All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 18 Next

Displaying 341 – 360 of 407

Showing per page

Sufficient conditions for the existence of a center in polynomial systems of arbitrary degree.

Hector Giacomini, Malick Ndiaye (1996)

Publicacions Matemàtiques

In this paper, we consider polynomial systems of the form x' = y + P(x, y), y' = -x + Q(x, y), where P and Q are polynomials of degree n wihout linear part.For the case n = 3, we have found new sufficient conditions for a center at the origin, by proposing a first integral linear in certain coefficient of the system. The resulting first integral is in the general case of Darboux type.By induction, we have been able to generalize these results for polynomial systems of arbitrary degree.

Suites doubles de basse complexité

Valérie Berthé, Laurent Vuillon (2000)

Journal de théorie des nombres de Bordeaux

Nous donnons une représentation géométrique des suites doubles uniformément récurrentes de fonction de complexité rectangulaire m n + n . Nous montrons que ces suites codent l’action d’une ℤ 2 -action définie par deux rotations irrationnelles sur le cercle unité. La preuve repose sur une étude des suites doubles dont les lignes sont des suite sturmiennes de même langage.

Summarizing sensors data in vehicular ad hoc networks

Dorsaf Zekri, Bruno Defude, Thierry Delot (2010)

RAIRO - Operations Research - Recherche Opérationnelle

This article focuses on data aggregation in vehicular ad hoc networks. In such networks, sensor data are usually produced and exchanged between vehicles in order to warn or inform the drivers when an event is detected (e.g., accident, emergency braking, parking space released, vehicle with non-functioning brake lights, etc.). In the following, we present a solution to aggregate and store these data in order to have a history of past events. We therefore use Flajolet-Martin sketches. Our goal is...

Summarizing sensors data in vehicular ad hoc networks

Dorsaf Zekri, Bruno Defude, Thierry Delot (2011)

RAIRO - Operations Research

This article focuses on data aggregation in vehicular ad hoc networks. In such networks, sensor data are usually produced and exchanged between vehicles in order to warn or inform the drivers when an event is detected (e.g., accident, emergency braking, parking space released, vehicle with non-functioning brake lights, etc.). In the following, we present a solution to aggregate and store these data in order to have a history of past events. We therefore use Flajolet-Martin sketches. Our goal is...

Superiority of one-way and realtime quantum machines∗∗∗

Abuzer Yakaryılmaz (2012)

RAIRO - Theoretical Informatics and Applications

In automata theory, quantum computation has been widely examined for finite state machines, known as quantum finite automata (QFAs), and less attention has been given to QFAs augmented with counters or stacks. In this paper, we focus on such generalizations of QFAs where the input head operates in one-way or realtime mode, and present some new results regarding their superiority over their classical counterparts. Our first result is about the nondeterministic...

Superiority of one-way and realtime quantum machines

Abuzer Yakaryılmaz (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

In automata theory, quantum computation has been widely examined for finite state machines, known as quantum finite automata (QFAs), and less attention has been given to QFAs augmented with counters or stacks. In this paper, we focus on such generalizations of QFAs where the input head operates in one-way or realtime mode, and present some new results regarding their superiority over their classical counterparts. Our first result is about the nondeterministic acceptance mode: Each quantum model...

Superiority of one-way and realtime quantum machines∗∗∗

Abuzer Yakaryılmaz (2012)

RAIRO - Theoretical Informatics and Applications

In automata theory, quantum computation has been widely examined for finite state machines, known as quantum finite automata (QFAs), and less attention has been given to QFAs augmented with counters or stacks. In this paper, we focus on such generalizations of QFAs where the input head operates in one-way or realtime mode, and present some new results regarding their superiority over their classical counterparts. Our first result is about the nondeterministic...

Supervisory controller design for timed-place Petri nets

Aydin Aybar, Altuğ İftar (2012)

Kybernetika

Supervisory controller design to avoid deadlock in discrete-event systems modeled by timed-place Petri nets (TPPNs) is considered. The recently introduced approach of place-stretching is utilized for this purpose. In this approach, given an original TPPN (OPN), a new TPPN, called the place-stretched Petri net (PSPN), is obtained. The PSPN has the property that its marking vector is sufficient to represent its state. By using this property, a supervisory controller design approach for TPPNs to avoid...

Supporting locomotive functions of a six-legged walking robot

Krzysztof Walas, Dominik Belter (2011)

International Journal of Applied Mathematics and Computer Science

This paper presents a method for building a foothold selection module as well as methods for the stability check for a multi-legged walking robot. The foothold selection decision maker is shaped automatically, without expert knowledge. The robot learns how to select appropriate footholds by walking on rough terrain or by testing ground primitives. The gathered knowledge is then used to find a relation between slippages and the obtained local shape of the terrain, which is further employed to assess...

Sur la complexité de mots infinis engendrés par des q -automates dénombrables

Marion Le Gonidec (2006)

Annales de l’institut Fourier

On étudie, dans cet article, les propriétés combinatoires de mots engendrés à l’aide de q -automates déterministes dénombrables de degré borné, ou de manière équivalente, engendrés par des substitutions de longueur constante uniformément bornées sur un alphabet dénombrable. En particulier, on montre que la complexité de tels mots est au plus polynomiale et que, sur plusieurs exemples, elle est au plus de l’ordre de grandeur de n ( log n ) p .

Currently displaying 341 – 360 of 407