of Nonholonomic Wheeled Mobile Robot Hyun-Sik Shim Jong-Hwan Kim Kwangill Koh Dept. of Elec. Eng. Dept. of Elec. Eng. KAIST KAIST LG Industrial Systems Co., Ltd. Taejoen-shi, 305-701, Korea Taejoen-shi, 305-701, Korea Kyongki-do, 430-080, Korea [email protected] [email protected] [email protected] Abstract A variable structure controller(VSC) for a nonholonomic wheeled mobile...

Data compression attempts to reduce the amount of information needed to recreate a signal. A source coder is a data compression system which attempts to maximize the quality of the signal reproduction for a xed transmission rate or minimize the transmission rate for a xed reproduction quality. Source coders are designed by exploiting the statistics of their signal sources. A vector quantizer ca...

Many widely studied graphical models with latent variables lead to nontrivial constraints on the distribution of the observed variables. Inspired by the Bell inequalities in quantum mechanics, we refer to any linear inequality whose violation rules out some latent variable model as a “hidden variable test” for that model. Our main contribution is to introduce a sequence of relaxations which pro...

Much of our understanding of Nature comes from theories about unobservable entities. Identifying which hidden variables exist given measurements in the observable world is therefore an important step in the process of discovery. Such an enterprise is only possible if the existence of latent factors constrains how the observable world can behave. We do not speak of atoms, genes and antibodies be...

We present a latent variable structured prediction model, called the Latent Left-linking Model (L3M), for discriminative supervised clustering of items that follow a streaming order. LM admits efficient inference and we present a learning framework for LM that smoothly interpolates between latent structural SVMs and hidden variable CRFs. We present a fast stochastic gradientbased learning techn...

We study estimation in the class of stationary variable length Markov chains (VLMC) on a nite space. The processes in this class are still Markovian of higher order, but with memory of variable length yielding a much bigger and structurally richer class of models than ordinary higher order Markov chains. From a more algo-rithmic view, the VLMC model class has attracted interest in information t...

‎The first variable Zagreb index of graph $G$ is defined as‎ ‎begin{eqnarray*}‎ ‎M_{1,lambda}(G)=sum_{vin V(G)}d(v)^{2lambda}‎, ‎end{eqnarray*}‎ ‎where $lambda$ is a real number and $d(v)$ is the degree of‎ ‎vertex $v$‎. ‎In this paper‎, ‎some upper and lower bounds for the distribution function and expected value of this index in random increasing trees (rec...

We present a sound, complete, modular and lean labelled tableau calculus for many propositional modal logics where the labels contain \free" and \universal" variables. Our \lean" Prolog implementation is not only surprisingly short, but compares favourably with other considerably more complex implementations for modal deduction.