Prochaines conférences

Andreas Flache

Opinion polarization and network segregation. Modelling a complex Relationship
24 juin 2021

Série de conférences mensuelles, le Colloquium Jacques Morgenstern expose les recherches les plus actives et les plus prometteuses dans le domaine des Sciences et Technologies de l’Information et de la Communication (STIC).

Les orateurs, français ou étrangers, sont des personnalités de premier plan, informaticiens, mathématiciens ou spécialistes de domaines où l'informatique est appelée à jouer un rôle majeur.

Les exposés couvrent une problématique suffisamment large pour intéresser tous les chercheurs, ingénieurs et étudiants concernés par l’avenir des STIC.

Le colloquium porte le nom de Jacques Morgenstern, professeur de mathématiques à l'Université de Nice Sophia Antipolis, spécialiste de la théorie de la complexité algébrique et l’un des pionniers du calcul formel. Il a dirigé jusqu’à son décès tragique en 1994 une équipe commune à l’Université de Nice Sophia Antipolis, Inria et le CNRS.

Le colloquium est un élément de la formation de l’Ecole Doctorale STIC. Entrée libre.

Nos derniers orateurs

Damien Woods – 21 Molecular Algorithms Using Reprogrammable DNA Self-Assembly
 
Damien Woods – 21 Molecular Algorithms Using Reprogrammable DNA Self-Assembly
May 20th, 2021 The history of computing tells us that computers can be made of almost anything: silicon, gears and levers, neurons, flowing water, interacting particles or even light. Although lithographically patterned silicon surfaces have been by far the most successful of these, they give us a limited view of what computation is capable of.…
Kathryn Hess – Topological insights in neuroscience
 
Kathryn Hess – Topological insights in neuroscience
April 20th, 2021 Over the past decade, and particularly over the past five years, research at the interface of topology and neuroscience has grown remarkably fast. Topology has, for example, been successfully applied to objective classification of neuron morphologies and to automatic detection of network dynamics. In this talk I will focus on the algebraic…
Mazyar Mirrahimi – The quest for long-lived quantum bit
 
Mazyar Mirrahimi – The quest for long-lived quantum bit
January 30th, 2020 The field of quantum information processing (quantum computation and quantum communication) has grown considerably in recent decades. Numerous proof-of-principle experiments on small-scale quantum systems (few physical degrees of freedom) have been carried out in various physical frameworks such as NMR (nuclear magnetic resonance), trapped ions, linear optics and superconducting circuits. In spite…
Bertrand Meyer –  How to build quality software: the Eiffel experience
 
Bertrand Meyer – How to build quality software: the Eiffel experience
Wednesday, December 18th, 2019 With society’s growing reliance on IT systems, the ability to write high-quality software is ever more critical. While a posteriori verification techniques have their role, there is no substitute for methods and tools that provide built-in quality (“correctness by construction”) and scale up to very large systems. For several decades my…
Alexei A. Efros – Self-Supervised Visual Learning and Synthesis
 
Alexei A. Efros – Self-Supervised Visual Learning and Synthesis
Thursday, November 28th, 2019 Computer vision has made impressive gains through the use of deep learning models, trained with large-scale labeled data. However, labels require expertise and curation and are expensive to collect. Can one discover useful visual representations without the use of explicitly curated labels? In this talk, I will present several case studies…
Luca Aceto – Theoretical Foundations for Runtime Monitoring
 
Luca Aceto – Theoretical Foundations for Runtime Monitoring
Tuesday, Sept.10th, 2019 – 11:00 am Runtime monitoring/verification is a lightweight technique that complements other verification methods in a multi-pronged approach towards ensuring software correctness. The technique poses novel questions to software engineers: it is not easy to see which specifications are amenable to runtime monitoring, and it is not clear which monitors perform the…
Laurence Calzone – Cancer network modelling: towards personalised medicine
 
Laurence Calzone – Cancer network modelling: towards personalised medicine
June 13th, 2019 Personalised medicine is one of the challenges of systems biology. If some clinical trials have already explored the possibility to treat patients individually based on their genomic profiles, there are more and more attempts to use mathematical models as an aid to select therapies in the clinics. The purpose of these models…
Alexandra Silva – CoNeCo: Concurrency, Networks and Coinduction
 
Alexandra Silva – CoNeCo: Concurrency, Networks and Coinduction
May 16th, 2019 In recent years, concurrent Kleene algebra (CKA), an extension of Kleene Algebra (KA) that includes concurrent composition as a first-class citizen, has been proposed by Hoare et al. as a setting to study the algebraic properties of concurrent composition as an operator on programs.  Orthogonally, based on KA, Foster et al proposed…