Adaptive switching supervisory control of nonlinear systems with no prior knowledge of noise bounds

The problem of controlling nonlinear noisy systems affected by parametric uncertainties is approached via the introduction of a supervisor which, whenever needed, switches on, in feedback to the plant, a controller selected from a finite set of predesigned controllers. A Lyapunov-based falsification criterion allows one to ensure robust stability in the presence of uncertain constant parameters and exogenous bounded disturbances. Simulations are discussed in order to illustrate the merits of the proposed algorithms.     

Frequency domain identification of Wiener models

This paper proposes a frequency domain algorithm for Wiener model identifications based on exploring the fundamental frequency and harmonics generated by the unknown nonlinearity. The convergence of the algorithm is established in the presence of white noise. No a priori knowledge of the structure of the nonlinearity is required and the linear part can be nonparametric.     

Position synchronization of multiple motion axes with adaptive coupling control

A new control approach to position synchronization of multiple motion axes is developed, by incorporating cross-coupling technology into adaptive control architecture. The control strategy is to stabilize position tracking of each axis while synchronizing its motion with other axes’ motions so that differential position errors amongst axes converge to zero. The proposed adaptive controller and parameter estimator employ coupling control by feeding back position errors and differential position errors, and have been realized to guarantee asymptotic convergence to zero of both position and synchronization errors. Simulations conducted on a multi-axis motion control system demonstrate the effectiveness of the method.     

Nonlinear model predictive control with polytopic invariant sets

Ellipsoidal invariant sets have been widely used as target sets in model predictive control (MPC). These sets can be computed by constructing appropriate linear difference inclusions together with additional constraints to ensure that the ellipsoid lies within a given inclusion polytope. The choice of inclusion polytope has a significant effect on the size of the target ellipsoid, but the optimal inclusion polytope cannot in general be computed systematically. This paper shows that use of polytopic invariant sets overcomes this difficulty, allowing larger stabilizable sets without loss of performance. In the interests of online efficiency, consideration is focused on interpolation-based MPC.     

高层建筑地下室人防及通风设计

该文结合工程实例介绍了地下室人防及通风设计的方法及实际运用中的注意事项．     

Frequency domain solution to delay-type Nehari problem

This paper generalizes the frequency-domain results on the delay-type Nehari problem in the stable case to the unstable case. The solvability condition of the delay-type Nehari problem is formulated in terms of the nonsingularity of three matrices. The optimal value γ_opt is the maximal γ∈(0,∞) such that one of the three matrices becomes singular. All sub-optimal compensators are parameterized in a transparent structure incorporating a modified Smith predictor.     

EM procedures using mean field-like approximations for Markov model-based image segmentation

Image segmentation using Markov random fields involves parameter estimation in hidden Markov models for which the EM algorithm is widely used. In practice, difficulties arise due to the dependence structure in the models and approximations are required. Using ideas from the mean field approximation principle, we propose a class of EM-like algorithms in which the computation reduces to dealing with systems of independent variables. Within this class, the simulated field algorithm is a new stochastic algorithm which appears to be the most promising for its good performance and speed, on synthetic and real image experiments.     

Determination of vitality from a non-invasive biomedical measurement for use in fingerprint scanners

Fingerprints are the oldest and most widely used biometrics for personal identification. Unfortunately, it is usually possible to deceive automatic fingerprint identification systems by presenting a well-duplicated synthetic or dismembered finger. This paper introduces one method to provide fingerprint vitality authentication in order to solve this problem. Detection of a perspiration pattern over the fingertip skin identifies the vitality of a fingerprint. Mapping the two-dimensional fingerprint images into one-dimensional signals, two ensembles of measures, namely static and dynamic measures, are derived for classification. Static patterns as well as temporal changes in dielectric mosaic structure of the skin, caused by perspiration, demonstrate themselves in these signals. Using these measures, this algorithm quantifies the sweating pattern and makes a final decision about vitality of the fingerprint by a neural network trained by examples.