MOMI2020: Program

Day 1: March 09, 2020

8h30 9h15 Registration
9h15 9h30 Welcome – MOMI2020 Opening
9h30 11h00 Prof. Michael Kerber
The Persistent Homology Pipeline: Shapes, Computations, and Applications
The theory of persistent homology provides a multi-scale summary of homological features which is stable with respect to noise. These properties make homological algebra applicable to a growing range of application areas (in geometry and beyond) and give rise to the field of topological data analysis. This success of linking theory and applications has posed the challenge of computing persistence on large data sets. Typical questions in this context are: How can we efficiently build combinatorial cell complexes out of point cloud data? How can we compute the persistence summaries of very large cell complexes in a scalable way? Finally, how does the computed summary lead us to new insights into the considered application? The talk will give a gentle introduction to the field of persistent homology, present some applications to real data, and discuss some current research topics.
11h00 11h30 Coffee Break – Poster Session
11h30 13h00 Prof. Michael Kerber
The Persistent Homology Pipeline: Shapes, Computations, and Applications
13h00 14h00 Lunch Break
14h00 15h00 Industrial Speakers
15h00 16h00 Coffee Break – Poster Session – Company fair
16h00 16h30 Industrial Speakers
16h30 17h30 Coffee Break – Poster Session – Company fair
Social Event starting 19h30

Day 2: March 10, 2020

9h00 9h30 Registration
9h30 11h00 Prof. Jean-Paul Comet
Automata, Logics and biology
Graphs are useful everywhere even in biology for representing networks. In this talk we illustrate how logic and automata can complete such descriptions of biological networks and help biologists to design pertinent models of gene networks making possible the analysis of temporal traces. After having sketched the modeling framework for genetic networks defined by René Thomas in the 1970s, we describe a complete modeling assistance methodology based on formal verification methods. We focus on an adaptation to gene networks of validation techniques by model-checking and proof in Hoare logic. We show that classical logical approaches from software engineering adapt remarkably effectively to the major problem of modeling complex systems: the identification of parameters.
11h00 11h30 Coffee Break
11h30 13h00 Prof. Jean-Claude BERMOND
Graphs Designs and Networks
13h00 13h15 Closing Remarks – Inria SAM Director: Maureen Clerc

Comments are closed.