INCREMENTAL AUGMENT ALGORITHM BASED ON REDUCED Q-MATRIX

Reduced Q-matrix （Qr matrix） plays an important role in the rule space model （RSM） and the attribute hierarchy method （AHM）. Based on the attribute hierarchy, a valid/invalid item is defined. The judgment method of the valid/invalid item is developed on the relation between reachability matrix and valid items. And valid items are explained from the perspective of graph theory. An incremental augment algorithm for constructing Qr matrix is proposed based on the idea of incremental forward regression, and its validity is theoretically considered. Results of empirical tests are given in order to compare the performance of the incremental augment algo-rithm and the Tatsuoka algorithm upon the running time. Empirical evidence shows that the algorithm outper-forms the Tatsuoka algorithm, and the analysis of the two algorithms also show linear growth with respect to the number of valid items. Mathematical models with 10 attributes are built for the two algorithms by the linear regression analysis.

Force-Based Incremental Algorithm for Mining Community Structure in Dynamic Network

Community structure is an important property of network. Being able to identify communities can provide invaluable help in exploiting and understanding both social and non-social networks. Several algorithms have been developed up till now. However, all these algorithms can work well only with small or moderate networks with vertexes of order 104. Besides, all the existing algorithms are off-line and cannot work well with highly dynamic networks such as web, in which web pages are updated frequently. When an already clustered network is updated, the entire network including original and incremental parts has to be recalculated, even though only slight changes are involved. To address this problem, an incremental algorithm is proposed, which allows for mining community structure in large-scale and dynamic networks. Based on the community structure detected previously, the algorithm takes little time to reclassify the entire network including both the original and incremental parts. Furthermore, the algorithm is faster than most of the existing algorithms such as Girvan and Newman＇s algorithm and its improved versions. Also, the algorithm can help to visualize these community structures in network and provide a new approach to research on the evolving process of dynamic networks.

A Novel Incremental Mining Algorithm of Frequent Patterns for Web Usage Mining

Because data warehouse is frequently changing, incremental data leads to old knowledge which is mined formerly unavailable. In order to maintain the discovered knowledge and patterns dynamically, this study presents a novel algorithm updating for global frequent patterns-IPARUC. A rapid clustering method is introduced to divide database into n parts in IPARUC firstly, where the data are similar in the same part. Then, the nodes in the tree are adjusted dynamically in inserting process by ＂pruning and laying back＂ to keep the frequency descending order so that they can be shared to approaching optimization. Finally local frequent itemsets mined from each local dataset are merged into global frequent itemsets. The results of experimental study are very encouraging. It is obvious from experiment that IPARUC is more effective and efficient than other two contrastive methods. Furthermore, there is significant application potential to a prototype of Web log Analyzer in web usage mining that can help us to discover useful knowledge effectively, even help managers making decision.

Maximum Power Point Tracking Using the Incremental Conductance Algorithm for PV Systems Operating in Rapidly Changing Environmental Conditions

Maximum Power Point Tracking (MPPT) is an important process in Photovoltaic (PV) systems because of the need to extract maximum power from PV panels used in these systems. Without the ability to track and have PV panels operate at its maximum power point (MPP) entails power losses;resulting in high cost since more panels will be required to provide specified energy needs. To achieve high efficiency and low cost, MPPT has therefore become an imperative in PV systems. In this study, an MPP tracker is modeled using the IC algorithm and its behavior under rapidly changing environmental conditions of temperature and irradiation levels is investigated. This algorithm, based on knowledge of the variation of the conductance of PV cells and the operating point with respect to the voltage and current of the panel calculates the slope of the power characteristics to determine the MPP as the peak of the curve. A simple circuit model of the DC-DC boost converter connected to a PV panel is used in the simulation;and the output of the boost converter is fed through a 3-phase inverter to an electricity grid. The model was simulated and tested using MATLAB/Simulink. Simulation results show the effectiveness of the IC algorithm for tracking the MPP in PV systems operating under rapidly changing temperatures and irradiations with a settling time of 2 seconds.

Research on the MPPT of Photovoltaic Power Generation Based on the CSA-INC Algorithm

The existing Maximum Power Point Tracking(MPPT)method has low tracking efficiency and poor stability.It is easy to fall into the Local Maximum Power Point(LMPP)in Partial Shading Condition(PSC),resulting in the degradation of output power quality and efficiency.It was found that various bio-inspired MPPT based optimization algorithms employ different mechanisms,and their performance in tracking the Global Maximum Power Point(GMPP)varies.Thus,a Cuckoo search algorithm(CSA)combined with the Incremental conductance Algorithm(INC)is proposed(CSA-INC)is put forward for the MPPT method of photovoltaic power generation.The method can improve the tracking speed by more than 52%compared with the traditional Cuckoo Search Algorithm(CSA),and the results of the study using this algorithm are compared with the popular Particle Swarm Optimization(PSO)and the Gravitational Search Algorithm(GSA).CSA-INC has an average tracking efficiency of 99.99%and an average tracking time of 0.19 s when tracking the GMPP,which improves PV power generation’s efficiency and power quality.

Fast Discovering Frequent Patterns for Incremental XML Queries

It is nontrivial to maintain such discovered frequent query patterns in real XML-DBMS because the transaction database of queries may allow frequent updates and such updates may not only invalidate some existing frequent query patterns but also generate some new frequent query patterns. In this paper, two incremental updating algorithms, FUX-QMiner and FUXQMiner, are proposed for efficient maintenance of discovered frequent query patterns and generation the new frequent query patterns when new XMI, queries are added into the database. Experimental results from our implementation show that the proposed algorithms have good performance. Key words XML - frequent query pattern - incremental algorithm - data mining CLC number TP 311 Foudation item: Supported by the Youthful Foundation for Scientific Research of University of Shanghai for Science and TechnologyBiography: PENG Dun-lu (1974-), male, Associate professor, Ph.D, research direction: data mining, Web service and its application, peerto-peer computing.

A new insertion sequence for incremental Delaunay triangulation

Incremental algorithm is one of the most popular procedures for constructing Delaunay triangulations （DTs）. However, the point insertion sequence has a great impact on the amount of work needed for the construction of DTs. It affects the time for both point location and structure update, and hence the overall computational time of the triangulation algorithm. In this paper, a simple deterministic insertion sequence is proposed based on the breadth-first-search on a Kd-tree with some minor modifications for better performance. Using parent nodes as search-hints, the proposed insertion sequence proves to be faster and more stable than the Hilbert curve order and biased randomized insertion order （BRIO）, especially for non-uniform point distributions over a wide range of benchmark examples.

Seismic response characteristics of nuclear island structure at generic soil and rock sites

The number of traditionally excellent coastal lithologic nuclear power plants is limited.It is a trend to develop nuclear power plants on soil sites in inland areas.Therefore,the seismic safety and adaptability of non-rock nuclear power plant(NPP)sites are the key concerns of nuclear safety researchers.Although the five site categories are clearly defined in the AP1000 design control documents,the effects of nuclear power five site conditions and soil nonlinearity on the seismic response characteristics of nuclear island buildings have not been systematically considered in previous related studies.In this study,targeting the AP1000 nuclear island structure as the research object,three-dimensional finite element models of a nuclear island structure at five types of sites(firm rock site(FR),soft rock site(SR),soft-to-medium soil site(SMS),upper bound soft-to-medium site(SMS-UB),and soft soil site(SS))are established.The partitioned analysis method of soil-structure interaction(PASSI)in the time-domain is used to investigate the effects of site hardness and nonlinearity on the acceleration,displacement,and acceleration response spectrum of the nuclear island structure under seismic excitation.The incremental equilibrium equation and explicit decoupling method are used to analyze the soil nonlinearity described by the Davidenkov model with simplified loading-reloading rules.The results show that,in the linear case,with the increase of site hardness,the peak ground acceleration(PGA)and the peak of acceleration response spectrum of the nuclear island structure increase except for the FR site,while the maximum displacement decreases.In nonlinear analysis,as the site hardness increases,the PGA,maximum displacement,and the peak of acceleration response spectrum of the nuclear island structure increase.The peak value of the acceleration response spectrum in the nonlinear case is greater than that in the linear case for FR,while smaller for SR and soil sites.The site nonlinearity reduces the peak values of the response spectrum for SR and soil sites much more as the site hardness decreases.The results of this study can provide a reference for design of nuclear island structures on soil and rock sites.

An Incremental Rule Acquisition Algorithm Based on Rough Set

Rough Set is a valid mathematical theory developed in recent years, which hasthe ability to deal with imprecise, uncertain, and vague information. This paper presents a newincremental rule acquisition algorithm based on rough set theory. First, the relation of the newinstances with the original rule set is discussed. Then the change law of attribute reduction andvalue reduction are studied when a new instance is added. Follow, a new incremental learningalgorithm for decision tables is presented within the framework of rough set. Finally, the newalgorithm and the classical algorithm are analyzed and compared by theory and experiments.

Optimal redundancy allocation for reliability systems with imperfect switching

The problem of stochastically allocating redundant com- ponents to increase the system lifetime is an important topic of reliability. An optimal redundancy allocation is proposed, which maximizes the expected lifetime of a reliability system with sub- systems consisting of components in parallel. The constraints are minimizing the total resources and the sizes of subsystems. In this system, each switching is independent with each other and works with probability p. Two optimization problems are studied by an incremental algorithm and dynamic programming technique respectively. The incremental algorithm proposed could obtain an approximate optimal solution, and the dynamic programming method could generate the optimal solution,

Adaptive Spectral Clustering Ensemble Selection via Resampling and Population-Based Incremental Learning Algorithm

In this paper, we explore a novel ensemble method for spectral clustering. In contrast to the traditional clustering ensemble methods that combine all the obtained clustering results, we propose the adaptive spectral clustering ensemble method to achieve a better clustering solution. This method can adaptively assess the number of the component members, which is not owned by many other algorithms. The component clusterings of the ensemble system are generated by spectral clustering （SC） which bears some good characteristics to engender the diverse committees. The selection process works by evaluating the generated component spectral clustering through resampling technique and population-based incremental learning algorithm （PBIL）. Experimental results on UCI datasets demonstrate that the proposed algorithm can achieve better results compared with traditional clustering ensemble methods, especially when the number of component clusterings is large.

An improved MPPT control strategy based on incremental conductance algorithm

PV power production is highly dependent on environmental and weather conditions,such as solar irradiance and ambient temperature.Because of the single control condition and any change in the external environment,the first step response of the converter duty cycle of the traditional MPPT incremental conductance algorithm is not accurate,resulting in misjudgment.To improve the efficiency and economy of PV systems,an improved incremental conductance algorithm of MPPT control strategy is proposed.From the traditional incremental conductance algorithm,this algorithm is simple in structure and can discriminate the instantaneous increment of current,voltage and power when the external environment changes,and so can improve tracking efficiency.MATLAB simulations are carried out under rapidly changing solar radiation level,and the results of the improved and conventional incremental conductance algorithm are compared.The results show that the proposed algorithm can effectively identify the misjudgment and avoid its occurrence.It not only optimizes the system,but also improves the efficiency,response speed and tracking efficiency of the PV system,thus ensuring the stable operation of the power grid.

DC Programming Algorithm for Clusterwise Linear L1 Regression

The aim of this paper is to develop an algorithm for solving the clusterwise linear least absolute deviations regression problem.This problem is formulated as a nonsmooth nonconvex optimization problem,and the objective function is represented as a difference of convex functions.Optimality conditions are derived by using this representation.An algorithm is designed based on the difference of convex representation and an incremental approach.The proposed algorithm is tested using small to large artificial and real-world data sets.

Orbit determination using incremental phase and TDOA of X-ray pulsar

X-ray pulsars offer stable, periodic X-ray pulse sequences that can be used in spacecraft positioning systems. A method using X-ray pulsars to determine the initial orbit of a satellite is presented in this paper. This method suggests only one detector to be equipped on the satellite and assumes that the detector observes three pulsars in turn. To improve the performance, the use of incremental phase in one observation duration is proposed, and the incremental phase is combined with the time difference of arrival(TDOA). Then, a weighted least squares(WLS) algorithm is formulated to calculate the initial orbit. Numerical simulations are performed to assess the proposed orbit determination method.

Learning real-time search on c-space GVDs

In the context of robotics, configuration space （c- space） is widely used for non-circular robots to engage tasks such as path planning, collision check, and motion planning. In many real-time applications, it is important for a robot to give a quick response to the user＇s command. Therefore, a constant bound on planning time per action is severely im- posed. However, existing search algorithms used in c-space gain first move lags which vary with the size of the under- lying problem. Furthermore, applying real-time search algo- rithms on c-space maps often causes the robots being trapped within local minima. In order to solve the above mentioned problems, we extend the learning real-time search （LRTS） algorithm to search on a set of c-space generalized Voronoi diagrams （c-space GVDs）, helping the robots to incremen- tally plan a path, to efficiently avoid local minima, and to ex- ecute fast movement. In our work, an incremental algorithm is firstly proposed to build and represent the c-space maps in Boolean vectors. Then, the method of detecting grid-based GVDs from the c-space maps is further discussed. Based on the c-space GVDs, details of the LRTS and its implemen- tation considerations are studied. The resulting experiments and analysis show that, using LRTS to search on the c-space GVDs can 1） gain smaller and constant first move lags which is independent of the problem size; 2） gain maximal clear- ance from obstacles so that collision checks are much re- duced; 3） avoid local minima and thus prevent the robot from visually unrealistic scratching.