NEURAL NETWORK PREDICTIVE CONTROL WITH HIERARCHICAL GENETIC ALGORITHM

A kind of predictive control based on the neural network(NN) for nonlinear systems with time delay is addressed.The off line NN model is obtained by using hierarchical genetic algorithms (HGA) to train a sequence data of input and output.Output predictions are obtained by recursively mapping the NN model.The error rectification term is introduced into a performance function that is directly optimized while on line control so that it overcomes influences of the mismatched model and disturbances,etc.Simulations show the system has good dynamic responses and robustness.

A NOVEL CLASSIFICATION METHOD FOR TROPICAL CYCLONE INTENSITY CHANGE ANALYSIS BASED ON HIERARCHICAL PARTICLE SWARM OPTIMIZATION ALGORITHM

Based on the tropical cyclone(TC) observations in the western North Pacific from 2000 to 2008, this paper adopts the particle swarm optimization(PSO) algorithm of evolutionary computation to optimize one comprehensive classification rule, and apply the optimized classification rule to the forecasting of TC intensity change. In the process of the optimization, the strategy of hierarchical pruning has been adopted in the PSO algorithm to narrow the search area,and thus to enhance the local search ability, i.e. hierarchical PSO algorithm. The TC intensity classification rule involves core attributes including 12-HMWS, MPI, and Rainrate which play vital roles in TC intensity change. The testing accuracy using the new mined rule by hierarchical PSO algorithm reaches 89.6%. The current study shows that the novel classification method for TC intensity change analysis based on hierarchic PSO algorithm is not only easy to explain the source of rule core attributes, but also has great potential to improve the forecasting of TC intensity change.

Exploring on Hierarchical Kalman Filtering Fusion Accuracy

Aim To analyze the traditional hierarchical Kalman filtering fusion algorithm theoretically and point out that the traditional Kalman filtering fusion algorithm is complex and can not improve the tracking precision well, even it is impractical, and to propose the weighting average fusion algorithm. Methods The theoretical analysis and Monte Carlo simulation methods were ed to compare the traditional fusion algorithm with the new one,and the comparison of the root mean square error statistics values of the two algorithms was made. Results The hierarchical fusion algorithm is not better than the weighting average fusion and feedback weighting average algorithm The weighting filtering fusion algorithm is simple in principle, less in data, faster in processing and better in tolerance.Conclusion The weighting hierarchical fusion algorithm is suitable for the defective sensors.The feedback of the fusion result to the single sersor can enhance the single sensorr's precision. especially once one sensor has great deviation and low accuracy or has some deviation of sample period and is asynchronous to other sensors.

Adaptive connected hierarchical optimization algorithm for minimum energy spacecraft attitude maneuver path planning

Space object observation requirements and the avoidance of specific attitudes produce pointing constraints that increase the complexity of the attitude maneuver path-planning problem.To deal with this issue,a feasible attitude trajectory generation method is proposed that utilizes a multiresolution technique and local attitude node adjustment to obtain sufficient time and quaternion nodes to satisfy the pointing constraints.These nodes are further used to calculate the continuous attitude trajectory based on quaternion polynomial interpolation and the inverse dynamics method.Then,the characteristic parameters of these nodes are extracted to transform the path-planning problem into a parameter optimization problem aimed at minimizing energy consumption.This problem is solved by an improved hierarchical optimization algorithm,in which an adaptive parameter-tuning mechanism is introduced to improve the performance of the original algorithm.A numerical simulation is performed,and the results confirm the feasibility and effectiveness of the proposed method.

Component Content Soft-Sensor Based on Hybrid Models in Countercurrent Rare Earth Extraction Process

In consideration of the online measurement of the component content in rare earth countercurrent extraction separation process, the soft sensor method based on hybrid modeling was proposed to measure the rare earth component content. The hybrid models were composed of the extraction equilibrium calculation model and the Radial Basis Function (RBF) Neural Network (NN) error compensation model; the parameters of compensation model were optimized by the hierarchical genetic algorithms (HGA). In addition, application experiment research of this proposed method was carried out in the rare earth separation production process of a corporation. The result shows that this method is effective and can realize online measurement for the component content of rare earth in the countercurrent extraction.

A NOVEL INTEREST COVERAGE METHOD BASED ON JENSEN-SHANNON DIVERGENCE IN SENSOR NETWORKS

In this paper, the idea of interest coverage is provided to form clusters in sensor network, which mean that the distance among data trends gathered by neighbor sensors is so small that, in some period, those sensors can be clustered, and certain sensor can be used to replace the cluster to form the virtual sensor network topology. In detail, the Jensen-Shannon Divergence (JSD) is used to characterize the distance among different distributions which represent the data trend of sensors. Then, based on JSD, a hierarchical clustering algorithm is provided to form the virtual sensor network topology. Simulation shows that the proposed approach gains more than 50% energy saving than Sta- tistical Aggregation Methods (SAM) which transmitted data gathered by sensor only when the differ- ence among data exceed certain threshold.

Randomized Algorithms for Orthogonal Nonnegative Matrix Factorization

Orthogonal nonnegative matrix factorization(ONMF)is widely used in blind image separation problem,document classification,and human face recognition.The model of ONMF can be efficiently solved by the alternating direction method of multipliers and hierarchical alternating least squares method.When the given matrix is huge,the cost of computation and communication is too high.Therefore,ONMF becomes challenging in the large-scale setting.The random projection is an efficient method of dimensionality reduction.In this paper,we apply the random projection to ONMF and propose two randomized algorithms.Numerical experiments show that our proposed algorithms perform well on both simulated and real data.

An Efficient Deep Learning-based Content-based Image Retrieval Framework

The use of massive image databases has increased drastically over the few years due to evolution of multimedia technology.Image retrieval has become one of the vital tools in image processing applications.Content-Based Image Retrieval(CBIR)has been widely used in varied applications.But,the results produced by the usage of a single image feature are not satisfactory.So,multiple image features are used very often for attaining better results.But,fast and effective searching for relevant images from a database becomes a challenging task.In the previous existing system,the CBIR has used the combined feature extraction technique using color auto-correlogram,Rotation-Invariant Uniform Local Binary Patterns(RULBP)and local energy.However,the existing system does not provide significant results in terms of recall and precision.Also,the computational complexity is higher for the existing CBIR systems.In order to handle the above mentioned issues,the Gray Level Co-occurrence Matrix(GLCM)with Deep Learning based Enhanced Convolution Neural Network(DLECNN)is proposed in this work.The proposed system framework includes noise reduction using histogram equalization,feature extraction using GLCM,similarity matching computation using Hierarchal and Fuzzy c-Means(HFCM)algorithm and the image retrieval using DLECNN algorithm.The histogram equalization has been used for computing the image enhancement.This enhanced image has a uniform histogram.Then,the GLCM method has been used to extract the features such as shape,texture,colour,annotations and keywords.The HFCM similarity measure is used for computing the query image vector's similarity index with every database images.For enhancing the performance of this image retrieval approach,the DLECNN algorithm is proposed to retrieve more accurate features of the image.The proposed GLCM+DLECNN algorithm provides better results associated with high accuracy,precision,recall,f-measure and lesser complexity.From the experimental results,it is clearly observed that the proposed system provides efficient image retrieval for the given query image.

Interpreting the Basis Path Set in Neural Networks

The G-SGD algorithm significantly outperforms the conventional SGD algorithm in ReLU neural networks by adopting the basis path set.However,how the inner mechanism of basis paths works remains mysterious,and the G-SGD algorithm that helps to find a basis path set is heuristic.This paper employs graph theory to investigate structure properties of basis paths in a more general and complicated neural network with unbalanced layers and edge-skipping.The hierarchical Algorithm HBPS is proposed to find a basis path set,by decomposing the complicated network into several independent and parallel substructures.The paper theoretically extends the study of basis paths and provides one methodology to find the basis path set in a more general neural network.

Evaluation of Agile Manufacturing Enterprises

Agile manufacturing is an important manufacturing philosophy to develop advanced manufacturing enterprises to improve competivity. The evaluation of Agile Manufacturing Enterprises (AME) is one of the key activities in implementing agile manufacturing. This paper proposes a method for evaluating AME, establishes a basic feature model of AME based on the feature tree and discusses the hierarchical decomposition algorithm based on the model with an example.