We consider a control system for a Korteweg-de Vries equation with homogeneous Dirichlet boundary conditions and Neumann boundary control. We address the rapid exponential stabilization problem. More precisely, we build some feedback laws forcing the solutions of the closed-loop system to decay exponentially to zero with arbitrarily prescribed decay rates. We also perform some numerical computa...

We consider the control of partially linear cascade systems using switching control of the states of the linear subsystem. We give suucient conditions under which feedback of the linear states with switching gains guarantees both exponential stability of the linear subsystem and positive invariance of a compact region in state space. Semi-global asymptotic stabilization follows under some addit...

Color reproduction stabilization is a control process to ensure that the printed output matches the desired color tones. In this paper we consider the stabilization of single color tone separation. The mapping of input-tone to output-color is characterized by the color tone reproduction curve(TRC). By compensating for any variations of the Xerographic printing process, the TRC stabilization con...

Consider a distributed network of n nodes that is connected to a global source of “beats”. All nodes receive the “beats” simultaneously, and operate in lock-step. A scheme that produces a “pulse” every Cycle beats is shown. That is, the nodes agree on “special beats”, which are spaced Cycle beats apart. Given such a scheme, a clock synchronization algorithm is built. The “pulsing” scheme is sel...

The greatest obstacle to developing a string phenomenology is our lack of understanding of the ground state. We explain why the dynamics which determines this state is not likely to be accessible to any systematic approximation. We note that the racetrack scheme, often cited as a counterexample, suffers from similar difficulties. We stress that the weakness of the gauge couplings, the gauge hie...

Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisions based on the states of their immediate neighbors. We provide a general transformation for constructing self-stabilizing algorithms which utilize distance-k knowledge. Our transformation has both a slowdown and space overhea...

We present the first polynomial self-stabilizing algorithm for finding a 2 3 -approximation of a maximum matching in a general graph. The previous best known algorithm has been presented by Manne et al. [6] and has a sub-exponential time complexity under the distributed adversarial daemon [1]. Our new algorithm is an adaptation of the Manne et al. algorithm and works under the same daemon, but ...

This paper is concerned with a particular application of image stabilization. Image stabilization is a necessary step to reduce the effect of camera motion when, as in this case, image sequences are acquired from a mobile platform. In this work, in order to find an efficient motion estimator, two one-dimensional characteristic curves are extracted from each video frame. Such curves are then com...