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.     

Directional features in online handwriting recognition

The selection of valuable features is crucial in pattern recognition. In this paper we deal with the issue that part of features originate from directional instead of common linear data. Both for directional and linear data a theory for a statistical modeling exists. However, none of these theories gives an integrated solution to problems, where linear and directional variables are to be combined in a single, multivariate probability density function. We describe a general approach for a unified statistical modeling, given the constraint that variances of the circular variables are small. The method is practically evaluated in the context of our online handwriting recognition system frog on hand and the so-called tangent slope angle feature. Recognition results are compared with two alternative modeling approaches. The proposed solution gives significant improvements in recognition accuracy, computational speed and memory requirements.     

Apollonius tenth problem via radius adjustment and Möbius transformations

The Apollonius Tenth Problem, as defined by Apollonius of Perga circa 200 B.C., has been useful for various applications in addition to its theoretical interest. Even though particular cases have been handled previously, a general framework for the problem has never been reported. Presented in this paper is a theory to handle the Apollonius Tenth Problem by characterizing the spatial relationship among given circles and the desired Apollonius circles. Hence, the given three circles in this paper do not make any assumption regarding on the sizes of circles and the intersection/inclusion relationship among them. The observations made provide an easy-to-code algorithm to compute any desired Apollonius circle which is computationally efficient and robust.     

Complete mobile email management

Years have lapsed since the inauguration of the first Wireless Application Protocol (WAP) application. One of the main reasons for the lukewarm response so far may be attributed to the lack of a “Killer” application. Many companies and developers have attempted to replicate email services (an Internet Killer appplication) within the WAP realm, but till now, no significant success has been reported. This paper will first discuss on the key functions which are lacking in the present WAP-email service, and which are arguably necessary if a much larger user base is to be attracted to these services. A new system will be proposed which can enable the user to send files residing in a remote personal computer (PC) as attachments to his emails using WAP-enabled mobile devices. The implementation of the system will be presented in details. Issue relating to the connection to various types of email servers and the security of the system will also be addressed in the paper.