Matthieu Roy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Matthieu Roy has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Armando Castañeda
Instituto de Matemáticas, Universidad Nacional Autónoma de México (UNAM), México City, Mexico
2 shared publications Michel Raynal
Université de Rennes 1
2 shared publicationsAchour Mostéfaoui
Université de Nantes
1 shared publication- Alexandre Armengaud
AtmoSud, Air Quality Regional Observatory in the South of France, Marseille, France
1 shared publication - Ami Paz
LISN, CNRS, Paris-Saclay University, Gif-sur-Yvette, France
1 shared publication Armando Castañeda
UNAM
1 shared publication
Latest Publications
- 12 April 2023
- Published by Elsevier in Information and Computation
- Vol. 292
Synchronous t-resilient consensus in arbitrary graphs
- 12 April 2023
- Published by Elsevier in Information and Computation
- Vol. 292
Synchronous t-resilient consensus in arbitrary graphs
- Open Access
- 22 September 2020
- Published by MDPI AG in Atmosphere
- Vol. 11 (9) , 1014
Urban-Scale NO2 Prediction with Sensors Aboard Bicycles: A Comparison of Statistical Methods Using Synthetic Observations
Mobile devices for city-scale air quality monitoring is receiving increasing attention due to the advent of low-cost and miniaturized sensors. Mobility and crowdsensing have emerged as a new means to investigate the ambient air quality in urban areas. However, the design of the network (e.g., number of sensors per unit area) and the scientific interpretation of collected data with an ad hoc method are still challenging. In this paper, we focus on the use of a fleet of private bicycles to monitor NO concentrations in the city of Marseille, France. The study is based on synthetic observations generated by means of a regional air quality simulation system at a spatial resolution of 25 m × 25 m and simulated bike trips that are randomly generated in the city. The bike trips correspond to a maximum of 4500 bike commuters and are generated using a web-based navigation service. Simulated bike tracks are validated using available statistics on bike counts. Each bike track is associated with the along-track corresponding NO concentrations collected from the air quality simulations and physical features on the ground collected from Open Street Map. Spatialization of the information collected aboard the bikes is tested by using three different algorithms: kriging, land-use regression (LUR) and neural network (NN). LUR and NN show that the fleet can be limited to below 100 bikes while the performance of kriging is steadily increasing with the number of bikes. Increasing the sample distance above 200 m also impairs the citywide prediction of simulated NO concentrations.- 22 September 2020
- Published by MDPI AG in Atmosphere
- Vol. 11 (9) , 1014
Open AccessUrban-Scale NO2 Prediction with Sensors Aboard Bicycles: A Comparison of Statistical Methods Using Synthetic Observations
Mobile devices for city-scale air quality monitoring is receiving increasing attention due to the advent of low-cost and miniaturized sensors. Mobility and crowdsensing have emerged as a new means to investigate the ambient air quality in urban areas. However, the design of the network (e.g., number of sensors per unit area) and the scientific interpretation of collected data with an ad hoc method are still challenging. In this paper, we focus on the use of a fleet of private bicycles to monitor NO concentrations in the city of Marseille, France. The study is based on synthetic observations generated by means of a regional air quality simulation system at a spatial resolution of 25 m × 25 m and simulated bike trips that are randomly generated in the city. The bike trips correspond to a maximum of 4500 bike commuters and are generated using a web-based navigation service. Simulated bike tracks are validated using available statistics on bike counts. Each bike track is associated with the along-track corresponding NO concentrations collected from the air quality simulations and physical features on the ground collected from Open Street Map. Spatialization of the information collected aboard the bikes is tested by using three different algorithms: kriging, land-use regression (LUR) and neural network (NN). LUR and NN show that the fleet can be limited to below 100 bikes while the performance of kriging is steadily increasing with the number of bikes. Increasing the sample distance above 200 m also impairs the citywide prediction of simulated NO concentrations. - Open Access
Tasks in Modular Proofs of Concurrent Algorithms
Proving correctness of distributed or concurrent algorithms is a mind-challenging and complex process. Slight errors in the reasoning are difficult to find, calling for computer-checked proof systems. In order to build computer-checked proofs with usual tools, such as Coq or TLA+, having sequential specifications of all base objects that are used as building blocks in a given algorithm is a requisite to provide a modular proof built by composition. Alas, many concurrent objects do not have a sequential specification. This article describes a systematic method to transform any task, a specification method that captures concurrent one-shot distributed problems, into a sequential specification involving two calls, Set and Get. This transformation allows system designers to compose proofs, thus providing a framework for modular computer-checked proofs of algorithms designed using tasks and sequential objects as building blocks. The Moir&Anderson implementation of renaming using splitters is an iconic example of such algorithms designed by composition.
Open AccessTasks in Modular Proofs of Concurrent Algorithms
Proving correctness of distributed or concurrent algorithms is a mind-challenging and complex process. Slight errors in the reasoning are difficult to find, calling for computer-checked proof systems. In order to build computer-checked proofs with usual tools, such as Coq or TLA+, having sequential specifications of all base objects that are used as building blocks in a given algorithm is a requisite to provide a modular proof built by composition. Alas, many concurrent objects do not have a sequential specification. This article describes a systematic method to transform any task, a specification method that captures concurrent one-shot distributed problems, into a sequential specification involving two calls, Set and Get. This transformation allows system designers to compose proofs, thus providing a framework for modular computer-checked proofs of algorithms designed using tasks and sequential objects as building blocks. The Moir&Anderson implementation of renaming using splitters is an iconic example of such algorithms designed by composition.
- 9 May 2018
- Published by Springer Nature in Computing
- Vol. 101 (1) , 3-17
Time-efficient read/write register in crash-prone asynchronous message-passing systems
- 9 May 2018
- Published by Springer Nature in Computing
- Vol. 101 (1) , 3-17
Time-efficient read/write register in crash-prone asynchronous message-passing systems
- 1 June 2017
- Published by IOP Publishing in Journal of Statistical Mechanics: Theory and Experiment
- Vol. 2017 (6) , 063401
The many faces of graph dynamics
The topological structure of complex networks has fascinated researchers for several decades, resulting in the discovery of many universal properties and reoccurring characteristics of different kinds of networks. However, much less is known today about the network dynamics: indeed, complex networks in reality are not static, but rather dynamically evolve over time. Our paper is motivated by the empirical observation that network evolution patterns seem far from random, but exhibit structure. Moreover, the specific patterns appear to depend on the network type, contradicting the existence of a 'one fits it all' model. However, we still lack observables to quantify these intuitions, as well as metrics to compare graph evolutions. Such observables and metrics are needed for extrapolating or predicting evolutions, as well as for interpolating graph evolutions. To explore the many faces of graph dynamics and to quantify temporal changes, this paper suggests to build upon the concept of centrality, a measure of node importance in a network. In particular, we introduce the notion of centrality distance, a natural similarity measure for two graphs which depends on a given centrality, characterizing the graph type. Intuitively, centrality distances reflect the extent to which (non-anonymous) node roles are different or, in case of dynamic graphs, have changed over time, between two graphs. We evaluate the centrality distance approach for five evolutionary models and seven real-world social and physical networks. Our results empirically show the usefulness of centrality distances for characterizing graph dynamics compared to a null-model of random evolution, and highlight the differences between the considered scenarios. Interestingly, our approach allows us to compare the dynamics of very different networks, in terms of scale and evolution speed.
- 1 June 2017
- Published by IOP Publishing in Journal of Statistical Mechanics: Theory and Experiment
- Vol. 2017 (6) , 063401
The many faces of graph dynamics
The topological structure of complex networks has fascinated researchers for several decades, resulting in the discovery of many universal properties and reoccurring characteristics of different kinds of networks. However, much less is known today about the network dynamics: indeed, complex networks in reality are not static, but rather dynamically evolve over time. Our paper is motivated by the empirical observation that network evolution patterns seem far from random, but exhibit structure. Moreover, the specific patterns appear to depend on the network type, contradicting the existence of a 'one fits it all' model. However, we still lack observables to quantify these intuitions, as well as metrics to compare graph evolutions. Such observables and metrics are needed for extrapolating or predicting evolutions, as well as for interpolating graph evolutions. To explore the many faces of graph dynamics and to quantify temporal changes, this paper suggests to build upon the concept of centrality, a measure of node importance in a network. In particular, we introduce the notion of centrality distance, a natural similarity measure for two graphs which depends on a given centrality, characterizing the graph type. Intuitively, centrality distances reflect the extent to which (non-anonymous) node roles are different or, in case of dynamic graphs, have changed over time, between two graphs. We evaluate the centrality distance approach for five evolutionary models and seven real-world social and physical networks. Our results empirically show the usefulness of centrality distances for characterizing graph dynamics compared to a null-model of random evolution, and highlight the differences between the considered scenarios. Interestingly, our approach allows us to compare the dynamics of very different networks, in terms of scale and evolution speed.
- 14 May 2017
- Published by Springer Nature
- p. 206-221
Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour
- 14 May 2017
- Published by Springer Nature
- p. 206-221
Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour
- 1 February 2017
- Published by Elsevier in Journal of Systems Architecture
- Vol. 73, 6-16
Architecting resilient computing systems: A component-based approach for adaptive fault tolerance
- 1 February 2017
- Published by Elsevier in Journal of Systems Architecture
- Vol. 73, 6-16
Architecting resilient computing systems: A component-based approach for adaptive fault tolerance
- 14 May 2015
- Published by Springer Nature
- p. 1-6
BG Distributed Simulation Algorithm
- 1 January 2012
- Published by Springer Nature
- p. 221-234
The ARUM Experimentation Platform: An Open Tool to Evaluate Mobile Systems Applications
- 1 January 2012
- Published by Springer Nature
- p. 221-234
The ARUM Experimentation Platform: An Open Tool to Evaluate Mobile Systems Applications