In this paper, a finite-time control scheme is presented for stabilization of the satellite chaotic attitude around its equilibrium point when its attitude is confused by a disturbed torque. Controllers and settling time of stabilizaton are obtained, based on the Lyapunov stability theorem and finite-time control scheme. This method is satisfied for any initial condition. Numerical simulations ...

A system is called prescribed-time attractive if its solution converges at an arbitrary user-defined finite time. In this note, necessary and sufficient conditions are developed for the attractivity of linear time-varying (LTV) systems. It proved that frozen-time eigenvalues a LTV have negative real parts when time sufficiently close to convergence moment. This result shows ubiquitous singulari...

We consider systems in which many items are evolving over time by sharing common resources, and the problem of how to control such systems by allocating resources to various activities which schedule, route and process these items. We represent this by a processing network as defined by Harrison, with the added feature of infinite virtual buffers, which can model exogenous input and output. We ...

A simple finite element method for the Reissner–Mindlin plate model in the primitive variables is presented and analyzed. The method uses nonconforming linear finite elements for the transverse displacement and conforming linear finite elements enriched by bubbles for the rotation, with the computation of the element stiffness matrix modified by the inclusion of a simple elementwise averaging. ...

This paper contains the research on a hybrid algorithm combining the Matching Pursuit (MP) and the wavelet shrinkage. In this algorithm, we propose to shrink the scalar product of the element which best correlates with the residue before modifying. The study concerns a broad family of shrinkage functions. Using weak properties of these shrinkage functions, we show that the algorithm converges t...

Consider a finite list of items n = 1;2; : : : ;N, that are requested according to an i.i.d. process. Each time an item is requested it is moved to the front of the list. The associated search cost CN for accessing an item is equal to its position before being moved. If the request distribution converges to a proper distribution as N→∞, then the stationary search cost CN converges in distributi...

We consider Voevodsky’s slice tower for a finite spectrum E in the motivic stable homotopy category over a perfect field k. In case k has finite cohomological dimension (in characteristic two, we also require that k is infinite), we show that the slice tower converges, in that the induced filtration on the bi-graded homotopy sheaves Πa,bfnE is finite, exhaustive and separated at each stalk. Thi...

We consider the optimization of nonquadratic measures of the transient response. We present a computational implementation of dynamic programming recursions to solve finite-horizon problems. In the limit, the finite-horizon performance converges to the infinite-horizon performance. We provide conditions based on finite-horizon computations which only assure that a receding horizon implementatio...