In this paper we present the self-stabilizing implementation of a class of token based algorithms. In the current work we only consider interactions between weak nodes. They are uniform, they do not have unique identifiers, are static and their interactions are restricted to a subset of nodes called neighbours. While interacting, a pair of neighbouring nodes may create mobile agents (that mater...

The last time many of us were assembled at this university Dang Pham, Deputy Director of the Office of Bilingual Education and Minority Languages Affairs, indicated that the United States Government recognizes a special debt of responsibility to assist Native American peoples to foster and strengthen their languages. This second conference at Northern Arizona University was to be a more concret...

Self-stabilization [14] is a versatile technique for recovery from erroneous behavior due to transient faults or wrong initialization. A system is self-stabilizing if (1) starting from an arbitrary initial state it can automatically reach a set of legitimate states in a finite number of steps and (2) it remains in legitimate states in the absence of faults. Weak-stabilization [25] and probabili...

Legged robots can sustain stable dynamic locomotion without sensors or feedback. It is possible to construct a running robot that is inherently stable and needs no sensing to reject minor perturbations; it is therefore self-stabilizing. In contrast, most previous attempts to make robots run have used active, high bandwidth feedback control systems. We use a simpliied monopod to give an understa...

We study the problem of determining, for a polynomial function f on a vector space V , the linear transformations g of V such that f ◦ g = f . When f is invariant under a simple algebraic group G acting irreducibly on V , we note that the subgroup of GL(V ) stabilizing f often has identity component G, and we give applications realizing various groups, including the largest exceptional group E8...

Route instability is widely recognized as a major problem in the Internet. Core routers are barraged with millions of updates daily, leading to massive infrastructural costs and worsened data-plane performance. Route flap damping provides some protection against instability, but introduces pathologies and reduces availability. With concerns about the scalability of the routing system prompting ...

As it is well known in K-theory, stabilization of matrices enables them to commute “up to homotopy”. The purpose of this short paper is to describe an analogous philosophy for cochains on a space. It is in fact a direct application of a paper of Henri Cartan [1], together with a new idea of stabilization for cochains, similar to matrices. The application below may be also deduced from a paper o...