BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.17.4.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.loria.fr
X-WR-CALDESC:Évènements pour LORIA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20221030T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20231029T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20241027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20231003T100000
DTEND;TZID=Europe/Paris:20231003T120000
DTSTAMP:20230918T135739Z
CREATED:20230918T135619Z
LAST-MODIFIED:20230918T135739Z
UID:23044-1696327200-1696334400@www.loria.fr
SUMMARY:PhD Defense: Dylan Marinho (Veridis)
DESCRIPTION:Dylan Marinho (Veridis) will defend his thesis\, entitled « Theoretical and algorithmic contributions to the analysis of safety and security properties in timed systems under uncertainty »\, on Tuesday\, October 3 at 10am in room A008. \nAbstract:\nReal-time systems can be used in a wide range of applications\, such as transport\, telecommunications and industry. However\, accidents can happen\, and it is necessary to have confidence in these systems in order to avoid them. It is therefore necessary to formally prove that their behavior will comply with a specification. This specification can be of two kinds: with safety properties\, showing that the system will always behave as expected\, and security properties\, showing that it will be resistant to certain attacks. For this\, the formalism of timed automata (TAs) is fairly common.\nJury\n\nPhD Advisors:\n\nStephan Merz\, Université de Lorraine\nÉtienne André\, Sorbonne Université\n\n\n\n\nReviewers:\n\nPatricia Bouyer Decitre\, Université Paris-Saclay\nThierry JÉRON\, Université de Rennes\n\n\n\n\nExaminers:\n\nVéronique Cortier\, Université de Lorraine\nThao Dang\, INP Grenoble\nFrédéric Herbreteau\, INP Bordeaux\nSwen Jacobs\, CISPA Helmholtz Saarbrucken
URL:https://www.loria.fr/event/phd-defense-dylan-marinho-veridis/
LOCATION:A008
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20231006T140000
DTEND;TZID=Europe/Paris:20231006T160000
DTSTAMP:20230918T110754Z
CREATED:20230918T110719Z
LAST-MODIFIED:20230918T110754Z
UID:23040-1696600800-1696608000@www.loria.fr
SUMMARY:PhD Defense: Djamel Eddine Amir (Mocqua)
DESCRIPTION:Djamel Eddine Amir (Mocqua) will defend his thesis\, entitled « Computability of Topological Spaces »\, on Friday\, October 6 at 2pm in room C005. \nAbstract:\nThe main objective of this thesis is to examine the concept of « computable type » and enhance our overall understanding of this notion\, as well as provide techniques for verifying or disproving this property. A compact metrizable space is said to have computable type if any semicomputable homeomorphic copy of that space is actually computable. This study builds upon the work of Miller\, who demonstrated that finite-dimensional spheres have computable type\, and Iljazović and other authors\, who extended this property to various spaces\, including compact manifolds.\nTo begin\, we establish the equivalence between two distinct definitions of computable type present in the literature\, involving metric spaces and Hausdorff spaces\, respectively. We contend that the stronger\, relativized version of computable type exhibits more favorable properties and lends itself well to topological analysis. Consequently\, we derive characterizations of  » strong computable type «  in purely topological terms as well as the descriptive complexity of topological invariants.\n\nIt naturally leads to our second objective\, is to the study of the expressive power of topological invariants of low descriptive complexity and their ability to differentiate between spaces. Specifically\, we investigate two families of low descriptive complexity topological invariants that capture the extensibility and null-homotopy of continuous functions. Using this framework\, we revisit previous findings on computable type and discover new insights. Notably\, we identify the complexity of the finite topological graph separation problem.\nLastly\, our third objective revolves around applying homology theory to study what we term the  » surjection property «  which characterizes the computable type property. For instance\, we prove that a finite simplicial complex has (strong) computable type if and only if the star at each vertex satisfies the surjection property. Furthermore\, the reduction to homology implies that the computable type property is decidable\, for finite simplicial complexes of dimension at most 4.\nJury\nPhD Advisors: \n\nMathieu HOYRUP\, INRIA\, Nancy\nEmmanuel JEANDEL\, Université de Lorraine\, Nancy\n\nReviewers: \n\nOlivier BOURNEZ\, École Polytechnique\, LIX\, Paris\nVasco BRATTKA\, University of the Bundeswehr Munich\, Germany & University of Cape Town\, South Africa\n\nExaminers: \n\nNathalie AUBRUN\, CNRS\, Paris\nLaurent BIENVENU\, CNRS\, Bordeaux\nMonique TEILLAUD\, INRIA\, Nancy\n\nInvited members: \n\nPierre GUILLON\, CNRS\, Marseille
URL:https://www.loria.fr/event/phd-defense-djamel-eddine-amir-mocqua/
LOCATION:C005
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20231013T140000
DTEND;TZID=Europe/Paris:20231013T160000
DTSTAMP:20231011T071659Z
CREATED:20231011T071416Z
LAST-MODIFIED:20231011T071659Z
UID:23084-1697205600-1697212800@www.loria.fr
SUMMARY:Soutenance de thèse de Nacira Abbas (Orpailleur)
DESCRIPTION:Nacira Abbas (Orpailleur) soutiendra sa thèse intitulée « Analyse formelle de concepts pour la découverte de clés de liage dans le web des données »\, le 13 octobre à 14 h en salle A008. \nRésumé :\nLe Web des données est un espace de données global qui peut être considéré comme une couche supplémentaire au-dessus du Web des documents. Le liage des données est la tâche de découverte des liens d’identité entre les ensembles de données RDF (Resource Description Framework) sur le Web des données. Nous nous intéressons à une approche spécifique pour le liage des données\, qui repose sur les “clés de liage”. Cette clé a la forme de deux ensembles de paires de propriétés associées à une paire de classes. \nJury\nRapporteurs : \n\nFatiha Saïs\, Université Paris Saclay\nFayçal Hamdi\, Conservatoire national des arts et métiers\n\nExaminateurs : \n\nJérôme David\, Université de Grenoble\nLuis Galárraga\, IRISA Rennes\nMathieu d’Aquin\, Université de Lorraine\nSébastien Ferre\, Université de Rennes\nCassia Trojahn\, Université de Toulouse\n\nDirecteur de thèse : \n\nAmedeo Napoli\, Université de Lorraine
URL:https://www.loria.fr/event/soutenance-de-these-de-nacira-abbas-orpailleur/
LOCATION:A008
CATEGORIES:Soutenance
END:VEVENT
END:VCALENDAR