BEGIN:VCALENDAR VERSION:2.0 PRODID:-//LORIA - ECPv6.16.3//NONSGML v1.0//EN CALSCALE:GREGORIAN METHOD:PUBLISH X-WR-CALNAME:LORIA 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:20200329T010000 END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET DTSTART:20201025T010000 END:STANDARD 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 END:VTIMEZONE BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210304T150000 DTEND;TZID=Europe/Paris:20210304T160000 DTSTAMP:20260608T130213 CREATED:20210302T154719Z LAST-MODIFIED:20210302T154719Z UID:11648-1614870000-1614873600@www.loria.fr SUMMARY:Séminaire D3: Performance and security in the Internet DESCRIPTION:Séminaire donné par : Baptiste Jonglez\nInria / Laboratoire d’Informatique de Grenoble\nThe Internet has been the dominant networking model for decades thanks to its robust design\, low cost\, and ability to grow organically. However\, this comes with a major tradeoff: no actor can claim to have complete visibility or control on end-to-end network paths. This lack of end-to-end control impacts both performance and security\, which helps to explain why they are both long-lasting challenges in the Internet. \nEnd-to-end performance is hard to understand or improve without visibility into the complete network path; similarly\, network security is hard to ensure in a distributed network\, because a wide variety of actors would need to agree on protocols and best practices. \nThis presentation will detail two recent works\, each related to one of\nthese two challenges: end-to-end network performance and network security. URL:https://www.loria.fr/event/seminaire-d3-performance-and-security-in-the-internet/ LOCATION:online END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210308T100000 DTEND;TZID=Europe/Paris:20210308T113000 DTSTAMP:20260608T130213 CREATED:20210304T195503Z LAST-MODIFIED:20210304T195532Z UID:11667-1615197600-1615203000@www.loria.fr SUMMARY:D3 seminar: Rémy Grünblatt and Mourad Dridi DESCRIPTION:Next Department 3 seminar will take place on Monday\, 8th March at 10am with two presentations. \n10h00: De l’évaluation des performances Wi-Fi à la mobilité contrôlée pour les réseaux de drones\, par Rémy Grünblatt (INRIA Inria Lille – Nord Europe) \nFrom Wi-Fi performance evaluation to controlled mobility for drone networks \nMobility in telecommunication networks is often seen as a hassle that needs to be dealt with: a mobile wireless device has to adapt is trans-mission parameters in order to remain connected to its counterpart(s)\,as the channel evolves with the device’s movements. Drones are no exception. In this presentation\, I’ll show how controlled mobility can be used to increase the performance of a drone network\, with a focus on IEEE 802.11 networks and small multi-rotor drones.\nI will first describe how mobility is partially dealt with in 802.11 networks\, that is to say using rate adaptation mechanisms\, and I’ll present the rate adaptation algorithm used in the Intel Wi-Fi chipsets\, also used in the Intel Aero Drone\, which I reverse engineered. The study of this rate adaptation algorithm\, thanks to its implementation in the network simulator NS-3\, allows its comparison against other well-known algorithms\, and highlights how big the impact of such algorithms is\, for drone networks.\nI will then present a controlled mobility solution which leverages the antenna radiation pattern of the drones. This algorithm is evaluated thanks to a customized simulation framework for antenna and drone simulation\, based on NS-3. This solution\, which works with any rate adaptation algorithm\, is distributed\, and do not require a global coordination that would be costly. It also does not require a full and complete control of the drone mobility as existing controlled mobility solutions require\, which makes this solution compatible with various applications. \n10h40: Robustesse des architectures pluri-cœurs et NoCs\, par Mourad Dridi (Université Polytechnique Hauts-de-France\, INSA\, Valenciennes) \n\nMon projet de recherche va porter principalement sur l’applicabilité de la théorie de l’ordonnancement\ntemps réel dans la conception et l’implémentation des systèmes embarqués.\nLes applications d’aujourd’hui demandent un fonctionnement en temps-réel\, pour fournir des résultats\ndans des délais bien précis\, comme la navigation par GPS\, le codage du son dans un téléphone cellulaire\, la\ncommande du gouvernail d’un avion\, la vidéo surveillance active\, l’ABS d’une voiture\, …\n\nMon objectif est donc de développer des méthodes\, techniques et outils pour la conception\, la vérification et la réalisation\nde systèmes informatiques temps réel. Afin d’atteindre cet objectif\, je voudrais exercer des activités de recherche dans les sujets suivants :\n\n\nLes systèmes temps réel multi-critiques et les systèmes temps réel à criticité mixte\nLe problème du placement dans les architectures pluri-cœurs\nL’ordonnancement des communications dans les architectures pluri-cœurs (NoCs\, SpaceWire …) URL:https://www.loria.fr/event/d3-seminar/ CATEGORIES:Séminaire END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210311T084500 DTEND;TZID=Europe/Paris:20210311T100000 DTSTAMP:20260608T130213 CREATED:20210219T145520Z LAST-MODIFIED:20210219T145520Z UID:11609-1615452300-1615456800@www.loria.fr SUMMARY:Soutenance HDR : Laure Buhry (NeuroRhythms) DESCRIPTION:Laure Buhry\, maître de conférences dans l’équipe NeuroRhythms\, soutiendra son Habilitation à Diriger des Recherches\, le jeudi 11 mars à 8h45. \nSon HDR est intitulée « La musique du cerveau : modélisation des mécanismes de genèse et\nmaintien des rythmes oscillatoires neuronaux ». \nJury : \nRapporteurs : \n\nM. Frédéric ALEXANDRE DR INRIA\, INM\, Bordeaux\nM. Boris GUTKIN DR CNRS\, ENS\, Paris\nM. Paul-Antoine SALIN\, DR CNRS\, CRNL\, Lyon\n\nExaminateurs : \n\nMme Valérie LOUIS DORR\, PU\, ENSEM-UL-CRAN\, Nancy\nM. Louis MAILLARD\, PU-PH\, CHRU-CRAN\, Nancy\nM. Julien MODOLO\, CR INSERM\, LTSI\, Rennes\n\nInvité : \n\nM. Raymund SCHWAN\, PU-PH\, CPN-INSERM\, Nancy-Strasbourg\n\nRésumé :\nLa compréhension des mécanismes neuronaux sous-jacents aux fonctions cognitives chez le sujet sain et en fonctionnement pathologique requiert la collaboration de plusieurs disciplines : les neurosciences fondamentales\, la médecine\, dont la neurologie et la psychiatrie\, mais également la modélisation mathématique et la simulation informatique. Les travaux présentés ici\, à la croisée de ces différents domaines\, concernent les aspects de modélisation et de simulation multi-échelles de l’activité électrique neuronale. Nous nous intéressons notamment à l’influence des propriétés intrinsèques microscopiques et aux interactions neuronales mésoscopiques dans la génération des oscillations observées\, au niveau macroscopique\, dans les enregistrements physiologiques. Cette approche vise à élucider des mécanismes physiologiques du fonctionnement cérébral\, à compléter ou orienter la démarche expérimentale en biologie et à tester des hypothèses aujourd’hui encore inaccessibles à l’observation expérimentale. En termes applicatifs\, nous abordons notamment la modélisation et la simulation de l’activité de : la formation hippocampique – structure impliquée dans la formation de la mémoire – saine et dans les épilepsies du lobe temporal mésian\, pendant la veille et le sommeil lent profond ; des neurones hippocampiques en présence d’un anesthésique\, le propofol ; et des ganglions de la bases dans la maladie de Parkinson. Ces travaux ayant mis en évidence des mécanismes communs aux différentes pathologies étudiées\, le projet de recherche futur s’oriente\, toujours sous l’angle de la modélisation et de la simulation de l’activité neuronale ou des cellules à activité rythmique\, vers le rôle de l’homéostasie ionique et l’expression de canaux ioniques spécifiques dans les pathologies neurologiques et psychiatriques. URL:https://www.loria.fr/event/soutenance-hdr-laure-buhry-neurorhythms/ END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20210316 DTEND;VALUE=DATE:20210317 DTSTAMP:20260608T130213 CREATED:20210303T142422Z LAST-MODIFIED:20210303T142722Z UID:11658-1615852800-1615939199@www.loria.fr SUMMARY:GT GDMM - Journées de Géométrie Discrète et Morphologie Mathématique DESCRIPTION:La journée du GT GDMM aura lieu le 16 mars 2021 en ligne. \nLa journée du Groupe de Travail de Géométrie Discrète et Morphologie Mathématique des groupements de recherche IM et IGRV est l’occasion pour les enseignants-chercheurs\, chercheurs\, doctorants de se rencontrer\, d’échanger sur les travaux les plus récents\, d’initier de nouvelles collaborations sur tous les thèmes de la géométrie discrète et de la morphologie mathématique. \nElle précède la journée plénière GdR IGRV le 17 mars 2021. \nDates importantes :\n\nJournées du GTMG 2018 : le 16 Mars 2021.\nOuverture des inscriptions : jusqu’au lundi 15 Mars 2021.\nProposition d’exposé (Titre et résumé) : avant le 10 Mars 2021.\n\nComité d’organisation :\nPhuc Ngo\, Isabelle Debled-Rennesson\, Philippe Even et Eric Domenjoud (équipe ADAGIo). \nToutes les informations sur ces deux événements sur le site du GT GDMM. URL:https://www.loria.fr/event/gt-gdmm-journees-de-geometrie-discrete-et-morphologie-mathematique/ CATEGORIES:Conférence END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210317T093000 DTEND;TZID=Europe/Paris:20210317T110000 DTSTAMP:20260608T130213 CREATED:20210312T122646Z LAST-MODIFIED:20210312T122646Z UID:11732-1615973400-1615978800@www.loria.fr SUMMARY:PhD defense: Daryna Panicheva DESCRIPTION:Daryna Panicheva (Magrit) will defend here thesis on Wednesday\, March 17th at 9:30. \nThe defense will be held in English and is entitled « Image-based mitral valve modeling for biomechanical applications« . Her thesis is supervised by Marie-Odile Berger and Pierre-Frédéric Villard (Magrit). \nAbstract:\nIn this thesis we aimed to develop methods for the realistic simulation of the mitral valve behavior using image-based geometry. To achieve this goal\, the segmentation of valve components was guided by the nature of the chosen biomechanical model. \nMethods for the valve components segmentation and their integration into the model have been proposed. We focused on automatic chordae extraction as it would improve the simulation reproducibility on various data examples\, and thus help to advance towards patient-based clinical applications. \nThe procedure proposed for the automatic extraction of the chordae consists of three steps. First\, the segmentation of the chordae is obtained with the method based on the topological properties of the structures. Then\, the representation of the geometry in a form of trees of  connected line segments is extracted using the tracking approach combined with the local fitting of a cylindrical model. In order to make the geometry resulting from these methods consistent with the biomechanical model\, the final stage of the chordae structure optimization is applied. In particular\, the optimization makes it possible to reduce slack in the chordae and to correct false topological configurations by taking into account mechanical and anatomical considerations associated with image data. \nWe have proposed a validation metric for the segmentation results based on the graph similarity. With this metric correspondences between the chordae obtained with our automatic method and those resulting from the manual segmentation are defined\, as well as the quality of the segmentation is assessed. \nWe then demonstrated the application of the extracted chordae geometry in the biomechanical simulation of the closed valve state. The consistency of the reproduced behavior was verified by comparing the results obtained with the chordae from our automatic procedure and the ground truth chordae. The bulging volume and the mechanical stress distribution have been used as quantitative criteria. The coherence of the simulation was also analyzed on a modeled pathological case with ruptured chordae. \n\nKey-words: mitral valve\, image-based modeling\, segmentation\, biomechanical simulation.\n\nCommittee:\nReviewers: Michel Desvignes\, Professeur\, Grenoble INP\nMireille Garreau\, Professeur\, Université de Rennes\n\nExaminers: Jacques Felblinger\, Professeur\, Université de Lorraine\nYohan Payan\, Directeur de recherche  CNRS\, Grenoble\n  URL:https://www.loria.fr/event/phd-defense-daryna-panicheva/ CATEGORIES:Soutenance END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210318T110000 DTEND;TZID=Europe/Paris:20210318T120000 DTSTAMP:20260608T130213 CREATED:20210317T091328Z LAST-MODIFIED:20210317T091328Z UID:11760-1616065200-1616068800@www.loria.fr SUMMARY:MALOTEC Webinar by Pierre-Alexandre Murena: Perspectives on Minimum Complexity Analogies DESCRIPTION:Analogies are 4-ary relations of the form “A is to B as C is to D”. When A\, B and C are fixed\, we call analogical equation the problem of finding the correct D. Even though this task has been shown to be simple for the human cognition\, it remains extremely challenging for artificial agents. In this presentation\, we introduce our recent advances in solving morphological analogies on words based on a principle of minimum of complexity. The idea of our method is to find a transformation from A to B which also applies to C and is maximally simple to describe algorithmically. We will show which new perspectives this principle of minimum complexity can open for the field of analogical reasoning: For that purpose\, we demonstrate the flexibility of our approach toward various related domains\, such as interactive AI\, case-based reasoning\, AI assistance or transfer learning. As a complement\, we will discuss the underlying assumptions of our framework as well as the algorithmic challenges of such an approach\, and show what these limitations imply for the application of this method to other problems. \n  \n\nAbout the speaker:\nPierre-Alexandre Murena is a member of the Probabilistic Machine Learning group in Aalto University (Finland). His research efforts focus on improving interactions between humans and AI. He also made noteworthy contributions to the understanding of analogical reasoning. URL:https://www.loria.fr/event/malotec-webinar-by-pierre-alexandre-murena-perspectives-on-minimum-complexity-analogies/ LOCATION:online END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20210323 DTEND;VALUE=DATE:20210327 DTSTAMP:20260608T130213 CREATED:20210312T122217Z LAST-MODIFIED:20210312T122217Z UID:11730-1616457600-1616803199@www.loria.fr SUMMARY:Journées nationales de l'informatique Mathématique du GDR-IM DESCRIPTION:Les Journées Nationales de l’Informatique Mathématique (JNIM) sont organisées chaque année par le GDR IM (Informatique Mathématique). C’est une occasion d’information et d’échange annuelle entre les chercheurs du GDR et de la discipline. Elles auront lieu du 23 au 26 mars. \nInscriptions gratuites et obligatoires avant le 18 mars. \nProgramme complet sur le site de la conférence. URL:https://www.loria.fr/event/journees-nationales-de-linformatique-mathematique-du-gdr-im/ CATEGORIES:Séminaire END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210325T110000 DTEND;TZID=Europe/Paris:20210325T120000 DTSTAMP:20260608T130213 CREATED:20210323T143331Z LAST-MODIFIED:20210323T143513Z UID:11820-1616670000-1616673600@www.loria.fr SUMMARY:MALOTEC Séminaire : Explainability for Sequential Decision-Making DESCRIPTION:Machine learning has been used to aid decision-making in several domains\, from healthcare to finance. Understanding the decision process of ML models is paramount in high-stakes decisions that impact people’s lives\, otherwise\, loss of control and lack of trust may arise. Often\, these decisions have a sequential nature. For instance\, the transaction history of a credit card must be considered when predicting the risk of fraud of the most recent transaction Although RNNs are state-of-the-art models for many sequential decision-making tasks\, they are perceived as black-boxes\, creating a tension between accuracy and interpretability. While there has been considerable research effort towards developing explanation methods for ML\, recurrent models have received relatively much less attention. Recently\, Lundberg and Lee unified several methods under a single family of additive feature attribution explainers. From this family\, KernelSHAP has seen a wide adoption throughout the literature; however\, this explainer is unfit to explain models in a sequential setting\, as it only accounts for the current input not the whole sequence. In this work\, we present TimeSHAP\, a model-agnostic recurrent explainer that builds upon KernelSHAP and extends it to sequences. TimeSHAP explains recurrent models by computing feature-\, timestep-\, and cell-level attributions\, producing explanations at both the feature and time axes. As sequences may be arbitrarily long\, we further propose two pruning methods that are shown to dramatically decrease TimeSHAP’s computational cost and increase its reliability. We validate TimeSHAP by using it to explain predictions of two RNN models in two real-world fraud detection tasks\, obtaining relevant insights into these models and their predictions. \n\n\nSpeaker:\nJoão Bento\, Research Data Scientist at Feedzai working on explainability for Machine Learning models.\n\nOn TEAMS. More information at:\nhttps://malotec.loria.fr URL:https://www.loria.fr/event/malotec-seminaire-explainability-for-sequential-decision-making/ LOCATION:online CATEGORIES:Séminaire END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210325T160000 DTEND;TZID=Europe/Paris:20210325T170000 DTSTAMP:20260608T130213 CREATED:20210304T173118Z LAST-MODIFIED:20210316T154038Z UID:11664-1616688000-1616691600@www.loria.fr SUMMARY:DigiTrust Webinar: Alfredo Cuzzocrea DESCRIPTION:The first webinar of LUE IMPACT project DigiTrust will take place on Thursday\, 25th March at 4pm. \nProfessor Alfredo Cuzzocrea\, Excellence Chair in Computer engineering financed by DigiTrust\, will give a presentation entitled “Privacy-Preserving Big Data Management and Analytics in Distributed Environments: Models\, Issues\, Proposals” \nThe webinar will take place on Teams. \nAbstract: \nNowadays\, big data management and analytics is gaining momentum within the research community. Basically\, the main issue with big data management concerns with effectively and efficiently managing massive big data repositories for a wide variety of typical data management tasks\, such as representation\, querying\, indexing\, partitioning\, and so forth. On the other hand\, big data analytics concerns with extracting useful\, actionable knowledge from big data repositories for decision making purposes\, by extending classical approaches inherited from decades of data mining and machine learning research. In this so-delineated context\, the issue of supporting privacy-preserving big data management and analytics plays a first-class role\, especially with respect to the wide class of emerging big data application scenarios\, which range from social networks to bio-informatics\, from sensors networks to web recommendation tools\, from e-science systems to e-government systems\, and so forth. In all these applicative settings\, protecting the privacy of sensitive information\, for instance personal data or aggregate data\, can be clearly intended as an enabling technology. Distributed environments are the natural humus for collocating privacy-preserving big data management and analytics tasks\, including the astonishing raise of blockchain technology. Among others\, Cloud systems play the major role\, even stirred-up by recent technological advancements that have really enhanced the ICT industry at now. More and more today\, real-life Cloud-based applications\, such as smart cities\, intelligent transportation systems\, marketplace tools and so forth\, are indeed posing new challenges to privacy-preserving big data research\, thus contributing to improve the scientific area. \nThis seminar will explore the research challenge represented by supporting privacy-preserving big data management and analytics in distributed environments\, by exploring models and issues\, and describing some proposed solutions. In particular\, the seminar will consider the special case of supporting privacy-preserving OLAP analytics in distributed environments. This kind of big data analytics tools predicates the definition of multidimensional metaphors to be embedded into the analytics phase\, and supports the achievement of richer actionable knowledge (prone to decision making) to be extracted from distributed big data repositories. On the other hand\, the issue of supporting privacy preservation within OLAP analytics is still an open research problem\, whit many advancements still to be achieved. According to this consideration\, an innovative privacy-preserving OLAP analytics in distributed environments approach is presented in this seminar\, along with the proposal of some interesting extensions that are at now under evolution. URL:https://www.loria.fr/event/digitrust-webinar/ CATEGORIES:Séminaire END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210325T180000 DTEND;TZID=Europe/Paris:20210325T193000 DTSTAMP:20260608T130213 CREATED:20210225T122258Z LAST-MODIFIED:20210225T122349Z UID:11620-1616695200-1616700600@www.loria.fr SUMMARY:6eme UX-Forum Exosquelettes : pour l’univers des métiers de soins et de santé DESCRIPTION:Le Cercle Entreprises et Santé organise le 6eme UX-Forum Exosquelettes. Cet évènement vise à faire dialoguer les principaux acteurs concernés par le développement de ces technologies dans les milieux de la santé. \nDans ce cadre\, Séréna Ivaldi et Pauline Maurice\, chargées de recherche (INRIA et CNRS respectivement) au Loria présenteront leurs expériences au sein du projet ExoTurn. \nCe forum aura lieu en ligne le 25 mars 2021 à 18h. Pour accéder à la visioconférence\, le formulaire d’inscription est disponible sur ce lien. URL:https://www.loria.fr/event/6eme-ux-forum-exosquelettes-pour-lunivers-des-metiers-de-soins-et-de-sante/ LOCATION:online CATEGORIES:Forum END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210325T183000 DTEND;TZID=Europe/Paris:20210325T203000 DTSTAMP:20260608T130213 CREATED:20210301T160631Z LAST-MODIFIED:20210310T144619Z UID:11638-1616697000-1616704200@www.loria.fr SUMMARY:Trois doctorants sélectionnés pour #MT180 2021 ! DESCRIPTION:La finale régionale de Ma Thèse en 180 secondes organisée par l’Université de Lorraine aura lieu le jeudi 25 mars à 18h30. Parmi les onze participants\, trois sont doctorants au sein du Loria : Guilherme Alves Da Silva (Orpailleur)\, Justine Basselin (Pixel) et Jessica Colombel (Larsen)… Tous nos encouragements à eux ! \n\n \n \n \n \n \n \n \n \n \n \n \n \n\nCompte-tenu de la crise sanitaire\, l’évènement se déroulera à huis clos. Le public est invité à regarder la diffusion en direct sur la chaîne YouTube de l’Université de Lorraine. Votez pour votre candidat(e) préféré(e) en vous inscrivant ici ! URL:https://www.loria.fr/event/trois-doctorants-selectionnes-pour-mt180-2021/ LOCATION:online CATEGORIES:Manifestation END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210401T130000 DTEND;TZID=Europe/Paris:20210401T143000 DTSTAMP:20260608T130213 CREATED:20210319T134650Z LAST-MODIFIED:20210330T154147Z UID:11789-1617282000-1617287400@www.loria.fr SUMMARY:Colloquium Loria : Mathieu d'Aquin DESCRIPTION:Mathieu d’Aquin\, Professor of Informatics specialised in data analytics and semantic technologies at the Data Science Institute and the Insight Centre for Data Analytics of the National University of Ireland Galway\, is the next speaker for Loria’s colloquium. \nThe colloquium will take place on Teams on Thursday\, April 1st at 1pm\, with a presentation entitled « Data and knowledge as commodities ». \nAbstract: While data has become increasingly available in the last few years\, those data and the models used to analyse them are becoming less and less interpretable. In other words\, the challenge of turning such vast amounts of data into exploitable knowledge is still present. In this presentation\, I aim to describe ongoing efforts to address this challenge by combining current data mining and machine learning techniques with traditional\, symbolic methods for artificial intelligence based on explicit knowledge representations and inferences. In particular\, taking examples from projects in education\, smart cities and the digital humanities\, I show how the legacy of the semantic web\, especially web-scale knowledge graphs and ontologies\, can support intelligent methods for data understanding and the interpretability of machine learning models. URL:https://www.loria.fr/event/colloquium-loria-mathieu-daquin/ CATEGORIES:Colloquium Loria END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210402T140000 DTEND;TZID=Europe/Paris:20210402T163000 DTSTAMP:20260608T130213 CREATED:20210325T092335Z LAST-MODIFIED:20210325T092633Z UID:11837-1617372000-1617381000@www.loria.fr SUMMARY:We are the robots - Basic Bot\, performance théâtre et robotique DESCRIPTION:Rendez-vous le vendredi 2 avril à 14h pour « Basic Bot »\, une performance théâtre et robotique proposée dans le cadre de l’atelier Artem « We Are The Robots »\, avec une pièce de théâtre numérique suivie d’une conférence-débat en direct sur la page Facebook de Mines Nancy. \nUn événement conçu par les élèves de Mines Nancy\, d’ICN Business School et de l’ENSAD.\nDirection scientifique et technique : Patrick Hénaff\, enseignant-chercheur Mines Nancy / Loria\, et Alain Dutech\, chargé de recherche Inria au Loria.\nDirection artistique : Raphaël Gouisset\, Collectif Les Particules \n \nL’intrigue du spectacle a lieu durant le confinement lorsque les étudiants sont livrés à eux-mêmes et se retrouvent seuls dans leur chambre. Ils décident alors de se distraire en cherchant des activités sur internet et découvrent le site BASIC BOT\, une salle de sport 3.0 où les étudiants suivent des coachs robots à travers des vidéos. Les robots se révèlent être plus ou moins doués de sentiments et de compréhension pour les accompagner dans cette période très singulière.  \nLe spectacle sera suivi d’un débat avec les étudiants du projet et des professionnels de la robotique et de l’intelligence artificielle : Raja Chatila (professeur\, directeur de l’ISIR)\, Nazim Fates (chargé de recherche Inria au Loria)\, Eloïse Dalin (doctorante dans l’équipe Larsen) pour répondre aux questions du public. \nPiloté par Patrick Henaff\, ce projet est un espace de travail transdisciplinaire\, entre composition artistique et programmation robotique. Il aborde les sujets de l’anthropomorphisme (attribution de caractéristiques du comportement humains ou de la morphologie humaine à des objets)\, de l’intelligence artificielle (IA)\, des questionnements sociétaux soulevés par la robotique et enfin\,  du rôle du roboticien et de son « pouvoir d’agir » dans une société où la robotique sera de plus en plus présente. Cet atelier est donc un travail collaboratif où les qualités et désirs de chaque participant se concrétisent pour parvenir à une réalisation commune. \nLe spectacle sera diffusé en live sur la page Facebook de Mines Nancy \nCe projet est une collaboration entre Mines Nancy\, ICN Business School\, l’ENSAD et un partenariat avec l’Alliance Artem et le Loria (CNRS\, Inria\, Université de Lorraine). Les robots de Mines Nancy ont été mis à disposition pour ce projet afin d’offrir un spectacle divertissant. URL:https://www.loria.fr/event/we-are-the-robots-basic-bot-performance-theatre-et-robotique/ CATEGORIES:Manifestation ATTACH;FMTTYPE=image/jpeg:https://www.loria.fr/wp-content/uploads/2021/03/Affiche-finale-scaled.jpg END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210409T110000 DTEND;TZID=Europe/Paris:20210409T120000 DTSTAMP:20260608T130213 CREATED:20210407T092250Z LAST-MODIFIED:20210407T092250Z UID:11971-1617966000-1617969600@www.loria.fr SUMMARY:MALOTEC Séminaire : Evaluating Local Explanation Methods on Ground Truth DESCRIPTION:Evaluating local explanation methods is a difficult task due to the lack of a shared and universally accepted definition of explanation. In the literature\, one of the most common ways to assess the performance of an explanation method is to measure the fidelity of the explanation with respect to the classification of a black box model adopted by an Artificial Intelligent system for making a decision. However\, this kind of evaluation only measures the degree of adherence of the local explainer in reproducing the behavior of the black box classifier with respect to the final decision. Therefore\, the explanation provided by the local explainer could be different in the content even though it leads to the same decision of the AI system. We propose an approach that allows to measure to which extent the explanations returned by local explanation methods are correct with respect to a synthetic ground truth explanation. Indeed\, the proposed methodology enables the generation of synthetic transparent classifiers for which the reason for the decision taken\, i.e.\, a synthetic ground truth explanation\, is available by design. Experimental results show how the proposed approach allows to easily evaluate local explanations on the ground truth and to characterize the quality of local explanation methods. \n\n\nSpeaker:\nRiccardo Guidotti\, Assistant Professor at the Department of Computer Science (University of Pisa) and a member of the Knowledge Discovery and Data Mining Laboratory (KDDLab).\n\nOn TEAMS. More information at:\nhttps://malotec.loria.fr URL:https://www.loria.fr/event/malotec-seminaire-evaluating-local-explanation-methods-on-ground-truth/ LOCATION:online CATEGORIES:Séminaire END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210415T160000 DTEND;TZID=Europe/Paris:20210415T170000 DTSTAMP:20260608T130213 CREATED:20210401T090802Z LAST-MODIFIED:20210401T090927Z UID:11954-1618502400-1618506000@www.loria.fr SUMMARY:DigiTrust Webinar : Enka Blanchard DESCRIPTION:The second webinar of LUE IMPACT project DigiTrust will take place on Thursday\, 15th April at 4pm. \nPostdoctoral Researcher Enka Blanchard\, working in the DigiTrust consortium\, will give a presentation entitled “Securing everyday voting with low-tech systems” \nThe webinar will take place on Teams. \nAbstract: \nVoting is often seen as a solemn activity\, with voters exercising their rights every few years in secure conditions. However\, many voting activities happen in much more common situations\, from company boardrooms to homeowners associations or employee breakrooms. Those votes often happen by raising one’s hand or at best writing down a name on a piece of paper and putting it into a hat. With the pandemic\, those votes have been harder to organise\, creating a vacuum for new systems to take hold\, and potentially presenting new opportunities.\n\nThe talk will start with an introduction to low-tech verifiable voting systems. We will then go over the impact of the pandemic and how it led us to propose a solution that is currently in use at the University of Maryland\, Baltimore County\, as well as the details of this low-tech (non-cryptographic) verifiable voting system. Finally\, I will discuss the implications this has not only for the development but more importantly for the deployment of new voting systems.\n\n\nThe talk is based on research I recently pursued with colleagues from UMBC and LaBRI. The relevant papers and preprints are available below:\n\nEnka Blanchard and Ted Selker. Origami voting: a non-cryptographic approach to transparent ballot verification. In VOTING – 5th Workshop on Advances in Secure Electronic\nVoting (https://hal.archives-ouvertes.fr/hal-02550738)\nEnka Blanchard\, Ryan Robucci\, Ted Selker\, and Alan T. Sherman. Phrase-verified voting: Verifiable low-tech remote boardroom voting. under review\nEnka Blanchard\, Sébastien Bouchard\, and Ted Selker. Visual secrets: A recognition-based security primitive and its use for boardroom voting. under review URL:https://www.loria.fr/event/digitrust-webinar-enka-blanchard/ LOCATION:online CATEGORIES:Séminaire ATTACH;FMTTYPE=image/png:https://www.loria.fr/wp-content/uploads/2021/04/Webinaire-Enka-Blanchard.png END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20210419 DTEND;VALUE=DATE:20210421 DTSTAMP:20260608T130213 CREATED:20201203T101217Z LAST-MODIFIED:20201203T101217Z UID:11302-1618790400-1618963199@www.loria.fr SUMMARY:Workshop on Human Evaluation of NLP Systems (HumEval) DESCRIPTION:EACL’21\, Kiev\, Ukraine\, 19-20 April 2021\nFirst Call for Papers\nThe HumEval Workshop invites the submission of long and short papers on substantial\, original\, and unpublished research on all aspects of human evaluation of NLP systems\, both intrinsic and extrinsic\, including but by no means limited to NLP systems whose output is language. More on: humeval.github.io. \nInvited Speakers\n\nMohit Bansal\, UNC Chapel Hill\, US\nMargaret Mitchell\, Google\, US\nLucia Specia\, UCL\, UK\n\nImportant Dates\n\nDec 2: First Call for Workshop Papers\nDec 18: Second Call for Workshop Papers\nJan 18: Workshop Paper Due Date\nFeb 18: Notification of Acceptance\nMar 01: Camera-ready papers due\nApr 19-20: Workshop Dates\nAll deadlines are 11.59 pm UTC-12.\n\nWorkshop Topic and Content\nHuman evaluation plays a central role in NLP\, from the large-scale crowd-sourced evaluations carried out e.g. by the WMT workshops\, to the much smaller experiments routinely encountered in conference papers. Moreover\, while NLP embraced automatic evaluation metrics from BLEU (Papineni et al\, 2001) onwards\, the field has always been acutely aware of their limitations (Callison-Burch et al.\, 2006; Reiter and Belz\, 2009; Novikova et al.\, 2017; Reiter\, 2018)\, and has gauged their trustworthiness in terms of how well\, and how consistently\, they correlate with human evaluation scores (Over et al.\, 2007; Gatt and Belz\, 2008; Bojar et al.\, 2016; Shimorina\, 2018; Ma et al.\, 2019; Mille et al.\, 2019; Dušek et al.\, 2020). \nYet there is growing unease about how human evaluations are conducted in NLP. Researchers have pointed out the less than perfect experimental and reporting standards that prevail (van der Lee et al.\, 2019). Only a small proportion of papers provide enough detail for reproduction of human evaluations\, and in many cases the information provided is not even enough to support the conclusions drawn. More than 200 different quality criteria (Fluency\, Grammaticality\, etc.) have been used in NLP  (Howcroft et al.\, 2020). Different papers use the same quality criterion name with different definitions\, and the same definition with different names. As a result\, we currently do not have a way of determining whether two evaluations assess the same thing which poses problems for both meta-evaluation and reproducibility assessments (Belz et al.\, 2020). \nReproducibility in the context of automatically computed system scores has recently attracted a lot of attention\, against the background of a troubling history (Pedersen\, 2008; Mieskes et al.\, 2019)\, where reproduction is perceived as failing in 24.9% of cases for own results\, and in 56.7% for another team’s (Mieskes et al.\, 2019). Initiatives have included the Reproducibility Challenge (Pineau et al.\, 2019\, Sinha et al.\, 2020); the Reproduction Paper special category at COLING’18; the reproducibility programme at NeurIPS’19 comprising code submission\, a reproducibility challenge\, and the ML Reproducibility checklist\, also adopted by EMNLP’20 and AAAI’21; and the REPROLANG shared task at LREC’20 (Branco et al.\, 2020). \nHowever\, reproducibility in the context of system scores obtained via human evaluations has barely been addressed at all\, with a tiny number of papers (e.g. Belz & Kow\, 2010; Cooper & Shardlow\, 2020) reporting attempted reproductions of results. The developments in reproducibility of automatically computed scores listed above are important\, but it is concerning that not a single one of the initiatives and events above addresses human evaluations. E.g. if a paper fully complies with all of the NeurIPS’19/EMNLP’20 reproducibility criteria\, any human evaluation results reported in it may not be reproducible to any degree\, simply because the criteria do not address human evaluation in any way. \nWith this workshop we wish to create a forum for current human evaluation research and future directions\, a space for researchers working with human evaluations to exchange ideas and begin to address the issues that human evaluation in NLP currently faces\, including aspects of experimental design\, reporting standards\, meta-evaluation and reproducibility. We invite papers on topics including\, but not limited to\, the following: \n\n\nExperimental design for human evaluations \n\n\nReproducibility of human evaluations \n\n\nEthical considerations in human evaluation of computational systems \n\n\nQuality assurance for human evaluation \n\n\nCrowdsourcing for human evaluation \n\n\nIssues in meta-evaluation of automatic metrics by correlation with human evaluations \n\n\nAlternative forms of meta-evaluation and validation of human evaluations \n\n\nComparability of different human evaluations \n\n\nMethods for assessing the quality of human evaluations \n\n\nMethods for assessing the reliability of human evaluations \n\n\nWork on measuring inter-evaluator and intra-evaluator agreement \n\n\nFrameworks\, model cards and checklists for human evaluation \n\n\nExplorations of the role of human evaluation in the context of Responsible AI and Accountable AI \n\n\nProtocols for human evaluation experiments in NLP \n\n\nWe welcome work on the above topics and more from any subfield of NLP (and ML/AI more generally)\, with a particular focus on evaluation of systems that produce language as output. We explicitly encourage the submission of work on both intrinsic and extrinsic evaluation. \nPaper Submission Information\nLong Papers:\nLong papers must describe substantial\, original\, completed and unpublished work. Wherever appropriate\, concrete evaluation and analysis should be included. \nLong papers may consist of up to eight (8) pages of content\, plus unlimited pages of references. Final versions of long papers will be given one additional page of content (up to 9 pages) so that reviewers’ comments can be taken into account. \nLong papers will be presented orally or as posters as determined by the programme committee. Cecisions as to which papers will be presented orally and which as posters will be based on the nature rather than the quality of the work. There will be no distinction in the proceedings between long papers presented orally and as posters. \nShort Papers:\nShort paper submissions must describe original and unpublished work. Short papers should have a point that can be made in a few pages. Examples of short papers are a focused contribution\, a negative result\, an opinion piece\, an interesting application nugget\, a small set of interesting results. \nShort papers may consist of up to four (4) pages of content\, plus unlimited pages of references. Final versions of short papers will be given one additional page of content (up to 5 pages) so that reviewers’ comments can be taken into account. \nShort papers will be presented orally or as posters as determined by the programme committee. While short papers will be distinguished from long papers in the proceedings\, there will be no distinction in the proceedings between short papers presented orally and as posters. \nReview forms will be made available prior to the deadlines. For more information on applicable policies\, see the ACL Policies for Submission\, Review\, and Citation. \nMultiple Submission Policy\nHumEval’21 allows multiple submissions. However\, if a submission has already been\, or is planned to be\, submitted to another event\, this must be clearly stated in the submission \nEthics Policy\nAuthors are required to honour the ethical code set out in the ACL Code of Ethics. \nThe consideration of the ethical impact of our research\, use of data\, and potential applications of our work has always been an important consideration\, and as artificial intelligence is becoming more mainstream\, these issues are increasingly pertinent. We ask that all authors read the code\, and ensure that their work is conformant to this code. Where a paper may raise ethical issues\, we ask that you include in the paper an explicit discussion of these issues\, which will be taken into account in the review process. We reserve the right to reject papers on ethical grounds\, where the authors are judged to have operated counter to the ACL Code of Ethics\, or have inadequately addressed legitimate ethical concerns with their work. \nPaper Submission and Templates\nSubmission is electronic\, using the Softconf START conference management system. For electronic submission of all papers\, please use: https://www.softconf.com/eacl2021/HumEval2021. Both long and short papers must follow the ACL Author Guidelines\, and must use the EACL’21 templates. You can find the EACL-2021 LaTeX template here or download the zip file. \nOrganisers\n\nAnya Belz\, University of Brighton\, UK\nShubham Agarwal\, Heriot Watt University\, UK\nYvette Graham\, Trinity College Dublin\, Ireland\nEhud Reiter\, University of Aberdeen\nAnastasia Shimorina\, Université de Lorraine / LORIA\n\nPC Members\n\n\n\n\n\n\n\n\nMohit Bansal\, UNC Chapel Hill\, US \n\n\nSaad Mahamood\, Trivago\, DE \n\n\n\n\nKevin B. Cohen\, University of Colorado\, US \n\n\nNitika Mathur\, University of Melbourne\, Australia \n\n\n\n\nKees van Deemter\, Utrecht University\, NL \n\n\nMargot Mieskes\, UAS Darmstadt\, DE \n\n\n\n\nOndrej Dusek\, Charles University\, Czechia \n\n\nEmiel van Miltenburg\, Tilburg University\, NL \n\n\n\n\nKarën Fort\, Sorbonne University\, France \n\n\nMargaret Mitchell\, Google\, US \n\n\n\n\nAnette Frank\, University of Heidelberg\, DE \n\n\nMathias Mueller\, University of Zurich\, CH \n\n\n\n\nClaire Gardent\, CNRS/LORIA Nancy\, France \n\n\nMalvina Nissim\, Groningen University\, NL \n\n\n\n\nAlbert Gatt\, Malta University\, Malta \n\n\nJuri Opitz\, University of Heidelberg\, DE \n\n\n\n\nDimitra Gkatzia\, Edinburgh Napier University\, UK \n\n\nRamakanth Pasunuru\, UNC Chapel Hill\, US \n\n\n\n\nHelen Hastie\, Heriot-Watt University\, UK \n\n\nMaxime Peyrard\, EPFL\, CH \n\n\n\n\nDavid Howcroft\, Heriot Watt University\, UK \n\n\nInioluwa Deborah Raji\, Ai Now Institute\, US \n\n\n\n\nJackie Chi Kit Cheung\, McGill University\, Canada \n\n\nVerena Rieser\, Heriot Watt University\, UK \n\n\n\n\nSamuel Läubli\, University of Zurich\, CH \n\n\nSamira Shaikh\, UNC\, US \n\n\n\n\nChris van der Lee\, Tilburg University\, NL \n\n\nLucia Specia\, UCL\, UK \n\n\n\n\nNelson Liu\, Washington University\, US \n\n\nWei Zhao\, TU Darmstadt\, DE \n\n\n\n\nQun Liu\, Huawei Noah’s Ark Lab\, China \n\n\n\n\n\n\nContact Information\nhumeval.ws@gmail.com \nhttps://humeval.github.io URL:https://www.loria.fr/event/workshop-on-human-evaluation-of-nlp-systems-humeval/ CATEGORIES:Séminaire END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210420T133000 DTEND;TZID=Europe/Paris:20210420T150000 DTSTAMP:20260608T130213 CREATED:20210409T101721Z LAST-MODIFIED:20210409T120947Z UID:12004-1618925400-1618930800@www.loria.fr SUMMARY:Colloquium Loria - CELLO Team DESCRIPTION:Next Colloquium will take place on Tuesday\, 20th April at 1:30 pm on Teams. \nWe are glad to welcome the CELLO team\, with presentations given by our colleagues Hans van Ditmarsch\, Marta Gawek and Mo Liu. \n \n\nProgram and abstracts: \n13:30 – 14:00 \n\nspeaker: Hans van Ditmarsch\, CELLO @ LORIA\ntitle: Knowledge and simplicial complexes\nabstract: Simplicial complexes are a versatile and convenient paradigm on which to build all the tools and techniques of the logic of knowledge\, on the assumption that initial epistemic models can be described in a distributed fashion. Thus\, we can define: knowledge\, belief\, bisimulation\, the group notions of mutual\, distributed and common knowledge\, and also dynamics in the shape of simplicial action models. We give a survey on how to interpret all such notions on simplicial complexes\, building upon the foundations laid in prior work by Goubault et al. More recent work investigates so-called impure simplicial complexes\, that also take into account crashed processes.\nReferences:\n[1] Hans van Ditmarsch\, Eric Goubault\, Jérémy Ledent\, and Sergio Rajsbaum. Knowledge and simplicial complexes. To appear. CoRR abs/2002.08863\, 2020.\n[2] Hans van Ditmarsch. Wanted Dead or Alive: Epistemic logic for impure simplicial complexes. CoRR abs/2103.03032\, 2021.\n\n        Joint work with Éric Goubault\, Jérémy Ledent\, and Sergio Rajsbaum. \n\n\n  \n14:00 – 14:30 \n\nspeaker: Marta Gawek\, CELLO @ LORIA\ntitle: An epistemic separation logic with action models\nabstract: We investigate extensions of separation logic with epistemic and dynamic epistemic modalities. Separation logics are based on the intuitionistic logic of bunched implications (BI) or its classical counterpart Boolean BI. These logics combine additive and multiplicative connectives in the language\, expressing the notions of resource composition and resource decomposition. Epistemic Separation Logic with Action Models (ESLAM) is a generalization of the Public Announcement Separation Logic (PASL) of Courtault et al. We present the syntax and semantics of ESLAM as well as reduction axioms for the elimination of dynamic modalities.\nReferences: [1] Jean-René Courtault\, Hans van Ditmarsch\, and Didier Galmiche. A Public Announcement Separation Logic. Mathematical Structures in Computer Science 29(6):828–871\, 2019.\n[2] David Pym. The Semantics and Proof Theory of the Logic of Bunched Implications\, Springer\, 2002.\n[3] Hans van Ditmarsch\, Didier Galmiche\, and Marta Gawek. An Epistemic Separation Logic with Action Models. Proceedings of 9th ICLA\, 2021.Joint work with Hans van Ditmarsch and Didier Galmiche.\n\n\n14:30 – 15:00 \n\nspeaker: Mo Liu\, CELLO @ LORIA\ntitle: Expressivity of some versions of APAL\nabstract: Arbitrary public announcement logic (APAL) is a logic of change of knowledge with   modalities representing quantification over announcements. It extends public announcement logic (PAL). We present three rather different versions of APAL: FSAPAL only quantifies over announcements containing a finite subset of all propositional variables. SCAPAL only quantifies over announcements containing variables occurring in the formula bound by the quantifier. IPAL quantifies over announcements implying a given formula. We determine the relative expressivity of FSAPAL\, SCAPAL and IPAL in relation to APAL and PAL.\nReferences:\n[1] Hans van Ditmarsch\, Mo Liu\, Louwe B. Kuijer\, and Igor Sedlár. Expressivity of Some Versions of APAL. Proceedings of DaLí 2020\, pp 120-136\, 2020.\n\n\n        Joint work with Hans van Ditmarsch\, Louwe B. Kuijer\, and Igor Sedlár. URL:https://www.loria.fr/event/12004/ LOCATION:online CATEGORIES:Colloquium Loria END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210422T093000 DTEND;TZID=Europe/Paris:20210422T113000 DTSTAMP:20260608T130213 CREATED:20210421T140948Z LAST-MODIFIED:20210421T141126Z UID:12149-1619083800-1619091000@www.loria.fr SUMMARY:PhD defense: Mingxiao Ma DESCRIPTION:Mingxiao Ma (RESIST) will defend his thesis\, entitled « Attack Modelling and Detection in Distributed and Cooperative Controlled Microgrid Systems« . The defense will be held online and it will take place on Thursday\, 22 April 2021 at 9:30 am. \n\n\nAbstract \n\nModern low-voltage microgrid systems rely on distributed and cooperative control approaches to guarantee safe and reliable operational decisions of their inverter-based distributed generators (DGs). However\, many sophisticated cyber-attacks can target these systems\, deceive their traditional detection methods and cause a severe impact on the power infrastructure.\n\nIn this thesis\, we systematically study the vulnerabilities and threats of distributed controlled microgrid systems. We design a novel attack named « measurement-as-reference » (MaR) attack and take it as a typical stealthy attack example to theoretically analyze the attack impact on the microgrid system and use numerical simulation results to verify the analysis. We provide mathematical models of possible false data injection (FDI) and denial of service (DoS) attacks in a representative distributed and cooperative controlled microgrid system. We propose a secure control framework with an attack detection module based on machine learning techniques. To validate the effectiveness of this framework\, we implement two typical attacks\, MaR attack and delay injection attack\, on a hardware platform modeled after a microgrid system. We collect datasets from the platform and validate the performance of multiple categories of machine learning algorithms to detect such attacks. Our results show that tree-based classifiers (Decision Tree\, Random Forest and AdaBoost) outperform other algorithms and achieve excellent performance in detecting normal behavior\, delay injection and false data attacks.\n\n\n\nComposition of jury:\nReviewers :\n                       Mohamed Kaâniche: Directeur de recherche CNRS au LAAS\, France\n                       Stéphane Mocanu: Maître de conférences à Université de Grenoble-Alpes\, France\n\n\nExaminers : \n\n                       Ghita Mezzour: Maître de conférences à Université Internationale de Rabat\, Maroc\n                       Abdelmadjid Bouabdallah: Professeur à Université de Technologie de Compiègne\, France\n                       Ye-Qiong Song: Professeur à Université de Lorraine\, France\n\nSupervisors :\n                      Isabelle Chrisment: Professeure à Télécom Nancy\, Nancy \, France\n                      Abdelkader Lahmadi: Maître de conférences à Université de Lorraine\, France URL:https://www.loria.fr/event/phd-defense-mingxiao-ma/ CATEGORIES:Soutenance END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210423T140000 DTEND;TZID=Europe/Paris:20210423T160000 DTSTAMP:20260608T130213 CREATED:20210421T135352Z LAST-MODIFIED:20210421T135352Z UID:12147-1619186400-1619193600@www.loria.fr SUMMARY:PhD defense: Bishnu Sarker DESCRIPTION:Bishnu Sarker (CAPSID) will defend his thesis\, entitled : On Graph-based Approaches for Protein Function Annotation and Knowledge Discovery. The defense will take place on Friday\, 23 April 2021 at 14:00. Due to the health situation\, the defense will be held online. \nAbstract \nDue to the recent advancement in genomic sequencing technologies\, the number of protein entries in public databases is growing exponentially. It is important to harness this huge amount of data to describe living things at the molecular level\, which is essential for understanding human disease processes and accelerating drug discovery. A prerequisite\, however\, is that all of these proteins be annotated with functional properties such as Enzyme Commission (EC) numbers and Gene Ontology (GO) terms. Today\, only a small fraction of the proteins is functionally annotated and reviewed by expert curators because it is expensive\, slow and time-consuming. Developing automatic protein function annotation tools is the way forward to reduce the gap between the annotated and unannotated proteins and to predict reliable annotations for unknown proteins. Many tools of this type already exist\, but none of them are fully satisfactory. We observed that only few consider graph-based approaches and the domain composition of proteins. Indeed\, domains are conserved regions across protein sequences of the same family. In this thesis\, we design and evaluate graph-based approaches to perform automatic protein function annotation and we explore the impact of domain architecture on protein functions. The first part is dedicated to protein function annotation using domain similarity graph and neighborhood-based label propagation technique. we present GrAPFI (Graph-based Automatic Protein Function Inference) for automatically annotating proteins with enzymatic functions (EC numbers) and GO terms from a protein-domain similarity graph. We validate the performance of GrAPFI using six reference proteomes from UniprotKB/SwissProt and compare GrAPFI results with state-of-the-art EC prediction approaches. We find that GrAPFI achieves better accuracy and comparable or better coverage. The second part of the dissertation deals with learning representation for biological entities. At the beginning\, we focus on neural network-based word embedding technique. We formulate the annotation task as a text classification task. We build a corpus of proteins as sentences composed of respective domains and learn fixed dimensional vector representation for proteins. Then\, we focus on learning representation from heterogeneous biological network. We build knowledge graph integrating different sources of information related to proteins and their functions. We formulate the problem of function annotation as a link prediction task between proteins and GO terms. We propose Prot-A-GAN\, a machine-learning model inspired by Generative Adversarial Network (GAN) to learn vector representation of biological entities from protein knowledge graph. We observe that Prot-A-GAN works with promising results to associate appropriate functions with query proteins. In conclusion\, this thesis revisits the crucial problem of large-scale automatic protein function annotation in the light of innovative techniques of artificial intelligence. It opens up wide perspectives\, in particular for the use of knowledge graphs\, which are today available in many fields other than protein annotation thanks to the progress of data science.\n\n\nComposition of jury:\nReviewers :\n                       Christine Brun : Research Director\,  CNRS\, Inserm-University of Marseille\, France.\n                       Mohamed Elati : Professor\, University of Lille\, France. \n\nExaminers :\n                       Anne Boyer : Professor\, University of  Lorraine\, France.\n                       Albert Montresor : Professor\, University of Trento\, Italy.\n\n\nSupervisors :\n                      David W. Ritchie (till Sept 2019) : Research Director\, Inria\, Nancy\, France.\n                      Marie-Dominique Devignes (from sept 2019) : Associate Researcher\, CNRS\, Nancy\, France.\n                      Sabeur Aridhi : Associate Professor\, University of Lorraine\, France. URL:https://www.loria.fr/event/phd-defense-bishnu-sarker/ LOCATION:Teams END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210423T150000 DTEND;TZID=Europe/Paris:20210423T163000 DTSTAMP:20260608T130213 CREATED:20210416T094459Z LAST-MODIFIED:20210416T094508Z UID:12079-1619190000-1619195400@www.loria.fr SUMMARY:HDR defense - Claudia Ignat (Coast) DESCRIPTION:Claudia Ignat (Coast team) will defend her HDR (Habilitation à Diriger des Recherches)\, entitled « Large-scale trustworthy distributed collaborative systems » on Friday April 23 at 3pm. The defense will be held in English. \n \nShort abstract: \nMost existing collaborative systems rely on a central authority and place personal information in the hands of a single large corporation which is a perceived privacy threat. Moreover\, these systems do not scale well in terms of the number of users and their modifications. My research work aims to move away from centralized authority-based collaboration towards a large scale trust-based peer-to-peer collaboration where control over data is given to users who can decide with whom to share their data. The main advantages of peer-to-peer collaborative systems are high scalability and resilience to faults and attacks. \nFirst\, I describe my contributions to the design and evaluation of optimistic data replication algorithms. I also present my work on group awareness specifically on what information should be provided to users to prevent conflicting changes and to understand divergence when conflicts cannot be avoided. \nSecondly\, I describe my contributions on large scale trustworthy collaboration. I present a contract-based collaboration model where contracts are specified by the data owners when they share the data and user trust is assessed according to the observation of adherence to or violation of contracts. For testing the proposed trust-based collaboration model\, I designed a user experiment employing trust game and relying on a computational trust metric according to user exchanges in this game. \nFinally\, I present my future research directions on secure and trustworthy collaborative data management. \nKeywords: distributed collaborative systems\, operational transformation\, CRDT\, group awareness\, trust\, contract-based collaboration\, authenticated logs\, trust game\, user studies \nMore details are available here \nJury members\nReviewers\nPrasun DEWAN\, Professor at University of North Carolina at Chapel Hill\nValerie ISSARNY\, Director of research at Inria\nFrançois TAIANI\, Professor at Université de Rennes I \nExaminers\nSihem AMER-YAHIA\, Director of research at CNRS\nFrançois CHAROY\, Professor at Université de Lorraine\nIsabelle CHRISMENT\, Professor at Université de Lorraine\nFabien GANDON\, Director of research at Inria\nPascal MOLLI\, Professor at Université de Nantes URL:https://www.loria.fr/event/habilitation-defense-claudia-ignat-coast/ CATEGORIES:HDR END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210504T093000 DTEND;TZID=Europe/Paris:20210504T113000 DTSTAMP:20260608T130213 CREATED:20210421T134010Z LAST-MODIFIED:20210421T134010Z UID:12128-1620120600-1620127800@www.loria.fr SUMMARY:PhD defense: George Krait DESCRIPTION:George Krait (Gamble) will defend his thesis\, entitled : Isolating the Singularities of the Plane Projection of  Generic Space Curves and Applications in Robotics\, on Tuesday\, Mai 4th 2021 at 9:30 am. \nAbstract\n Isolating the singularities of a plane curve is the first step towards computing its topology. For this\, numerical methods are efficient but not certified in general. We are interested in developing certified numerical algorithms  for isolating the singularities. In order to do so\, we restrict our attention to the special case of plane curves that are projections of smooth curves in higher dimensions. This type of curves appears naturally in robotics applications and scientific visualization. In this setting\, we show that the singularities can be encoded by a regular square system whose solutions can be isolated with certified numerical methods. Our analysis is conditioned by assumptions that we prove to be generic using transversality theory. We also provide a semi-algorithm to check their validity. Finally\, we present experiments in visualization and robotics\, some of which are not reachable by other methods\, and discuss the efficiency of our method.\n\nKeywords: Transversality\, Generic Singularities\, Certified Numerical Algorithms\, Interval Arithmetic\, Singular Curve Topology\n\n\n\n\n\n\n\nComposition of the jury\nReviewers:     Nicolas Delanoue (Université d’Angers\, ISTIA)\n                             Sonia Pérez-Díaz (University of Alcala)\n\nExaminers:     Pierrick Gaudry (CNRS\, Loria)\n                             Sylvain Lazard -directeur- (INRIA Nancy Grand Est\, Loria)\n                             Guillaume Moroz -co-directeur- (INRIA Nancy Grand Est\, Loria)\n                             Erika Ottaviano (University of Cassino and Southern Lazio)\n\nGuest:             Marc Pouget (INRIA Nancy Grand Est\, Loria)\n\n\nThe event will take place on Teams. URL:https://www.loria.fr/event/phd-defense-george-krait/ LOCATION:Teams CATEGORIES:Soutenance END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210504T110000 DTEND;TZID=Europe/Paris:20210504T120000 DTSTAMP:20260608T130213 CREATED:20210430T132513Z LAST-MODIFIED:20210430T132528Z UID:12370-1620126000-1620129600@www.loria.fr SUMMARY:D3 Seminar: Modélisation et optimisation de planification de réseaux RFID à grande échelle DESCRIPTION:Le prochain séminaire du D3 aura lieu le mardi 4 mai à 11h sur Teams. \nAtef Jaballah post-doctorant dans l’équipe Optimist\, fera une présentation intitulée « Modélisation et optimisation de planification de réseaux RFID à grande échelle ». \n \nRésumé : \nLa croissance énorme des sociétés industrielles nécessite le déploiement des réseaux RFID à grande échelle. Ce qui nécessite l’installation d’un grand nombre de composants RFID (lecteurs\, étiquettes\, middleware et autres). En conséquence\, le coût et la complexité des réseaux RFID augmentent en raison du grand nombre de lecteurs RFID à installer.  Ma thèse s’est intéressée à des problèmes liés au déploiement optimisé des réseaux RFID. En particulier\, nous nous sommes focalisés sur les trois problèmes suivants : (1) le problème de la planification d’un réseau RFID  (RFID Network Planning — RNP) \, (2) le problème de l’arrangement des lecteurs RFID tout en maximisant la couverture et minimisant les collisions\, et (3) le problème du profilage de la taille des étiquettes dans les systèmes RFID. \nLe problème RNP a été prouvé NP-difficile par analogie avec le problème du positionnement d’antennes dans les réseaux cellulaires. C’est un problème d’optimisation multi-objectif avec un espace de solutions très large et bruité\, pour lequel les approches méta-heuristiques conviennent le mieux.  Nous proposons une nouvelle variante de l’algorithme de recherche coucou (Cuckoo Search – CS)\, dénommé auto-adaptative CS algorithme (Self Adaptive Cuckoo Search-SACS) où les paramètres de contrôle de l’algorithme CS sont adaptés en temps réel\, selon l’avancement du processus d’optimisation pour résoudre ce problème.  Ensuite\, nous intéressons au problème d’ordonnancement des lecteurs RFID afin de réduire les chevauchements des régions couvertes par les lecteurs et minimiser les collions. Ce problème est connu sous le nom de problème RCCAA (Reader Coverage Collision Avoidance Arrangement). Pour résoudre ce problème\, nous proposons un algorithme d’approximation qui est capable de résoudre le problème RCCAA en évitant les différents types de collisions. \nLe dernier problème abordé dans ma thèse est le problème du profilage de la taille des étiquettes dans les systèmes RFID ou (Tag Size Profiling -TSP problem). Le problème du TSP consiste à estimer les tailles des sous-régions du système RFID couvertes par plusieurs lecteurs. La résolution du problème TSP permet de déterminer l’ordonnancement optimal des lecteurs qui maximise le débit d’identification des étiquettes. Nous prouvons que la construction de système linéaire optimale adéquat pour résoudre le problème TSP est une tâche est NP difficile. Ensuite\, nous développons un nouvel algorithme approximatif qui est capable de résoudre une telle tâche en un temps raisonnable. \nAbstract:  \nRadio Frequency IDentification (RFID ) is a key technology of the Internet of Things (IoT).  RFID has the possibility of enabling  machines to  identify\, control  and localize the physical objects  through networks in real time.  Due to its low cost\, small size and ability to communicate in different environments (liquids\, gas…) without power source\,  RFID is frequently used in different sectors : supply chain management\, electronic security\, retail marketing\, smart university\, military and health-care. RFID is a system composed  by  tags  sensitive to electromagnetic fields created bya reader antenna. Each tag encapsulate a unique identification and can be attached to objects in order to monitor them. However\, many challenges remain to be addressed before  RFID can reach its full potential in the IoT.  Particularly\, readers scheduling and RFID network planning  (RNP)  are among these most important challenges.  Essentially\, the readers scheduling avoids collision and the RNP  assures the most suitable quality of service and cost efficiency. \nOwing to the limited interrogation range of RFID readers\, multiple readers should be deployed to ensure full tag coverage.   The arbitrary deployment of readers causes several problems: wastage of readers\, collision and load imbalance between readers.  Finding the optimal number of readers to deploy so as obtain full tag coverage\, the optimal placement of these readers and the optimal configuration of their parameters is known as an RNP problem.  The RNP problem is a multiobjective optimization problem with a large number of variables and uncertain parameters.   This dissertation presents a new variant of the cuckoo search algorithm  to plan large-scale RFID networks and overcome the deployment challenges described above. In some cases\, a good planning can not completely eliminate overlap between readers\, hence the necessity of readers scheduling to activate the neighbors readers in a different time to avoids collisions.  In this context\, a particular problem known as the Reader-Coverage Collision Avoidance Arrangement (RCCAA) problem has received great attention in the literature.  The RCCAA problem consists in activating  RFID readers and adjusting their interrogation ranges in order to cover the maximum number of tags without collision. In this manuscript\, we propose the maximum-weight-independent-set-based algorithm II to solve the RCCAA problem. Another important problem that has great importance in readers scheduling is  to know the Tag Size Profile  (TSP) of the system.   TSP consists in estimating the size of sub-regions in an RFID system covered by several readers.  In order to achieve this goal\,   the sub-regions are considered as variable and  the adequate linear system is constructed by these variables and solve them.   In this dissertation\, we show that the determination of the minimal set of schedule instances to construct an adequate linear system is NP-hard\, and we propose a time-efficient approximate algorithm based on a k-partial set cover to solve it. URL:https://www.loria.fr/event/d3-seminar-2/ CATEGORIES:Séminaire END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20210518 DTEND;VALUE=DATE:20210618 DTSTAMP:20260608T130213 CREATED:20210503T141736Z LAST-MODIFIED:20210517T144006Z UID:12383-1621296000-1623974399@www.loria.fr SUMMARY:Department 1 seminar DESCRIPTION:The Department 1 seminar will take place from 18th May to 17th June online. \nProgram: \n\nMardi 18 mai\, 13h30\n\nLéo Valque\, Gamble : Rounding polygonal meshes \nFlorian Delconte\, Adagio : Tree Defect Segmentation using Geometric Features and CNN \n\n\nMercredi 19 mai\, 13h30\n\nDavid Lopez\, Pixel : Triangulation de Delaunay : comment préserver le volume ? \nMatthieu Zins\, Tangram : « Object-Based Visual Localization From Ellipsoidal Model and 3D-Aware Ellipse Prediction » \n\n\nJeudi 20 mai\, 13h30\n\nYoussef Assis\, Tangram : Intracranial aneurysms detection using deep learning \nMelike Aydinlilar\, MFX : Ray-Tracing Implicit Surfaces \n\n\nVendredi 21 mai\, 13h30\n\nMarco Freire\, MFX : Layout problems and generative design for shape modeling in computational fabrication \nDavid Desobry\, Pixel : Designing 2D and 3D Non-Orthogonal Frame Fields \nQuentin Yang\, Caramba : Coercion resistance with cast-as-intended verification \n\n\nLundi 14 juin\, 11h30\n\nNariman Khaledian\, Tangram : Toward a Functional Model of the Mitral Valve \nJustine Basselin\, Pixel : Restricted Power diagram on the GPU \n\n\nMardi 15 juin\, 11h30\n\nAbdelkarim Elassam\, Tangram : Horizon Line and Vanishing points detection using Deep Learning \nLouis Massucci\, ABC : Statistical learning theory and hybrid dynamical system identification \n\n\nMercredi 16 juin\, 11h30\n\nGuillaume Coiffier\, Pixel : Improving global parametrizations for quadmeshing \nNuwan Herath Mudiyanselage\, Gamble : Fast algorithm for the visualization of surfaces \n\n\nJeudi 17 juin\, 11h30\n\nHamid Boukerrou\, Caramba : TBA \nFrançois Protais\, Pixel : Computing Foldover-free maps URL:https://www.loria.fr/event/department-1-seminar/ CATEGORIES:Séminaire END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210520T140000 DTEND;TZID=Europe/Paris:20210520T160000 DTSTAMP:20260608T130213 CREATED:20210517T102244Z LAST-MODIFIED:20210518T134106Z UID:12455-1621519200-1621526400@www.loria.fr SUMMARY:CISPA - LORIA seminar DESCRIPTION:The Second Virtual Workshop Day of the French-German Center for Cybersecurity will take place on Thursday\, 20th May. \n02:00 p.m. to 02:05 p.m. Introduction by Prof. Marine Minier and Dr Antoine Joux (Directors of the French-German Center for Cybersecurity)\n\n02:05 p.m. to 02:30 p.m.: Dr Jérôme François (Inria Research Scientist with RESIST Team): In-network security monitoring\nAbstract: Monitoring is a critical task of network operations to serve as support as many other ones such as fault management\, security\, trouble-shooting\, QoS… Recently\, network softwarization empowers the paradigm of programmable networks where network functions or even tasks of these functions can be programmed with high flexibility to fit user or operator needs independently of hardware used. Programming network data-plane allows to program the processing of each packet and is supported by novel technologies like P4. In this talk\, we will bring the gap between data-plane programming with P4 and network monitoring by highlighting what possibilities exist to support an enhance in-network security monitoring rather than offloading the latter to a server as usual. In particular\, we will discuss how complex (malicious) behaviors can be tracked with extended finite state machines and how network switch could support real number operations that is a requirement for expecting AI to be run in-network.\n\n02:30 p.m. to 02:40 p.m.: Q&A\n\n02:40 p.m. to 03:05 p.m.: Dr Antoine Joux (Faculty at CISPA): Subset-sum collisions\nAbstract: In this talk\, we revisit the subset-sum collision problem in a parameter regime where lattice reduction technique are expected to be costly. For this\, we turn to combinatorial algorithms based on the representation technique and show how they can be applied to the subset-sum collision problem. After a survey of the state of the art\, we present two algorithmic strategy: first\, a reduction to the resolution of ordinary subset sum problem and\, second\, a direct application of the representation technique. Quite surprisingly\, for a given number of elements in the subset-sum\, the subset-sum collision problem is (with current algorithms) harder that the subset-sum inversion problem. This contrasts with the general intuition that collisions are easier to find than pre-images.\n\n03:05 p.m. to 03:15 p.m.: Q&A\n\n03:15 p.m. to 03:30 p.m.: Final discussion\n\n03:30 p.m. to 04:00 p.m. Virtual Coffee on gather.town URL:https://www.loria.fr/event/cispa-loria-seminar/ CATEGORIES:Séminaire END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20210525 DTEND;VALUE=DATE:20210528 DTSTAMP:20260608T130213 CREATED:20201130T094517Z LAST-MODIFIED:20201130T094609Z UID:11245-1621900800-1622159999@www.loria.fr SUMMARY:ISMVL2021 IEEE International Symposium on Multiple-Valued Logic DESCRIPTION:The Technical Committee on Multiple-Valued Logic of the IEEE Computer Society will hold its 51st annual symposium in fully online\, on May 25-27\, 2021. \nThe symposium will bring together researchers from computer science\, engineering\, mathematics\, and further disciplines to discuss new developments and directions for future research in the area of multi-valued logic and related fields. Research papers\, surveys\, or tutorial papers on any subject in these areas are within the scope of the symposium. \nThe proceedings of ISMVLs are in the Ei compendex that is the broadest and most complete engineering literature database available in the world. \nPaper submission\nAuthors should submit papers as PDF files following the IEEE style guidelines for conference proceedings. Each manuscript shall include a 50-100 word abstract and shall not exceed 6 pages. All accepted papers will be published by IEEE. The authors of selected papers will be invited after the conference to prepare an extended version of their\npaper to be published in the journal of Mulitple-Valued Logic and Soft Computing. \n\nAbstract Submission Deadline: December 21\, 2020\nManuscript Submittion Deadline: December 28\, 2020\n\nA link to the submission system will be available soon at: www.mvl.jpn.org/ISMVL2021 \nSupport the MVL community by joining the TCMVL (free for IEEE members). More information is available at:\nwww.ieee.org/membership-catalog URL:https://www.loria.fr/event/ismvl-2021-ieee-international-symposium-on-multiple-valued-logic/ CATEGORIES:Séminaire END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210525T130000 DTEND;TZID=Europe/Paris:20210525T150000 DTSTAMP:20260608T130213 CREATED:20210521T130720Z LAST-MODIFIED:20210521T130720Z UID:12475-1621947600-1621954800@www.loria.fr SUMMARY:Soutenance de thèse : Gabrielle De Micheli DESCRIPTION:La soutenance de Gabrielle De Micheli (CARAMBA)\, intitulée “Cryptanalyses de logarithmes discrets : crible algébrique et réseaux pour attaques par canaux auxiliaires”\, se déroulera le Mardi 25 Mai 2021 à 13h.  En raison de la situation sanitaire\, la soutenance se fera en anglais par visioconférence. \nRésumé :\nLes cryptosystèmes dits à clé publique sont construits à l’aide de fonctions à sens unique qui assurent à la fois la sécurité et l’efficacité des cryptosystèmes. L’un des deux principaux candidats envisagés à l’origine pour construire de tels cryptosystèmes est l’exponentiation modulaire avec son opération inverse\, le calcul de logarithmes discrets. Dans cette thèse\, nous étudions la sécurité de protocoles qui utilisent des exponentiations modulaires où l’exposant est un secret du protocole. Afin d’évaluer la sécurité de tels protocoles\, on peut d’une part estimer la difficulté de résoudre directement le problème du logarithme discret (DLP) dans les groupes considérés par les protocoles\, ou examiner les vulnérabilités issues de l’implémentation des algorithmes d’exponentiation rapide. \nUne première façon d’estimer la sécurité des protocoles basés sur la difficulté du problème du logarithme discret est d’étudier directement la complexité des algorithmes qui résolvent ce dernier. Dans cette thèse\, nous étudions la complexité asymptotique des algorithmes qui résolvent le DLP sur des corps finis Fpn précisément de la forme où les couplages prennent leurs valeurs.\nNous proposons également une première implémentation et un calcul record d’un logarithme discret dans un corps fini de 521 bits en utilisant l’algorithme Tower Number Field Sieve\, une variante de NFS dont la complexité asymptotique est meilleure. Cette variante n’avait jamais été implémentée auparavant en raison de la difficulté du crible algébrique dans des dimensions supérieures à deux. \nEnfin\, la sécurité des protocoles déployés ne repose pas seulement sur la difficulté du problème mathématique sous-jacent\, mais aussi sur l’implémentation des algorithmes considérés. De nombreux algorithmes d’exponentiation modulaire rapide se sont accumulés au fil des ans et certaines implémentations ont fait apparaître des vulnérabilités exploitables par des attaques par canaux auxiliaires. Un second aspect de cette thèse considère donc les principales méthodes pour reconstituer une clé secrète lorsque des informations partielles sont récupérées à partir d’un canal auxiliaire. \nComposition du jury :\nRapporteurs :\nMartin Albrecht\, Royal Holloway\, University of London\, Royaume-Uni\nFrederik Vercauteren\, KU Leuven\, Belgique \nExaminateurs :\nRobert Granger\, University of Surrey\, Royaume-Uni\nSteve Kremer\, Inria\, Nancy\, France\nTanja Lange\, Technische Universiteit\, Eindhoven\, Pays-Bas\nPalash Sarkar\, Indian Statistical Institute\, Inde \nDirecteurs de thèse :\nPierrick Gaudry\, CNRS\, Nancy\, France\nCécile Pierrot\, Inria\, Nancy\, France URL:https://www.loria.fr/event/soutenance-de-these-gabrielle-de-micheli/ LOCATION:online CATEGORIES:Soutenance END:VEVENT BEGIN:VEVENT DTSTART;VALUE=DATE:20210603 DTEND;VALUE=DATE:20210604 DTSTAMP:20260608T130213 CREATED:20210526T151127Z LAST-MODIFIED:20210526T151127Z UID:12518-1622678400-1622764799@www.loria.fr SUMMARY:AI_Now DESCRIPTION:Une journée entière consacrée au sujet de l’intelligence artificielle pour les professionnels\, avec des conférences\, des démonstrations et du networking. \nEn 2021\, une édition 100% en ligne\, avec 100% du programme accessible via internet. Rendez-vous le jeudi 3 juin ! \nUn événement annuel pour comprendre\, apprendre\, s’interroger et progresser sur une forme de technologie qui promet de toucher chaque cm² de l’humanité. \nNos chercheurs prendront part à l’événement : \n\nAbdelkader Lahmadi (Resist) interviendra à 15h lors d’un cercle d’échanges sur la cybersécurité\nNazim Fatès (Mocqua) fera une conférence à 15h45\, intitulée « AI-Calypse now : comment l’intelligence artificielle a-t-elle muté pour devenir un enjeu planétaire ? ».\n\nPlus d’informations et inscriptions sur le site de l’événement URL:https://www.loria.fr/event/ai_now/ CATEGORIES:Manifestation END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210610T090000 DTEND;TZID=Europe/Paris:20210610T123000 DTSTAMP:20260608T130213 CREATED:20210521T154109Z LAST-MODIFIED:20210525T084608Z UID:12479-1623315600-1623328200@www.loria.fr SUMMARY:Matinée d'étude sur l'intelligence artificielle et la vie privée : Evénement DigiTrust - OLKi DESCRIPTION:Les comités de pilotage des projets DigiTrust et OLKi vous invitent à la matinée d’étude : Intelligence artificielle et vie privée \n10 juin 2021\, 9h-12h30\, visioconférence\nInscription : https://enquetes.univ-lorraine.fr/index.php/853614 \nProgramme\n09:00 Mots d’introduction \n09:15 La charte « Pour un développement des IAs respectueux de la vie privée dès la conception«  \nhttps://hal.archives-ouvertes.fr/hal-03104692 \nMaël Pégny (rédacteur de la charte) & Marc M. Anderson (Loria) \n09:55 Bastien Guerry (Etalab) « Éthique et IA : que peut enseigner le mouvement du logiciel libre ? »  \n10:20 Félicien Vallet (CNIL) –  « Les enjeux de l’IA pour la CNIL » \n\n« Statut juridique des modèles d’apprentissage automatique\, utilisation de jeux de données à caractère personnel à des fins d’apprentissage ou encore application du principe de minimisation des données\, etc.\, cette courte présentation vise à présenter les enjeux que pose l’intelligence artificielle à la CNIL\, le régulateur en charge de la protection des données personnelles en France. » \n\n10:50 Pause \n\n11:00 Jean-Marie John-Mathew (Science Po) \nPrésentation un papier expérimental sur les limites des dispositifs d’interprétabilité de l’IA pour déceler les décisions algorithmiques discriminatoires. \n11:25 Table ronde \n\n      Daniel Andler\, Professeur émérite à l’université Paris-Sorbonne en philosophie des sciences et théorie de la connaissance http://andler.dec.ens.fr/ \n     Christophe Cerisara\, chercheur au Loria en apprentissage profond et traitement automatique des langues https://members.loria.fr/CCerisara/ \n     Abdessamad Imine\, maître de conférences à l’Université de Lorraine en informatique https://members.loria.fr/AImine/ \n     Célia Zolynski\, Professeure à l’université de Paris 1 Panthéon-Sorbonne en droit privée et sciences criminelles https://univ-droit.fr/universitaires/5213-zolynski-celia \nDiscussion avec le public et les conférenciers  URL:https://www.loria.fr/event/matinee-detude-sur-lintelligence-artificielle-et-la-vie-privee-evenement-digitrust-olki/ LOCATION:online CATEGORIES:Autres ATTACH;FMTTYPE=image/jpeg:https://www.loria.fr/wp-content/uploads/2021/05/Seminaire-Digitrust-Olki_V7-scaled.jpg END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210614T140000 DTEND;TZID=Europe/Paris:20210614T160000 DTSTAMP:20260608T130213 CREATED:20210614T072234Z LAST-MODIFIED:20210614T072234Z UID:12564-1623679200-1623686400@www.loria.fr SUMMARY:Soutenance de thèse : Victorien Elvinger DESCRIPTION:La soutenance de Victorien Elvinger (COAST)\, intitulée « Réplication sécurisée dans les infrastructures pair-à-pair de\ncollaboration »\, se déroulera le Lundi 14 juin 2021 à 14h en salle A008. \nRésumé :\nUne application de collaboration permet à plusieurs individus de coéditer un contenu. Les infrastructures pair-à-pair de collaboration visent à la conception d’applications hautement disponibles\, aux latences faibles\, qui tolèrent les partitions réseaux\, et qui passent à l’échelle. Chaque pair (individu) modifie sa propre copie du contenu. La modification concurrente des copies conduit à leur divergence. Les protocoles de réplication sont responsables de la convergence des copies. \nCes protocoles supposent l’absence de pairs malintentionnés qui compromettent la convergence des copies. Pouvons-nous protéger la convergence des copies et préserver les propriétés des infrastructures pair-à-pair ? Nous proposons deux protocoles qui protègent la convergence des copies. Le premier protocole maintient un journal répliqué et infalsifiable qui enregistre les modifications du contenu. Les pairs conservent l’intégralité du journal pour déjouer les attaques des pairs malintentionnés et pour le transmettre à ceux qui rejoignent la collaboration. Le second protocole permet aux pairs de tronquer leur journal. La troncature du journal repose sur le concept de Stabilité. Une modification devient stable lorsque toute modification intégrée dans le journal dépend d’elle. Pour rejoindre la collaboration\, un pair récupère une copie et un journal tronqué. Il vérifie l’authenticité de la copie à partir du journal tronqué. \nUn type de données répliquées (CRDT) encapsule un protocole de réplication. Les CRDTs séquences supposent généralement un ordre d’intégration causal des modifications du contenu. Le retard d’une modification propage des ralentissements dans l’ensemble du système. La connexion d’un pair peut engendrer l’intégration de nombreuses modifications. Pouvons-nous éliminer ces ralentissements et ces intégrations coûteuses ? Nous formalisons une famille de CRDTs séquences et nous proposons une approche qui permet leur synchronisation par différences d’états. Les différences d’états peuvent être intégrées dans un ordre arbitraire et résumer plusieurs modifications. Nous proposons un CRDT séquence qui tire avantage de notre approche. \nComposition du jury :\nRapporteur·ice·s : \n\nEmmanuelle Anceaume\, directrice de recherche IRISA\nPascal Molli\, professeur à l’Université de Nantes\nFrederik Vercauteren\, KU Leuven\, Belgique\n\nExaminateur·ice·s : \n\nSteve Kremer\, directeur de recherche Inria Grand Est\nEsther Pacitti\, professeure à l’Université de Montpellier 2\n\nSuperviseurs : \n\nFrançois Charoy\, professeur à l’Université de Lorraine\nGérald Oster\, maître de conférence à l’Université de Lorraine\n\n  URL:https://www.loria.fr/event/soutenance-de-these-victorien-elvinger/ LOCATION:A008 CATEGORIES:Soutenance END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20210617T160000 DTEND;TZID=Europe/Paris:20210617T170000 DTSTAMP:20260608T130213 CREATED:20210512T083920Z LAST-MODIFIED:20210512T083920Z UID:12424-1623945600-1623949200@www.loria.fr SUMMARY:DigiTrust Webinaire : Aleksandr Stepanov DESCRIPTION:L’acte administratif numérique\nLe troisième webinaire du projet LUE IMPACT DigiTrust aura lieu le 17 juin à 16 h sur Teams.\nIl sera présenté par Aleksandr Stepanov\, Doctorant en Droit interne financé par LUE-DigiTrust. \n\nRésumé: L’acte administratif unilatéral est le principal moyen de l’interaction entre l’administration et le citoyen. La dématérialisation des procédures et plus encore l’intervention de l’intelligence artificielle changent fondamentalement le paradigme de son étude. Selon l’étape du processus décisionnel administratif et le degré d’introduction de l’intelligence artificielle\, toutes les caractéristiques essentielles du concept d’acte administratif sont affectées d’une manière ou d’une autre et doivent être revues. Il s’agit principalement de ses aspects objectifs et subjectifs\, c’est-à-dire respectivement la détermination des faits et du droit applicable et la décision administrative elle-même en tant qu’expression de la volonté administrative. En fonction de la technologie censée être utilisée\, les systèmes d’intelligence artificielle basés sur des règles et les systèmes d’apprentissage automatique sont applicables à la procédure administrative\, mais leur utilisation est limitée par les exigences législatives et jurisprudentielles visant à garantir la prévisibilité et la transparence des décisions prises ainsi que maintien des droits et des principes fondamentaux. Il s’agit donc d’un sujet complexe et pluridisciplinaire dont le but est de trouver la cohésion entre la théorie classique du droit administratif français et les enjeux modernes de la République numérique. URL:https://www.loria.fr/event/digitrust-webinar-aleksandr-stepanov/ LOCATION:Teams CATEGORIES:Séminaire ATTACH;FMTTYPE=image/jpeg:https://www.loria.fr/wp-content/uploads/2021/05/W3-scaled.jpg END:VEVENT END:VCALENDAR