-
2009
Stefan Balev, Omar Gaci, Yoann Pigné.
Fourmis artificielles et bio-informatique (repliement de protéines, alignement multiple et séquençage par hybridation).
In
Nicolas Monmarché, Frédéric Guinand, Patrick Siarry, editors,
Fourmis artificielles 2, nouvelles directions pour une intelligence collective, Series IC2, Pages 269-297.
Hermes Sciences,
2009.
Bibtex
@incollection{Balev:2009vn,
type={2_chapter},
author={ Stefan Balev, Omar Gaci, Yoann Pigné},
booktitle={Fourmis artificielles 2, nouvelles directions pour une intelligence collective},
editor={Nicolas Monmarché, Frédéric Guinand, Patrick Siarry},
language={French},
pages={269-297},
publisher={Hermes Sciences},
series={IC2},
title={Fourmis artificielles et bio-informatique (repliement de protéines, alignement multiple et séquençage par hybridation)},
year={2009}
}
-
2009
Antoine Dutot, Frédéric Guinand, Yoann Pigné.
Principes généraux de résolution de problèmes combinatoires.
In
Nicolas Monmarché, Frédéric Guinand, Patrick Siarry, editors,
Fourmis artificielles 1, Des bases de l'optimisation aux applications industrielles, Series IC2, Pages 41-70.
Hermes Sciences,
2009.
Bibtex
@incollection{Dutot:2009uq,
author={ Antoine Dutot, Frédéric Guinand, Yoann Pigné},
title={Principes généraux de résolution de problèmes combinatoires},
booktitle={Fourmis artificielles 1, Des bases de l'optimisation aux applications industrielles},
editor={Nicolas Monmarché, Frédéric Guinand, Patrick Siarry},
publisher={Hermes Sciences},
year={2009},
pages={41-70},
language={Français},
series={IC2},
type={2_chapter}
}
-
2009
Antoine Dutot, Yoann Pigné.
Tour d'horizon des problèmes combinatoires traités par les fourmis artificielles.
In
Nicolas Monmarché, Frédéric Guinand, Patrick Siarry, editors,
Fourmis artificielles 1, Des bases de l'optimisation aux applications industrielles, Series IC2, Pages 71-100.
Hermes Sciences,
2009.
Bibtex
@incollection{Dutot:2009kx,
author={ Antoine Dutot, Yoann Pigné},
title={Tour d'horizon des problèmes combinatoires traités par les fourmis artificielles},
booktitle={Fourmis artificielles 1, Des bases de l'optimisation aux applications industrielles},
editor={Nicolas Monmarché, Frédéric Guinand, Patrick Siarry},
publisher={Hermes Sciences},
series={IC2},
year={2009},
pages={71-100},
language={Français},
type={2_chapter}
}
-
2006
Frédéric Guinand, Yoann Pigné.
Problem Solving and Complex Systems.
In
A. Alaoui and C. Bertelle, editors,
Emergent Properties in Natural and Artificial Dynamical Systems, Series Understanding Complex Systems, Pages 53-86.
Springer Verlag,
2006.
Abstrat
Bibtex
@incollection{Guinand:2006fk,
type={2_chapter},
abstract={The observation and modeling of natural Complex Systems ({CS}s) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models reusable to solve other problems. For instance, Genetic Algorithms or Ant Colony Optimizations are inspired from natural {CS}s to solve optimization problems. This paper proposes the use of ant-based systems to solve various problems with a non assessing approach. This means that solutions to some problem are not evaluated. They appear as resultant structures from the activity of the system. Problems are modeled with graphs and such structures are observed directly on these graphs. Problems of Multiple Sequences Alignment and Natural Language Processing are addressed with this approach.},
author={ Frédéric Guinand, Yoann Pigné},
booktitle={Emergent Properties in Natural and Artificial Dynamical Systems},
editor={A. Alaoui and C. Bertelle},
keywords={Bio-Complexity; Dynamical Systems; Emergent Structures; Nonlinear Dynamics; Springer Complexity; Synchronization; selected},
language={English},
pages={53-86},
publisher={Springer Verlag},
series={Understanding Complex Systems},
title={Problem Solving and Complex Systems},
year={2006}
}
The observation and modeling of natural Complex Systems ({CS}s) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models reusable to solve other problems. For instance, Genetic Algorithms or Ant Colony Optimizations are inspired from natural {CS}s to solve optimization problems. This paper proposes the use of ant-based systems to solve various problems with a non assessing approach. This means that solutions to some problem are not evaluated. They appear as resultant structures from the activity of the system. Problems are modeled with graphs and such structures are observed directly on these graphs. Problems of Multiple Sequences Alignment and Natural Language Processing are addressed with this approach.
-
2011
Yoann Pigné, Grégoire Danoy, Pascal Bouvry.
A Vehicular Mobility Model based on Real Traffic Counting Data.
In
Thomas Strang et al., editors,
Nets4Cars/Nets4Trains 2011, Volume 6596, Series Lecture Notes in Computer Science, Pages 131-142. DOI: 10.1007/978-3-642-19786-4_12. ISBN: 978-3-642-19785-7.
Springer,
2011.
Abstrat
Bibtex
@inproceedings{PIGNE:2011a,
author={ Yoann Pigné, Grégoire Danoy, Pascal Bouvry},
title={A Vehicular Mobility Model based on Real Traffic Counting Data},
booktitle={Nets4Cars/Nets4Trains 2011},
year={2011},
pages={131-142},
series={Lecture Notes in Computer Science},
volume={6596},
editor={Thomas Strang et al.},
publisher={Springer},
isbn={978-3-642-19785-7},
doi={10.1007/978-3-642-19786-4_12},
type={1_conference},
abstract={This paper proposes VehILux, a new vehicular mobility model based on real traffic counting data. It relies on two freely available sources of real information for the country of Luxembourg. The first source is traffic data collected by counting devices located on the Luxembourgian road network, while the second is geographical information about different types of areas: residential, industrial, commercial and other services. VehILux models vehicles commuting around the city of Luxembourg by considering two types of traffic, outer traffic with vehicles entering in the defined geographical area and inner traffic starting from residential zones located inside the geographical area. One part of the collected traffic data is used as input traffic, while another part is used to control the produced traffic and to fine-tune the model. VehILux is coupled with the microscopic road traffic simulator SUMO to produce realistic vehicular traces.},
url={N4C_Pigne_Danoy_Bouvry.pdf}
}
This paper proposes VehILux, a new vehicular mobility model based on real traffic counting data. It relies on two freely available sources of real information for the country of Luxembourg. The first source is traffic data collected by counting devices located on the Luxembourgian road network, while the second is geographical information about different types of areas: residential, industrial, commercial and other services. VehILux models vehicles commuting around the city of Luxembourg by considering two types of traffic, outer traffic with vehicles entering in the defined geographical area and inner traffic starting from residential zones located inside the geographical area. One part of the collected traffic data is used as input traffic, while another part is used to control the produced traffic and to fine-tune the model. VehILux is coupled with the microscopic road traffic simulator SUMO to produce realistic vehicular traces.
-
2011
Yoann Pigné, Grégoire Danoy, Pascal Bouvry.
Sensivity Analysis for a Realistic Vehicular Mobility Model.
In
Proceedings of the First ACM International Symposium on Design and Analysis of Intelligent Vehicular Networks and Applications, Pages 31-38. ISBN: 978-1-4503-0904-2.
ACM,
Miami, USA,
2011.
Abstrat
Bibtex
@inproceedings{pigne2011b,
abstract={This paper proposed to conduct a sensitivity analysis on a vehicular mobility model, VehILux, to quantitatively study the influence and interdependencies of its parameters on the output, \emph{i.e.} its accuracy compared to real traffic data. Using two state-of-the-art SA approaches, Morris and FAST99, key characteristics inherent to the impact of the parameters on the model's output could be observed. This analysis first helped in identifying wrong parameter ranges. Then fixed values could be set for parameters that revealed to have no or few effect on the output. Finally, the unexpected importance of some parameters could additionally be observed. As a conclusion, performing a sensitivity analysis on such a parameter-based mobility model is a crucial step when willing to understand and optimize it. Future works will consider the optimization of VehILux based on its identified influential set of parameters and their respective values range. },
address={Miami, USA},
author={ Yoann Pigné, Grégoire Danoy, Pascal Bouvry},
booktitle={Proceedings of the First ACM International Symposium on Design and Analysis of Intelligent Vehicular Networks and Applications},
date-added={2011-11-09 23:31:28 +0100},
date-modified={2011-11-09 23:42:27 +0100},
month={November},
pages={31-38},
publisher={ACM},
isbn={978-1-4503-0904-2},
type={1_conference},
title={Sensivity Analysis for a Realistic Vehicular Mobility Model},
year={2011},
url={divan05a-pigne.pdf}
}
This paper proposed to conduct a sensitivity analysis on a vehicular mobility model, VehILux, to quantitatively study the influence and interdependencies of its parameters on the output, \emph{i.e.} its accuracy compared to real traffic data. Using two state-of-the-art SA approaches, Morris and FAST99, key characteristics inherent to the impact of the parameters on the model's output could be observed. This analysis first helped in identifying wrong parameter ranges. Then fixed values could be set for parameters that revealed to have no or few effect on the output. Finally, the unexpected importance of some parameters could additionally be observed. As a conclusion, performing a sensitivity analysis on such a parameter-based mobility model is a crucial step when willing to understand and optimize it. Future works will consider the optimization of VehILux based on its identified influential set of parameters and their respective values range.
-
2010
Yoann Pigné, Frédéric Guinand.
Short and Robust Communication Paths in Dynamic Wireless Networks.
In
Dorigo, Marco and et al., editors,
Swarm Intelligence, Volume 6234, Series Lecture Notes in Computer Science, Pages 520-527. ISBN: 978-3-642-15460-7.
Springer Berlin / Heidelberg,
2010.
Abstrat
Bibtex
@incollection{Pigne:2010fk,
author={ Yoann Pigné, Frédéric Guinand},
title={Short and Robust Communication Paths in Dynamic Wireless Networks},
booktitle={Swarm Intelligence},
series={Lecture Notes in Computer Science},
volume={6234},
editor={Dorigo, Marco and et al.},
publisher={Springer Berlin / Heidelberg},
pages={520-527},
isbn={978-3-642-15460-7},
url={ANTS2010_Pigne.pdf},
type={1_conference},
abstract={We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when trying to minimize both the length of the constructed paths and the number link reconnections. We propose two centralized algorithms that help analyse the problem from a dynamic graph point of view. These algorithms give lower bounds for our proposed decentralized ant-based algorithm that constructs and maintains such paths in a MANET.},
year={2010}
}
We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when trying to minimize both the length of the constructed paths and the number link reconnections. We propose two centralized algorithms that help analyse the problem from a dynamic graph point of view. These algorithms give lower bounds for our proposed decentralized ant-based algorithm that constructs and maintains such paths in a MANET.
-
2010
Yoann Pigné, Arnaud Casteigts, Frédéric Guinand, Serge Chaumette.
Construction et maintien d'une forêt couvrante dans un réseau dynamique.
In
Maria Gradinariu Potop-Butucaru et Hervé Rivano, editors,
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Pages 67-70.
Belle Dune, France,
2010.
Abstrat
Bibtex
@inproceedings{Pigne:2010zr,
author={ Yoann Pigné, Arnaud Casteigts, Frédéric Guinand, Serge Chaumette},
title={Construction et maintien d'une forêt couvrante dans un réseau dynamique},
address={Belle Dune, France},
booktitle={12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
editor={Maria Gradinariu Potop-Butucaru et Hervé Rivano},
pages={67-70},
year={2010},
url={http://hal.archives-ouvertes.fr/inria-00477755/PDF/algotel-2010.pdf},
url={http://hal.archives-ouvertes.fr/inria-00477755/PDF/algotel-2010.pdf},
type={1_conference},
abstract={Dans ce travail nous présentons le principe d’un algorithme de construction et de maintien d’une forêt couvrante dans un réseau de télécommunication mobile de type réseau mobile ad hoc (MANET). L’algorithme, basé sur une marche aléatoire de jetons, est entie`rement décentralisé. Nous en proposons une analyse probabiliste dans le cadre statique et nous montrons comment l’ajout d’une mémoire aux jetons permet d’en améliorer sensiblement les performances.}
}
Dans ce travail nous présentons le principe d’un algorithme de construction et de maintien d’une forêt couvrante dans un réseau de télécommunication mobile de type réseau mobile ad hoc (MANET). L’algorithme, basé sur une marche aléatoire de jetons, est entie`rement décentralisé. Nous en proposons une analyse probabiliste dans le cadre statique et nous montrons comment l’ajout d’une mémoire aux jetons permet d’en améliorer sensiblement les performances.
-
2010
Yoann Pigné, Grégoire Danoy, Pascal Bouvry.
A Platform for Realistic Online Vehicular Network Management.
In
IEEE International Workshop on Management of Emerging Networks and Services, Pages 615-619. DOI: 10.1109/GLOCOMW.2010.5700389. ISBN: 978-1-4244-8863-6.
IEEE Computer Society,
2010.
Abstrat
Bibtex
@inproceedings{Pigne:2010kl,
author={ Yoann Pigné, Grégoire Danoy, Pascal Bouvry},
title={A Platform for Realistic Online Vehicular Network Management},
booktitle={IEEE International Workshop on Management of Emerging Networks and Services},
publisher={IEEE Computer Society},
pages={615-619},
year={2010},
url={MENS2010_Pigne.pdf},
isbn={978-1-4244-8863-6},
doi={10.1109/GLOCOMW.2010.5700389},
type={1_conference},
abstract={This paper introduces a platform for realistic and computationally efficient online vehicular networks simulation. It permits decentralized traffic management applications simulation as nodes mobility is modifiable at runtime thanks to the integration of two state-of-the-art network and traffic simulators. The platform embeds a tool that generates vehicular traces based on traffic counting data and ensures performance through a geographical decomposition of the network. Evidence of its performance is given on a Luxembougian traffic management scenario, using real road network and traffic data.}
}
This paper introduces a platform for realistic and computationally efficient online vehicular networks simulation. It permits decentralized traffic management applications simulation as nodes mobility is modifiable at runtime thanks to the integration of two state-of-the-art network and traffic simulators. The platform embeds a tool that generates vehicular traces based on traffic counting data and ensures performance through a geographical decomposition of the network. Evidence of its performance is given on a Luxembougian traffic management scenario, using real road network and traffic data.
-
2009
Cédric Aboue-Nze, Frédéric Guinand, Yoann Pigné.
Impact of Obstacles on the Degree of Mobile Ad Hoc Connection Graphs.
In
ICNS 09: Proceedings of the 2009 Fifth International Conference on Networking and Services International Conference on Networking and Services, Pages 332-337. DOI: 10.1109/ICNS.2009.36. ISBN: 978-1-4244-3688-0.
IEEE Computer Society,
Valence, Spain,
2009.
Abstrat
Bibtex
@inproceedings{Aboue-Nze:2009ve,
author={ Cédric Aboue-Nze, Frédéric Guinand, Yoann Pigné},
title={Impact of Obstacles on the Degree of Mobile Ad Hoc Connection Graphs},
year={2009},
booktitle={ICNS 09: Proceedings of the 2009 Fifth International Conference on Networking and Services International Conference on Networking and Services},
publisher={IEEE Computer Society},
doi={10.1109/ICNS.2009.36},
keywords={Mobile Ad Hoc Networks; MANET, Delay-Tolerant Mobile Ad Hoc Networks; DT-MANET; Random Waypoint Mobility Model; RWP; Obstacle; Probabilistic Analysis; Spatial Node Distribution; selected},
language={English},
pages={332-337},
isbn={978-1-4244-3688-0},
type={1_conference},
abstract={What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is to define both an environment with obstacles and a mobility model for the stations in such an environment. The present paper focuses on a new way of considering the mobility within environments with obstacles, while keeping the core ideas of the well-known Random WayPoint mobility model (a.k.a RWP). Based on a mesh-partitioning of the space, we propose a new model called RSP-O-G for which we compute the spatial distribution of stations and analyse how the presence of obstacles impacts this distribution compared to the distribution when no obstacles are present. Coupled with a simple model of radio propagation, and according to the density of stations in the environment, we study the mean degree of the connection graphs corresponding to such mobile ad hoc networks.},
address={Valence, Spain}
}
What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is to define both an environment with obstacles and a mobility model for the stations in such an environment. The present paper focuses on a new way of considering the mobility within environments with obstacles, while keeping the core ideas of the well-known Random WayPoint mobility model (a.k.a RWP). Based on a mesh-partitioning of the space, we propose a new model called RSP-O-G for which we compute the spatial distribution of stations and analyse how the presence of obstacles impacts this distribution compared to the distribution when no obstacles are present. Coupled with a simple model of radio propagation, and according to the density of stations in the environment, we study the mean degree of the connection graphs corresponding to such mobile ad hoc networks.
-
2008
Frédéric Guinand, Yoann Pigné.
An Ant-Based Model for Multiple Sequence Alignment.
In
Lirkov, Ivan and Margenov, Svetozar and Wasniewski, Jerzy, editors,
Large-Scale Scientific Computing Large-Scale Scientific Computing, 6th International Conference, {LSSC} 2007, Volume 4818/2008, Series Lecture Notes in Computer Science, Pages 553-560. DOI: 10.1007/978-3-540-78827-0_63.
Springer Verlag,
Sozopol Bulgaria,
2008.
Abstrat
Bibtex
@inproceedings{Guinand:2008qf,
type={1_conference},
abstract={Multiple sequence alignment is a key process in today's biology, and finding a relevant alignment of several sequences is much more challenging than just optimizing some improbable evaluation functions. Our approach for addressing multiple sequence alignment focuses on the building of structures in a new graph model: the factor graph model. This model relies on block-based formulation of the original problem, formulation that seems to be one of the most suitable ways for capturing evolutionary aspects of alignment. The structures are implicitly built by a colony of ants laying down pheromones in the factor graphs, according to relations between blocks belonging to the different sequences.},
address={Sozopol Bulgaria},
audience={international},
author={ Frédéric Guinand, Yoann Pigné},
booktitle={Large-Scale Scientific Computing Large-Scale Scientific Computing, 6th International Conference, {LSSC} 2007},
doi={10.1007/978-3-540-78827-0_63},
editor={Lirkov, Ivan and Margenov, Svetozar and Wasniewski, Jerzy},
keywords={selected},
language={English},
month={03},
pages={553-560},
publisher={Springer Verlag},
series={Lecture Notes in Computer Science},
title={An Ant-Based Model for Multiple Sequence Alignment},
volume={4818/2008},
year={2008},
url={http://dx.doi.org/10.1007/978-3-540-78827-0_63}
}
Multiple sequence alignment is a key process in today's biology, and finding a relevant alignment of several sequences is much more challenging than just optimizing some improbable evaluation functions. Our approach for addressing multiple sequence alignment focuses on the building of structures in a new graph model: the factor graph model. This model relies on block-based formulation of the original problem, formulation that seems to be one of the most suitable ways for capturing evolutionary aspects of alignment. The structures are implicitly built by a colony of ants laying down pheromones in the factor graphs, according to relations between blocks belonging to the different sequences.
-
2007
Antoine Dutot, Frédéric Guinand, Damien Olivier, Yoann Pigné.
GraphStream: A Tool for bridging the gap between Complex Systems and Dynamic Graphs.
In
Emergent Properties in Natural and Artificial Complex Systems. Satellite Conference within the 4th European Conference on Complex Systems ({ECCS}'2007).
Dresden Germany,
2007.
Abstrat
Bibtex
@inproceedings{Dutot:2007bh,
type={1_conference},
abstract={The notion of complex systems is common to many domains, from Biology to Economy, Computer Science, Physics, etc. Often, these systems are made of sets of entities moving in an evolving environment. One of their major characteristics is the emergence of some global properties stemmed from local interactions between the entities themselves and between the entities and the environment. The structure of these systems as sets of interacting entities leads researchers to model them as graphs. However, their understanding requires most often to consider the dynamics of their evolution. It is indeed not relevant to study some properties out of any temporal consideration. Thus, dynamic graphs seem to be a very suitable model for investigating the emergence and the conservation of some properties. GraphStream is a Java-based library whose main purpose is to help researchers and developers in their daily tasks of dynamic problem modeling and of classical graph management tasks: creation, processing, display, etc. It may also be used, and is indeed already used, for teaching purpose. GraphStream relies on an event-based engine allowing several event sources. Events may be included in the core of the application, read from a file or received from an event handler.},
address={Dresden Germany},
arxivid={0803.2093},
author={ Antoine Dutot, Frédéric Guinand, Damien Olivier, Yoann Pigné},
booktitle={Emergent Properties in Natural and Artificial Complex Systems. Satellite Conference within the 4th European Conference on Complex Systems ({ECCS}'2007)},
language={English},
month={10},
title={GraphStream: A Tool for bridging the gap between Complex Systems and Dynamic Graphs},
url={http://hal.archives-ouvertes.fr/hal-00264043/PDF/GraphStream.pdf},
year={2007}
}
The notion of complex systems is common to many domains, from Biology to Economy, Computer Science, Physics, etc. Often, these systems are made of sets of entities moving in an evolving environment. One of their major characteristics is the emergence of some global properties stemmed from local interactions between the entities themselves and between the entities and the environment. The structure of these systems as sets of interacting entities leads researchers to model them as graphs. However, their understanding requires most often to consider the dynamics of their evolution. It is indeed not relevant to study some properties out of any temporal consideration. Thus, dynamic graphs seem to be a very suitable model for investigating the emergence and the conservation of some properties. GraphStream is a Java-based library whose main purpose is to help researchers and developers in their daily tasks of dynamic problem modeling and of classical graph management tasks: creation, processing, display, etc. It may also be used, and is indeed already used, for teaching purpose. GraphStream relies on an event-based engine allowing several event sources. Events may be included in the core of the application, read from a file or received from an event handler.