Let G be a graph of order n. Settling conjectures of Chen and Jackson, we prove the following generalization of Ore’s Theorem: If G is 2-connected and )N(u)u N(v)1 >:n for every pair of nonadjacent vertices a, u, then either G is hamiltonian, or G is the Petersen graph, or G belongs to one of three families of exceptional graphs of connectivity 2.

The paper introduces a method for generating trajectories with curve sharpness and curvature constraints. Trajectories are based on continuous-curvature paths using Single & Double Continuous-Curvature paths. The paper also proposes a multi-rate control scheme by considering different dynamics with different sampling frequencies: global path planner at low frequency; target update based on Look...

— This paper presents an analysis approach to finite-time attraction in probability concerns with nonlinear systems described by nonlinear random differential equations (RDE). RDE provide meticulous physical interpreted models for some applications contain stochastic disturbance. The existence and the path-wise uniqueness of the finite-time solution are investigated through nonrestrictive assum...

The aim of this very brief third version is to present succinctly, but clearly with two animations, two optimization results from the second version of the paper available on http://arxiv.org/abs/1109.5966v2 which can still be consulted for more details. A future and much improved version of the paper will be deposited on arXiv at the beginning of 2012. The objective considered here is to optim...

As required controlling speed of motors to do control prosthetic arm movement, conventional control method is not reliably control multiple functions together, So, new control strategy is requiring tackling with this difficult problem. In this review paper we survey some recent developments of various methodologies for improvement in settling time and overshoot.

Regarding generality, the paper does not apply to the two examples mentioned, coins and a toy (Fig. 2 therein) by lack of the conformal contact that the theory demands (Fig. 1 therein): a coin by its raised images and generally rough edges, and the toy by its concave support bowl (Fig. 2 of the paper). One can roll almost any disk, including the toy and a coin, on a variety of nominally flat su...

The problem of finding a compensator C, that stabilises in the Finite Settling Time (FST) sense, a family of k distinct discrete time plants {P(, i— 1, ..., fc}, is referred to as Simultaneous FST Stabilisation Problem (S-FSTSP) and it is examined here. The general case of many input, many output plants is considered first and algebraic conditions for the existence of a S-FSTS controller are de...

Nicola Cannata, Emanuela Merelli, Russ B. Altman DOI: 10.1371/journal.pcbi.0010076 In PLoS Computational Biology, volume 1, issue 7. Two quotes and reference citations were omitted in error: ‘‘More information needs to be in a form that the machine can ‘understand’ rather than simply display’’ —T. Berners-Lee and J. Hendler [7] ‘‘We invite the life science communities to participate together an...

Thispaper presents a new nonlinear controller design method for regional pole placement of uncertain discretetime systems. The constraint of control input saturation is considered in the design. A sufficient condition is derived for the robust stabilization and the desireddynamic performance represented by the settling time and damping ratio.The design is formulated in terms of linear matrix in...