2020
|
 | Nicolas Ballier
Jean-Baptiste Yunès RELIA, un projet interdisciplinaire d'initiation à la recherche par le TAL Inproceedings Forthcoming JEP - TALN - RECITAL Forthcoming. Links | BibTeX @inproceedings{Yunès2020,
title = {RELIA, un projet interdisciplinaire d'initiation à la recherche par le TAL},
author = {Nicolas Ballier
Jean-Baptiste Yunès},
url = {https://jep-taln2020.loria.fr
http://yunes.informatique.univ-paris-diderot.fr/accueil/enseignement/ireel-relia
},
year = {2020},
date = {2020-06-08},
organization = {JEP - TALN - RECITAL},
howpublished = {online due to COVID pandemic},
keywords = {},
pubstate = {forthcoming},
tppubtype = {inproceedings}
}
|
 | Maria Zimina, Nicolas Ballier, Jean-Baptiste Yunès Approche textométrique des phases d'entraînement en traduction automatique neuronale (TAN) : étude de cas avec Europarl et OpenNMT Miscellaneous Forthcoming Accepted, Forthcoming. Links | BibTeX @misc{jadt2020,
title = {Approche textométrique des phases d'entraînement en traduction automatique neuronale (TAN) : étude de cas avec Europarl et OpenNMT},
author = {Maria Zimina and Nicolas Ballier and Jean-Baptiste Yunès},
url = {https://jadt2020.sciencesconf.org/},
year = {2020},
date = {2020-01-01},
booktitle = {JADT 2020 15èmes Journées Internationales d'Analyse statistique des Données Textuelles, Toulouse, France, Jun. 16-19.},
school = {JADT 2020 15èmes Journées Internationales d'Analyse statistique des Données Textuelles, Toulouse, France, Jun. 16-19.},
howpublished = {Accepted},
keywords = {},
pubstate = {forthcoming},
tppubtype = {misc}
}
|
 | Nicolas Ballier, Nabil Amari, Laure Mérat, Jean-Baptiste Yunès The learnability of the annotated input in NMT (Replicating Vanmassenhove et al. 2018 with OpenNMT) Miscellaneous Forthcoming Accepted, Forthcoming. Abstract | Links | BibTeX @misc{reprolang2020,
title = {The learnability of the annotated input in NMT (Replicating Vanmassenhove et al. 2018 with OpenNMT)},
author = {Nicolas Ballier and Nabil Amari and Laure Mérat and Jean-Baptiste Yunès},
url = {https://www.clarin.eu/event/2020/reprolang-2020},
year = {2020},
date = {2020-01-01},
school = {REPROLANG 2020 — LREC 2020, Marseille, France, May 13-15},
abstract = {In this paper, we reproduce some of the experiments related to neural network training for Machine Translation as reported in (Vanmassenhove and Way, 2018). They annotated a sample from the EN-FR and EN-DE Europarl aligned corpora with syntactic and semantic annotations to train neural networks with the Nematus Neural Machine Translation (NMT) toolkit. Following the original publication, we obtained lower BLEU scores than the authors of the original paper, but on a more limited set of annotations. In the second half of the paper, we try to analyze the difference in the results obtained and suggest some methods to improve the results. We discuss the Byte Pair Encoding (BPE) used in the pre-processing phase and suggest feature ablation in relation to the granularity of syntactic and semantic annotations. The learnability of the annotated input is discussed in relation to existing resources for the target languages. We also discuss the feature representation likely to have been adopted for combining features.},
howpublished = {Accepted},
keywords = {},
pubstate = {forthcoming},
tppubtype = {misc}
}
In this paper, we reproduce some of the experiments related to neural network training for Machine Translation as reported in (Vanmassenhove and Way, 2018). They annotated a sample from the EN-FR and EN-DE Europarl aligned corpora with syntactic and semantic annotations to train neural networks with the Nematus Neural Machine Translation (NMT) toolkit. Following the original publication, we obtained lower BLEU scores than the authors of the original paper, but on a more limited set of annotations. In the second half of the paper, we try to analyze the difference in the results obtained and suggest some methods to improve the results. We discuss the Byte Pair Encoding (BPE) used in the pre-processing phase and suggest feature ablation in relation to the granularity of syntactic and semantic annotations. The learnability of the annotated input is discussed in relation to existing resources for the target languages. We also discuss the feature representation likely to have been adopted for combining features. |
2018
|
 | Luidnel Maignan, Jean-Baptiste Yunès Generalized FSSP on Two Triangular Tilings Inproceedings 2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW), Hida Takayama, Japan, November 27-30, 2018, pp. 27–31, IEEE 2018. Abstract | Links | BibTeX @inproceedings{maignan2018generalized,
title = {Generalized FSSP on Two Triangular Tilings},
author = {Luidnel Maignan and Jean-Baptiste Yunès},
url = {https://ieeexplore.ieee.org/document/8590867
https://is-candar.org/candar18/},
doi = {10.1109/CANDARW.2018.00013},
year = {2018},
date = {2018-11-27},
booktitle = {2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW), Hida Takayama, Japan, November 27-30, 2018},
pages = {27--31},
organization = {IEEE},
abstract = {Maignan and Yunes have already investigated solutions to the generalized firing squad synchronization problem for square tilings with both Moore and Von Neumann neighborhoods, and then shown that the same concepts could be used to handle hexagonal tilings. The communication grids for these cellular space are all very regular in a precise formal sense: they are Cayley graphs. In this paper we investigate the triangular tiling because it is very related to the hexagonal one but is not a Cayley graph. We also consider another tiling of triangles obtained by dividing every square of a square tiling into four triangles. We show that the same concepts still apply, therefore showing that the previous solutions can be extended to a broader class of spaces included in what we may call Cayley Graphs on Groupoïd.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Maignan and Yunes have already investigated solutions to the generalized firing squad synchronization problem for square tilings with both Moore and Von Neumann neighborhoods, and then shown that the same concepts could be used to handle hexagonal tilings. The communication grids for these cellular space are all very regular in a precise formal sense: they are Cayley graphs. In this paper we investigate the triangular tiling because it is very related to the hexagonal one but is not a Cayley graph. We also consider another tiling of triangles obtained by dividing every square of a square tiling into four triangles. We show that the same concepts still apply, therefore showing that the previous solutions can be extended to a broader class of spaces included in what we may call Cayley Graphs on Groupoïd. |
 | Yoann Marquer, Luidnel Maignan, Jean-Baptiste Yunès Proving Formally a Field-Based FSSP Solution Technical Report 2018. Abstract | Links | BibTeX @techreport{marquer2018proving,
title = {Proving Formally a Field-Based FSSP Solution},
author = {Yoann Marquer and Luidnel Maignan and Jean-Baptiste Yunès},
url = {https://hal.archives-ouvertes.fr/hal-01739317},
year = {2018},
date = {2018-09-11},
abstract = {In the research domain of cellular automata algorithmics, the firing squad synchronization problem is a famous problem that has been solved in many ways. However, very few of these solutions have a detailed formal proof suitable for proof assistant and for human understanding. The reason is that the correctness of those solutions is more easily seen from a high level point of view and from the way the solution has been constructed than from the actual formal description of the constructed solution. The field-based approach consists in giving a formal description of a new high-level and modular description and the reduction process down to the final low-level solution. The decomposition in modules are natural from a design point of view and is a precise counterpart of the previous informal high-level description. This research report aims to present an understandable proof of correctness of the high-level field-based solution suitable for an implementation in Coq.},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
In the research domain of cellular automata algorithmics, the firing squad synchronization problem is a famous problem that has been solved in many ways. However, very few of these solutions have a detailed formal proof suitable for proof assistant and for human understanding. The reason is that the correctness of those solutions is more easily seen from a high level point of view and from the way the solution has been constructed than from the actual formal description of the constructed solution. The field-based approach consists in giving a formal description of a new high-level and modular description and the reduction process down to the final low-level solution. The decomposition in modules are natural from a design point of view and is a precise counterpart of the previous informal high-level description. This research report aims to present an understandable proof of correctness of the high-level field-based solution suitable for an implementation in Coq. |
2016
|
| Luidnel Maignan, Jean-Baptiste Yunès Synchronizing the squad with (almost) arbitrary cut ratio Inproceedings 2016 Fourth International Symposium on Computing and Networking (CANDAR), Hiroshima, Japan, November 22-25, 2016, pp. 229–235, IEEE 2016. Abstract | Links | BibTeX @inproceedings{maignan2016synchronizing,
title = {Synchronizing the squad with (almost) arbitrary cut ratio},
author = {Luidnel Maignan and Jean-Baptiste Yunès},
url = {http://is-candar.org/afca16
},
doi = {10.1109/CANDAR.2016.0048},
year = {2016},
date = {2016-11-22},
booktitle = {2016 Fourth International Symposium on Computing and Networking (CANDAR), Hiroshima, Japan, November 22-25, 2016},
pages = {229--235},
organization = {IEEE},
abstract = {In this paper, we design a solution to the generalized firing squad problem where the splittings can be chosen to happen at any ratio greater than two thirds. This is in the same spirit as the (non-generalized) solutions of Mazoyer except that we do not use signal speeds but the concept of fields to achieve this goal. Signals and speeds do appear visually as an effect of the spatio-temporal structure of the cellular automaton. However, not being setup by design allows the solution to automatically extends to more generalized settings. Moreover, the conceptual design of the solution is separated from the state space optimization that is only handle afterward. The finiteness of state space is also sketched.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we design a solution to the generalized firing squad problem where the splittings can be chosen to happen at any ratio greater than two thirds. This is in the same spirit as the (non-generalized) solutions of Mazoyer except that we do not use signal speeds but the concept of fields to achieve this goal. Signals and speeds do appear visually as an effect of the spatio-temporal structure of the cellular automaton. However, not being setup by design allows the solution to automatically extends to more generalized settings. Moreover, the conceptual design of the solution is separated from the state space optimization that is only handle afterward. The finiteness of state space is also sketched. |
 | Luidnel Maignan, Jean-Baptiste Yunès A field based solution of Mazoyer’s FSSP schema Inproceedings Samira El Yacoubi, Jaroslaw Wąs, Stefania Bandini (Ed.): International Conference on Cellular Automata, ACRI 2016. Fez, Morocco, September 5-8, 2016, pp. 134–143, Springer, Cham 2016, ISBN: 978-3-319-44365-2. Abstract | Links | BibTeX @inproceedings{maignan2016field,
title = {A field based solution of Mazoyer’s FSSP schema},
author = {Luidnel Maignan and Jean-Baptiste Yunès},
editor = {Samira El Yacoubi and Jaroslaw Wąs and Stefania Bandini},
doi = {10.1007/978-3-319-44365-2_13},
isbn = {978-3-319-44365-2},
year = {2016},
date = {2016-09-05},
booktitle = {International Conference on Cellular Automata, ACRI 2016. Fez, Morocco, September 5-8, 2016},
pages = {134--143},
organization = {Springer, Cham},
abstract = {Continuing our line of work on field based cellular automata programming we, here, focus our attention on an implementation of Mazoyer’s schema for cellular synchronization problem. Due to its very special nature among the numerous solutions to the problem, we emphasize the power of cellular fields to construct cellular programs: clear semantic construction, modularity, automatic synthesis of finite state machines.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Continuing our line of work on field based cellular automata programming we, here, focus our attention on an implementation of Mazoyer’s schema for cellular synchronization problem. Due to its very special nature among the numerous solutions to the problem, we emphasize the power of cellular fields to construct cellular programs: clear semantic construction, modularity, automatic synthesis of finite state machines. |
 | Daniel Racoceanu, David Ameisen, A Veillard, Ben B Cheikh, E Attieh, P Brezillon, Jean-Baptiste Yunès, J-M Temerson, L Toubiana, V Verger, others Towards efficient collaborative digital pathology: a pioneer initiative of the FlexMIm project Journal Article Diagnostic Pathology, 1 (8), 2016, ISSN: 2364-4893. Links | BibTeX @article{racoceanu2016towards,
title = {Towards efficient collaborative digital pathology: a pioneer initiative of the FlexMIm project},
author = {Daniel Racoceanu and David Ameisen and A Veillard and Ben B Cheikh and E Attieh and P Brezillon and Jean-Baptiste Yunès and J-M Temerson and L Toubiana and V Verger and others},
doi = {10.17629/www.diagnosticpathology.eu-2016-8:199},
issn = {2364-4893},
year = {2016},
date = {2016-06-08},
journal = {Diagnostic Pathology},
volume = {1},
number = {8},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
 | Roberto Mantaci, Paolo Massazza, Jean-Baptiste Yunès An efficient algorithm for generating symmetric ice piles Journal Article Theoretical Computer Science, 629 , pp. 96–115, 2016. Links | BibTeX @article{mantaci2016efficient,
title = {An efficient algorithm for generating symmetric ice piles},
author = {Roberto Mantaci and Paolo Massazza and Jean-Baptiste Yunès},
doi = {10.1016/j.tcs.2015.10.024},
year = {2016},
date = {2016-05-16},
journal = {Theoretical Computer Science},
volume = {629},
pages = {96--115},
publisher = {Elsevier},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
|
 | Luidnel Maignan, Jean-Baptiste Yunès Finitization of Infinite Field-based Multi-general FSSP Solution. Journal Article Journal of Cellular Automata, 12 , 2016, ISSN: 1557-5997. Abstract | Links | BibTeX @article{maignan2016finitization,
title = {Finitization of Infinite Field-based Multi-general FSSP Solution.},
author = {Luidnel Maignan and Jean-Baptiste Yunès},
url = {https://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-12-number-1-2-2016/jca-12-1-2-p-121-139/},
issn = {1557-5997},
year = {2016},
date = {2016-01-01},
journal = {Journal of Cellular Automata},
volume = {12},
abstract = {In a previous work we presented a general schema to solve the 1D Generalized Firing Squad Synchronization Problem. We used a semantic approach and designed it in a modular way using the concept of fields (open CA). The proposed solution is not directly a finite cellular automaton because it needs unbounded integers in distance fields, and an unbounded stack of fields due to the recursive nature of the algorithm. In this paper, we extend the solution to tackle the multi-general problem and show that this approach does effectively leads to a finite cellular automaton. For this, we exhibit a projection function from infinite to finite states and write a program that generates the associated finite transition table. We finally sketch some theoretical arguments for the validity of the construction.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In a previous work we presented a general schema to solve the 1D Generalized Firing Squad Synchronization Problem. We used a semantic approach and designed it in a modular way using the concept of fields (open CA). The proposed solution is not directly a finite cellular automaton because it needs unbounded integers in distance fields, and an unbounded stack of fields due to the recursive nature of the algorithm. In this paper, we extend the solution to tackle the multi-general problem and show that this approach does effectively leads to a finite cellular automaton. For this, we exhibit a projection function from infinite to finite states and write a program that generates the associated finite transition table. We finally sketch some theoretical arguments for the validity of the construction. |
2014
|
| David Ameisen, Christophe Deroulers, Valérie Perrier, Fatiha Bouhidel, Maxime Battistella, Luc Legrès, Anne Janin, Philippe Bertheau, Jean-Baptiste Yunès Towards better digital pathology workflows: programming libraries for high-speed sharpness assessment of Whole Slide Images Journal Article The Diagnostic Digital Pathology, 9 (1), pp. S3, 2014. Abstract | Links | BibTeX @article{ameisen2014towards,
title = {Towards better digital pathology workflows: programming libraries for high-speed sharpness assessment of Whole Slide Images},
author = {David Ameisen and Christophe Deroulers and Valérie Perrier and Fatiha Bouhidel and Maxime Battistella and Luc Legrès and Anne Janin and Philippe Bertheau and Jean-Baptiste Yunès},
doi = {10.1186/1746-1596-9-S1-S3},
year = {2014},
date = {2014-12-19},
booktitle = {Diagnostic pathology},
journal = {The Diagnostic Digital Pathology},
volume = {9},
number = {1},
pages = {S3},
organization = {BioMed Central},
abstract = {BACKGROUND:
Since microscopic slides can now be automatically digitized and integrated in the clinical workflow, quality assessment of Whole Slide Images (WSI) has become a crucial issue. We present a no-reference quality assessment method that has been thoroughly tested since 2010 and is under implementation in multiple sites, both public university-hospitals and private entities. It is part of the FlexMIm R&D project which aims to improve the global workflow of digital pathology. For these uses, we have developed two programming libraries, in Java and Python, which can be integrated in various types of WSI acquisition systems, viewers and image analysis tools.
METHODS:
Development and testing have been carried out on a MacBook Pro i7 and on a bi-Xeon 2.7GHz server. Libraries implementing the blur assessment method have been developed in Java, Python, PHP5 and MySQL5. For web applications, JavaScript, Ajax, JSON and Sockets were also used, as well as the Google Maps API. Aperio SVS files were converted into the Google Maps format using VIPS and Openslide libraries.
RESULTS:
We designed the Java library as a Service Provider Interface (SPI), extendable by third parties. Analysis is computed in real-time (3 billion pixels per minute). Tests were made on 5000 single images, 200 NDPI WSI, 100 Aperio SVS WSI converted to the Google Maps format.
CONCLUSIONS:
Applications based on our method and libraries can be used upstream, as calibration and quality control tool for the WSI acquisition systems, or as tools to reacquire tiles while the WSI is being scanned. They can also be used downstream to reacquire the complete slides that are below the quality threshold for surgical pathology analysis. WSI may also be displayed in a smarter way by sending and displaying the regions of highest quality before other regions. Such quality assessment scores could be integrated as WSI's metadata shared in clinical, research or teaching contexts, for a more efficient medical informatics workflow.},
howpublished = {Selected articles from the 12th European Congress on Digital Pathology.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
BACKGROUND:
Since microscopic slides can now be automatically digitized and integrated in the clinical workflow, quality assessment of Whole Slide Images (WSI) has become a crucial issue. We present a no-reference quality assessment method that has been thoroughly tested since 2010 and is under implementation in multiple sites, both public university-hospitals and private entities. It is part of the FlexMIm R&D project which aims to improve the global workflow of digital pathology. For these uses, we have developed two programming libraries, in Java and Python, which can be integrated in various types of WSI acquisition systems, viewers and image analysis tools.
METHODS:
Development and testing have been carried out on a MacBook Pro i7 and on a bi-Xeon 2.7GHz server. Libraries implementing the blur assessment method have been developed in Java, Python, PHP5 and MySQL5. For web applications, JavaScript, Ajax, JSON and Sockets were also used, as well as the Google Maps API. Aperio SVS files were converted into the Google Maps format using VIPS and Openslide libraries.
RESULTS:
We designed the Java library as a Service Provider Interface (SPI), extendable by third parties. Analysis is computed in real-time (3 billion pixels per minute). Tests were made on 5000 single images, 200 NDPI WSI, 100 Aperio SVS WSI converted to the Google Maps format.
CONCLUSIONS:
Applications based on our method and libraries can be used upstream, as calibration and quality control tool for the WSI acquisition systems, or as tools to reacquire tiles while the WSI is being scanned. They can also be used downstream to reacquire the complete slides that are below the quality threshold for surgical pathology analysis. WSI may also be displayed in a smarter way by sending and displaying the regions of highest quality before other regions. Such quality assessment scores could be integrated as WSI's metadata shared in clinical, research or teaching contexts, for a more efficient medical informatics workflow. |
 | Enrico Formenti, Katsunobu Imai, Bruno Martin, Jean-Baptiste Yunès Advances on random sequence generation by uniform cellular automata Incollection C. Calude C., R. Freivalds R., I. Kazuo (Ed.): Computing with New Resources. Lecture Notes in Computer Science., 8808 , pp. 56–70, Springer, Cham, 2014, ISBN: 978-3-319-13350-8. Abstract | Links | BibTeX @incollection{formenti2014advances,
title = {Advances on random sequence generation by uniform cellular automata},
author = {Enrico Formenti and Katsunobu Imai and Bruno Martin and Jean-Baptiste Yunès},
editor = {C. Calude C. and R. Freivalds R. and I. Kazuo},
doi = {10.1007/978-3-319-13350-8_5},
isbn = {978-3-319-13350-8},
year = {2014},
date = {2014-12-10},
booktitle = {Computing with New Resources. Lecture Notes in Computer Science.},
volume = {8808},
pages = {56--70},
publisher = {Springer, Cham},
abstract = {The study of cellular automata rules suitable for cryptographic applications is under consideration. On one hand, cellular automata can be used to generate pseudo-random sequences as well as for the design of S-boxes in symmetric cryptography. On the other hand, Boolean functions with good properties like resiliency and non-linearity are usually obtained either by exhaustive search or by the use of genetic algorithms. We propose here to use some recent research in the classification of Boolean functions and to link it with the study of cellular automata rules. As a consequence of our technique, this also provides a mean to get Boolean functions with good cryptographic properties.},
keywords = {},
pubstate = {published},
tppubtype = {incollection}
}
The study of cellular automata rules suitable for cryptographic applications is under consideration. On one hand, cellular automata can be used to generate pseudo-random sequences as well as for the design of S-boxes in symmetric cryptography. On the other hand, Boolean functions with good properties like resiliency and non-linearity are usually obtained either by exhaustive search or by the use of genetic algorithms. We propose here to use some recent research in the classification of Boolean functions and to link it with the study of cellular automata rules. As a consequence of our technique, this also provides a mean to get Boolean functions with good cryptographic properties. |
 | Roberto Mantaci, Paolo Massazza, Jean-Baptiste Yunès An Efficient Algorithm for Generating Symmetric Ice Piles Inproceedings Stefano Bistarelli, Andrea Formisano (Ed.): 15th Italian Conference on Theoretical Computer Science, Perugia, Italy, September 17-19, 2014, pp. 15–170, 2014, ISSN: 1613-0073. Links | BibTeX @inproceedings{ictcs2014,
title = {An Efficient Algorithm for Generating Symmetric Ice Piles},
author = {Roberto Mantaci and Paolo Massazza and Jean-Baptiste Yunès},
editor = {Stefano Bistarelli and Andrea Formisano},
url = {http://www.dmi.unipg.it/ictcs2014/},
issn = {1613-0073},
year = {2014},
date = {2014-09-17},
booktitle = {15th Italian Conference on Theoretical Computer Science, Perugia, Italy, September 17-19, 2014},
pages = {15--170},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
 | Jean-Marie Rifflet, Jean-Baptiste Yunès Fondements de la Programmation Concepts et Techniques Book Ellipses, 2014, ISBN: 9782340000148. Abstract | Links | BibTeX @book{rifflet2014fondements,
title = {Fondements de la Programmation Concepts et Techniques},
author = {Jean-Marie Rifflet and Jean-Baptiste Yunès},
url = {https://www.editions-ellipses.fr/accueil/8629-fondements-de-la-programmation-concepts-et-techniques-9782340000148.html#description-scroll-tricks},
isbn = {9782340000148},
year = {2014},
date = {2014-08-26},
publisher = {Ellipses},
abstract = {Cet ouvrage, à l’usage de tout informaticien, du programmeur à l’ingénieur, a pour but de fixer plus profondément un certain nombre de concepts de programmation. Ce livre n’est pas un manuel de programmation au sens traditionnel. On n’y trouvera pas l’habituelle litanie des arcanes syntaxiques de tel ou tel langage, d’abord parce qu’il ne se focalise pas sur un langage en particulier et ensuite parce qu’il ne se préoccupe pas de ces questions largement traitées par ailleurs. Son but est de cerner au travers d’exemples très nombreux, plus de 120 programmes documentés et décortiqués, quelques concepts essentiels de la programmation :
– les notions de variables, pointeurs, références, tableaux et structures qui prennent des formes variées et s’utilisent différemment selon les langages
– le concept de fonctions, appels de fonctions, transmissions de paramètres et renvois de valeurs
– la structure de pile et ses usages
– la récursion, ses différentes formes, ses avantages et inconvénients.
L’approche proposée est volontairement pragmatique, presque aucun formalisme n’est utilisé. Il s’agit d’écrire des programmes dans divers langages couramment utilisés (principalement Java, C, C++ mais pas seulement) illustrant des concepts, de les traduire vers une machine virtuelle simple permettant de comprendre comment ces constructions s’incarnent en machine et donc quels sont leurs impacts sur l’exécution des programmes : performance ou fiabilité par exemple. Par conséquent, le lecteur, qu’il soit débutant ou confirmé, sera par la suite capable de faire des choix bien éclairés et de mieux conduire sa conception de programmes.
Les codes sources des programmes peuvent être retrouvés sur Internet à partir des pages des auteurs.},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
Cet ouvrage, à l’usage de tout informaticien, du programmeur à l’ingénieur, a pour but de fixer plus profondément un certain nombre de concepts de programmation. Ce livre n’est pas un manuel de programmation au sens traditionnel. On n’y trouvera pas l’habituelle litanie des arcanes syntaxiques de tel ou tel langage, d’abord parce qu’il ne se focalise pas sur un langage en particulier et ensuite parce qu’il ne se préoccupe pas de ces questions largement traitées par ailleurs. Son but est de cerner au travers d’exemples très nombreux, plus de 120 programmes documentés et décortiqués, quelques concepts essentiels de la programmation :
– les notions de variables, pointeurs, références, tableaux et structures qui prennent des formes variées et s’utilisent différemment selon les langages
– le concept de fonctions, appels de fonctions, transmissions de paramètres et renvois de valeurs
– la structure de pile et ses usages
– la récursion, ses différentes formes, ses avantages et inconvénients.
L’approche proposée est volontairement pragmatique, presque aucun formalisme n’est utilisé. Il s’agit d’écrire des programmes dans divers langages couramment utilisés (principalement Java, C, C++ mais pas seulement) illustrant des concepts, de les traduire vers une machine virtuelle simple permettant de comprendre comment ces constructions s’incarnent en machine et donc quels sont leurs impacts sur l’exécution des programmes : performance ou fiabilité par exemple. Par conséquent, le lecteur, qu’il soit débutant ou confirmé, sera par la suite capable de faire des choix bien éclairés et de mieux conduire sa conception de programmes.
Les codes sources des programmes peuvent être retrouvés sur Internet à partir des pages des auteurs. |
 | Luidnel Maignan, Jean-Baptiste Yunès Generalized FSSP on hexagonal tiling: Towards arbitrary regular spaces Inproceedings Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo (Ed.): Cellular Automata and Discrete Complex Systems. AUTOMATA 2014. Himeji, Japan, July 7th-9th, 2014. LNCS 8996. , pp. 83–96, Springer, Cham 2014, ISBN: 978-3-319-18812-6. Abstract | Links | BibTeX @inproceedings{maignan2014generalized,
title = {Generalized FSSP on hexagonal tiling: Towards arbitrary regular spaces},
author = {Luidnel Maignan and Jean-Baptiste Yunè}s},
editor = {Teijiro Isokawa and Katsunobu Imai and Nobuyuki Matsui and Ferdinand Peper and Hiroshi Umeo},
doi = {10.1007/978-3-319-18812-6_7},
isbn = {978-3-319-18812-6},
year = {2014},
date = {2014-07-07},
booktitle = {Cellular Automata and Discrete Complex Systems. AUTOMATA 2014. Himeji, Japan, July 7th-9th, 2014. LNCS 8996. },
pages = {83--96},
organization = {Springer, Cham},
abstract = {Here we present a solution to the generalized firing squad synchronization problem that works on some class of shapes in the hexagonal tiling of the plane. The solution is obtained from a previous solution which works on grids with either a von Neumann or a Moore neighborhood. Analyzing the construction of this previous solution, we were able to exhibit a parameter that leads us to abstract the solution. First, and for an arbitrary considered neighborhood, we focus our attention on a class of shapes built from this neighborhood, and determine the corresponding parameter value for them. Second, we apply our previous solution with the determined parameter value for the hexagonal neighborhood and show that, indeed, all the considered shapes on the hexagonal tiling synchronizes.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Here we present a solution to the generalized firing squad synchronization problem that works on some class of shapes in the hexagonal tiling of the plane. The solution is obtained from a previous solution which works on grids with either a von Neumann or a Moore neighborhood. Analyzing the construction of this previous solution, we were able to exhibit a parameter that leads us to abstract the solution. First, and for an arbitrary considered neighborhood, we focus our attention on a class of shapes built from this neighborhood, and determine the corresponding parameter value for them. Second, we apply our previous solution with the determined parameter value for the hexagonal neighborhood and show that, indeed, all the considered shapes on the hexagonal tiling synchronizes. |
 | David Ameisen, Christophe Deroulers, Valérie Perrier, Fatiha Bouhidel, Maxime Battistella, Luc Legrès, Anne Janin, Philippe Bertheau, Jean-Baptiste Yunès Automatic image quality assessment in digital pathology: from idea to implementation. Online 2014, visited: 07.04.2014. Abstract | Links | BibTeX @online{ameisen2014automatic,
title = {Automatic image quality assessment in digital pathology: from idea to implementation.},
author = {David Ameisen and Christophe Deroulers and Valérie Perrier and Fatiha Bouhidel and Maxime Battistella and Luc Legrès and Anne Janin and Philippe Bertheau and Jean-Baptiste Yunès},
url = {http://iwbbio.ugr.es/2014/papers/IWBBIO_2014_paper_18.pdf},
year = {2014},
date = {2014-04-07},
urldate = {2014-04-07},
booktitle = {IWBBIO 2014 (2nd International Work-Conference on Bioinformatics and Biomedical Engineering)},
pages = {148--157},
abstract = {At this time, the quality of a Whole Slide Image (WSI) is verified a posteriori by a technician or a pathologist. A WSI of insufficient quality needs to be scanned again. High-speed automatic quality assessment tools for WSI will therefore greatly improve laboratory workflow. We describe here a fast method to automatically assess WSI quality, with different tests such as blurri- ness, contrast, brightness and color, and to accept or discard them at the time of acquisition in less than a minute. Parameters are weighted by pertinence and a global score indicates whether the WSI is suitable for further use. This fast method, designed at first to improve laboratory workflow, is currently being implemented in a network of 27 French hospitals and public-private health in- stitutions in the Paris region. It may also be used as a calibration and quality control tool for WSI acquisition systems.},
keywords = {},
pubstate = {published},
tppubtype = {online}
}
At this time, the quality of a Whole Slide Image (WSI) is verified a posteriori by a technician or a pathologist. A WSI of insufficient quality needs to be scanned again. High-speed automatic quality assessment tools for WSI will therefore greatly improve laboratory workflow. We describe here a fast method to automatically assess WSI quality, with different tests such as blurri- ness, contrast, brightness and color, and to accept or discard them at the time of acquisition in less than a minute. Parameters are weighted by pertinence and a global score indicates whether the WSI is suitable for further use. This fast method, designed at first to improve laboratory workflow, is currently being implemented in a network of 27 French hospitals and public-private health in- stitutions in the Paris region. It may also be used as a calibration and quality control tool for WSI acquisition systems. |
 | Luidnel Maignan, Jean-Baptiste Yunès Experimental finitization of infinite field-based generalized FSSP solution Inproceedings Jarosalw Wąs, Giorgos Sirakoulis, Stefania Bandini (Ed.): International Conference on Cellular Automata, ACRI 2014: Cellular Automata, LNCS., pp. 136–145, Springer, Cham 2014, ISBN: 978-3-319-11520-7. Abstract | Links | BibTeX @inproceedings{maignan2014experimental,
title = {Experimental finitization of infinite field-based generalized FSSP solution},
author = {Luidnel Maignan and Jean-Baptiste Yunès},
editor = {Jarosalw Wąs and Giorgos Sirakoulis and Stefania Bandini},
doi = {10.1007/978-3-319-11520-7_15},
isbn = {978-3-319-11520-7},
year = {2014},
date = {2014-01-01},
booktitle = {International Conference on Cellular Automata, ACRI 2014: Cellular Automata, LNCS.},
volume = {8751},
pages = {136--145},
organization = {Springer, Cham},
abstract = {In a previous work (see [3]) we presented a general scheme to solve the 1D Generalized Firing Squad Synchronization Problem. We designed it in a modular way using the concept of fields (open CA). The solution was not designed as a finite cellular automaton because we needed unbounded integers as states for distance fields, and the recursive nature of the algorithm leaded to a unbounded number of fields. In this paper, we show as claimed, that this approach does lead to a finite cellular automaton. We exhibit a transformation function from infinite to finite states and write a program that generates the associated finite transition table while checking its validity and the conservation of the input-output behavior of the original cellular automaton.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In a previous work (see [3]) we presented a general scheme to solve the 1D Generalized Firing Squad Synchronization Problem. We designed it in a modular way using the concept of fields (open CA). The solution was not designed as a finite cellular automaton because we needed unbounded integers as states for distance fields, and the recursive nature of the algorithm leaded to a unbounded number of fields. In this paper, we show as claimed, that this approach does lead to a finite cellular automaton. We exhibit a transformation function from infinite to finite states and write a program that generates the associated finite transition table while checking its validity and the conservation of the input-output behavior of the original cellular automaton. |
2013
|
| Luidnel Maignan, Jean-Baptiste Yunès Moore and von Neumann neighborhood n-dimensional generalized firing squad solutions using fields Inproceedings 2013 First International Symposium on Computing and Networking, Matsuyama, Japan, 2013, pp. 552–558, IEEE 2013. Abstract | Links | BibTeX @inproceedings{maignan2013moore,
title = {Moore and von Neumann neighborhood n-dimensional generalized firing squad solutions using fields},
author = {Luidnel Maignan and Jean-Baptiste Yunès},
doi = {10.1109/CANDAR.2013.98},
year = {2013},
date = {2013-12-04},
booktitle = {2013 First International Symposium on Computing and Networking, Matsuyama, Japan, 2013},
pages = {552--558},
organization = {IEEE},
abstract = {We present a solution to the Firing Squad Synchronization Problem that works both in Von Neumann and Moore neighborhood and whatever is the dimension of the space. That solution is based on fields that provide a clean modular decomposition of such cellular automata problem.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
We present a solution to the Firing Squad Synchronization Problem that works both in Von Neumann and Moore neighborhood and whatever is the dimension of the space. That solution is based on fields that provide a clean modular decomposition of such cellular automata problem. |
| David Ameisen, Christophe Deroulers, Valérie Perrier, Jean-Baptiste Yunès, Fatiha Bouhidel, Maxime Battistella, Luc Legrès, Anne Janin, Philippe Bertheau Stack or trash? Quality assessment of virtual slides Inproceedings Diagnostic Pathology: Proceedings of the 11th European Congress on Telepathology and 5th International Congress on Virtual Microscopy, pp. S23, BioMed Central 2013. Abstract | Links | BibTeX @inproceedings{ameisen2013stack,
title = {Stack or trash? Quality assessment of virtual slides},
author = {David Ameisen and Christophe Deroulers and Valérie Perrier and Jean-Baptiste Yunès and Fatiha Bouhidel and Maxime Battistella and Luc Legrès and Anne Janin and Philippe Bertheau},
doi = {10.1186/1746-1596-8-S1-S23},
year = {2013},
date = {2013-09-30},
booktitle = {Diagnostic Pathology: Proceedings of the 11th European Congress on Telepathology and 5th International Congress on Virtual Microscopy},
volume = {8},
number = {1},
pages = {S23},
organization = {BioMed Central},
abstract = {Since microscopic slides can now be automatically digitized and integrated in the clinical workflow, quality assessment of these Whole Slide Images (WSI) has become a crucial issue. At this time, the quality of a WSI is verified a posteriori by a technician or by a pathologist. There is however a significant amount of WSI that are too insufficient in quality (blurred, bad colors, poor contrast.) to be used for diagnoses. These slides have then to be scanned again with delay thus slowing down the diagnostic workflow.
To address this problem, we chose to design a method of quality assessment followed by reacquisition, as opposed to a process of enhancement or restoration [1, 2]. Such process indeed too frequently results in the degradation of image quality, a key factor in medical diagnosis.
The quality of a flat image can be defined by several quantifiable parameters such as color, brightness, and contrast. One of the most important parameters, yet difficult to assess, is the focus sharpness (i.e. the level of focus blur) [3]).
Quality assessment of WSI is much more complex than that of flat images because of their intrinsic structure made of multiple magnification levels (pyramidal structure) and resolutions above the gigapixel. One study [4] has shown the possibility of comparing the tiles’ contrast and entropy in two WSI obtained with two different scanners digitizing the same slide. Another work [5] assessed the focus sharpness of the tiles of a WSI with the generation of a focus assessment map of the WSI at a given magnification level. However, both these methods still require a human eye to assess if the WSI must be accepted or discarded after the scan.
We describe here a fast method to automatically assess quality and to accept or discard WSI at the time of acquisition.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Since microscopic slides can now be automatically digitized and integrated in the clinical workflow, quality assessment of these Whole Slide Images (WSI) has become a crucial issue. At this time, the quality of a WSI is verified a posteriori by a technician or by a pathologist. There is however a significant amount of WSI that are too insufficient in quality (blurred, bad colors, poor contrast.) to be used for diagnoses. These slides have then to be scanned again with delay thus slowing down the diagnostic workflow.
To address this problem, we chose to design a method of quality assessment followed by reacquisition, as opposed to a process of enhancement or restoration [1, 2]. Such process indeed too frequently results in the degradation of image quality, a key factor in medical diagnosis.
The quality of a flat image can be defined by several quantifiable parameters such as color, brightness, and contrast. One of the most important parameters, yet difficult to assess, is the focus sharpness (i.e. the level of focus blur) [3]).
Quality assessment of WSI is much more complex than that of flat images because of their intrinsic structure made of multiple magnification levels (pyramidal structure) and resolutions above the gigapixel. One study [4] has shown the possibility of comparing the tiles’ contrast and entropy in two WSI obtained with two different scanners digitizing the same slide. Another work [5] assessed the focus sharpness of the tiles of a WSI with the generation of a focus assessment map of the WSI at a given magnification level. However, both these methods still require a human eye to assess if the WSI must be accepted or discarded after the scan.
We describe here a fast method to automatically assess quality and to accept or discard WSI at the time of acquisition. |
2012
|
| David Ameisen, Christophe Deroulers, Valérie Perrier, Jean-Baptiste Yunès, F Bouhidel, M Battistella, L Legrès, Anne Janin, Philippe Bertheau À prendre ou à laisser? Une évaluation automatique de la qualité des lames virtuelles en temps quasi-réel Inproceedings Annales de Pathologie, pp. S151–S152, Elsevier Masson 2012. Abstract | BibTeX @inproceedings{ameisen2012prendre,
title = {À prendre ou à laisser? Une évaluation automatique de la qualité des lames virtuelles en temps quasi-réel},
author = {David Ameisen and Christophe Deroulers and Valérie Perrier and Jean-Baptiste Yunès and F Bouhidel and M Battistella and L Legrès and Anne Janin and Philippe Bertheau},
year = {2012},
date = {2012-11-01},
booktitle = {Annales de Pathologie},
volume = {32},
number = {5},
pages = {S151--S152},
organization = {Elsevier Masson},
abstract = {Discussion.–Notre prototype pourra notamment être amélioré en augmentant la vitesse d’analyse grâce à une architecture en grappe de serveurs (cluster). Un algorithme d’apprentissage permettrait par ailleurs d’affiner les seuils en fonction des colorations et du type de système d’acquisition.
Conclusion.–Notre méthode peut être utilisée en amont comme un outil de calibration ou d’assurance qualité pour les systèmes d’acquisition de LV ou comme outil en temps réel pour numériser à nouveau les tuiles lors de la numérisation. Elle peut également être utilisée en aval pour détecter les lames de qualité insuffisante et permettre leur renumérisation avant analyse par le pathologiste. Ces scores pourraient être intégrés, en tant qu’indicateurs de qualité, aux métadonnées des LV partagées dans les contextes de recherche, d’enseignement ou clinique.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Discussion.–Notre prototype pourra notamment être amélioré en augmentant la vitesse d’analyse grâce à une architecture en grappe de serveurs (cluster). Un algorithme d’apprentissage permettrait par ailleurs d’affiner les seuils en fonction des colorations et du type de système d’acquisition.
Conclusion.–Notre méthode peut être utilisée en amont comme un outil de calibration ou d’assurance qualité pour les systèmes d’acquisition de LV ou comme outil en temps réel pour numériser à nouveau les tuiles lors de la numérisation. Elle peut également être utilisée en aval pour détecter les lames de qualité insuffisante et permettre leur renumérisation avant analyse par le pathologiste. Ces scores pourraient être intégrés, en tant qu’indicateurs de qualité, aux métadonnées des LV partagées dans les contextes de recherche, d’enseignement ou clinique. |
 | Jacques Mazoyer, Jean-Baptiste Yunès Computations on cellular automata Book Chapter Grzegorz Rozenberg (Ed.): Handbook of Natural Computing, pp. 159–188, Springer Berlin Heidelberg, 2012, ISBN: 978-3-540-92911-6. BibTeX @inbook{mazoyer2012computations,
title = {Computations on cellular automata},
author = {Jacques Mazoyer and Jean-Baptiste Yunès},
editor = {Grzegorz Rozenberg},
isbn = {978-3-540-92911-6},
year = {2012},
date = {2012-08-01},
booktitle = {Handbook of Natural Computing},
pages = {159--188},
publisher = {Springer Berlin Heidelberg},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
|
 | Luidnel Maignan, Jean-Baptiste Yunès A spatio-temporal algorithmic point of view on firing squad synchronisation problem Inproceedings Georgios Sirakoulis, Stefania Bandini (Ed.): International Conference on Cellular Automata, Cellular Automata. ACRI 2012, Santorini Island, Greece. Lecture Notes in Computer Science, LNCS., pp. 101–110, Springer, Berlin, Heidelberg 2012, ISBN: 978-3-642-33350-7. Abstract | Links | BibTeX @inproceedings{maignan2012spatio,
title = {A spatio-temporal algorithmic point of view on firing squad synchronisation problem},
author = {Luidnel Maignan and Jean-Baptiste Yunès},
editor = {Georgios Sirakoulis and Stefania Bandini},
doi = {10.1007/978-3-642-33350-7_11},
isbn = {978-3-642-33350-7},
year = {2012},
date = {2012-01-01},
booktitle = {International Conference on Cellular Automata, Cellular Automata. ACRI 2012, Santorini Island, Greece. Lecture Notes in Computer Science, LNCS.},
volume = {7495},
pages = {101--110},
organization = {Springer, Berlin, Heidelberg},
abstract = {Firing Squad Synchronization Problems are well known to be solvable by voluminous transition tables describing signals traveling and colliding. In this paper, we show that it is possible to solve it by expressing directly the fact that we want a recursive division of the space into two parts of equal size, and a notification when no further division is possible. Using fields – objects associating a value to every point in space and time – as primitive objects, the solution is designed algorithmically by a semantically-intuitive decomposition of the global evolution into simpler evolutions.
The system we obtain has several interesting characteristics : it is understandable, time-optimal, tackles many initial configurations, and allows a new interpretation of the traditional signals and collisions point of view. We will quickly sketch how we can obtain a finite state automaton by reduction of the system using the Lipschitz-continuity of involved fields, and a kind of tail-recursivity property of the dependencies.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Firing Squad Synchronization Problems are well known to be solvable by voluminous transition tables describing signals traveling and colliding. In this paper, we show that it is possible to solve it by expressing directly the fact that we want a recursive division of the space into two parts of equal size, and a notification when no further division is possible. Using fields – objects associating a value to every point in space and time – as primitive objects, the solution is designed algorithmically by a semantically-intuitive decomposition of the global evolution into simpler evolutions.
The system we obtain has several interesting characteristics : it is understandable, time-optimal, tackles many initial configurations, and allows a new interpretation of the traditional signals and collisions point of view. We will quickly sketch how we can obtain a finite state automaton by reduction of the system using the Lipschitz-continuity of involved fields, and a kind of tail-recursivity property of the dependencies. |
 | Jean-Baptiste Yunès Grids and universal computations on one-dimensional cellular automata Journal Article Natural Computing, 11 (2), pp. 303–309, 2012. Abstract | Links | BibTeX @article{yunes2012grids,
title = {Grids and universal computations on one-dimensional cellular automata},
author = {Jean-Baptiste Yunès},
editor = {Yasubumi Sakakibara and Yongli Mi and Svozil and Dennunzio and Enrico Formenti and Ferdinand Peper and Hiroshi Umeo},
doi = {10.1007/s11047-012-9312-2},
year = {2012},
date = {2012-01-01},
journal = {Natural Computing},
volume = {11},
number = {2},
pages = {303--309},
publisher = {Springer},
abstract = {This article shows how universal computations can be achieved on one-dimensional cellular automata. We are interested in intrinsic universality: we want a CA in which any other CA can be represented and simulated with no intermediate coding relevant to another computation model. We first abstract the space-time diagram in favor of the dependency graph. Then we show how such a dependency graph (via treillis automata) can be realized by what is called a grid, leading to a simple uniform simulation. Finally, we exhibit a very simple universal brick that can be used in grids to obtain an intrinsic universal CA.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This article shows how universal computations can be achieved on one-dimensional cellular automata. We are interested in intrinsic universality: we want a CA in which any other CA can be represented and simulated with no intermediate coding relevant to another computation model. We first abstract the space-time diagram in favor of the dependency graph. Then we show how such a dependency graph (via treillis automata) can be realized by what is called a grid, leading to a simple uniform simulation. Finally, we exhibit a very simple universal brick that can be used in grids to obtain an intrinsic universal CA. |
2011
|
 | Enrico Formenti, Katsunobu Imai, Bruno Martin, Jean-Baptiste Yunes On 1-resilient, radius 2 elementary CA rules Inproceedings Nazim Fatès, Eric Goles, Alejandro Maass, Ivan Rapaport
(Ed.): AUTOMATA 2011, 17th International Workshop on Cellular Automata and Discrete Complex Systems, Nancy, France., pp. 41–54, 2011. Abstract | Links | BibTeX @inproceedings{formenti20111,
title = {On 1-resilient, radius 2 elementary CA rules},
author = {Enrico Formenti and Katsunobu Imai and Bruno Martin and Jean-Baptiste Yunes},
editor = {Nazim Fatès and Eric Goles and Alejandro Maass and Ivan Rapaport
},
url = {https://hal.inria.fr/hal-00654706/document},
year = {2011},
date = {2011-11-21},
booktitle = {AUTOMATA 2011, 17th International Workshop on Cellular Automata and Discrete Complex Systems, Nancy, France.},
journal = {AUTOMATA 2011},
pages = {41--54},
abstract = {The study of cellular automata rules suitable for cryptographic applications is under consideration. Cellular automata can be used to generate pseudo-random sequences as well as for the design of S-boxes in symmetric cryptography. Boolean functions with good properties like resiliency and non-linearity are usually obtained either by exhaustive search or by the use of genetic algorithms. We propose here to use some recent research in the classification of Boolean functions and to link the study of cellular automata rules to the study of such Boolean functions. We illustrate our approach with 5-variable Boolean functions.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The study of cellular automata rules suitable for cryptographic applications is under consideration. Cellular automata can be used to generate pseudo-random sequences as well as for the design of S-boxes in symmetric cryptography. Boolean functions with good properties like resiliency and non-linearity are usually obtained either by exhaustive search or by the use of genetic algorithms. We propose here to use some recent research in the classification of Boolean functions and to link the study of cellular automata rules to the study of such Boolean functions. We illustrate our approach with 5-variable Boolean functions. |
 | Enrico Formenti, Katsunobu Imai, Bruno Martin, Jean-Baptiste Yunès Cellular automata, Boolean functions, Pseudo-random generators, Symmetric cryptography. Inproceedings Nazim Fatès, Eric Goles, Alejandro Maass, Ivan Rappaport (Ed.): AUTOMATA 11, 17th International Workshop on Cellular Automata and Discrete Complex Systems, November 21—23, 2011, Santiago, Chile., 2011. BibTeX @inproceedings{formenti2011boolean,
title = {Cellular automata, Boolean functions, Pseudo-random generators, Symmetric cryptography.},
author = {Enrico Formenti and Katsunobu Imai and Bruno Martin and Jean-Baptiste Yunès},
editor = {Nazim Fatès and Eric Goles and Alejandro Maass and Ivan Rappaport},
year = {2011},
date = {2011-11-21},
booktitle = {AUTOMATA 11, 17th International Workshop on Cellular Automata and Discrete Complex Systems, November 21—23, 2011, Santiago, Chile.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
 | Jean-Baptiste Yunès Le premier programme informatique de von Neumann Book Chapter Éléments pour une histoire de l'informatique.
Traduction d'œuvres choisies de Donald E. Knuth.
Traduction dirigée par Patrick Cégielski., pp. 56–75, Société Mathématique de France-CSLI Publications, Stanford, California, 2011, ISBN: 978-1-57586-622-2. BibTeX @inbook{yunes2011premier,
title = {Le premier programme informatique de von Neumann},
author = {Jean-Baptiste Yunès},
isbn = {978-1-57586-622-2},
year = {2011},
date = {2011-01-01},
booktitle = {Éléments pour une histoire de l'informatique.
Traduction d'œuvres choisies de Donald E. Knuth.
Traduction dirigée par Patrick Cégielski.},
pages = {56--75},
publisher = {Société Mathématique de France-CSLI Publications, Stanford, California},
keywords = {},
pubstate = {published},
tppubtype = {inbook}
}
|
2010
|
 | Jean-Baptiste Yunès Achieving universal computations on one-dimensional cellular automata (invited conference) Inproceedings Hiroshi Umeo, Stefania Bandini (Ed.): Cellular Automata. ACRI 2010. Ascoli Piceno, Italy, Septembre 21-24, 2010. Lecture Notes in Computer Science, LNCS, pp. 660–669, Springer, Berlin, Heidelberg 2010, ISBN: 978-3-642-15979-4. Abstract | Links | BibTeX @inproceedings{yunes2010achieving,
title = {Achieving universal computations on one-dimensional cellular automata (invited conference)},
author = {Jean-Baptiste Yunès},
editor = {Hiroshi Umeo and Stefania Bandini},
doi = {10.1007/978-3-642-15979-4_74},
isbn = {978-3-642-15979-4},
year = {2010},
date = {2010-09-21},
booktitle = {Cellular Automata. ACRI 2010. Ascoli Piceno, Italy, Septembre 21-24, 2010. Lecture Notes in Computer Science, LNCS},
volume = {6350},
pages = {660--669},
organization = {Springer, Berlin, Heidelberg},
abstract = {We show how natural universal computations can be achieved on one-dimensional cellular automata. That model of computation is obviously Turing complete but how can we effectively program any given computation is far less known. In this paper we are interested in intrinsic universality; we want a CA in which any other CA can be represented and simulated with no intermediate coding relevant to another computation model. The first step is to abstract from the space-time diagram in favor of a more essential dependency graph. Then such dependency graph can be projected on grids. This work shows that grids put forward causality in place of space-time contingencies.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
We show how natural universal computations can be achieved on one-dimensional cellular automata. That model of computation is obviously Turing complete but how can we effectively program any given computation is far less known. In this paper we are interested in intrinsic universality; we want a CA in which any other CA can be represented and simulated with no intermediate coding relevant to another computation model. The first step is to abstract from the space-time diagram in favor of a more essential dependency graph. Then such dependency graph can be projected on grids. This work shows that grids put forward causality in place of space-time contingencies. |
 | Akira Nomura, Jean-Baptiste Yunès, Hiroshi Umeo A Note on Synchronization Steps in Firing Squad Synchronization Problem Inproceedings 2010 Third International Joint Conference on Computational Science and Optimization, Huangshan, China., pp. 300–301, IEEE 2010, ISBN: 978-1-4244-6812-6. Abstract | Links | BibTeX @inproceedings{nomura2010note,
title = {A Note on Synchronization Steps in Firing Squad Synchronization Problem},
author = {Akira Nomura and Jean-Baptiste Yunès and Hiroshi Umeo},
doi = {10.1109/CSO.2010.124},
isbn = {978-1-4244-6812-6},
year = {2010},
date = {2010-05-28},
booktitle = {2010 Third International Joint Conference on Computational Science and Optimization, Huangshan, China.},
volume = {1},
pages = {300--301},
organization = {IEEE},
abstract = {The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In this paper, we propose two synchronization algorithms and their implementations, each having O(n^2) and O(2^n) synchronization steps for n cells, respectively.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In this paper, we propose two synchronization algorithms and their implementations, each having O(n^2) and O(2^n) synchronization steps for n cells, respectively. |
2009
|
 | Hiroshi Umeo, Jean-Baptiste Yunès, Naoki Kamikawa, Juntarou Kurashiki Small non optimum time firing squad synchronization protocols for one-dimensional rings Inproceedings International Symposium on Nonlinear Theory and its Applications (NOLTA'09). Sapporo, Japan, October 18—21, 2009., pp. 479–482, 2009. Abstract | BibTeX @inproceedings{umeo2009small,
title = {Small non optimum time firing squad synchronization protocols for one-dimensional rings},
author = {Hiroshi Umeo and Jean-Baptiste Yunès and Naoki Kamikawa and Juntarou Kurashiki},
year = {2009},
date = {2009-10-18},
booktitle = {International Symposium on Nonlinear Theory and its Applications (NOLTA'09). Sapporo, Japan, October 18—21, 2009.},
volume = {9},
pages = {479--482},
abstract = {The synchronization in cellular automata has been known as a firing squad synchronization problem since its development, in which it was originally pro- posed by J. Myhill in Moore [1964] to synchronize all or some parts of self-reproducing cellular automata. The firing squad synchronization problem has been studied extensively for more than 40 years [1-22]. In the present article, we propose two six-state firing squad synchronization full protocols for rings, which are the smallest ones known at present for rings. In addition, we present a family of 4-state partial protocols that can synchronize any one-dimensional rings of length n = 2^k for any positive integer k. The number four is the smallest one in the class of synchronization protocols proposed so far. We also study state change complexities for those protocols.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The synchronization in cellular automata has been known as a firing squad synchronization problem since its development, in which it was originally pro- posed by J. Myhill in Moore [1964] to synchronize all or some parts of self-reproducing cellular automata. The firing squad synchronization problem has been studied extensively for more than 40 years [1-22]. In the present article, we propose two six-state firing squad synchronization full protocols for rings, which are the smallest ones known at present for rings. In addition, we present a family of 4-state partial protocols that can synchronize any one-dimensional rings of length n = 2^k for any positive integer k. The number four is the smallest one in the class of synchronization protocols proposed so far. We also study state change complexities for those protocols. |
 | Hiroshi Umeo, Jean-Baptiste Yunès, Takuya Yamawaki A simple optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays Inproceedings 2009 International Conference on Computational Intelligence, Modelling and Simulation, Brno, Czech Republic, September 7—9, 2009., pp. 120–125, IEEE 2009. Abstract | Links | BibTeX @inproceedings{umeo2009simple,
title = {A simple optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays},
author = {Hiroshi Umeo and Jean-Baptiste Yunès and Takuya Yamawaki},
doi = {10.1109/CSSim.2009.58},
year = {2009},
date = {2009-09-07},
booktitle = {2009 International Conference on Computational Intelligence, Modelling and Simulation, Brno, Czech Republic, September 7—9, 2009.},
pages = {120--125},
organization = {IEEE},
abstract = {The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional arrays but two-dimensional arrays. In the present paper, we propose a new and simpler optimum-time synchronization algorithm that can synchronize any rectangle array of size m × n with a general at one corner in m + n + max(m, n)-3 steps. An implementation for the algorithm in terms of local transition rules is also given.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional arrays but two-dimensional arrays. In the present paper, we propose a new and simpler optimum-time synchronization algorithm that can synchronize any rectangle array of size m × n with a general at one corner in m + n + max(m, n)-3 steps. An implementation for the algorithm in terms of local transition rules is also given. |
 | Hiroshi Umeo, Jean-Baptiste Yunès, Takuya Yamawaki A Two-Dimensional Optimum-Time Firing Squad Synchronization Algorithm and Its Implementation Incollection Ferdinand Peper, Hiroshi Umeo, N. Matsui, Teijiro Isokawa (Ed.): IWNC'09 — International Workshop on Natural Computing, Himeji, Japan, September 23—25, 2009, Proceedings in Information and Communications Technology., 2 (3), pp. 342–351, Springer, Tokyo, 2009. Abstract | Links | BibTeX @incollection{umeo2010two,
title = {A Two-Dimensional Optimum-Time Firing Squad Synchronization Algorithm and Its Implementation},
author = {Hiroshi Umeo and Jean-Baptiste Yunès and Takuya Yamawaki},
editor = {Ferdinand Peper and Hiroshi Umeo and N. Matsui and Teijiro Isokawa},
doi = {10.1007/978-4-431-53868-4},
year = {2009},
date = {2009-09-01},
booktitle = {IWNC'09 — International Workshop on Natural Computing, Himeji, Japan, September 23—25, 2009, Proceedings in Information and Communications Technology.},
volume = {2},
number = {3},
pages = {342--351},
publisher = {Springer, Tokyo},
abstract = {The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional arrays but two-dimensional arrays. In the present paper, we propose a new and simpler optimum-time synchronization algorithm that can synchronize any rectangle array of size m ×n with a general at one corner in m + n + max (m, n) − 3 steps. An implementation for the algorithm in terms of local transition rules is also given.},
keywords = {},
pubstate = {published},
tppubtype = {incollection}
}
The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional arrays but two-dimensional arrays. In the present paper, we propose a new and simpler optimum-time synchronization algorithm that can synchronize any rectangle array of size m ×n with a general at one corner in m + n + max (m, n) − 3 steps. An implementation for the algorithm in terms of local transition rules is also given. |
 | Hiroshi Umeo, Naoki Kamikawa, Jean-Baptiste Yunès A family of smallest symmetrical four-state firing squad synchronization protocols for ring arrays Journal Article Parallel Processing Letters, 19 (02), pp. 299–313, 2009. Abstract | Links | BibTeX @article{umeo2009family,
title = {A family of smallest symmetrical four-state firing squad synchronization protocols for ring arrays},
author = {Hiroshi Umeo and Naoki Kamikawa and Jean-Baptiste Yunès},
doi = {10.1142/S0129626409000237},
year = {2009},
date = {2009-01-01},
journal = {Parallel Processing Letters},
volume = {19},
number = {02},
pages = {299--313},
publisher = {World Scientific},
abstract = {An existence or non-existence of five-state firing squad synchronization protocol has been a longstanding and famous open problem for a long time. In this paper, we answer partially to this problem by proposing a family of smallest four-state firing squad synchronization protocols that can synchronize any one-dimensional ring cellular arrays of length n = 2k for any positive integer k. The number four is the smallest one in the class of synchronization protocols proposed so far.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
An existence or non-existence of five-state firing squad synchronization protocol has been a longstanding and famous open problem for a long time. In this paper, we answer partially to this problem by proposing a family of smallest four-state firing squad synchronization protocols that can synchronize any one-dimensional ring cellular arrays of length n = 2k for any positive integer k. The number four is the smallest one in the class of synchronization protocols proposed so far. |
| Jean-Baptiste Yunès Known CA synchronizers made insensitive to the initial state of the initiator Journal Article Journal of Cellular Automata, 4 (2), pp. 147–158, 2009. Abstract | Links | BibTeX @article{yun2009known,
title = {Known CA synchronizers made insensitive to the initial state of the initiator},
author = {Jean-Baptiste Yunès},
editor = {Henryk Fuks and Anna T. Lawniczak},
url = {https://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-4-number-2-2009/jca-4-2-p-147-158/},
year = {2009},
date = {2009-01-01},
booktitle = {Special Issue. Automata 2007. 13th International Workshop on Cellular Automata.},
journal = {Journal of Cellular Automata},
volume = {4},
number = {2},
pages = {147--158},
abstract = {We show that a lot of CA synchronizers can be made insensitive to the initial state of the initiator by adding a few new transitions which were previously undefined and no new state.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
We show that a lot of CA synchronizers can be made insensitive to the initial state of the initiator by adding a few new transitions which were previously undefined and no new state. |
2008
|
 | Hiroshi Umeo, Jean-Baptiste Yunès, Naoki Kamikawa About 4-states solutions to the firing squad synchronization problem Inproceedings Hiroshi Umeo, Shin Morishita, Katsuhiro Nishinari, Toshihiko Komatsuzaki, Stefania Bandini (Ed.): Cellular Automata, 8th International Conference on Cellular Automata for Research and Industry, ACRI 2008, Yokohama, Japan, September 23—26, 2008. Proceedings. Lecture Notes on Computer Science, LNCS, pp. 108–113, Springer, Berlin, Heidelberg 2008, ISBN: 978-3-540-79992-4. Abstract | Links | BibTeX @inproceedings{umeo20084,
title = {About 4-states solutions to the firing squad synchronization problem},
author = {Hiroshi Umeo and Jean-Baptiste Yunès and Naoki Kamikawa},
editor = {Hiroshi Umeo and Shin Morishita and Katsuhiro Nishinari and Toshihiko Komatsuzaki and Stefania Bandini},
doi = {10.1007/978-3-540-79992-4_14},
isbn = {978-3-540-79992-4},
year = {2008},
date = {2008-09-23},
booktitle = {Cellular Automata, 8th International Conference on Cellular Automata for Research and Industry, ACRI 2008, Yokohama, Japan, September 23—26, 2008. Proceedings. Lecture Notes on Computer Science, LNCS},
volume = {5191},
pages = {108--113},
organization = {Springer, Berlin, Heidelberg},
abstract = {We present some elements of a new family of time-optimal solutions to a less restrictive firing squad synchronization problem. These solutions are all built on top of some elementary algebraic cellular automata. Thus, this gives a very new insight on the problem and a more general way of computing on cellular automata.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
We present some elements of a new family of time-optimal solutions to a less restrictive firing squad synchronization problem. These solutions are all built on top of some elementary algebraic cellular automata. Thus, this gives a very new insight on the problem and a more general way of computing on cellular automata. |
 | Jean-Baptiste Yunès A 4-states algebraic solution to linear cellular automata synchronization Journal Article Information Processing Letters, 107 (2), pp. 71–75, 2008. Abstract | Links | BibTeX @article{yunes20084,
title = {A 4-states algebraic solution to linear cellular automata synchronization},
author = {Jean-Baptiste Yunès},
doi = {10.1016/j.ipl.2008.01.009},
year = {2008},
date = {2008-07-16},
journal = {Information Processing Letters},
volume = {107},
number = {2},
pages = {71--75},
publisher = {Elsevier},
abstract = {In this paper, we aim to present a completely new solution to the firing squad synchronization problem based on Wolfram's rule 60. This solution solves the problem on an infinite number of lines but not all possible lines. The two remarkable properties are that the state complexity of it is the lowest possible, say 4 states and 32 transitions (we prove that no line of length
can be synchronized with only 3 states) and that the algorithm is no more based on geometric constructions but relies on some algebraic properties of the transition function. The solution is almost in minimal time: up to one unit of time.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, we aim to present a completely new solution to the firing squad synchronization problem based on Wolfram's rule 60. This solution solves the problem on an infinite number of lines but not all possible lines. The two remarkable properties are that the state complexity of it is the lowest possible, say 4 states and 32 transitions (we prove that no line of length
can be synchronized with only 3 states) and that the algorithm is no more based on geometric constructions but relies on some algebraic properties of the transition function. The solution is almost in minimal time: up to one unit of time. |
 | Hiroshi Umeo, Naoki Kamikawa, Jean-Baptiste Yunès A family of smallest symmetrical four-state firing squad synchronization protocols for one-dimensional ring cellular automata Journal Article pp. 174–185, 2008, ISBN: 978-1-905986-16-5. Abstract | BibTeX @article{umeo2008family,
title = {A family of smallest symmetrical four-state firing squad synchronization protocols for one-dimensional ring cellular automata},
author = {Hiroshi Umeo and Naoki Kamikawa and Jean-Baptiste Yunès},
editor = {Andrew Adamatsky and Ramon Alonso-Sanz and Anna Lawniczak and Genaro Juarez Martinez and Kenichi Morita and Thomas Worsch },
isbn = {978-1-905986-16-5},
year = {2008},
date = {2008-06-12},
booktitle = {Proceedings of AUTOMATA 2008. 14th International Workshop on Cellular Automata, Bristol, United Kingdom, September 2008. Theory and Applications of Cellular Automata.},
pages = {174--185},
publisher = {Luniver Press},
abstract = {An existence or non-existence of five-state firing squad synchronization protocol has been a longstanding and famous open problem for a long time. In this paper, we answer partially to this problem by proposing a family of smallest four-state firing squad synchronization protocols that can synchronize any one-dimensional ring cellular arrays of length n = 2^k for any positive integer k. The number four is the smallest one in the class of synchronization protocols proposed so far.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
An existence or non-existence of five-state firing squad synchronization protocol has been a longstanding and famous open problem for a long time. In this paper, we answer partially to this problem by proposing a family of smallest four-state firing squad synchronization protocols that can synchronize any one-dimensional ring cellular arrays of length n = 2^k for any positive integer k. The number four is the smallest one in the class of synchronization protocols proposed so far. |
 | Olga Masnyk Hansen, Jean Francis Michon, Pierre Valarcher, Jean-Baptiste Yunès (Ed.) BFCA 2008. Proceedings of BFCA’08, Fourth international workshop on Boolean Functions : Cryptography and Applications. May 19—21, 2008. IBM, Copenhagen, Denmark. Book 2008. Links | BibTeX @book{bfca08,
title = {BFCA 2008. Proceedings of BFCA’08, Fourth international workshop on Boolean Functions : Cryptography and Applications. May 19—21, 2008. IBM, Copenhagen, Denmark.},
editor = {Olga Masnyk Hansen and Jean Francis Michon and Pierre Valarcher and Jean-Baptiste Yunès},
url = {http://yunes.informatique.univ-paris-diderot.fr/raw/bfca/bfca08/},
year = {2008},
date = {2008-05-21},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
|
 | Jean-Baptiste Yunès Goto's construction and Pascal's triangle: new insights into cellular automata synchronization Inproceedings Proceedings of the first symposium on cellular automata, "Journées Automates Cellulaires", JAC 2008, Uzès, France, 2008, pp. 195–203, Издательство МЦНМО 2008, ISBN: 978-5-94057-377-7. Links | BibTeX @inproceedings{yunes2008goto,
title = {Goto's construction and Pascal's triangle: new insights into cellular automata synchronization},
author = {Jean-Baptiste Yunès},
url = {http://yunes.informatique.univ-paris-diderot.fr/raw/publications/jac08/Jac.html},
isbn = {978-5-94057-377-7},
year = {2008},
date = {2008-05-01},
booktitle = {Proceedings of the first symposium on cellular automata, "Journées Automates Cellulaires", JAC 2008, Uzès, France, 2008},
pages = {195--203},
organization = {Издательство МЦНМО},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
 | Jean-Baptiste Yunès An intrinsically non minimal-time Minsky-like 6-states solution to the firing squad synchronization problem Journal Article RAIRO - Theoretical Informatics and Applications, 42 (1), pp. 55–68, 2008. Abstract | Links | BibTeX @article{yunes2008intrinsically,
title = {An intrinsically non minimal-time Minsky-like 6-states solution to the firing squad synchronization problem},
author = {Jean-Baptiste Yunès},
doi = {10.1051/ita:2007051},
year = {2008},
date = {2008-01-18},
journal = {RAIRO - Theoretical Informatics and Applications},
volume = {42},
number = {1},
pages = {55--68},
publisher = {EDP Sciences},
abstract = {Here is presented a 6-states non minimal-time solution which is intrinsically Minsky-like and solves the three following problems: unrestricted version on a line, with one initiator at each end of a line and the problem on a ring. We also give a complete proof of correctness of our solution, which was never done in a publication for Minsky's solutions.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Here is presented a 6-states non minimal-time solution which is intrinsically Minsky-like and solves the three following problems: unrestricted version on a line, with one initiator at each end of a line and the problem on a ring. We also give a complete proof of correctness of our solution, which was never done in a publication for Minsky's solutions. |
2007
|
 | Jean-Baptiste Yunès Automates Cellulaires; Fonctions Booléennes. Mémoire d'Habilitation à Diriger des Recherches PhD Thesis Université Paris Diderot, 2007. Links | BibTeX @phdthesis{yunes2007automates,
title = {Automates Cellulaires; Fonctions Booléennes. Mémoire d'Habilitation à Diriger des Recherches},
author = {Jean-Baptiste Yunès},
url = {http://yunes.informatique.univ-paris-diderot.fr/raw/publicationsHDR.pdf},
year = {2007},
date = {2007-12-12},
school = {Université Paris Diderot},
keywords = {},
pubstate = {published},
tppubtype = {phdthesis}
}
|
 | Jean-Baptiste Yunès Simple new algorithm which solve the FSSP: a 4n-steps 7-states solution Inproceedings International Conference on Machines, Computations, and Universality. MCU 2007: Machines, Computations, and Universality. Université d'Orléans, France, September 10—13, 2007., pp. 316–324, Springer, Berlin, Heidelberg., 2007, ISBN: 978-3-540-74593-8. Abstract | Links | BibTeX @inproceedings{yunes2007simpleb,
title = {Simple new algorithm which solve the FSSP: a 4n-steps 7-states solution},
author = {Jean-Baptiste Yunès},
doi = {10.1007/978-3-540-74593-8_27},
isbn = {978-3-540-74593-8},
year = {2007},
date = {2007-09-10},
booktitle = {International Conference on Machines, Computations, and Universality. MCU 2007: Machines, Computations, and Universality. Université d'Orléans, France, September 10—13, 2007.},
pages = {316--324},
publisher = {Springer, Berlin, Heidelberg.},
abstract = {We present a new family of solutions to the firing squad synchronization problem. All these solutions are built with a few finite number of signals, which lead to simple implementations with 7 or 8 internal states. Using one of these schemes we are able to built a 7-states 4𝑛+O(log𝑛) -steps solution to the firing squad synchronization problem. These solutions not only solves the unrestricted problem (initiator at one of the two ends), but also the problem with initiators at both ends and the problem on a ring.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
We present a new family of solutions to the firing squad synchronization problem. All these solutions are built with a few finite number of signals, which lead to simple implementations with 7 or 8 internal states. Using one of these schemes we are able to built a 7-states 4𝑛+O(log𝑛) -steps solution to the firing squad synchronization problem. These solutions not only solves the unrestricted problem (initiator at one of the two ends), but also the problem with initiators at both ends and the problem on a ring. |
 | Jean-Baptiste Yunès New extensions to some firing squad synchronization solutions Inproceedings AUTOMATA 2007. 13th International Workshop on Cellular Automata, Fields Institute, Toronto, Canada, August 27—29, 2007. IFIP TC1 WG 1.5., 2007. BibTeX @inproceedings{yunes2007new,
title = {New extensions to some firing squad synchronization solutions},
author = {Jean-Baptiste Yunès},
year = {2007},
date = {2007-08-27},
booktitle = {AUTOMATA 2007. 13th International Workshop on Cellular Automata, Fields Institute, Toronto, Canada, August 27—29, 2007. IFIP TC1 WG 1.5.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
 | Jean-Baptiste Yunès Revisiting existing solutions to the firing squad synchronization problem Inproceedings WSDC'07, Workshop on Symbolic Dynamic and Coding. Institut Gaspard Monge, Marne-la-Vallée, France, July 2—4, 2007., 2007. BibTeX @inproceedings{yunes2007revisiting,
title = {Revisiting existing solutions to the firing squad synchronization problem},
author = {Jean-Baptiste Yunès},
year = {2007},
date = {2007-07-02},
booktitle = {WSDC'07, Workshop on Symbolic Dynamic and Coding. Institut Gaspard Monge, Marne-la-Vallée, France, July 2—4, 2007.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
 | Jean-Francis Michon, Pierre Valarcher, Jean-Baptiste Yunès (Ed.) BFCA 07. Proceedings of BFCA'07, Third international workshop on Boolean Functions : Cryptography and Applications. May 2—3, 2007. LIAFA, Université Paris Diderot, France. Book 2007. Links | BibTeX @book{bfca07,
title = {BFCA 07. Proceedings of BFCA'07, Third international workshop on Boolean Functions : Cryptography and Applications. May 2—3, 2007. LIAFA, Université Paris Diderot, France.},
editor = {Jean-Francis Michon and Pierre Valarcher and Jean-Baptiste Yunès},
url = {http://yunes.informatique.univ-paris-diderot.fr/raw/bfca/bfca07/},
year = {2007},
date = {2007-05-03},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
|
2006
|
 | Jean Francis Michon, Pierre Valarcher, Jean-Baptiste Yunès (Ed.) BFCA 06. Proceedings of BFCA’06, Second international workshop on Boolean Functions : Cryptography and Applications. March 13—15, 2006. LIFAR, Université Rouen, France. Book Presses Universitaires de Rouen et du Havre, 2006, ISBN: 978-2-87775-422-4. Links | BibTeX @book{bfca06,
title = {BFCA 06. Proceedings of BFCA’06, Second international workshop on Boolean Functions : Cryptography and Applications. March 13—15, 2006. LIFAR, Université Rouen, France.},
editor = { Jean Francis Michon and Pierre Valarcher and Jean-Baptiste Yunès},
url = {http://yunes.informatique.univ-paris-diderot.fr/raw/bfca/bfca06/},
isbn = {978-2-87775-422-4},
year = {2006},
date = {2006-03-13},
publisher = { Presses Universitaires de Rouen et du Havre},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
|
| Jean-Baptiste Yunès Fault Tolerant Solutions to the Firing Squad Synchronization Problem in Linear Cellular Automata. Journal Article J. Cellular Automata, 1 (3), pp. 253–268, 2006. Abstract | Links | BibTeX @article{yunes2006fault,
title = {Fault Tolerant Solutions to the Firing Squad Synchronization Problem in Linear Cellular Automata.},
author = {Jean-Baptiste Yunès},
url = {https://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-1-number-3-2006/jca-1-3-p-253-268/},
year = {2006},
date = {2006-01-01},
journal = {J. Cellular Automata},
volume = {1},
number = {3},
pages = {253--268},
abstract = {We consider some specific instances of the firing squad synchronization problem in which some cells are possibly defectives. As Umeo [16] showed, minimal-time solutions exist in the case there are locally more working cells than defective ones. This paper explains how to set up different schemes to obtain a linear-time synchronization on defective lines in the case there are locally more defective cells than working ones (but globally not too much many ones).},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
We consider some specific instances of the firing squad synchronization problem in which some cells are possibly defectives. As Umeo [16] showed, minimal-time solutions exist in the case there are locally more working cells than defective ones. This paper explains how to set up different schemes to obtain a linear-time synchronization on defective lines in the case there are locally more defective cells than working ones (but globally not too much many ones). |
2005
|
| Jean-Francis Michon, Jean-Baptiste Yunès, Pierre Valarcher On maximal QROBDD's of Boolean functions Journal Article RAIRO - Theoretical Informatics and Applications, 39 (4), pp. 677–686, 2005. Abstract | Links | BibTeX @article{michon2005maximal,
title = {On maximal QROBDD's of Boolean functions},
author = {Jean-Francis Michon and Jean-Baptiste Yunès and Pierre Valarcher},
doi = {10.1051/ita:2005036},
year = {2005},
date = {2005-01-01},
journal = {RAIRO - Theoretical Informatics and Applications},
volume = {39},
number = {4},
pages = {677--686},
publisher = {EDP Sciences},
abstract = {We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer).},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer). |
 | Jean-Baptiste Yunès, Pierre Valarcher, Jean-Francis Michon BFCA 05. Proceedings of BFCA’05, First international workshop on Boolean Functions : Cryptography and Applications. March 7—8, 2005. LIFAR, Université Rouen, France. Book Presses Universitaires de Rouen et du Havre, 2005, ISBN: 2-87775-403-0. Links | BibTeX @book{yunes2005bfca,
title = {BFCA 05. Proceedings of BFCA’05, First international workshop on Boolean Functions : Cryptography and Applications. March 7—8, 2005. LIFAR, Université Rouen, France.},
author = {Jean-Baptiste Yunès and Pierre Valarcher and Jean-Francis Michon},
url = {http://yunes.informatique.univ-paris-diderot.fr/raw/bfca/bfca05/},
isbn = {2-87775-403-0},
year = {2005},
date = {2005-01-01},
publisher = {Presses Universitaires de Rouen et du Havre},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
|
2004
|
 | Jean-Francis Michon, Pierre Valarcher, Jean-Baptiste Yunès HFE and BDDs: A practical attempt at cryptanalysis Incollection K.Q. Feng, H. Niederreiter, C.P. Xing (Ed.): Proceedings of CCC'03, Coding, Cryptography and Combinatorics. Progress in Computer Science and Applied Logic., pp. 237–246, Birkhäuser, Basel, 2004, ISBN: 978-3-7643-2429-5. Abstract | Links | BibTeX @incollection{michon2004hfe,
title = {HFE and BDDs: A practical attempt at cryptanalysis},
author = {Jean-Francis Michon and Pierre Valarcher and Jean-Baptiste Yunès},
editor = {K.Q. Feng and H. Niederreiter and C.P. Xing},
doi = {10.1007/978-3-0348-7865-4_16},
isbn = {978-3-7643-2429-5},
year = {2004},
date = {2004-01-01},
booktitle = {Proceedings of CCC'03, Coding, Cryptography and Combinatorics. Progress in Computer Science and Applied Logic.},
pages = {237--246},
publisher = {Birkhäuser, Basel},
abstract = {HFE (Hidden Field Equations) is a public key cryptosystem using univariate polynomials over finite fields. It was proposed by J. Patarin in 1996. Well chosen parameters during the construction produce a system of quadratic multivariate polynomials over 𝔽2 as the public key. An enclosed trapdoor is used to decrypt messages. We propose a ciphertext-only attack which mainly consists in satisfying a boolean formula. Our algorithm is based on BDDs (Binary Decision Diagrams), introduced by Bryant in 1986, which allow to represent and manipulate, possibly efficiently, boolean functions. This paper is devoted to some experimental results we obtained while trying to solve the Patarin’s challenge. This approach was not successful, nevertheless it provided some interesting information about the security of HFE cryptosystem.},
keywords = {},
pubstate = {published},
tppubtype = {incollection}
}
HFE (Hidden Field Equations) is a public key cryptosystem using univariate polynomials over finite fields. It was proposed by J. Patarin in 1996. Well chosen parameters during the construction produce a system of quadratic multivariate polynomials over 𝔽2 as the public key. An enclosed trapdoor is used to decrypt messages. We propose a ciphertext-only attack which mainly consists in satisfying a boolean formula. Our algorithm is based on BDDs (Binary Decision Diagrams), introduced by Bryant in 1986, which allow to represent and manipulate, possibly efficiently, boolean functions. This paper is devoted to some experimental results we obtained while trying to solve the Patarin’s challenge. This approach was not successful, nevertheless it provided some interesting information about the security of HFE cryptosystem. |
 | Jean-Baptiste Yunès, Jean-Francis Michon, Pierre Valarcher A100344, Sequence of Enumeration of QROBDD Journal Article The Online Encyclopedia of Integer Sequences, 2004. Abstract | Links | BibTeX @article{yunes2004sequence,
title = {A100344, Sequence of Enumeration of QROBDD},
author = {Jean-Baptiste Yunès and Jean-Francis Michon and Pierre Valarcher},
url = {http://oeis.org/A100344},
year = {2004},
date = {2004-01-01},
journal = {The Online Encyclopedia of Integer Sequences},
abstract = {Gives the i-th coefficient M(k,i) of the decomposition of the polynomials B(k,X^2) in the basis of all B(i,X), where B(i,X) is the i-th binomial polynomial: B(i,X) = X(X-1)...(X-i+1)/i! for any i > 0 and B(0,X) = 1 by definition.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Gives the i-th coefficient M(k,i) of the decomposition of the polynomials B(k,X^2) in the basis of all B(i,X), where B(i,X) is the i-th binomial polynomial: B(i,X) = X(X-1)...(X-i+1)/i! for any i > 0 and B(0,X) = 1 by definition. |
2003
|
 | Jean-Marie Rifflet, Jean-Baptiste Yunès Unix: Programmation et Communication Book Dunod, 2003, ISBN: 978-2100079667. Abstract | Links | BibTeX @book{yunes2003unix,
title = {Unix: Programmation et Communication},
author = {Jean-Marie Rifflet and Jean-Baptiste Yunès},
url = {https://www.dunod.com/sciences-techniques/unix-programmation-et-communication},
isbn = {978-2100079667},
year = {2003},
date = {2003-08-21},
publisher = {Dunod},
abstract = {Prise en main. Le système de gestion de fichiers. Les processus. Les principales commandes du système. Les langages de commande. L'édition de textes. Les interfaces graphiques. Le langage C. Les outils de développement. Généralités sur l'interface avec le système. Les entrées-sorties. Terminaux, groupes et sessions. La gestion des processus. La gestion des signaux. La communication par tubes. IPC System V et IPC Posix. Les threads. Unix et réseaux. RPC. Sockets.},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
Prise en main. Le système de gestion de fichiers. Les processus. Les principales commandes du système. Les langages de commande. L'édition de textes. Les interfaces graphiques. Le langage C. Les outils de développement. Généralités sur l'interface avec le système. Les entrées-sorties. Terminaux, groupes et sessions. La gestion des processus. La gestion des signaux. La communication par tubes. IPC System V et IPC Posix. Les threads. Unix et réseaux. RPC. Sockets. |
2002
|
| Jean-Francis Michon, Jean-Baptiste Yunes, Pierre Valarcher Attaque du système HFE par BDD Technical Report 2002. Links | BibTeX @techreport{michonand,
title = {Attaque du système HFE par BDD},
author = {Jean-Francis Michon and Jean-Baptiste Yunes and Pierre Valarcher},
url = {http://yunes.informatique.univ-paris-diderot.fr/raw/publications/HFE.pdf},
year = {2002},
date = {2002-01-01},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
|
1999
|
| Jean-Baptiste Yunès An Implementation of a Fault Tolerant Scheme of the FSSP Inproceedings Automata 1999, IFIP WG1.5 Meeting, École Normale Supérieure de Lyon, Lyon, France., 1999. BibTeX @inproceedings{yunes1999implementation,
title = {An Implementation of a Fault Tolerant Scheme of the FSSP},
author = {Jean-Baptiste Yunès},
year = {1999},
date = {1999-01-01},
booktitle = {Automata 1999, IFIP WG1.5 Meeting, École Normale Supérieure de Lyon, Lyon, France.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
1997
|
 | Debra Cameron, Bill Rosenblatt, Jean-Baptiste Yunès (traducteur) Introduction à GNU Emacs Book O'Reilly, 1997, ISBN: 2-84177-015-X. Links | BibTeX @book{emacs,
title = {Introduction à GNU Emacs},
author = {Debra Cameron and Bill Rosenblatt and Jean-Baptiste Yunès (traducteur)},
url = {https://www.eyrolles.com/Informatique/Livre/introduction-a-gnu-emacs-9782841770151/},
isbn = {2-84177-015-X},
year = {1997},
date = {1997-01-01},
publisher = {O'Reilly},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
|
1996
|
 | Cricket Liu, Jerry Peek, Russ Jones, Bryan Buus, Adrian Nye, Gauthier Groult (traducteur), Jean-Baptiste Yunès (traducteur) Systèmes d’information sur Internet: Installation et mise en oeuvre Book O'Reilly, 1996, ISBN: 2-84177-013-3. BibTeX @book{internet,
title = {Systèmes d’information sur Internet: Installation et mise en oeuvre},
author = {Cricket Liu and Jerry Peek and Russ Jones and Bryan Buus and Adrian Nye and Gauthier Groult (traducteur) and Jean-Baptiste Yunès (traducteur)},
isbn = {2-84177-013-3},
year = {1996},
date = {1996-01-01},
publisher = {O'Reilly},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
|
1995
|
| Jean-Baptiste Yunès Solutions Tolérantes aux pannes pour le problème de la synchronisation d'une ligne de fusiliers. Inproceedings ASMICS Workshop, Roanne, France., 1995. Links | BibTeX @inproceedings{yunes1995solutions,
title = {Solutions Tolérantes aux pannes pour le problème de la synchronisation d'une ligne de fusiliers.},
author = {Jean-Baptiste Yunès},
url = {http://yunes.informatique.univ-paris-diderot.fr/raw/publications/roanne.pdf},
year = {1995},
date = {1995-01-01},
booktitle = {ASMICS Workshop, Roanne, France.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
 | Jean-Baptiste Yunès Fault tolerant solutions to the firing squad synchronization problem Inproceedings Jozef Gruska, Hiroshi Umeo, Roland Vollmar (Ed.): Dagstuhl Seminar Report. Automata 1995, Schloss Dagstuhl 9510, Dagstuhl, Germany., pp. 28, Dagstuhl 1995. Links | BibTeX @inproceedings{yunes1995fault,
title = {Fault tolerant solutions to the firing squad synchronization problem},
author = {Jean-Baptiste Yunès},
editor = {Jozef Gruska and Hiroshi Umeo and Roland Vollmar},
url = {http://yunes.informatique.univ-paris-diderot.fr/raw/publications/dagstuhl.pdf},
year = {1995},
date = {1995-01-01},
booktitle = {Dagstuhl Seminar Report. Automata 1995, Schloss Dagstuhl 9510, Dagstuhl, Germany.},
pages = {28},
organization = {Dagstuhl},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
|
| Maurice Margenstern, Jean-Baptiste Yunès (Ed.) MCU 95. Proceedings of MCU/UMC'95. Book 1995. BibTeX @book{mcu95,
title = {MCU 95. Proceedings of MCU/UMC'95.},
editor = { Maurice Margenstern and Jean-Baptiste Yunès},
year = {1995},
date = {1995-01-01},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
|
1994
|
 | Jean-Baptiste Yunès Seven-state solutions to the firing squad synchronization problem Journal Article Theoretical Computer Science, 127 (2), pp. 313–332, 1994. Abstract | Links | BibTeX @article{yunes1994seven,
title = {Seven-state solutions to the firing squad synchronization problem},
author = {Jean-Baptiste Yunès},
doi = {10.1016/0304-3975(94)90045-0},
year = {1994},
date = {1994-01-01},
journal = {Theoretical Computer Science},
volume = {127},
number = {2},
pages = {313--332},
publisher = {Elsevier},
abstract = {We show that seven states are enough to implement Minsky-like solutions to the Firing Squad Synchronization Problem in a linear network of n finite state cellular automata with null transmission delay.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
We show that seven states are enough to implement Minsky-like solutions to the Firing Squad Synchronization Problem in a linear network of n finite state cellular automata with null transmission delay. |
1993
|
| Jean-Baptiste Yunès Synchronisation et automates cellulaires: la ligne de fusiliers PhD Thesis Université Paris 7, 1993. Abstract | Links | BibTeX @phdthesis{yunes1993synchronisation,
title = {Synchronisation et automates cellulaires: la ligne de fusiliers},
author = {Jean-Baptiste Yunès},
url = {https://tel.archives-ouvertes.fr/tel-00139049},
year = {1993},
date = {1993-01-01},
pages = {1--116},
school = {Université Paris 7},
abstract = {CETTE THESE CONCERNE UN TYPE PARTICULIER DE PARALLELISME: LES AUTOMATES CELLULAIRES. L'AUTEUR ETUDIE LE PROBLEME DE LA SYNCHRONISATION D'UNE LIGNE DE FUSILIERS, ET NOTAMMENT, LE PROBLEME OUVERT CONCERNANT L'EXISTENCE OU NON D'UN AUTOMATE SYNCHRONISANT DONT L'ENSEMBLE DES ETATS NE CONTIENDRAIT QUE CINQ ELEMENTS. DEUX APPROCHES SONT DECRITES: 1) UNE PREMIERE (DESCENDANTE ET CONSTRUCTIVE) MONTRE COMMENT, APRES AVOIR CONSTRUIT UN AUTOMATE AVEC TREIZE ETATS, IL EST POSSIBLE DE DIMINUER LA CARDINALITE DE L'ENSEMBLE PAR DES CODAGES SUCCESSIFS. LE PROCEDE DE MINSKY (DIVIDE-AND-CONQUER) EST LA BASE DE CES SOLUTIONS; 2) UNE DEUXIEME (ASCENDANTE ET ANALYTIQUE) ETUDIE CERTAINS COMPORTEMENTS OBSERVES DANS QUELQUES AUTOMATES N'AYANT QU'UN NOMBRE TRES REDUIT D'ETATS. IL EST POSSIBLE DE CONSTRUIRE DES AUTOMATES A DEUX ETATS QUI PASSENT PAR TOUTES LES CONFIGURATIONS POSSIBLES. LEUR ETUDE EST RAMENEE A CELLE DES AUTOMATES CYLINDRIQUES, PERMETTANT DE METTRE EN AVANT DES LIENS NON TRIVIAUX AVEC LA THEORIE DES NOMBRES. IL EST MONTRE COMMENT QUELQUES CALCULS SIMULENT LE COMPORTEMENT D'AUTOMATES TREILLIS EN PAVANT LE DIAGRAMME ESPACE-TEMPS PAR DES LOSANGES.},
keywords = {},
pubstate = {published},
tppubtype = {phdthesis}
}
CETTE THESE CONCERNE UN TYPE PARTICULIER DE PARALLELISME: LES AUTOMATES CELLULAIRES. L'AUTEUR ETUDIE LE PROBLEME DE LA SYNCHRONISATION D'UNE LIGNE DE FUSILIERS, ET NOTAMMENT, LE PROBLEME OUVERT CONCERNANT L'EXISTENCE OU NON D'UN AUTOMATE SYNCHRONISANT DONT L'ENSEMBLE DES ETATS NE CONTIENDRAIT QUE CINQ ELEMENTS. DEUX APPROCHES SONT DECRITES: 1) UNE PREMIERE (DESCENDANTE ET CONSTRUCTIVE) MONTRE COMMENT, APRES AVOIR CONSTRUIT UN AUTOMATE AVEC TREIZE ETATS, IL EST POSSIBLE DE DIMINUER LA CARDINALITE DE L'ENSEMBLE PAR DES CODAGES SUCCESSIFS. LE PROCEDE DE MINSKY (DIVIDE-AND-CONQUER) EST LA BASE DE CES SOLUTIONS; 2) UNE DEUXIEME (ASCENDANTE ET ANALYTIQUE) ETUDIE CERTAINS COMPORTEMENTS OBSERVES DANS QUELQUES AUTOMATES N'AYANT QU'UN NOMBRE TRES REDUIT D'ETATS. IL EST POSSIBLE DE CONSTRUIRE DES AUTOMATES A DEUX ETATS QUI PASSENT PAR TOUTES LES CONFIGURATIONS POSSIBLES. LEUR ETUDE EST RAMENEE A CELLE DES AUTOMATES CYLINDRIQUES, PERMETTANT DE METTRE EN AVANT DES LIENS NON TRIVIAUX AVEC LA THEORIE DES NOMBRES. IL EST MONTRE COMMENT QUELQUES CALCULS SIMULENT LE COMPORTEMENT D'AUTOMATES TREILLIS EN PAVANT LE DIAGRAMME ESPACE-TEMPS PAR DES LOSANGES. |
https://orcid.org/0000-0003-0291-4263
