Theme 1--- Reseaux et systemes (2007)
Jean-claude Bermond, Jean-claude Bermond, Eric Darrot, Eric Darrot, Olivier Delmas, Olivier Delmas, ...
apport de recherche
Design of fault-tolerant networks on satellites (TWTA redundancy) (2007)
Jean-Claude Bermond, Eric Darrot, Olivier Delmas
This article deals with the design of networks to be loaded on satellites. These networks should connect inputs (corresponding to signals arriving on the satellite) to outputs (corresponding to...
Diffusion En Mode Commutation De Circuits Dans Les Tores De Dimension (2007)
Olivier Delmas And Stéphane Perennes, Olivier Delmas, Stephane Perennes, Projet Sloop
. This paper deals with broadcasting in k\Gammadimensional torus network under the circuitswitched routing model. We suppose that a node can send a message simultaneously on all its out-links. Here,...
Design of fault-tolerant on-board network (2006)
Delmas, Olivier, Montassier, Mickael, Havet, Frédéric, Pérennes, Stéphane
An $(n,k,r)$-network is a triple $N=(G,in,out)$ where $G=(V,E)$ is a graph and $in,out$ are integral functions defined on $V$ called input and output functions, such that for any $v \inV$,...
Design of fault-tolerant on-board network (2006)
Delmas, Olivier, Montassier, Mickael, Havet, Frédéric, Pérennes, Stéphane
An $(n,k,r)$-network is a triple $N=(G,in,out)$ where $G=(V,E)$ is a graph and $in,out$ are integral functions defined on $V$ called input and output functions, such that for any $v \inV$,...
Design of Fault-Tolerant Networks for Satellites (2002)
Jean-claude Bermond, Eric Darrot, Olivier Delmas
This article deals with the design of networks to be placed on satellites. These networks should connect inputs (corresponding to signals arriving at the satellite) to outputs (corresponding to...
Tight Bounds for Broadcasting in the Linear Cost Model (1999)
Beauquier, Bruno, Delmas, Olivier, Pérennes, Stéphane
This work considers broadcast protocols made of successive communication rounds in the linear cost model: the time needed to send a message of length L is defined as \alpha +L\tau. In this model,...
Tight Bounds for Broadcasting in the Linear Cost Model (1999)
Beauquier, Bruno, Delmas, Olivier, Pérennes, Stéphane
This work considers broadcast protocols made of successive communication rounds in the linear cost model: the time needed to send a message of length L is defined as \alpha +L\tau. In this model,...
Tight Bounds for Broadcasting in the Linear Cost Model (1999)
Beauquier, Bruno, Delmas, Olivier, Pérennes, Stéphane
This work considers broadcast protocols made of successive communication rounds in the linear cost model: the time needed to send a message of length L is defined as \alpha +L\tau. In this model,...
Stphane Prennes, Unit Inria, Sophia Antipolis, Bruno Beauquier, Bruno Beauquier, Olivier Delmas, ...
apport de recherche
Communications par commutation de circuits dans les réseaux d'interconnexion / (1997)
1997 d'après la déclaration du dépôt légal.
Communications par commutation de circuits dans les réseaux d'interconnexion (1997)
Les résultats obtenus dans cette thèse portent principalement sur l' étude des communications dans les architectures parallèles, distribuées ou réseaux d'interconnexion. Dans le chapitre 1 nous...
Communications par commutation de circuits dans les réseaux d'interconnexion (1997)
Les résultats obtenus dans cette thèse portent principalement sur l' étude des communications dans les architectures parallèles, distribuées ou réseaux d'interconnexion.Dans le chapitre 1 nous...
Communications par commutation de circuits dans les réseaux d'interconnexion (1997)
Les résultats obtenus dans cette thèse portent principalement sur l' étude des communications dans les architectures parallèles, distribuées ou réseaux d'interconnexion. Dans le chapitre 1 nous...
Communications par commutation de circuits dans les réseaux d'interconnexion (1997)
Les résultats obtenus dans cette thèse portent principalement sur l' étude des communications dans les architectures parallèles, distribuées ou réseaux d'interconnexion. Dans le chapitre 1 nous...
Hamilton Circuits in the Directed Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly digraph $\vec{{\cal WBF}}(d,n)$ of degree $d$ and dimension $n$ contains at least $d-1$ arc-disjoint Hamilton circuits, answering a conjecture of D....
Circuit-Switched Gossiping in the 3-Dimensional Torus Networks (1996)
Delmas, Olivier, Perennes, Stéphane
In this paper we describe, in the case of short messages, an efficient gossiping algorithm for 3-dimensional torus networks (wrap-around or toroidal meshes) that uses synchronous circuit-switched...
Hamilton Cycle Decomposition of the Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly graph ${\cal WBF}(d,n)$ of degree $d$ and \linebreak dimension $n$ is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and...
Hamilton Circuits in the Directed Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly digraph $\vec{{\cal WBF}}(d,n)$ of degree $d$ and dimension $n$ contains at least $d-1$ arc-disjoint Hamilton circuits, answering a conjecture of D....
Circuit-Switched Gossiping in the 3-Dimensional Torus Networks (1996)
Delmas, Olivier, Perennes, Stéphane
In this paper we describe, in the case of short messages, an efficient gossiping algorithm for 3-dimensional torus networks (wrap-around or toroidal meshes) that uses synchronous circuit-switched...
Hamilton Cycle Decomposition of the Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly graph ${\cal WBF}(d,n)$ of degree $d$ and \linebreak dimension $n$ is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and...
Hamilton Circuits in the Directed Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly digraph $\vec{{\cal WBF}}(d,n)$ of degree $d$ and dimension $n$ contains at least $d-1$ arc-disjoint Hamilton circuits, answering a conjecture of D....
Circuit-Switched Gossiping in the 3-Dimensional Torus Networks (1996)
Delmas, Olivier, Perennes, Stéphane
In this paper we describe, in the case of short messages, an efficient gossiping algorithm for 3-dimensional torus networks (wrap-around or toroidal meshes) that uses synchronous circuit-switched...
Hamilton Cycle Decomposition of the Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly graph ${\cal WBF}(d,n)$ of degree $d$ and \linebreak dimension $n$ is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and...
Hamilton circuits in the directed Butterfly network (1996)
Jean-Claude Bermond, Eric Darrot, Olivier Delmas, Stéphane Perennes, Projet Sloop, Unite Inria, ...
In this paper, we prove that the wrapped Butterfly digraph ~ WBF(d,n) of degree d and dimension n contains at least d \Gamma 1 arc-disjoint Hamilton circuits, answering a conjecture of D. Barth. We...
Circuit-Switched Gossiping in the 3-Dimensional Torus Networks (1996)
Olivier Delmas, Stéphane Perennes, Projet Sloop
In this paper we describe, in the case of short messages, an efficient gossiping algorithm for 3-dimensional torus networks (wrap-around or toroidal meshes) that uses synchronous circuit-switched...
Circuit-Switched Gossiping in 3-Dimensional Torus Networks. (1996)
Olivier Delmas, Stéphane Perennes, St'ephane Perennes
In this paper we describe an efficient gossiping algorithm for short messages into the 3-dimensional torus networks (wrap-around or toroidal meshes) that uses synchronous circuit-switched routing....
Circuit-Switched Gossiping in the 3-Dimensional Torus Networks (1996)
Olivier Delmas Stephane, Olivier Delmas, Stephane Perennes, Stephane Perennes, Projet Sloop
: in this paper we describe, in the case of short messages, an efficient gossiping algorithm for 3-dimensional torus networks (wrap-around or toroidal meshes) that uses synchronous circuitswitched...
Hamilton circuits in the directed Butterfly network (1996)
Jean-Claude Bermond, Jean-claude Bermond, Eric Darrot, Eric Darrot, Olivier Delmas, Olivier Delmas, ...
In this paper, we prove that the wrapped Butterfly digraph ~ WBF(d;n) of degree d and dimension n contains at least d \Gamma 1 arc-disjoint Hamilton circuits, answering a conjecture of D. Barth. We...
Circuit-Switched Gossiping in the 3-Dimensional Torus Networks (1996)
Olivier Delmas, Olivier Delmas, Stephane Perennes, Stephane Perennes, Projet Sloop
In this paper we describe, in the case of short messages, an efficient gossiping algorithm for 3-dimensional torus networks (wrap-around or toroidal meshes) that uses synchronous circuitswitched...
Hamilton circuits in the directed wrapped Butterfly network (1996)
Jean-Claude Bermond, Jean-claude Bermond, Eric Darrot, Eric Darrot, Olivier Delmas, Olivier Delmas, ...
In this paper, we prove that the wrapped Butterfly digraph ~ WBF(d;n) of degree d and dimension n contains at least d \Gamma 1 arc-disjoint Hamilton circuits, answering a conjecture of D. Barth. We...
Hamilton cycle decomposition of the Butterfly networks. (1996)
Jean-Claude Bermond, Eric Darrot, Olivier Delmas, Stéphane Perennes
In this paper we prove that the wrapped Butterfly graph WBF(d,n) of degree d and dimension n is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and A. Raspaud who solved the...
Hamilton circuits in directed Butterfly networks (1995)
Jean-claude Bermond, Eric Darrot, Olivier Delmas
In this paper we prove that the wrapped Butterfly digraph ~ WBF(d;n) of degree d and dimension n contains at least d \Gamma 1 arc-disjoint Hamilton circuits, answering a conjecture of D. Barth. We...
Th. Univ. : Sc. de la vie et de la santé : Lille 1 : 1988 ; 282.
Delmas, Olivier, Durand-Schneider, Anne-Marie, Cohen, Jean, Colard, Odile, Trugnan, Germain
Rotavirus assembly is a multistep process that requires the successive association of four major structural proteins in three concentric layers. It has been assumed until now that VP4, the most...
Rafts Promote Assembly and Atypical Targeting of a Nonenveloped Virus, Rotavirus, in Caco-2 Cells
Sapin, Catherine, Colard, Odile, Delmas, Olivier, Tessier, Cedric, Breton, Michelyne, Enouf, Vincent, ...
Rotavirus follows an atypical pathway to the apical membrane of intestinal cells that bypasses the Golgi. The involvement of rafts in this process was explored here. VP4 is the most peripheral...
Rafts Promote Assembly and Atypical Targeting of a Nonenveloped Virus, Rotavirus, in Caco-2 Cells
Sapin, Catherine, Colard, Odile, Delmas, Olivier, Tessier, Cedric, Breton, Michelyne, Enouf, Vincent, ...
Rotavirus follows an atypical pathway to the apical membrane of intestinal cells that bypasses the Golgi. The involvement of rafts in this process was explored here. VP4 is the most peripheral...
Delmas, Olivier, Durand-Schneider, Anne-Marie, Cohen, Jean, Colard, Odile, Trugnan, Germain
Rotavirus assembly is a multistep process that requires the successive association of four major structural proteins in three concentric layers. It has been assumed until now that VP4, the most...
Delmas, Olivier, Breton, Michelyne, Sapin, Catherine, Le Bivic, André, Colard, Odile, Trugnan, Germain
Previous studies have shown that rotavirus virions, a major cause of infantile diarrhea, assemble within small intestinal enterocytes and are released at the apical pole without significant cell...
Genomic Diversity and Evolution of the Lyssaviruses
Delmas, Olivier, Holmes, Edward C., Talbi, Chiraz, Larrous, Florence, Dacheux, Laurent, Bouchier, Christiane, ...
Lyssaviruses are RNA viruses with single-strand, negative-sense genomes responsible for rabies-like diseases in mammals. To date, genomic and evolutionary studies have most often utilized partial...
Mitochondrial Dysfunction in Lyssavirus-Induced Apoptosis▿ †
Gholami, Alireza, Kassis, Raïd, Real, Eléonore, Delmas, Olivier, Guadagnini, Stéphanie, Larrous, Florence, ...
Lyssaviruses are highly neurotropic viruses associated with neuronal apoptosis. Previous observations have indicated that the matrix proteins (M) of some lyssaviruses induce strong neuronal...
Rhabdovirus Matrix Protein Structures Reveal a Novel Mode of Self-Association
Graham, Stephen C., Assenberg, René, Delmas, Olivier, Verma, Anil, Gholami, Alireza, Talbi, Chiraz, ...
The matrix (M) proteins of rhabdoviruses are multifunctional proteins essential for virus maturation and budding that also regulate the expression of viral and host proteins. We have solved the...
European Bat Lyssavirus Transmission among Cats, Europe
Dacheux, Laurent, Larrous, Florence, Mailles, Alexandra, Boisseleau, Didier, Delmas, Olivier, Biron, Charlotte, ...
We identified 2 cases of European bat lyssavirus subtype 1 transmission to domestic carnivores (cats) in France. Bat-to-cat transmission is suspected. Low amounts of virus antigen in cat brain made...