Let G be the group of projectivities stabilizing a unital U in PG(2, q2) and let A,B be two distinct points of U . In this paper we prove that, if G has an elation group of order q with center A and a group of projectivities stabilizing both A and B of order a divisor of q − 1 greater than 2(√q − 1), then U is an ovoidal Buekenhout–Metz unital. From this result two group theoretic characterizat...

Acquisition of image series using the digital camera gives a possibility to obtain high resolution/quality animation, much better than while using the digital camcorder. However, there are several problems to deal with when producing animation using such approach. Especially, if motion involves changes in observer position and spatial orientation, the resulting animation may turn out to look ch...

Legged robots have the advantage of being able to access a large variety of terrain types. In unstructured environments, where only a number of discrete footholds are possible (disaster sites, construction sites, forests, etc.), legged quadrupedal systems can utilize static stability crawl gaits or dynamic stability –often ZMP-based– gaits. In environments where smooth, continuous support is av...

We show that exponentially large warp factor hierarchies can be dynamically generated in supersymmetric compactifications. The compactification we consider is the supersymmetric extension of the Randall–Sundrum model. The crucial issue is the stabilization of the radius modulus for large warp factor. The stabilization sector we employ is very simple, consisting of two pure Yang–Mills sectors, o...

This paper proposes a Time Delay nonlinear dynamic model of HIV-1 (Human Immunodeficiency Virus type 1), introducing the drug consumption efficiencies as the controlling input for the model. The paper also represents the fuzzy T-S representation and the corresponding Fuzzy T-S controller. The controller parameters are tuned using LMIs (Linear Matrix Inequalities). The main focus is on the stabi...

The phase synchronization problem requires each node to infinitely transfer from one phase to the next one under the restriction that at most two consecutive phases can appear among all nodes. In this paper, we propose a self-stabilizing algorithm under the parallel execution model to solve this problem for semi-uniform systems of general graph topologies. The proposed algorithm is memory-effic...

This paper describes a self-stabilizing version of an algorithm presented by A. Mazurkiewicz [Inform. Process. Lett. 61 (1997) 233–239] for enumerating nodes by local rules on an anonymous network. The result improves the reliability aspects of the original algorithm and underlines the importance of a non-ambiguous topology for a network.  2001 Elsevier Science B.V. All rights reserved.

The exit time and the exit location of a non-markovian diffusion is analyzed. More particularly, we focus on the so-called self-stabilizing process. The question has been studied by Herrmann, Imkeller and Peithmann in [HIP08]. Some results similar to the ones of Freidlin and Wentzell for classical diffusions have been proved. We aim to provide the same results by a method more intuitive. Our ar...