Removable ears of 1-extendable graphs

<正> Carvalho,Lucchesi and Murty proved that any 1-extendable graph G different from K_2and C_(2n)has at least Δ(G)edge-disjoint removable ears,and any brick G distinct from K_4 and■hasat least Δ(G)-2 removable edges,where Δ(G)denotes the maximum degree of G.In this paper,weimprove the lower bounds for numbers of removable ears and removable edges of 1-extendable graphs.It is proved that any 1-extendable graph G different from K_2 and C_(2n)has at least χ′(G)edge-disjointremovable ears,and any brick G distinct from K_4 and■has at least χ′(G)-2 removable edges,whereχ′(G)denotes the edge-chromatic number of G.     

DEGREE CONDITIONS FOR GRAPHS TO BE FRACTIONAL （a, b, n）-CRITICAL GRAPHS

Let G be a graph, and a and b be integers with a ≤ b. A graph G is called a fraetional （a, b, n）-critical graph if after any n vertices of G are deleted the remaining subgraph has a fractional [a, b]-factor. In this paper two degree conditions for graphs to be fractional （a, b, n）-eritical graphs are presented, and the degree conditions are sharp in some sense.     

Asymptotic normality of wavelet estimator in heteroscedastic model with <Emphasis Type="Italic">α</Emphasis>-mixing errors

Consider heteroscedastic regression model Y _ni = g(x _ni ) + σ _ni ɛ _ni (1 ≤ i ≤ n), where σ _ni ² = f(u _ni ), the design points (x _ni , u _ni ) are known and nonrandom, g(·) and f(·) are unknown functions defined on closed interval [0, 1], and the random errors {ɛ _ni , 1 ≤ i ≤ n} are assumed to have the same distribution as {ξ _i , 1 ≤ i ≤ n}, which is a stationary and α-mixing time series with Eξ _i = 0. Under appropriate conditions, we study asymptotic normality of wavelet estimators of g(·) and f(·). Finite sample behavior of the estimators is investigated via simulations, too.     

H ∞ filtering for continuous-time systems with pointwise time-varying delay

The problem of H_∞filtering for continuous-time systems with pointwise time-varying delay is investigated in this paper.By applying an innovation analysis in Krein space,a necessary and sufficient condition for the existence of an H_∞filter is derived in two methods:One is the partial differential equation approach,the other is the reorganized innovation analysis approach.The former gives a solution to the proposed H_∞filtering problem in terms of the solution of a partial differential equation with boundary conditions.The later gives an analytical solution to the proposed H_∞filtering problem in terms of the solutions of Riccati and matrix differential equations.     

The limit theorem for dependent random variables with applications to autoregression models

This paper studies the autoregression models of order one, in a general time series setting that allows for weakly dependent innovations. Let {X _t } be a linear process defined by X _t = Σ _k=0^∞ψ _k ɛ _t−k , where {ψ _k , k ≥ 0} is a sequence of real numbers and {ɛ _k , k = 0, ±1, ±2, …} is a sequence of random variables. Two results are proved in this paper. In the first result, assuming that {ɛ _k , k ≥ 1} is a sequence of asymptotically linear negative quadrant dependent (ALNQD) random variables, the authors find the limiting distributions of the least squares estimator and the associated regression t statistic. It is interesting that the limiting distributions are similar to the one found in earlier work under the assumption of i.i.d. innovations. In the second result the authors prove that the least squares estimator is not a strong consistency estimator of the autoregressive parameter α when {ɛ _k , k ≥ 1} is a sequence of negatively associated (NA) random variables, and ψ ₀ = 1, ψ _k = 0, k ≥ 1.     

H ∞ control of networked multi-agent systems

This paper concerns the disturbance rejection problem arising in the coordination control of a group of autonomous agents subject to external disturbances. The agent network is said to possess a desired level of disturbance rejection, if the H _∞ norm of its transfer function matrix from the disturbance to the controlled output is satisfactorily small. Undirected graph is used to represent the information flow topology among agents. It is shown that the disturbance rejection problem of an agent network can be solved by analyzing the H _∞ control problem of a set of independent systems whose dimensions are equal to that of a single node. An interesting result is that the disturbance rejection ability of the whole agent network coupled via feedback of merely relative measurements between agents will never be better than that of an isolated agent. To improve this, local feedback injections are applied to a small fraction of the agents in the network. Some criteria for possible performance improvement are derived in terms of linear matrix inequalities. Finally, extensions to the case when communication time delays exist are also discussed. This research is supported by the Natural Science Foundation of China under Grants Nos. 10832006 and 60674093.     

<Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript> control for stochastic systems with Poisson jumps

This paper discusses the H _∞ control problem for a class of linear stochastic systems driven by both Brownian motion and Poisson jumps. The authors give the basic theory about stabilities for such systems, including internal stability and external stability, which enables to prove the bounded real lemma for the systems. By means of Riccati equations, infinite horizon linear stochastic state-feedback H _∞ control design is also extended to such systems.     

Solutions for singular p-Laplacian equation in R n

In this paper, the authors study the existence and non-existence of positive solutions for singular p-Laplacian equation −∆ _p u = f(x)u ^−α + λg(x)u ^β in R ^N ; where N ≥ 3, 1 < p < N, λ > 0, 0 < α < 1, max(p, 2) < β + 1 < p* = \fracN_pN - p \frac{{{N_p}}}{{N - p}} . We prove that there exists a critical value ¤ such that the problem has at least two solutions if 0 < λ < Λ; at least one solution if λ = Λ; and no solutions if λ > Λ.     

Confidence intervals for nonparametric regression functions with missing data: Multiple design case

This paper considers two estimators of θ = g (x) in a nonparametric regression model Y = g (x) + ɛ (x ∈ (0, 1) ^p ) with missing responses: Imputation and inverse probability weighted estimators. Asymptotic normality of the two estimators is established, which is used to construct normal approximation based confidence intervals on θ.     

The recursive solution of queue length for <Emphasis Type="Italic">Geo/G</Emphasis>/1 queue with <Emphasis Type="Italic">N</Emphasis>-policy

This paper considers a discrete-time queue with N-policy and LAS-DA(late arrival system with delayed access) discipline.By using renewal process theory and probability decomposition techniques,the authors derive the recursive expressions of the queue-length distributions at epochs n~-,n~+,and n.Furthermore,the authors obtain the stochastic decomposition of the queue length and the relations between the equilibrium distributions of the queue length at different epochs(n~-,n~+,n and departure epoch D_n).     

IMPROVED ROBUST H-INFINITY ESTIMATION FOR UNCERTAIN CONTINUOUS-TIME SYSTEMS

The design of full-order robust estimators is investigated for continuous-time polytopic uncertain systems. The main purpose is to obtain a stable linear estimator such that the estimation error system remains robustly stable with a prescribed H∞ attenuation level. Firstly, a simple alternative proof is given for an improved LMI representation of H∞ performance proposed recently. Based on the performance criterion which keeps the Lyapunov matrix out of the product of the system dynamic matrices, a sufficient condition for the existence of the robust estimator is provided in terms of linear matrix inequalities. It is shown that the proposed design strategy allows the use of parameterdependent Lyapunov functions and hence it is less conservative than the earlier results. A numerical example is employed to illustrate the feasibility and advantage of the proposed design.     

A NEW FAMILY OF TRIVALENT CAYLEY NETWORKS ON WREATH PRODUCT Zm ～ Sn

We propose a new family of interconnection networks （WGn^m） with regular degree three. When the generator set is chosen properly, they are isomorphic to Cayley graphs on the wreath product Zm ～ Sn. In the case of m ≥ 3 and n ≥3, we investigate their different algebraic properties and give a routing algorithm with the diameter upper bounded by [m/2]（3n^2- 8n ＋ 4） - 2n ＋ 1. The connectivity and the optimal fault tolerance of the proposed networks are also derived. In conclusion, we present comparisons of some familiar networks with constant degree 3.     

Testing <Emphasis Type="Italic">k</Emphasis>-edge-connectivity of digraphs

This paper presents an algorithm that tests whether a given degree-bounded digraph is k-edge-connected or ɛ-far from k-edge-connectivity. This is the first testing algorithm for k-edgeconnectivity of digraphs whose running time is independent of the number of vertices and edges. A digraph of n vertices with degree bound d is ɛ-far from k-edge-connectivity if at least ɛdn edges have to be added or deleted to make the digraph k-edge-connected, preserving the degree bound. Given a constant error parameter ɛ and a degree bound d, our algorithm always accepts all k-edge-connected digraphs and rejects all digraphs that is ɛ-far from k-edge-connectivity with probability at least 2/3. It runs in $ O\left( {d\left( {\frac{c} {{\varepsilon d}}} \right)^k log\frac{1} {{\varepsilon d}}O} \right) $ O\left( {d\left( {\frac{c} {{\varepsilon d}}} \right)^k log\frac{1} {{\varepsilon d}}O} \right) (c > 1 is a constant) time when input digraphs are restricted to be (k-1)-edge connected and runs in $ O\left( {d\left( {\frac{{ck}} {{\varepsilon d}}} \right)^k log\frac{k} {{\varepsilon d}}O} \right) $ O\left( {d\left( {\frac{{ck}} {{\varepsilon d}}} \right)^k log\frac{k} {{\varepsilon d}}O} \right) (c > 1 is a constant) time for general digraphs.     

Properties of storage functions and applications to nonlinear stochastic <Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript> control

This paper discusses the properties of the storage functions for a class of nonlinear stochastic systems. Some necessary and sufficient conditions for a function to be a storage function are derived. As applications, the finite and infinite horizon nonlinear stochastic H _∞ controls for systems with state, control, and external disturbance dependent noise are investigated, which generalize the previous results.     

Asymptotic limits and stabilization for the 1D nonlinear Mindlin-Timoshenko system

<正> This paper shows how the so called von Karman model can be obtained as a singular limitof a modified Mindlin-Timoshenko system when the modulus of elasticity in shear k tends to infinity,provided a regularizing term through a fourth order dispersive operator is added.Introducing dampingmechanisms,the authors also show that the energy of solutions for this modified Mindlin-Timoshenkosystem decays exponentially,uniformly with respect to the parameter k.As k→∞,the authors obtainthe damped von Karman model with associated energy exponentially decaying to zero as well.     

Delay-dependent robust H∞ control of convex polyhedral uncertain fuzzy systems

The robust H∞ control problem for a class of uncertain Takagi-Sugeno fuzzy systems with timevarying state delays is studied. The uncertain parameters are supposed to reside in a polytope. Based on the delay-dependent Lyapunov functional method, a new delay-dependent robust H∞ fuzzy controller, which depends on the size of the delays and the derivative of the delays, is presented in term of linear matrix inequalities （LMIs）. For all admissible uncertainties and delays, the controller guarantees not only the asymptotic stability of the system but also the prescribed H∞ attenuation level. In addition, the effectiveness of the proposed design method is demonstrated by a numerical example.     

Sliding mode H∞ control for a class of uncertain nonlinear state-delayed systems

A new proportional-integral (PI) sliding surface is designed for a class of uncertain nonlinear state-delayed systems. Based on this, an adaptive sliding mode controller (ASMC) is synthesized, which guarantees the occurrence of sliding mode even when the system is undergoing parameter uncertainties and external disturbance. The resulting sliding mode has the same order as the original system, so that it becomes easy to solve the H_∞ control problem by designing a memoryless H_∞ state feedback controller. A delay-dependent sufficient condition is proposed in terms of linear matrix inequalities (LMIs), which guarantees the sliding mode robust asymptotically stable and has a noise attenuation level γ in an H_∞ sense. The admissible state feedback controller can be found by solving a sequential minimization problem subject to LMI constraints by applying the cone complementary linearization method. This design scheme combines the strong robustness of the sliding mode control with the H_∞ norm performance. A numerical example is given to illustrate the effectiveness of the proposed scheme.     

A general iterative method of fixed points for equilibrium problems and optimization problems

The purpose of this paper is to present a general iterative scheme as below:

ROBUST H∞ CONTROL FOR UNCERTAIN NONLINEAR SYSTEMS

This paper studies the robust H∞ disturbance attenuation with internal stability for uncertain nonlinear control systems. By adding one power integrator technique, this paper designs a explicit smooth robust dynamic feedback law while rejecting the disturbance to any specified degree of accuracy. Further, the example and simulation results show the effectiveness of the proposed schemes.