Displaying similar documents to “Gate circuits in the algebra of transients”

Efficient validation and construction of border arrays and validation of string matching automata

Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

We present an on-line linear time and space algorithm to check if an integer array is the border array of at least one string built on a bounded or unbounded size alphabet . First of all, we show a bijection between the border array of a string and the skeleton of the DFA recognizing Σ*ω, called a string matching automaton (SMA). Different strings can have the same border array but the originality of the presented method is that the correspondence between a border array...

Strong stabilization of controlled vibrating systems

Jean-François Couchouron (2011)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

This paper deals with feedback stabilization of second order equations of the form ytt + A 0 y + u (t) B 0 y (t) = 0, t ∈ [0, +∞[, where A ...

Three tabu search methods for the MI-FAP applied to 802.11 networks

Sacha Varone, Nicolas Zufferey (2009)

RAIRO - Operations Research

Similarity:

Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually....

Strong stabilization of controlled vibrating systems

Jean-François Couchouron (2011)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

This paper deals with feedback stabilization of second order equations of the form + + = 0, ∈ [0, +∞[, where is a densely defined positive selfadjoint linear operator on a real Hilbert space with compact inverse and is a linear map in diagonal form. It is proved here that the classical sufficient ad-condition of Jurdjevic-Quinn and Ball-Slemrod with the feedback control = ⟨, ...

A test-set for -power-free binary morphisms

F. Wlazinski (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

A morphism is -power-free if and only if is -power-free whenever is a -power-free word. A morphism is -power-free up to if and only if is -power-free whenever is a -power-free word of length at most . Given an integer ≥ 2, we prove that a binary morphism is -power-free if and only if it is -power-free up to . This bound becomes linear for primitive morphisms: a binary primitive morphism is -power-free if and only if it is -power-free up to ...

Computing and proving with pivots

Frédéric Meunier (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A simple idea used in many combinatorial algorithms is the idea of . Originally, it comes from the method proposed by Gauss in the 19th century for solving systems of linear equations. This method had been extended in 1947 by Dantzig for the famous simplex algorithm used for solving linear programs. From since, a pivoting algorithm is a method exploring subsets of a ground set and going from one subset to a new one ′ by deleting an element inside and adding an element outside : ′ =  ...