BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.17.5//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:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20221007T100000
DTEND;TZID=Europe/Paris:20221007T120000
DTSTAMP:20221004T063505Z
CREATED:20221004T063505Z
LAST-MODIFIED:20221004T063505Z
UID:17044-1665136800-1665144000@www.loria.fr
SUMMARY:PHD Defense: Nicolas Lasolle (K)
DESCRIPTION:Nicolas Lasolle (K Team) will defend his thesis on Friday\, 7th October at 10 am at Loria. \nHis thesis is entitled « Un système d’interrogation flexible pour le Web sémantique : application à la correspondance d’Henri Poincaré ». \nRésumé \nDe nombreux travaux historiques portent sur la vie et l’œuvre scientifique d’Henri Poincaré (1854-1912)\, notamment au travers de l’étude et de la publication du corpus de sa correspondance. Des travaux numériques s’appuyant sur le Web sémantique visent à offrir de nouveaux outils aux chercheurs étudiant ce corpus. Un constat est qu’il est parfois difficile pour les historiens de formuler des requêtes pour retrouver des données intéressantes. Ce travail de recherche propose un système d’interrogation capable de guider les utilisateurs en leur suggérant de nouveaux critères de recherches. Ces suggestions s’appuient sur des règles exploitant les connaissances historiques du corpus. Au travers de l’utilisation de ce système\, réutilisable dans d’autres contextes\, ces travaux s’interrogent également sur l’évolution des pratiques de recherche en histoire\, et tendent à illustrer comment un tel système d’interrogation flexible peut encourager la découverte de connaissances. \nAbstract \nNumerous historical works are devoted to the life and the scientific work of Henri Poincaré (1854-1912)\, in particular through the study and the publication of his correspondence. Digital work based on Semantic Web intends to offer new tools for researchers studying this corpus. One observation is that it is sometimes difficult for historians to formulate queries to find relevant data. This research work proposes a query system guiding users by suggesting new search criteria. These suggestions are based on rules exploiting corpus historical knowledge. Through the use of this system\, which can be reused in other contexts\, this work also questions the evolution of research practices in history and aims at illustrating how such a flexible query system can stimulate knowledge discovery.
URL:https://www.loria.fr/event/phd-defense-nicolas-lasolle-k/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20221007T150000
DTEND;TZID=Europe/Paris:20221007T170000
DTSTAMP:20221005T093914Z
CREATED:20221005T085359Z
LAST-MODIFIED:20221005T093914Z
UID:17055-1665154800-1665162000@www.loria.fr
SUMMARY:PHD Defense: Hans-Jörg Schurr (Veridis)
DESCRIPTION:Hans-Jörg Schurr (Veridis Team) will defend his thesis on Friday\, 7th October at 3pm at Loria. His thesis is entitled « Stronger SMT Solvers for Proof Assistants: Proofs\, Quantifier Simplification\, Strategy Schedules ». \nAbstract:\nThis thesis presents three contributions that have the same underlying\nmotivation: to improve the utility of SMT solvers as backends for proof\nassistants. SMT solvers are automated theorem provers that combine\npropositional reasoning with theories.  Proof assistants are tools\nthat empower users to write formally checked proofs. To help the user\,\nproof assistants can provide automation by integrating with automated\ntheorem provers. \nProof assistants typically accept only proofs that are constructed in\nthe trusted kernel of the assistant.  The first contribution addresses\nthe reconstruction of SMT proofs in a proof assistant.  We present the\nAlethe proof format for SMT solvers.  It improves and unifies previous\nwork on proof generation from SMT solvers.  The vast majority of these\nimprovements were informed by the experience provided by a concrete effort\nof reconstructing Alethe proofs in the proof assistant Isabelle. \nSMT problems generated by proof assistants usually really heavily\non quantifiers.  Since SMT solvers excel on quantifier free problems\,\nthey use quantifier instantation to generate quantifier free formulas.\nThe second contribution improves quantifier instantiation. It is a\nunification-based method that augments the problem with shallow quantified\nformulas obtained from assertions with nested quantifiers. These\nnew formulas help unlocking the regular instantiation techniques\, but\nparsimony is necessary since they might also be misguiding.  The method\nallows the solver to prove more formulas\, faster. \nThe heuristics of an SMT solvers can be parameterized.  A specific\nparameterization of the entire solver is called a strategy\, and the best\nstrategy usually differs from problem to problem. The third contribution\nis a toolbox to work with strategy schedules.  A key component of the\ntoolbox is a tool that uses integer programming to generate strategy\nschedules.  Beyond this tool\, the toolbox also contains tools for\nsimulating and analyzing schedules. We used the toolbox to select\nstrategies that solve many problems generated by Isabelle. \nJury:\n\nDirecteurs de thèse : Stephan MERZ (Université de Lorraine\, Inria)\, Pascal FONTAINE (Université de Liège)\, Jasmin BLANCHETTE (Vrije Universiteit Amsterdam)\nRapporteurs : Frédéric BLANQUI (Université Paris Saclay\, Inria)\, Elaine PIMENTEL (University College London)\nExaminateurs : Chantal KELLER (Université Paris Saclay\, LMF)\, Christophe RINGEISSEN (Université de Lorraine\, Inria)\, Cesare TINELLI (The University of Iowa)
URL:https://www.loria.fr/event/phd-defense-hans-jorg-schurr-veridis/
LOCATION:Loria
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20221011T140000
DTEND;TZID=Europe/Paris:20221011T170000
DTSTAMP:20221010T074456Z
CREATED:20221010T074456Z
LAST-MODIFIED:20221010T074456Z
UID:17078-1665496800-1665507600@www.loria.fr
SUMMARY:PhD Defense: Abir Laraba (Resist)
DESCRIPTION:Abir Laraba will defend her thesis on Tuesday\, 11th October at 2 pm in room A008. \nHer thesis is entitled « Protocol Abuse Mitigation In SDN Programmable Data Planes ». \n\nAbstract:\n\nThe emergence of the Software-Defined Networking paradigm has supported the development of new network monitoring scheme thanks to network programmability. The first purpose of SDN is to centralize the network intelligence at the control plane with a stateless data plane (i.e.\, network elements\, switches). As a result\, the network monitoring functions require the help of the remote controller or the extension of existing data plane protocols. In recent years\, efforts have been made to make the data plane more programmable and stateful\, permitting customized functions deployment and offloading many applications to network elements (e.g.\,forwarding devices). For example\, the data plane programmability can be enabled by the P4 language that defines how packets are processed in a switch pipeline and supports stateful packet processing. However\, P4 does not provide intuitive stateful abstractions to model behavioral attacks. Therefore\, rethinking on the general abstractions to model and track a complex and stateful behavior in the data plane is necessary. To exploit the opportunities offered by a programmable data plane\, including stateful and real-time packet processing\, we need models which are simple enough to be deployed on a programmable switch with respect to the existing primitives that remain limited and\, at the same time\, capable of capturing a complex behavior.\n\n\nMeantime\, attackers exploit vulnerabilities present in protocols used in the core of the Internet\, such as TCP and DNS. However\, the proposed solutions to detect these attacks require modifying the protocol implementation at the end-hosts or having a negative impact on benign flows. Therefore\, patching at the scale of the Internet would require much time for deployment\, such as in the case of DNSSEC. In this thesis\, we address these shortcomings by designing a security function (i.e.\, an attack mitigation approach) that can be deployed in an SDN programmable data plane. We propose an abstraction based on an Extended Finite State Machine (EFSM) to model an attack behavior. To detect sophisticated attacks such as multi-step attacks\, we extend it with Petri Net to synchronize the detection of a set of attack steps. We present how these models can be mapped to P4 primitives so that we can detect and react against an attack within the network. We present three attacks from Layer-3\, Layer-4\, and Layer-7 of the OSI model\, namely the ECN protocol abuse\, the Optimistic ACK attack\, and the recent DNS multi-step cache poisoning attack. Our approach does not require modifying protocol implementation at the end hosts. Besides\, our solution leverages programmable data planes\, enabling flow tracking and reaction against attacks in real-time within the network
URL:https://www.loria.fr/event/phd-defense-abir-laraba-resist/
LOCATION:A008
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20221020T140000
DTEND;TZID=Europe/Paris:20221020T170000
DTSTAMP:20221014T072047Z
CREATED:20221014T072047Z
LAST-MODIFIED:20221014T072047Z
UID:17094-1666274400-1666285200@www.loria.fr
SUMMARY:PhD defense: Anna Liednikova (Synalp)
DESCRIPTION:Anna Liednikova (Synalp team) will defend her thesis on Thursday\, October 20th at 2 pm in room C005.\nHer thesis is entitled Human-Machine Dialogue in the Medical Field. Using Dialogue to Collect Important Patient Information.\n\nJury composition\n\n– Reviewers :\nAnne Vilnat\, Professor\, Université Paris-Saclay\, France\nSandra Bringay\, Professor\, Université Paul-Valéry Montpellier 3\, France\n– Examiners :\nYannick Toussaint\, Professor\, Université de Lorraine\, France\n– Thesis Director :\nClaire Gardent\, Research Director\, CNRS\, LORIA\, France\n– Invited :\nPhilippe Jolivet\, CEO et co-founder d’ALIAE\, France\n\nAbstract:\n\nHealthcare dialogue systems are developed to automate and simplify routine tasks such as collecting patient information or making an appointment. Often\, these models are trained to mimic doctor-patient interaction as their constant availability is a key feature for patients\, in particular with chronic conditions. Chronic patients regularly visit their doctor and are asked to repeatedly fill in standardized questionnaires\, which may trigger repetitive\, incorrect input. In collaboration with the ALIAE company\, we focus on developing novel dialogue models which can maintain a conversation with the patient while collecting both specific answers to a set of pre-defined questions and serendipitous information about the patient condition that we conjecture\, may be useful for the patient treatment. Specifically\, we propose a dialogue system and automatic questionnaire filling pipeline that should complement existing routine between doctors and patients.\n    \nThis thesis makes three main contributions. We first propose an approach to flexibly guide the user through a pre-defined medical decision tree using naturally written user input. This allows the health-bot to collect  answers to a set of pre-defined questions. To improve user engagement\, increase the probability of all  required medical topics being addressed and allow for further information about the patient condition to be collected\, we then  extend this initial model  by  integrating additional bots designed to handle health-related follow-up questions and maintain small talk. Finally\, we introduce novel zero-shot Question Answering models and pre-processing techniques so that standard\, clinical questionnaires can be automatically filled in based on the content of collected human-bot dialogues.
URL:https://www.loria.fr/event/phd-defense-anna-liednikova-synalp/
LOCATION:C005
CATEGORIES:Soutenance
END:VEVENT
END:VCALENDAR