Non-Minimum Phase Nonlinear System Predictive Control Based on Local Recurrent Neural Networks

Abstract: After a recursive multi-step-ahead predictor for nonlinear systems based on local recurrent neural networks isintroduced, an intelligent PID controller is adopted to correct the errors including identified model errors and accumulatederrors produced in the recursive process. Characterized by predictive control, this method can achieve a good controlaccuracy and has good robustness. A simulation study shows that this control algorithm is very effective.     

Dynamic Characteristics of Inter-Satellite Links in LEO Networks

To establish an efficient inter-satellite link (ISL) in an LEO network, the effect of geometric characteristics of ISL on the ISLs and the devices on the LEO satellite should be examined. Because of the continuous movement of the LEO satellite, the time-varying behaviours of the ISL's geometric charactersistics continuously change with the changes of the satellite's position on the orbit. These dynamic geometric characteristics of the ISLs are important for ISL's performance analyzing and the design of the devices on the LEO satellite. This paper describes dynamic geometric characteristics of ISL, analyzes the impact of these regulations on the tracking system of the satellite's antenna and the power adjusting system of the satellite's transmitter, with the Iridium system as an example.     

金属间化合物Ni3Al中的硼晶界偏聚特性的AES研究

本文应用俄歇能谱仪研究了不同化学计量比ＮｉＡｌ金属间化合物硼在晶界偏聚的特性。研究结果表明：硼在Ｎｉ３Ａｌ的各个晶界偏聚存在着不均匀性，硼在晶界的偏聚范围只有几个原子层，晶界结构及晶界化学环境是影响在晶界偏聚的决定因素。     

Radar Imaging Based on Iterative Algorithms

It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.     

高含固量聚苯乙烯－聚丙烯酸酯复合乳胶的合成及表征

本文采用种子乳液聚合技术，合成聚苯乙烯－聚丙烯酸酯复合乳液，用ＴＥＭ电镜观察其乳液的形态，用ＧＰＣ方法测定了乳胶聚合物的化学组成。     

Face Recognition Based on Support Vector Machine and Nearest Neighbor Classifier

Support vector machine (SVM), as a novel approach in pattern recognition, has demonstrated a success in face detection and face recognition. In this paper, a face recognition approach based on the SVM classifier with the nearest neighbor classifier (NNC) is proposed. The principal component analysis (PCA) is used to reduce the dimension and extract features. Then one-against-all stratedy is used to train the SVM classifiers. At the testing stage, we propose an al-     

Subset threshold autoregression

We develop in this paper an efficient way to select the best subset threshold autoregressive model. The proposed method uses a stochastic search idea. Differing from most conventional approaches, our method does not require us to fix the delay or the threshold parameters in advance. By adopting the Markov chain Monte Carlo techniques, we can identify the best subset model from a very large of number of possible models, and at the same time estimate the unknown parameters. A simulation experiment shows that the method is very effective. In its application to the US unemployment rate, the stochastic search method successfully selects lag one as the time delay and five best models from more than 4000 choices. Copyright © 2003 John Wiley & Sons, Ltd.     

Discovering Frequent Subtrees from XML Data Using Neural Networks

By rapid progress of network and storage technologies, a huge amount of electronic data such as Web pages and XML has been available on Internet. In this paper, we study a data-mining problem of discovering frequent ordered sub-trees in a large collection of XML data, where both of the patterns and the data are modeled by labeled ordered trees. We present an efficient algorithm of Ordered Subtree Miner （OSTMiner） based on two- layer neural networks with Hebb rule, that computes all ordered sub-trees appearing in a collection of XML trees with frequent above a user-specified threshold using a special structure EM-tree. In this algo- rithm, EM-tree is used as an extended merging tree to supply scheme information for efficient pruning and mining frequent sub-trees. Experiments results showed that OSTMiner has good response time and scales well.