Let G be the group of projectivities stabilizing a unital U in PG(2, q2). In this paper, we prove that U is a classical unital if and only if there are two points in U such that the stabilizer of these two points in G has order q2 − 1.

The Theory of Belief Functions is a formal framework for reasoning with uncertainty that is well suited for representing unreliable information and weak states of knowledge. In information fusion applications, it is mainly used in a centralized way, by gathering the data on a single node before computation. In this paper, a distributed algorithm is proposed to compute the neighborhood confidenc...

A particularly suitable design strategy for constructing a robust distributed computer application is to endow it with a self-stabilization property. Such a property guarantees that the system will always return to and stay within a specified set of legal states within bounded time regardless of its initial state. A self-stabilizing application therefore has the potential of recovering from the...

Self-stabilizing algorithms model distributed systems and allow automatic recovery of the system from transient failures. The center of a graph is the set of vertices with the minimum eccentricity. In this paper we investigate the self-stabilizing algorithm for finding the center of Cartesian product of K2 and maximal outerplanar graphs.

In this paper, we extend results from packet-based control theory and present sufficient conditions on the rate of a packet network to guarantee asymptotic stabilizability of unstable discrete LTI systems with less inputs than states. Two types of Network Control Systems are considered in the absence of communication delays, then for one of the two types, the case of a constant time delay is di...

Conventional self-stabilizing algorithms cannot be used for safety-critical systems due to the period of vulnerability that exists after a transient failure occurs till the system stabilizes. In this paper, we consider a highly safe self-stabilizing system where the vulnerability problem is tackled. The design principles we use to achieve this goal include sobriety test and processor specializa...

We consider a nonconforming streamline-diiusion nite element method for solving convection-diiusion problems. The theoretical and numerical investigation for triangular and tetrahedral meshes recently given by John, Maubach and Tobiska has shown that the usual application of the SDFEM gives not a suucient stabilization. Additional parameter dependent jump terms have been proposed which preserve...

A distributed system consists of a set of processes and a set of communication links, each connecting a pair of processes. A distributed system is called self-stabilizing if it converges to a correct system state no matter which system state it is started with. A self-stabilizing system is considered to be an ideal fault tolerant system, since it can tolerate a nite number of transient failures...

We present a contribution to the study of the problem of semi-global asymptotic stabilization of nonlinear continuous-time systems under data rate constraints when only output measurements are available. We consider systems which are uniformly observable and we point out that the design of an “embedded-observer” decoder and a controller which semi-globally stabilize this class of systems under ...

Risk-based slope stabilization planning integrates the failure probability and the failure consequence systematically and shows promise for use in the practice. This paper attempts to develop a risk-based methodology for stabilization planning for deteriorating soil cut slopes. First, a framework of risk-based stabilization planning for slopes is proposed. Then the time-dependent reliability of...