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.     

FROM MANUFACTURING SCHEDULING TO SUPPLY CHAIN COORDINATION：THE CONTROL OF COMPLEXITY AND UNCERTAINTY

With time-based competition and rapid technology advancements, effective manufacturingscheduling and supply chain coordination are critical to quickly respond to changing marketconditions. These problems, however, are difficult in view of inherent complexity and variousuncertainties involved. Based on a series of results by the authors, decomposition and coordination byusing Lagrangian relaxation is identified in this paper as an effective way to control complexity anduncertainty.A manufacturing scheduling problem is first formulated within the job shop context withuncertain order arrivals, processing times, due dates, and part priorities as a separable optimizationproblem. A solution methodology that combines Lagrangian relaxation, stochastic dynamicprogramming, and heuristics is developed. Method improvements to effectively solve large problemsare also highlighted. To extend manufacturing scheduling within a factory to coordinate autonomicmembers across chains of suppliers, a decentralized supply chai     

A small GTP-binding protein dissociates from synaptic vesicles during exocytosis.

Low-molecular-weight GTP-binding proteins are strong candidates for regulators of membrane traffic. In yeast, mutations in the sec4 or ypt1 genes encoding small GTP-binding proteins inhibit constitutive membrane flow at the plasma membrane or Golgi complex, respectively. It has been suggested that membrane fusion-fission events are regulated by cycling of small GTP-binding proteins between a membrane-bound and free state, but although most of these small proteins are found in both soluble and tightly membrane-bound forms, there is no direct evidence to support such cycling. In rat brain a small GTP-binding protein, rab3A, is exclusively associated with synaptic vesicles, the secretory organelles of nerve terminals. Here we use isolated nerve terminals to study the fate of rab3A during synaptic vesicle exocytosis. We find that rab3A dissociates quantitatively from the vesicle membrane after Ca2(+)-dependent exocytosis and that this dissociation is partially reversible during recovery after stimulation. These results are direct evidence for an association-dissociation cycle of a small GTP-binding protein during traffic of its host membrane.     

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-     

The Huntington's disease candidate region exhibits many different haplotypes.

Analysis of 78 Huntington's disease (HD) chromosomes with multi-allele markers revealed 26 different haplotypes, suggesting a variety of independent HD mutations. The most frequent haplotype, accounting for about one third of disease chromosomes, suggests that the disease gene is between D4S182 and D4S180. However, the paucity of an expected class of chromosomes that can be related to this major haplotype by assuming single crossovers may reflect the operation of other mechanisms in creating haplotype diversity. Some of these mechanisms sustain alternative scenarios that do not require a multiple mutational origin for HD and/or its positioning between D4S182 and D4S180.