A Distributed Trust Diffusion Protocol for Ad Hoc Networks (2009)
In this paper, we propose and evaluate a distributed protocol to manage trust diffusion in ad hoc networks. In this protocol, each node i maintains a \trust value" about an other node j which is...
French Roadmap for complex Systems 2008-2009 (2009)
Chavalarias, David, Bourgine, Paul, Perrier, Edith, Amblard, Fréderic, Arlabosse, François, Auger, Pierre, ...
A “complex system” is in general any system comprised of a great number of heterogeneous entities, among which local interactions create multiple levels of collective structure and organization....
French Roadmap for complex Systems 2008-2009 (2009)
Chavalarias, David, Bourgine, Paul, Perrier, Edith, Amblard, Fréderic, Arlabosse, François, Auger, Pierre, ...
A “complex system” is in general any system comprised of a great number of heterogeneous entities, among which local interactions create multiple levels of collective structure and organization....
A Distributed Trust Diffusion Protocol for Ad Hoc Networks (2008)
Institut d’informatique et de mathématiques appliquées de Grenoble,
Rouquier, Jean-Baptiste, Morvan, Michel
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration...
Stefan Felsner, Jens Gustedt, Michel Morvan
Abstract. We discuss bijections that relate families of chains in lattices associated to an order P and families of interval orders defined on the ground set of P. Two bijections of this type have...
Karell Bertet, Michel Morvan, Lhouari Nourine
Abstract. Lattice structures are often used in knowledge processing, but starting from a partial order, completion into a lattice poses efficiency problems. We use some recent results on lattice...
Constructing Colorings for Diagrams (2007)
Stefan Felsner, Jens Gustedt, Michel Morvan, Jean-xavier Rampon
Introduction and Overview An undirected graph G = (V; E) is a (Hasse--) diagram if there is a poset P = (V; !) and an orientation ~ E of E such that (x; y) 2 ~ E iff x ! y in P and there is no z with...
Coalescing Cellular Automata (2006)
Rouquier, Jean-Baptiste, Morvan, Michel
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration...
Coalescing Cellular Automata (2006)
Rouquier, Jean-Baptiste, Morvan, Michel
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration...
Coalescing Cellular Automata (2006)
Rouquier, Jean-Baptiste, Morvan, Michel
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration...
Coalescing Cellular Automata (2006)
Rouquier, Jean-Baptiste, Morvan, Michel
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration...
A Distributed Trust Diffusion Protocol for Ad Hoc Networks (2006)
In this paper, we propose and evaluate a distributed protocol to manage trust diffusion in ad hoc networks. In this protocol, each node i maintains a \trust value" about an other node j which is...
A Distributed Trust Diffusion Protocol for Ad Hoc Networks (2006)
In this paper, we propose and evaluate a distributed protocol to manage trust diffusion in ad hoc networks. In this protocol, each node i maintains a \trust value" about an other node j which is...
Fully asynchronous behavior of double-quiescent elementary cellular automata. (2005)
Fatès, Nazim, Morvan, Michel, Schabanel, Nicolas, Thierry, Eric
(eng) In this paper we propose a probabilistic analysis of the fully asynchronous behavior (i.e., two cells are never simultaneously updated, as in a continuous time process) of elementary finite...
Laboratoire de l’Informatique du Parallélisme (2005)
École Normale, Supérieure Lyon, Nazim Fatès, Michel Morvan, Nicolas Schabanel, Éric Thierry, ...
Fully asynchronous behavior of double-quiescent elementary cellular automata
Graph encoding of 2D-gon tilings (2005)
Frederic Chavanon, Matthieu Latapy, Michel Morvan, Eric Remila, Laurent Vuillon
D-gon tilings with parallelograms are a model used in physics to study quasicrystals, and they are also important in combinatorics for the study of aperiodic structures. In this paper, we study the...
Asynchronous behavior of double-quiescent elementary cellular automata (2004)
Fatès, Nazim, Morvan, Michel, Schabanel, Nicolas, Thierry, Eric
In this paper we propose a probabilistic analysis of the asynchronous behavior of elementary finite cellular automata (i.e. ${0,1}$ states, radius 1 and unidimensional) for which both states are...
Asynchronous behavior of double-quiescent elementary cellular automata (2004)
Fatès, Nazim, Morvan, Michel, Schabanel, Nicolas, Thierry, Eric
In this paper we propose a probabilistic analysis of the asynchronous behavior of elementary finite cellular automata (i.e. ${0,1}$ states, radius 1 and unidimensional) for which both states are...
Perturbing the topology of the Game of Life increases its robustness to asynchrony (2004)
Fates, Nazim A., Morvan, Michel
An experimental analysis of the asynchronous version of the "Game of Life" is performed to estimate how topology perturbations modify its evolution. We focus on the study of a phase transition from...
An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata (2004)
Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on...
An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata (2004)
Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on...
An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata (2004)
Fates, Nazim A., Morvan, Michel
Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on...
Perturbing the topology of the Game of Life increases its robustness to asynchrony (2004)
An experimental analysis of the asynchronous version of the "Game of Life" is performed to estimate how topology perturbations modify its evolution. We focus on the study of a phase transition from...
Perturbing the topology of the Game of Life increases its robustness to asynchrony (2004)
An experimental analysis of the asynchronous version of the "Game of Life" is performed to estimate how topology perturbations modify its evolution. We focus on the study of a phase transition from...
Asynchronous behavior of double-quiescent elementary cellular automata (2004)
Fatès, Nazim, Morvan, Michel, Schabanel, Nicolas, Thierry, Eric
In this paper we propose a probabilistic analysis of the asynchronous behavior of elementary finite cellular automata (i.e. ${0,1}$ states, radius 1 and unidimensional) for which both states are...
An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata (2004)
Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on...
Perturbing the topology of the Game of Life increases its robustness to asynchrony (2004)
An experimental analysis of the asynchronous version of the "Game of Life" is performed to estimate how topology perturbations modify its evolution. We focus on the study of a phase transition from...
Perturbing the topology of the Game of Life increases its robustness to asynchrony (2004)
An experimental analysis of the asynchronous version of the "Game of Life" is performed to estimate how topology perturbations modify its evolution. We focus on the study of a phase transition from...
Asynchronous behavior of double-quiescent elementary cellular automata (2004)
Fatès, Nazim, Morvan, Michel, Schabanel, Nicolas, Thierry, Eric
In this paper we propose a probabilistic analysis of the asynchronous behavior of elementary finite cellular automata (i.e. ${0,1}$ states, radius 1 and unidimensional) for which both states are...
An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata (2004)
Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on...
Graph encoding of 2D-gon tilings. (2003)
Chavanon, Frédéric, Latapy, Matthieu, Morvan, Michel, Vuillon, Laurent
(eng) 2D-gons tilings with parallelograms are the main model used in physics to study quasicrystals, and they are also important in combinatorics for the study of aperiodic structures. In this paper,...
Lattices of Tilings and Stability. (2003)
Caspard, Nathalie, Morvan, Michel, Remila, Eric, Thierry, Eric
(eng) Many tiling spaces such as domino tilings of fixed figures have an underlying lattice structure. This lattice structure corresponds to the dynamics induced by flips. In this paper, we further...
Lattices of tilings and stability (2003)
École Normale, Supérieure Lyon, Unité Mixte, Nathalie Caspard, Michel Morvan, ...
Many tiling spaces such as domino tilings of fixed figures have an underlying lattice structure. This lattice structure corresponds to the dynamics induced by flips. In this paper, we further...
Some algorithms for synchronizing clocks of base transceiver stations in a cellular network (2001)
Dornstetter, Jean Louis, Krob, Daniel, Morvan, Michel, Viennot, Laurent
Nous proposons plusieurs algorithmes de synchronisation d'horloges de stations de base dans un réseau cellulaire.
An overview of Λ-type operations on quasi-symmetric functions (2001)
Bertet, Karell, Krob, Daniel, Morvan, Michel, Novelli, Jean Christophe, Phan, H.D., Thibon, Jean Yves
Cet article est un article de survol des propriétés de type Lambda-anneau de l'algèbre des fonctions quasi-symétriques.
Some algorithms for synchronizing clocks of base transceiver stations in a cellular network (2001)
Dornstetter, Jean Louis, Krob, Daniel, Morvan, Michel, Viennot, Laurent
Nous proposons plusieurs algorithmes de synchronisation d'horloges de stations de base dans un réseau cellulaire.
An overview of Λ-type operations on quasi-symmetric functions (2001)
Bertet, Karell, Krob, Daniel, Morvan, Michel, Novelli, Jean Christophe, Phan, H.D., Thibon, Jean Yves
Cet article est un article de survol des propriétés de type Lambda-anneau de l'algèbre des fonctions quasi-symétriques.
Some algorithms for synchronizing clocks of base transceiver stations in a cellular network (2001)
Dornstetter, Jean Louis, Krob, Daniel, Morvan, Michel, Viennot, Laurent
Nous proposons plusieurs algorithmes de synchronisation d'horloges de stations de base dans un réseau cellulaire.
An overview of Λ-type operations on quasi-symmetric functions (2001)
Bertet, Karell, Krob, Daniel, Morvan, Michel, Novelli, Jean Christophe, Phan, H.D., Thibon, Jean Yves
Cet article est un article de survol des propriétés de type Lambda-anneau de l'algèbre des fonctions quasi-symétriques.
An overview of Λ-type operations on quasi-symmetric functions (2001)
Bertet, Karell, Krob, Daniel, Morvan, Michel, Novelli, Jean Christophe, Phan, H.D., Thibon, Jean Yves
Cet article est un article de survol des propriétés de type Lambda-anneau de l'algèbre des fonctions quasi-symétriques.
Some algorithms for synchronizing clocks of base transceiver stations in a cellular network (2001)
Dornstetter, Jean Louis, Krob, Daniel, Morvan, Michel, Viennot, Laurent
Nous proposons plusieurs algorithmes de synchronisation d'horloges de stations de base dans un réseau cellulaire.
Some Algorithms for Synchronizing Clocks of Base Transceiver Stations in a Cellular Network (2001)
Jean-louis Dornstetter, Daniel Krob, Michel Morvan, Laurent Viennot
This paper deals with synchronization problems arising in the context of cellular networks. It presents and compares several algorithms that can be used for solving these problems
Sandpile Models and Lattices: A Comprehensive Survey (2001)
Éric Goles, Matthieu Latapy, Clémence Magnien, Michel Morvan, Ha Duong Phan
Starting from some studies of (linear) integer partitions, we noticed that the lattice structure is strongly related to a large variety of discrete dynamical models, in particular sandpile models and...
Sandpile models and lattices: A comprehensive survey (2001)
Éric Goles, Matthieu Latapy, Clémence Magnien, Michel Morvan, Ha Duong Phan
Abstract: Starting from some studies of (linear) integer partitions, we noticed that the lattice structure is strongly related to a large variety of discrete dynamical models, in particular sandpile...
Lattice Structure and Convergence of a Game of Cards (2000)
Goles, Eric, Morvan, Michel, Phan, Ha Duong
This paper is devoted to the study of the dynamics of a discrete system related to some self stabilizing protocol on a ring of processors.
The structure of Chip Firing Games and related models (2000)
Goles, Eric, Morvan, Michel, Phan, Ha Duong
In this paper, we study the dynamics of sand grains falling in sand piles. Usually sand piles are characterized by a decreasing integer partition and grain moves are described in terms of transitions...
The Handling of Graphs on PC Clusters : A Coarse Grained Approach (2000)
Guérin Lassous, Isabelle, Gustedt, Jens, Morvan, Michel
We study the relationship between the design and analysis of graph algorithms in the coarsed grained parallel models and the behavior of the resulting code on clusters. We conclude that the coarse...
Guérin Lassous, Isabelle, Gustedt, Jens, Morvan, Michel
We study the relationship between the design and analysis of graph algorithms in the coarsed grained parallel models and the behavior of the resulting code on todays parallel machines and clusters....
The Handling of Graphs on PC Clusters : A Coarse Grained Approach (2000)
Guérin Lassous, Isabelle, Gustedt, Jens, Morvan, Michel
We study the relationship between the design and analysis of graph algorithms in the coarsed grained parallel models and the behavior of the resulting code on clusters. We conclude that the coarse...
Guérin Lassous, Isabelle, Gustedt, Jens, Morvan, Michel
We study the relationship between the design and analysis of graph algorithms in the coarsed grained parallel models and the behavior of the resulting code on todays parallel machines and clusters....
The Handling of Graphs on PC Clusters : A Coarse Grained Approach (2000)
Guérin Lassous, Isabelle, Gustedt, Jens, Morvan, Michel
We study the relationship between the design and analysis of graph algorithms in the coarsed grained parallel models and the behavior of the resulting code on clusters. We conclude that the coarse...
Guérin Lassous, Isabelle, Gustedt, Jens, Morvan, Michel
We study the relationship between the design and analysis of graph algorithms in the coarsed grained parallel models and the behavior of the resulting code on todays parallel machines and clusters....
Some Algorithms for Synchronizing Clocks of Base Transceiver Stations in a Cellular Network (1999)
Daniel Dornstetter, Daniel Krob, Michel Morvan, Laurent Viennot
This paper deals with synchronization problems arising in the context of cellular networks. It presents and compares several algorithms that can be used for solving these problems. 1 Introduction The...
Interval Reductions and Extensions of Orders: Bijections to Chains in Lattices (1998)
Stefan Felsner, Stefan Felsner, Jens Gustedt, Jens Gustedt, Michel Morvan, Michel Morvan
. We discuss bijections that relate families of chains in lattices associated to an order P and families of interval orders defined on the ground set of P . Two bijections of this type have been...
Structure of Some Sand Piles Model (1998)
Matthieu Latapy, Roberto Mantaci, Michel Morvan, Ha Duong Phan
: spm (Sand Pile Model) is a simple discrete dynamical system used in physics to represent granular objects. It is deeply related to integer partitions, and many other combinatorics problems, such as...
Weak-order extensions of an order (1997)
Karell Bertet, Karell Bertet, Jens Gustedt, Jens Gustedt, Michel Morvan, Michel Morvan
gustedt@math.tu-berlin.de. Supported by IFP Digitale Filter. Abstract In this paper, at first we describe a graph representing all the weak-order extensions of a partially ordered set and an...
Some Results on Ongoing Research on Parallel Implementation of Graph Algorithms (1997)
Isabelle Guérin Lassous, Michel Morvan
In high performance computing, three recognized important points are usability, scalability and portability. No models seemed to satisfy these three steps till recently: a few proposed models try to...
From Parallel Comparability Graph Recognition to Parallel Modular Decomposition (1995)
Michel Morvan, Laurent Viennot, Paris Denis Diderot
A parallelization of the algorithm of Golumbic for recognizing comparability graphs is proposed for the concurrent parallel random access machine (CRCW PRAM). Parallel algorithms for finding a...
A Compact Data Structure and Parallel Algorithms for Permutation Graphs (1995)
Jens Gustedt, Jens Gustedt, Michel Morvan, Michel Morvan, Laurent Viennot, ...
. Starting from a permutation of f0; : : : ; n \Gamma 1g we compute in parallel with a workload of O(n log n) a compact data structure of size O(n log n). This data structure allows to obtain the...
A Compact Data Structure and Parallel Algorithms for Permutation Graphs (1995)
Jens Gustedt, Michel Morvan, Laurent Viennot, Paris Denis Diderot
. Starting from a permutation of f0; : : : ; n \Gamma 1g we compute in parallel with a workload of O(n log n) a compact data structure of size O(n log n). This data structure allows to obtain the...
Les origines linguistiques du Basque : l'ouralo-altaïque / (1992)
[Mikrofiche-Ausg.].
Les origines linguistiques du basque [microform] : l'ouralo-altaïque / (1992)
Thesis (doctoral)--Université Michel de Montaigne-Bordeaux III, 1992.