A Multi‐Strategic Concept‐Spotting Approach for Robust Understanding of Spoken Korean

We propose a multi‐strategic concept‐spotting approach for robust spoken language understanding of conversational Korean in a hostile recognition environment such as in‐car navigation and telebanking services. Our concept‐spotting method adopts a partial semantic understanding strategy within a given specific domain since the method tries to directly extract pre‐defined meaning representation slot values from spoken language inputs. In spite of partial understanding, we can efficiently acquire the necessary information to compose interesting applications because the meaning representation slots are properly designed for specific domain‐oriented understanding tasks. We also propose a multi‐strategic method based on this concept‐spotting approach such as a voting method. We present experiments conducted to verify the feasibility of these methods using a variety of spoken Korean data.     

Disturbance Attenuation in Hyperbolic 2D-systems

We consider disturbed linear 2D-systems of Fornasini–Marchesini type in the continuous time case. These systems are also named Goursat-type systems. Conditions for unique solvability of the disturbed optimal control problem with a quadratic cost functional are obtained. The disturbed or worst case optimal control guarantees to minimize the cost functional for any unknown disturbance input. In a second part then we consider a disturbance attenuation by boundary controls, i.e., by using the Goursat-data as control functions. In the 2D-case this results in two control functions acting independently on the system. We study a cooperative and a non-cooperative situation. In the cooperative situation we again obtain a disturbed optimal control problem and get conditions for existence and uniqueness of such a disturbed optimal control problem. If the action of the agents is non-cooperative we assume that it is agreed that they act on an open-loop Nash/worst-case equilibrium strategy. Sufficient conditions for the existence of such an equilibrium are obtained. Published online: April 2006     

Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

In this paper, the single machine sequencing problem with maximum lateness criterion is discussed. The parameters of the problem are imprecise and they are specified as intervals. The maximal regret criterion is applied to calculate the optimal sequence. A polynomial algorithm for the studied problem is constructed.     

The defocusing mechanism of isochronous resonances

We present a numerical study concerning the defocusing mechanism of isochronous resonance island chains in the presence of two permanent robust tori. The process is initialized and concluded through bifurcations of fixed points located on the robust tori. Our approach is based on a Hamiltonian system derived from the resonant normal form. Choosing a convenient parameter in this system, we are able to depict a comprehensive analysis of the dynamics of the problem.     

A cone programming approach to the bilinear matrix inequality problem and its geometry

We discuss an approach for solving the Bilinear Matrix Inequality (BMI) based on its connections with certain problems defined over matrix cones. These problems are, among others, the cone generalization of the linear programming (LP) and the linear complementarity problem (LCP) (referred to as the Cone-LP and the Cone-LCP, respectively). Specifically, we show that solving a given BMI is equivalent to examining the solution set of a suitably constructed Cone-LP or Cone-LCP. This approach facilitates our understanding of the geometry of the BMI and opens up new avenues for the development of the computational procedures for its solution. Research supported in part by the National Science Foundation under Grant CCR-9222734.     

Worst-case distribution analysis of stochastic programs

We show that for even quasi-concave objective functions the worst-case distribution, with respect to a family of unimodal distributions, of a stochastic programming problem is a uniform distribution. This extends the so-called ``Uniformity Principle' of Barmish and Lagoa (1997) where the objective function is the indicator function of a convex symmetric set.     

Stability radii for linear time-varying differential-algebraic equations with respect to dynamic perturbations

This paper is concerned with the robust stability for linear time-varying differential-algebraic equations. We consider the systems under the effect of uncertain dynamic perturbations. A formula of the structured stability radius is obtained. The result is an extension of a previous result for time-varying ordinary differential equations proven by Birgit Jacob [B. Jacob, A formula for the stability radius of time-varying systems, J. Differential Equations 142 (1998) 167-187].     

OTL电路中点电压稳定性三次择优

本文用“稳健设计”的观点，分别对ＯＴＬ电路中点电压稳定性“系统择优”，“参数择优”及“容差择优”作出较为系统的介绍     

二进神经网络的最稳健设计

本文基于对ｎ维超立方体的分割超平面应处在任两个不同类相邻顶点连线的中点、且与连 的思想，设计了能够实现逻辑功能的具有次强和最强稳健能力的我层前向神经网络、给出了稳健神经元之间的连接权和偏置值的设计规则，并服运用这一规则能够设计出既能实现所希望逻辑功能，又具有对输入数据的次强和最强稳健能力的前向网络，相应的网络规模分别为ｎ－ｋ－１和ｎ－ｎ－ｋ－１由于所构造的网络其连接权值只可能是＋１、－１、０，使得     

An observer for a class of disturbance driven nonlinear systems

An observer design for a class of nonlinear systems driven by disturbances or uncertainties is presented. The design is based on a high gain strategy, and the gain of the proposed observer is explicitly given.