Interval observers for linear time-invariant systems with disturbances

It is shown that, for any time-invariant exponentially stable linear system with additive disturbances, time-varying exponentially stable interval observers can be constructed. The technique of construction relies on the Jordan canonical form that any real matrix admits and on time-varying changes of coordinates for elementary Jordan blocks which lead to cooperative linear systems. The approach is applied to detectable linear systems.     

Set-valued Lyapunov functions for difference inclusions

The paper relates set-valued Lyapunov functions to pointwise asymptotic stability in systems described by a difference inclusion. Pointwise asymptotic stability of a set is a property which requires that each point of the set be Lyapunov stable and that every solution to the inclusion, from a neighborhood of the set, be convergent and have the limit in the set. Weak set-valued Lyapunov functions are shown, via an argument resembling an invariance principle, to imply this property. Strict set-valued Lyapunov functions are shown, in the spirit of converse Lyapunov results, to always exist for closed sets that are pointwise asymptotically stable.     

On singular perturbations due to fast actuators in hybrid control systems

A stability result is given for hybrid control systems singularly perturbed by fast but continuous actuators. If a hybrid control system has a compact set globally asymptotically stable when the actuator dynamics are omitted, or equivalently, are infinitely fast, then the same compact set is semiglobally practically asymptotically stable in the finite speed of the actuator dynamics. This result, which generalizes classical results for differential equations, justifies using a simplified plant model that ignores fast but continuous actuator dynamics, even when using a hybrid feedback control algorithm.     

Probability of graphs with large spectral gap by multicanonical Monte Carlo

Graphs with large spectral gap are important in various fields such as biology, sociology and computer science. In designing such graphs, an important question is how the probability of graphs with large spectral gap behaves. A method based on multicanonical Monte Carlo is introduced to quantify the behavior of this probability, which enables us to calculate extreme tails of the distribution. The proposed method is successfully applied to random 3-regular graphs and large deviation probability is estimated.     

The spined cube: A new hypercube variant with smaller diameter

Bijective connection graphs (in brief, BC graphs) are a family of hypercube variants, which contains hypercubes, twisted cubes, crossed cubes, Möbius cubes, locally twisted cubes, etc. It was proved that the smallest diameter of all the known n-dimensional bijective connection graphs (BC graphs) is , given a fixed dimension n. An important question about the smallest diameter among all the BC graphs is: Does there exist a BC graph whose diameter is less than the known BC graphs such as crossed cubes, twisted cubes, Möbius cubes, etc., with the same dimension? This paper answers this question. In this paper, we find that there exists a kind of BC graphs called spined cubes and we prove that the n-dimensional spined cube has the diameter ⌈n/3⌉+3 for any integer n with n?14. It is the first time in literature that a hypercube variant with such a small diameter is presented.     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

Stabilization for T-S model based uncertain stochastic systems

This paper considers the stabilization problem of a class of uncertain Itô stochastic fuzzy systems driven by a multidimensional Wiener process. The uncertainty modeled in the systems is of the linear fractional type which includes the norm-bounded uncertainty as a special case. The objective is to design a state-feedback fuzzy controller such that the closed-loop system is robustly asymptotically stable under a stochastic setting. By using a stochastic Lyapunov approach, sufficiency conditions for the stability and stabilization of this class of systems are established based on a novel matrix decomposition technique. The derived stability conditions are then employed to design controllers which stabilize the uncertain Itô stochastic fuzzy systems. Two simulation examples are given to illustrate the effectiveness of the approaches proposed.     

One conjecture of bubble-sort graphs

The bubble-sort graph is an important interconnection network designed from Cayley graph model. One conjecture is proposed in Shi and Lu (2008) [10] as follows: for any integer n?2, if n is odd then bubble-sort graph Bn is a union of edge-disjoint hamiltonian cycles; if n is even then bubble-sort graph Bn is a union of edge-disjoint hamiltonian cycles and its perfect matching that has no edges in common with the hamiltonian cycles. In this paper, we prove that conjecture is true for n=5,6.     

Fundamental connections among the stability conditions using higher-order time-derivatives of Lyapunov functions for the case of linear time-invariant systems

It has already been recognized that looking for a positive definite Lyapunov function such that a high-order linear differential inequality with respect to the Lyapunov function holds along the trajectories of a nonlinear system can be utilized to assess asymptotic stability when the standard Lyapunov approach examining only the first derivative fails. In this context, the main purpose of this paper is, on one hand, to theoretically unveil deeper connections among existing stability conditions especially for linear time-invariant (LTI) systems, and from the other hand to examine the effect of the higher-order time-derivatives approach on the stability results for uncertain polytopic LTI systems in terms of conservativeness. To this end, new linear matrix inequality (LMI) stability conditions are derived by generalizing the concept mentioned above, and through the development, relations among some existing stability conditions are revealed. Examples illustrate the improvement over the quadratic approach.