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.     

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.     

Specific binding of antigenic peptides to cell-associated MHC class I molecules

T lymphocytes recognize antigen in the form of peptides that associate with specific alleles of class I or class II major histocompatibility (MHC) molecules. By contrast with the clear MHC allele-specific binding of peptides to purified class II molecules purified solubilized class I molecules either bind relatively poorly or show degenerate specificity. Using photo-affinity labelling, we demonstrate here the specific interaction of peptides with cell-associated MHC class I molecules and show that this involves metabolically active processes.     

Truth and openness: an epistemology for interpretive systemology

Both an ontoepistemology for reductionist modern science (counter-ontoepistemology) and an ontology for interpretive Systemology have been outlined in the two preceding papers in this special issue ofSystems Practice. In the present article, the notion of “truth” is interpreted in terms of both the ontoepistemology of “reductionism” and the ontology of interpretive systemology. Both interpretations are discussed. Such a discussion represents the objective of this paper, that is, to outline the epistemological “face” of the ontoepistemology of interpretive systemology. In order to design that “epistemological face,” the relation between ontology and epistemology must be clarified. Such a relation is seen from the standpoint already provided by the ontology. After the discussion on the notion of truth, the general shape of a systemic-interpretive inquiring process is outlined.