In the stabilizing consensus problem each agent of a networked system has an input value and is repeatedly writing output value; it required that eventually all values stabilize to same which, moreover, must be one values. We study this for synchronous model with identical anonymous agents are connected by time-varying topology may join at any time (asynchronous start). Our main result generic ...

We consider regression in which one predicts a response Y with set of predictors X across different experiments or environments. This is common setup many data-driven scientific fields, and we argue that statistical inference can benefit from an analysis takes into account the distributional changes In particular, it useful to distinguish between stable unstable predictors, is, have fixed chang...

STUDY DESIGN A systematic review of randomized controlled trials. OBJECTIVES To evaluate the effectiveness of segmental stabilizing exercises for acute, subacute and chronic low back pain with regard to pain, recurrence of pain, disability and return to work. METHODS MEDLINE, EMBASE, CINAHL, Cochrane Controlled Trials Register, PEDro and article reference lists were searched from 1988 onwar...

Self-stabilization for non-masking fault-tolerant distributed system has received considerable research interest over the last decade. In this paper, we propose a self-stabilizing algorithm for 2-edge-connectivity and 2-vertex-connectivity of an asynchronous distributed computer network. It is based on a self-stabilizing depth-first search, and is not a composite algorithm in the sense that it ...

A thrombin-sensitive protein has been isolated from human blood platelets by gel electrophoresis followed by filtration through Sephadex. The isolated protein was homogeneous on disc gel and behaved like a P-globulin. In immunoelectrophoresis, a single precipitin line was observed with antiplatelet serum or anti-fibrin-stabilizing factor serum. The precipitin line as well as the protein band on...

This paper proposes a general definition of self-stabilizing wait-free shared memory objects. The definition ensures that, even in the face of processor failures, every execution after a transient memory failure is linearizable except for an a priori bounded number of actions. Shared registers have been used extensively as communication medium in self-stabilizing protocols. As an application of...

We present a method of combining a self-stabilizing algorithm with a hierarchical structure to construct a self-stabilizing algorithm with improved stabilization time complexity and fault-containment features. As a case study, a self-stabilizing spanning-tree algorithm is presented which in favorable settings has logarithmic stabilization time complexity.

We reduce the problem of proving the convergence of a randomized self-stabilizing algorithm under k-bounded policies to the convergence of the same algorithm under a specific policy. As a consequence, all k-bounded schedules are equivalent : a given algorithm is self-stabilizing under one of them if and only if it is self-stabilizing under any of them.