BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.17.3.1//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:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20191027T010000
END:STANDARD
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;VALUE=DATE:20201202
DTEND;VALUE=DATE:20201203
DTSTAMP:20201127T155724Z
CREATED:20201127T155724Z
LAST-MODIFIED:20201127T155724Z
UID:11237-1606867200-1606953599@www.loria.fr
SUMMARY:Journée des doctorants de la SIF
DESCRIPTION:La SIF organise le 2 décembre une journée d’information pour les doctorants sur le thème \n“Que faire avec un doctorat en Informatique ?\nValorisation des compétences acquises pendant le doctorat pour une multiplicité de carrières” \nLe programme se trouve à cette adresse \nLien d’inscription \nUn lien vous sera envoyé après inscription pour vous connecter à la visioconférence.
URL:https://www.loria.fr/event/journee-des-doctorants-de-la-sif/
CATEGORIES:Manifestation
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20201202T140000
DTEND;TZID=Europe/Paris:20201202T180000
DTSTAMP:20201127T152955Z
CREATED:20201127T152955Z
LAST-MODIFIED:20201127T152955Z
UID:11235-1606917600-1606932000@www.loria.fr
SUMMARY:Journée Fédération Charles Hermite - Intelligence Artificielle et Automatique : quelles interactions ?
DESCRIPTION:La prochaine journée Fédération Charles Hermite est organisée par Fabien Lauer (LORIA) et Marion Gilson (CRAN). \nElle aura lieu le mercredi 2 decembre 2020 de 14h à 18h sur Teams. \n \nProgramme \nLe but de cette demi-journée est de donner un aperçu des interactions entre les domaines de l’intelligence articielle (en particulier l’apprentissage) et de l’automatique (identification\, diagnostic\, commande. . .). \n14h00 : Accueil – Introduction\nFabien Lauer (LORIA) et Marion Gilson (CRAN) \n14h15 : Hybrid system identication and Learning theory\nFabien Lauer\, LORIA \n15h00 : Indoor Navigation problem : an example where AI and Control benet each other\nChristophe Prieur\, GIPSA-Lab \n15h45 : Regularised reinforcement learning\nMatthieu Geist\, Google Research \n16h30 : Deep learning and Prognostics of dynamical systems under degradation\nMayank Jha\, CRAN
URL:https://www.loria.fr/event/journee-federation-charles-hermite-intelligence-artificielle-et-automatique-quelles-interactions/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20201204
DTEND;VALUE=DATE:20201205
DTSTAMP:20201203T142821Z
CREATED:20201203T142305Z
LAST-MODIFIED:20201203T142821Z
UID:11317-1607040000-1607126399@www.loria.fr
SUMMARY:Soutenance de thèse par Simon Masson
DESCRIPTION:Simon Masson de l’équipe CARAMBA soutiendra sa thèse en français le vendredi 4 décembre à 16h00 en visioconférence. \nIntitulée de la thèse : « Algorithmique des courbes destinées au contexte de la cryptographie bilinéaire et post-quantique » \nRésumé\nCette thèse étudie l’algorithmie de plusieurs applications cryptographiques liées aux courbes elliptiques et aux isogénies de courbes elliptiques. D’une part\, nous étudions le compromis entre efficacité et sécurité concernant les courbes à couplages pour un niveau de sécurité de 128 bits. La menace des récentes avancées sur le calcul de logarithme discret dans certains corps finis nous oriente vers l’étude de nouvelles courbes à couplage. Nous effectuons une comparaison de l’efficacité de ces nouvelles courbes avec celles utilisées actuellement en  estimant le temps de calcul pratique. D’autre part\, nous présentons la cryptographie à base d’isogénies de courbes supersingulières\, considérées actuellement comme résistantes aux ordinateurs quantiques. Nous portons une attention particulière à la sécurité de ces protocoles en apportant une implémentation des calculs d’idéaux connectants entre ordres maximaux d’algèbres de quaternions. Enfin\, nous présentons deux constructions de fonctions à délai vérifiables\, basées sur des calculs de couplages et d’évaluations d’isogénies de grand degré friable. Ces dernières ne sont pas considérées comme résistantes aux ordinateurs quantiques\, mais apportent plusieurs nouveautés par rapport aux constructions actuelles. Nous analysons leur sécurité et effectuons une comparaison entre toutes ces fonctions à un niveau de sécurité de 128 bits. \nMots-clés : courbes elliptiques\, isogénies\, algèbre de quaternions\, couplage\, fonction à délai vérifiable. \nJury\nRapporteur : \nAndreas Enge – Directeur de recherche\, INRIA Bordeaux\nFrancisco Rodríguez-Henríquez – Directeur de recherche\, CINVESTAV Mexico \nExaminatrice : \nMonique Teillaud – Directrice de recherche\, INRIA Nancy\nEmmanuel Fouotsa – Chargé de cours\, Université de Bamenda \nInvité : \nOlivier Bernard – Ingénieur cryptologue\, Thales \nCo-directeur de thèse : \nEmmanuel Thomé – Directeur de recherche\, INRIA Nancy\nAurore Guillevic – Chargée de recherche\, INRIA Nancy
URL:https://www.loria.fr/event/soutenance-de-these-par-simon-masson/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20201211T090000
DTEND;TZID=Europe/Paris:20201211T110000
DTSTAMP:20201210T125740Z
CREATED:20201210T125740Z
LAST-MODIFIED:20201210T125740Z
UID:11356-1607677200-1607684400@www.loria.fr
SUMMARY:PhD defense: Florian Liétard
DESCRIPTION:Florian Liétard\, PhD student at Loria and IECL\, will defend his thesis on Friday\, 11th December at 9am online.
URL:https://www.loria.fr/event/phd-defense-florian-lietard/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20201216T140000
DTEND;TZID=Europe/Paris:20201216T160000
DTSTAMP:20201214T102854Z
CREATED:20201214T102847Z
LAST-MODIFIED:20201214T102854Z
UID:11397-1608127200-1608134400@www.loria.fr
SUMMARY:PhD defense: Pierre Monnin
DESCRIPTION:Pierre Monnin\, PhD student in the Orpailleur team\, will defend his thesis on Wednesday\, 16th December at 2pm. \n \nAbstract:\nIn the Web of data\, an increasing number of knowledge graphs are concurrently published\, edited\, and accessed by human and software agents. Their wide adoption makes key the two tasks of matching and mining. First\, matching consists in identifying equivalent\, more specific\, or somewhat similar units within and across knowledge graphs. This task is crucial since concurrent publication and edition may result in coexisting and complementary knowledge graphs. However\, this task is challenging because of the inherent heterogeneity of knowledge graphs\, e.g.\, in terms of granularities\, vocabularies\, and completeness. Motivated by an application in pharmacogenomics\, we propose two approaches to match n-ary relationships represented in knowledge graphs: a symbolic rule-based approach and a numeric approach using graph embedding.\nWe experiment on PGxLOD\, a knowledge graph that we semi-automatically built by integrating pharmacogenomic relationships from three distinct sources of this domain.\nSecond\, mining consists in discovering new and useful knowledge units from knowledge graphs. Their increasing size and combinatorial nature entail scalability issues\, which we address in the mining of path patterns. We also propose Concept Annotation\, a refinement approach extending Formal Concept Analysis\, a mathematical framework that groups entities based on their common attributes. Throughout all our works\, we particularly focus on taking advantage from domain knowledge in the form of ontologies that can be associated with knowledge graphs. We show that\, when considered\, such domain knowledge alleviates heterogeneity and scalability issues in matching and mining approaches. \nKeywords:\nOntology\, n-ary Tuple\, Preorder\, Graph Embedding\, Path Pattern\, Formal Concept Analysis. \nReferees:\nClaudia d’Amato\, Associate Professor\, University of Bari\nFabien Gandon\, Directeur de recherche\, Inria \nExaminers:\nMarianne Clausel\, Professeure\, Université de Lorraine\nCéline Rouveirol\, Professeure\, Université Sorbonne Paris Nord\nMatthias Samwald\, Associate Professor\, Medical University of Vienna \nSupervisors:\nAmedeo Napoli\, Directeur de recherche émérite\, CNRS\nAdrien Coulet\, Chercheur en détachement\, Inria Paris
URL:https://www.loria.fr/event/phd-defense-pierre-monnin/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20201218
DTEND;VALUE=DATE:20201219
DTSTAMP:20201106T161526Z
CREATED:20201106T161526Z
LAST-MODIFIED:20201106T161526Z
UID:11132-1608249600-1608335999@www.loria.fr
SUMMARY:WebNLG+: 3rd Workshop on Natural Language Generation from the Semantic Web
DESCRIPTION:Workshop Overview\nThere is a growing need in the Semantic Web (SW) community for technologies that give humans easy access to the machine-oriented Web of data. Because it maps data to text\, Natural Language Generation (NLG) provides a natural means for presenting this data in an organized\, coherent and accessible way. Conversely\, the representation languages used by the semantic web (e.g.\, RDF\, OWL\, SPARQL) are a natural starting ground for NLG systems. \nMore on webnlg-challenge.loria.fr/workshop2020
URL:https://www.loria.fr/event/webnlg-3rd-workshop-on-natural-language-generation-from-the-semantic-web/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210107T150000
DTEND;TZID=Europe/Paris:20210107T170000
DTSTAMP:20210104T173348Z
CREATED:20210104T173335Z
LAST-MODIFIED:20210104T173348Z
UID:11428-1610031600-1610038800@www.loria.fr
SUMMARY:PhD defense: Wissem Inoubli
DESCRIPTION:Wissem Inoubli (Capsid Team) will defend his thesis on Thursday\, 7 January 2021 at 3:00 PM in the thesis room at the Department of Mathematics\, Faculty of Sciences of Tunis. \nHis thesis is entitled « Analysis and Mining of Large Dynamic Graphs:  application to graph clustering ». \n \n\nAbstract\nRecently\, graph clustering has become one of the most used techniques to understand structures and inherent knowledge in graph data. This trend progressively attracts the attention of companies and the research community. For example\, in the industrial field\, it is used for multiple applications like social networks (e.g. Facebook)\, where communities can be modeled as clusters in a graph. As for collaborative networks (e.g. DBLP)\, a cluster can represent a team with similar research interests. Several works have been established where their proposed approaches are based on advanced algorithms mainly graph clustering algorithms and modularity based-ones. The former has demonstrated their efficiency notably by providing supplementary information about clusters in a list. Besides\, they can identify hub and outlier vertices. Despite their importance\, the utility of such algorithms is limited by their high complexity particularly when dealing with Big and dynamic graphs. This limitation motivates us to propose new algorithms with higher performances in our thesis. For more details\, our contributions can be summarized in the following points: (1) carrying out of a comparative study between the most popular Big Data platforms (2) proposing a distributed algorithm called DSCAN for large graphs clustering and (3) extending DSCAN to develop an incremental algorithm for dynamic and large graphs. A comparative study between our proposed algorithms and other baselines has shown their effectiveness and their scalability when dealing with large and dynamic graphs\nKeywords: Dynamic graph clustering\, graph mining\, community detection\, Big Data\, graph clustering\, big graph processing\n\nReviewers:\nPr. Lotfi Ben Romdhane\, University of Sousse\, Tunisia\nPr. Osmar Zaiane\, University of Alberta\, Canada\nExaminers:\nPr. Anis Yazidi\, Oslo Metropolitan University\, Norway\nPr. Mohamed Mohssen Gamoudi\, University of Manouba\, Tunisia\nAdvisors: \n\nDr. Sabeur Aridhi\, University of lorraine\, France\nPr. Engelbert Mephu Nguifo\, University of Clermont Auvergne\, France\nPr. Mondher Maddouri\, University of Jeddah\, KSA\nPr. Amel Borgi University of Tunis El Manar\, Tunisia
URL:https://www.loria.fr/event/phd-defense-wissem-inoubli/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210112T093000
DTEND;TZID=Europe/Paris:20210112T113000
DTSTAMP:20210106T142343Z
CREATED:20210106T142343Z
LAST-MODIFIED:20210106T142343Z
UID:11437-1610443800-1610451000@www.loria.fr
SUMMARY:PhD defense: Quentin Laporte-Chabasse
DESCRIPTION:Quentin Laporte-Chabasse (COAST team) will defend his thesis on Tuesday\, January 12th at 9.30 am. \nHis presentation will be in French and is entitled « Étude morpho-statistique des réseaux sociaux. Application aux collaborations inter-organisationnelles. » \n \n\nRésumé de la thèse :\n\n\nLes applications collaboratives décentralisées permettent de répondre aux problèmes de confidentialité\, de disponibilité et de sécurité inhérents aux plateformes collaboratives centralisées. Elles reposent sur un paradigme de communication pair-à-pair selon lequel tous les utilisateurs sont directement connectés les uns aux autres. Les collaborations ayant tendance à s’élargir et dépasser les frontières des organisations\, il est nécessaire de garantir aux utilisateurs le contrôle sur leurs données tout en assurant la disponibilité de la collaboration. Pour ce faire\, il est possible d’utiliser comme topologie le réseau social qui s’est tissé entre les collaborateurs.\n\nLe manque d’information sur ce maillage de confiance nous amène à développer une approche pour étudier ses propriétés morphologiques. Dans cette thèse\, nous développons et mettons en œuvre une approche permettant d’étudier la structure sociale des interactions dans le cadre de collaborations inter-organisationnelles. Nous proposons une approche stochastique qui s’inspire des Exponential Random Graph Models et des modèles spatiaux. Nous définissons un formalisme qui met en avant la structure des interactions et intègre la dimension organisationnelle. Nous proposons d’utiliser une méthode d’inférence bayésienne\, ABC Shdadow\, pour contourner les difficultés liées à l’estimation de ce modèle. Cette approche est mise en œuvre sur un exemple réel : les collaborations initiées par les chercheurs d’un laboratoire. Elle permet notamment de montrer la faible propension\, pour un chercheur\, à tisser des liens avec d’autres laboratoires. Nous montrons que cette approche peut être appliquée à d’autres types d’interactions sociales\, comme les interactions entre les enfants d’une école primaire. Enfin\, nous présentons une stratégie de parallélisation de l’échantillonneur de Gibbs visant à traiter des graphes de plus grande taille dans un temps raisonnable.\n\n\nMots clés : Collaborations inter-organisationnelles\, Analyse des réseaux sociaux\, Exponential Random Graph Model (ERGM)\, Inférence bayésienne.\n\n\n\nLa composition du jury :\n\nRapporteures :\n\nMyriam Maumy-Bertrand\, Maître de Conférences\, Université de Technologie de Troyes\nFlorence Sedes\, Professeur\, Université Toulouse 3\n\n\nExaminateurs :\n\nArnaud Martin\, Professeur\, Université Rennes 1\nRadu Stoica\, Professeur\, Université de Lorraine\n\n\nInvitée :\n\nMarianne Clausel\, Professeur\, Université de Lorraine\n\n\nEncadrants :\n\nFrançois Charoy\, Professeur\, Université de Lorraine\nGérald Oster\, Maître de Conférences\, Université de Lorraine
URL:https://www.loria.fr/event/phd-defense-quentin-laporte-chabasse/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210112T093000
DTEND;TZID=Europe/Paris:20210112T163000
DTSTAMP:20210106T171022Z
CREATED:20210106T171021Z
LAST-MODIFIED:20210106T171022Z
UID:11443-1610443800-1610469000@www.loria.fr
SUMMARY:Journée « Intelligence artificielle : l’ordinateur passe la barrière de la langue »
DESCRIPTION:Le Groupement de Recherche Traitement Automatique des Langues (TAL) du CNRS organise le 12 janvier 2020 une journée « Intelligence Artificielle et technologies des langues : l’ordinateur passe la barrière de la langue ». Celle-ci se déroulera au siège du CNRS dans la limite des places disponibles et en ligne. \n \nCette journée propose un tour d’horizon des récentes avancées des technologies des langues pour des applications au cœur de notre société. Nous verrons comment est utilisée l’intelligence artificielle\, en particulier les nouvelles approches exploitant les réseaux de neurones profonds\, pour aider différents acteurs de la société : formateurs\, journalistes\, scientifiques\, médecins\, mais aussi le grand public. \nInformations et inscriptions sur le site du GDR TAL \nProgramme \n9h30    Introduction\, B. Daille\, directrice du GdR TAL \n9h45    Fouille de publications scientifiques sur le COVID\, B. Favre \n10h30    Ironie\, sarcasme et sentiments : les algorithmes dans les subtilités de la langue\, F. Benamara \n11h15    pause \n11h30    Mon ordinateur est-il un bon psy ? Le TAL au service du diagnostic médical\,M. Amblard \n12h15    La traduction automatique à l’heure des réseaux de neurones\, F. Yvon \nRepas \n14h15    Le dialogue virtuel au service de la formation\, M. Ochs \n15h00    Quand la science-fiction inspire les technologies de la langue\, F. Landragin \n15h45    Les algorithmes à la chasse aux infox\, V. Claveau \n16 H 30 Fin
URL:https://www.loria.fr/event/journee-intelligence-artificielle-lordinateur-passe-la-barriere-de-la-langue/
LOCATION:CNRS\, 3\, rue Michel Ange\, Paris\, France
CATEGORIES:Conférence
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210114T090000
DTEND;TZID=Europe/Paris:20210114T110000
DTSTAMP:20210113T174246Z
CREATED:20210113T174246Z
LAST-MODIFIED:20210113T174246Z
UID:11484-1610614800-1610622000@www.loria.fr
SUMMARY:PhD defense: Hoai Le Nguyen
DESCRIPTION:Hoai Le Nguyen\, PhD student in the COAST team\, will defend his thesis on Thursday\, January 14th a at 9am.\nHis defense is entitled « Study of conflicts in Collaborative Editing » and will be held in English.\n\n \nAbstract:\n\nEarly researches about Collaborative Editing (CE) (in the 1990s and the early 2000) focused on describing different characteristics of CE based on interviewing people who had participated in some CE projects. Some recent researches about CE started analyzing the logs of CE activities to study how people edit together with support of modern CE tools such as Git version control systems and Google Docs.\nFrom the general view point\, the process of CE is the continuous synchronization of ‘multiple\, parallel streams of activity’ of collaborators. If the synchronization takes place less often\, for example in the development of a software project based on Git version control system\, the work mode is called ‘asynchronous’. And if the synchronization takes place within a small interval\, for example in editing a shared document in ShareLaTex\, the work mode is called ‘synchronous’. The longer the divergence is\, more conflicts are likely to happen during the synchronization. Resolving conflicts is costly\, especially after a long period of divergence. Understanding how often conflicts happen and how users resolve conflict in real CE projects is important to ensure good performance and user experience in collaborative editing. In the first part of this thesis\, we study the collaboration traces of four large open source projects in Git version control system. We analyze different types of textual conflicts that arise during the development and how developers resolve these types of conflict. In particular regarding ‘adjacent-lines conflicts’\, we found that users mostly resolve them by applying changes from both sites. Besides\, we also analyze how often users use ‘roll-back to previous version’ as a way to resolve merge conflicts.\nThe process of CE based on online collaborative editor is more specific. It can be split into several ‘sessions’ of editing which are performed by a single author or several authors. They are denoted as ‘single-authored sessions’ and ‘co-authored sessions’  respectively. This fragmentation process requires a predefined ‘interval’ or ‘maximum time gap’ which is not yet well defined in previous studies. In the second part of this thesis\, we analyze the logs of CE works of students of an Engineering School using  ShareLaTeX which were collected and anonymized for privacy purpose. By examining different ‘maximum time gaps’ from 30 seconds to 15 minutes on the logs we found that we can define a suitable ‘maximum time gap’ to split CE activities into sessions by evaluating the distribution of the ‘external-distance’. Besides\, we analyse the editing activities inside each ‘co-author session’. We borrow a [30 seconds\, 10 characters] time-position window to examine these ‘potential conflict’ cases. The result shows that people rarely edit closely in both time-position. However\, conflicts are more likely to happen in these cases.\nKeywords: collaborative editing\, conflict\, version control\, real-time collaborative editors\n\n\nJury members:\nRapporteurs:\nMme Sophie CHABRIDON\, Professeur\, Télécom SudParis – FRANCE\nM Stefano ZACCHIROLI\, Maître de Conférences\, Université  de Paris – FRANCE \n\nExaminers:\nM Horatiu CIRSTEA\, Professeur\, Université de Lorraine – FRANCE \nMme Hala SKAF-MOLLI\, Maître de Conférences\, Université de Nantes – FRANCE \n\n\nSupervisors:\nM François CHAROY\, Professeur\, Université de Lorraine – FRANCE\nMme Claudia IGNAT\, Chargée de recherche\, Inria Nancy-Grand Est – FRANCE
URL:https://www.loria.fr/event/phd-defense-hoai-le-nguyen/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210201T140000
DTEND;TZID=Europe/Paris:20210201T160000
DTSTAMP:20210118T085751Z
CREATED:20210118T085751Z
LAST-MODIFIED:20210118T085751Z
UID:11494-1612188000-1612195200@www.loria.fr
SUMMARY:PhD defense: Itsaka Rakotonirina
DESCRIPTION:Itsaka Rakotonirina\, PhD student in the Pesto Team\, will defend his thesis on Monday\, February 1st at 2pm. \n \nTitle: Symbolic verification of cryptographic protocols\, theory and practice \nThe defence will be english. You can also find his dissertation here. \nAbstract: \nThis thesis studies the analysis of cryptographic protocols. They are sequences of instructions permitting to interact with a recipient remotely while protecting the sensitive content of the communication from a potential malicious third party. Classical cases where the confidentiality and the integrity of the communication are critical are\, among others\, online payments and medical-service booking\, or electronic voting. \nWe study notions of security defined technically by observational equivalences (which includes among others confidentiality\, anonymity or non-traceability). We designed a program\, DeepSec\, which\, from the description of a protocol for a fixed number of participants\, verifies in a fully-automated way whether the protocol offers a security guarantee of this type. We demonstrate the ability of this tool to analyse complex attack scenarios through several examples\, optimisations\, and a detailed study of the complexity of the underlying problem. \nJury: \nDavid Basin (ETH Zurich) – reviewer\, president \nTamara Rezk (Inria Sophia Antipolis) – reviewer \nMyrto Arapinis (University of Edinburgh) \nVincent Cheval (Inria Nancy) – co-advisor \nThomas Jensen (Inria Rennes) \nSteve Kremer (Inria Nancy) – advisor \n\n\n\nCatuscia Palamidessi (Inria Saclay)
URL:https://www.loria.fr/event/phd-defense-itsaka-rakotonirina/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20210204
DTEND;VALUE=DATE:20210205
DTSTAMP:20210127T090552Z
CREATED:20210127T090552Z
LAST-MODIFIED:20210127T090552Z
UID:11506-1612396800-1612483199@www.loria.fr
SUMMARY:CISPA-LORIA Virtual Workshop on Cybersecurity
DESCRIPTION:The CISPA – LORIA virtual workshop on cybersecurity will take place on Thursday\, February 4th. \n \n\n\n\nOrganization: Prof. Antoine Joux Program \n\n\n\n\n\n\n\n\n\n10:00am-10:15am: Get together in the gather.town common space (15 min) \n10:30am-10:50am: Benoît-Michel Cogliati (Researcher\, CISPA) and Virginie Lallemand (Researcher\, LORIA): Deterministic Authenticated Encryption GIAE from the Tweakable Pseudorandom Injection TableSpoon (20 min) \n10:50am-11:00am: Discussion (10 min) \n11:00am-11:20am: Bizhan Alipourpijani (PhD Student funded by DigiTrust\, LORIA): Online Attacks on Picture Owner Privacy (20 min) \n11:20am-11:30am: Discussion (10 min) \n11:30am-01:00pm: Lunch break (90 min) \n01:00pm-01:20pm: Robert Künnemann (Research group leader at CISPA): Accountability without bounds! (20 min) \n01:20pm-01:30pm: Discussion (10 min) \n01:30pm-01:35pm:  5-minute break \n01:35pm-01:55pm: Jannik Dreier (Associate Professor at Université de Lorraine\, member of the PESTO team at LORIA): Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols (20 min) \n01:55pm-02:05pm: Discussion (10 min) \n02:05pm-02:30pm: Final discussion (25 min) \n\n\n\n\nAbstracts\nSpeakers: Benoît-Michel Cogliati (Research group leader at CISPA) and Virginie Lallemand (CNRS \nresearcher in the CARAMBA team at LORIA) \nTitle: Deterministic Authenticated Encryption GIAE from the Tweakable Pseudorandom Injection TableSpoon \nAbstract: This paper explores the use of fixed-length Tweakable Pseudorandom Injections (TPRIs) in the context of deterministic authenticated encryption (DAE). First\, we propose an efficient generic construction that turns a secure tweakable block cipher (TBC) into an expanding secure TPRI with minimal security loss. Second\, we instantiate this generic structure and present TableSpoon\, a fixed- length TPRI based on Deoxys-BC\, the AES-based tweakable block cipher used in one of the winners of CAESAR. We design and analyze a new TPRI-based DAE scheme that bears similarities to the GCM-SIV mode of operation. Our new mode is highly efficient\, parallelizable\, and offers $(n+\min(n\,t))/2$ bits of security\, where n\,t denote respectively the input block size and the tweak size of the underlying TPRI. When implemented using TableSpoon\, we achieve speeds of 1.20 c/B during the encryption of 64kB messages on the Skylake microarchitecture\, which is significantly faster than earlier TBC-based DAE schemes that offer similar security guarantees. \n===================================================================== \nSpeaker: Bizhan Alipourpijani (PhD Student funded by DigiTrust\, LORIA) Title: Online Attacks on Picture Owner Privacy \nAbstract:\nFacebook is the dominant platform for users to interact\, share pictures\, and stay connected to their friends. Attribute inference attacks are emerging threats to user privacy in social media such as Facebook. We present an online attribute inference attack by leveraging Facebook picture metadata (i) alt-text generated by Facebook to describe picture contents\, and (ii) comments containing words\, emojis posted by other Facebook users. Specifically\, we study the correlation of the picture’s owner with Facebook generated alt-text and comments used by commenters when reacting to the picture. We concentrate on gender attribute\, which is highly relevant for targeted advertising or privacy breaking. We explore how to launch an online gender inference attack on any Facebook user by handling online newly discovered vocabulary using the retrofitting process\, for enriching a core vocabulary built during offline training. Our experiments show that even when the user hides most public data (e.g.\, friend list\, public attribute\, page\, group)\, an attacker can detect user gender with AUC (area under the ROC curve) from 87% to 92%\, depending on the picture metadata availability. Moreover\, we can detect with high accuracy sequences of words leading to gender disclosure\, and accordingly\, enable users to derive countermeasures and configure safely their privacy settings. \n===================================================================== \nSpeaker: Robert Künnemann (Research group leader at CISPA) Title: Accountability without bounds! \n\n\n\n\n\n\nAbstract: Accountability in protocol design allows us to examine\, justify and incentivize trust and provide a basis to act upon attacks that cannot be prevented a priori. We capture accountability as a protocol’s ability to identify the causes of any eventual violation of some security goal and translate it into trace properties that can be automatically verified. More recently\, we extended this verification mechanism with support for an unbounded set of participants. Finally\, we look at accountability in a setting where protocol parties are truly independent\, i.e.\, they can choose not to follow the protocol without giving control to some designated adversary. \n===================================================================== \nSpeaker: Jannik Dreier (Associate Professor at Université de Lorraine\, member of the PESTO team at LORIA) \nTitle: Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols \nAbstract: Tamarin is a popular tool dedicated to the formal analysis of security protocols. One major strength of the tool is that it offers an interactive mode\, allowing to go beyond what push-button tools can typically handle. Tamarin is\, for example\, able to verify complex protocols such as TLS\, 5G\, or RFID protocols. However\, one of its drawbacks is its lack of automation. For many simple protocols the user often needs to help Tamarin by writing specific lemmas\, called “sources lemmas”\, which requires some knowledge of the internal behavior of the tool. \nIn this paper\, we propose a technique to automatically generate sources lemmas in Tamarin. We prove formally that our lemmas indeed hold for arbitrary protocols that make use of cryptographic primitives that can be modelled with a subterm convergent equational theory (modulo associativity and commutativity). We have implemented our approach within Tamarin. Our experiments show that\, in most examples of the literature\, we are now able to generate suitable sources lemmas automatically\, in replacement of the hand-written lemmas. As a direct application\, many simple protocols can now be analyzed fully automatically\, while they previously required user interaction. \n\n\n\n 
URL:https://www.loria.fr/event/cispa-loria-virtual-workshop-on-cybersecurity/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210210T084500
DTEND;TZID=Europe/Paris:20210210T120000
DTSTAMP:20210203T103307Z
CREATED:20210108T081921Z
LAST-MODIFIED:20210203T103307Z
UID:11472-1612946700-1612958400@www.loria.fr
SUMMARY:Point d'étape du projet LUE OLKi
DESCRIPTION:La communauté OLKi et plus largement les membres des laboratoires du consortium OLKi sont invités le mercredi 10 février matin au point d’étape du projet avec le Comité exécutif de Lorraine Université d’Excellence et des experts extérieurs invités. \n \nProgramme \n\n8h45 – 9h00 : Réglages techniques (15′) \n9h00 – 9h15 : Tour de table (15′) \n9h15 : Présentation des travaux des work packages (1h30) \n9h15 – 9h40 : WP1 Connaissance et ingénierie \n9h40 – 10h05 : WP2 Langage \n10h05 – 10h30 : WP3 Défis sociétaux \n10h30 – 10h45 : Focus sur la plateforme OLKi \n10h45 – 11h00 : Pause (15′) \n11h00 – 12h00 : Discussion entre le Comex LUE\, des experts invités et le comité opérationnel sur le projet et sa trajectoire \n12h00 – 13h00 : Forum autour des pitches avec présence des auteurs pour répondre aux questions\nInscriptions via ce lien
URL:https://www.loria.fr/event/point-detape-du-projet-lue-olki/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210211T090000
DTEND;TZID=Europe/Paris:20210211T120000
DTSTAMP:20210211T150748Z
CREATED:20210211T150748Z
LAST-MODIFIED:20210211T150748Z
UID:11510-1613034000-1613044800@www.loria.fr
SUMMARY:PhD defense: Daniel El Ouraoui
DESCRIPTION:Daniel El Ouraoui\, doctorant dans l’équipe Mosel-Veridis\, soutiendra sa thèse intitulée « Méthodes pour le raisonnement d’ordre supérieur dans SMT »\, effectuée sous la direction de Jasmin Blanchette\, Pascal Fontaine et Stephan Merz\, le 11 février à 9h. \n \nRésumé :\n \nLa vérification formelle de programmes informatiques ou de systèmes dits\ncritiques tels que dans le transport\, l’énergie\, etc\, est essentielle pour\ngarantir le bon fonctionnement de ces systèmes. Les méthodes de vérification\nemployées s’appuient très fortement sur des procédés mathématiques et logiques\npermettant de raisonner de manière formelle sur le comportement de ces systèmes.\nCes procédés définissent généralement les comportements sous forme de grands\nensembles de contraintes logiques. L’approche par satisfaisabilité est une\nméthode largement utilisée pour vérifier ces contraintes et est un exemple de\ncas\, où les solveurs SMT (satisfaisabilité modulo théories) sont\nfortement sollicités \nGénéralement\, les solveurs SMT ne gèrent que la logique de premier ordre et ils \nne peuvent généralement pas effectuer de preuves par induction. C’est regrettable\, car la\nplupart des outils de vérification interactifs\, qui utilisent les solveurs SMT\,\nutilisent des langages d’ordre supérieur. \nL’objectif de cette thèse dans sa globalité est d’offrir des solutions pour\naméliorer les interactions entre solveur automatique et assistant de preuves. En\nparticulier nous répondons à deux problématiques importantes permettant\nd’améliorer les usages de solveurs SMT au sein des assistants de preuves. Notre\npremière contribution permet de réduire l’écart entre solveur et assistant de\npreuve en proposant une architecture adaptée pour la logique d’ordre supérieur.\nLa seconde contribution permet d’améliorer les capacités de raisonnement des\nsolveurs SMT pour les quantificateurs. Pour les deux approches développées nous\napportons un ensemble d’évaluation sur des problèmes extraits pour la grande\nmajorité de problèmes de formalisation. Les résultats obtenus lors de ces\névaluations sont encourageants et montrent que les techniques développées dans\ncette thèse peuvent apporter de bonnes améliorations pour les solveurs SMT. \nCe doctorat s’est effectué dans le cadre du projet ERC porté par Jasmin Blanchette\n(Matryoshka)\, un projet qui vise à concevoir des\nprouveurs automatiques utiles pour la vérification interactive\, et réduire\nl’écart entre les prouveurs interactifs et solveurs automatiques. L’un des\nobjectifs concrets du projet est d’étendre les capacités de raisonnement des\nsolveurs SMT vers l’ordre supérieur. \n\n\nMembres du jury :\n \nRapporteurs :\nMme Micaela MAYERO \, Maître de conférences\, IUT de Villetaneuse – Université Sorbonne Paris Nord – FRANCE\nM. Yakoub SALHI \, Professeur\, Université d’Artois – FRANCE\nExaminateurs :\nM. David DÉHARBE\, Professeur\, CLEARSY Aix-en-Provence – FRANCE\n\nMme Catherine DUBOIS\, Professeur\, Ecole Nationale Supérieure d’Informatique pour l’Industrie et l’Entreprise – FRANCE\nMme Chantal KELLER\, Maître de conférences\, LRI\, Université Paris-Saclay – FRANCE\n\n\nEncadrants :\nM. Jasmin BLANCHETTE\, Professeur associé\, Université libre d’Amsterdam – PAYS-BAS\nM. Pascal FONTAINE\, Professeur\, Université de Liège – BELGIQUE\nM. Stephan MERZ\, DR2\, Inria Nancy – Grand Est – FRANCE
URL:https://www.loria.fr/event/phd-defense-daniel-el-ouraoui/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210212T140000
DTEND;TZID=Europe/Paris:20210212T153000
DTSTAMP:20210211T151125Z
CREATED:20210211T151125Z
LAST-MODIFIED:20210211T151125Z
UID:11512-1613138400-1613143800@www.loria.fr
SUMMARY:D3 Seminar: Thomas Lambert (Inria Rennes)
DESCRIPTION:Next D3 seminar will take place on February 3rd at 2pm online.\nThomas Lambert\, postdoctoral researcher at Inria Rennes\, will give a presentation entitled ‘Performance Analysis and Optimality Results for Data-Locality Aware Tasks Scheduling with Replicated Inputs »\n\n \n« Replication of data files\, as automatically performed by Distributed File Systems such as HDFS\, is known to have a crucial impact on data locality in addition to system fault tolerance. Indeed\, intuitively\, having more replicas of the same input file gives more opportunities for this task to be processed locally\, i.e.without any input file transfer. Given the practical importance of this problem\, a vast literature has been proposed to schedule tasks\, based on a random placement of replicated input files. Our goal in this study is to evaluate the performance of the default greedy placement algorithm\, both in terms of makespan minimization (minimize the completion time of the last task when non-local processing is forbidden) and communication minimization (minimize the number of non-local tasks when no idle time on resources is allowed). In the case of homogenous tasks\, we are able to prove\, using models based on « balls into bins » and « power of two choices » problems\, that the well known good behavior of classical strategies can be theoretically grounded. Going further\, we even establish that it is possible\, using semi-matchings theory\, to find the optimal solution in very small time. We also use known graph-orientation results to prove that this optimal solution is indeed near-perfect with strong probability. »
URL:https://www.loria.fr/event/d3-seminar-thomas-lambert-inria-rennes/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210218T130000
DTEND;TZID=Europe/Paris:20210218T174500
DTSTAMP:20210121T173939Z
CREATED:20210121T173939Z
LAST-MODIFIED:20210121T173939Z
UID:11504-1613653200-1613670300@www.loria.fr
SUMMARY:Journée Fédération Charles Hermite : IA et énergie
DESCRIPTION:Le prochaine journée scientifique de la Fédération Charles Hermite (CRAN\, IECL\, LORIA) aura lieu le 18 février de 13h30 à 17h45 en ligne. \nOrganisée par Vincent Chevrier (équipe Simbiot du Loria) et Antoine Lejay (IECL)\, elle a pour thématique « Intelligence artificielle et énergie ». \n \n\n\n\nNotre société vit actuellement une transition énergétique qui pose de nombreux défis en termes de gestion de la production\, du transport\, du stockage et de la consommation de l’énergie. \nCes défis concernent la société dans sa globalité et leur étude demande une réflexion systémique. Ils posent de nombreuses questions qui dépassent largement le cadre du domaine de l’énergie touchant notamment à celui de l’intelligence artificielle. \nCe séminaire a pour objectif de présenter quelques travaux à l’intersection de l’intelligence artificielle et de l’énergie\, et plus particulièrement deux facettes de l’intelligence artificielle qui sont les systèmes multi-agents et l’apprentissage. \nCe séminaire est organisé dans le cadre institutionnel de la fédération Charles Hermite. \nORGANISATION PRATIQUE \nCe séminaire a lieu en distanciel sous TEAMS. \n– PROGRAMME PRÉVISIONNEL – \n13h30 : Introduction (Antoine Lejay\, Vincent Chevrier) \nSession 1 (14h – 15h30) \n1. Autoconsommation collective de l’énergie et simulation multi-agent de l’activité humaine \nPrésentateur : Nicolas Sabouret (Laboratoire Interdisciplinaire des Sciences du Numérique-LISN\, Université Paris-Saclay) \nContributeurs : \n\nJérémy Albouys-Perrois (LISN et Université de La Rochelle)\nMathieu Schumann (EDF R&D)\nChristian Inard (Laboratoire des Sciences de l’Ingénieur pour l’Environnement (LaSIE)\,\nUniversité de La Rochelle)\nYvon Haradji\nRésumé :\nNos travaux se situent dans le cadre du projet SMACH fruit d’une collaboration de plus de 10 ans entre EDF R&D et le CNRS autour de la simulation multi-agent de l’activité en relation avec la consommation énergétique. Nous présenterons nos derniers travaux qui portent sur la modélisation de l’AutoConsommation Collective (ACC) au sein du secteur résidentiel. L’originalité de notre approche multi-agent et multi-niveau est sa capacité de simuler l’autoconsommation collective dans des configurations contractuelles variées\, en plaçant au centre de la démarche les processus de décision des foyers et de leurs occupants\, et en prenant en compte la diversité de l’activité humaine et le comportement thermique des bâtiments comme base de la consommation d’énergie. L’articulation de ces composantes est absente des travaux actuels dans ce domaine\, alors même que plusieurs études ont montré leur importance. Nous présenterons notre modélisation des échanges contractuels de l’énergie au sein de groupements de foyers partageant une organisation des échanges. Nous illustrerons les possibilités de notre modèle à travers l’étude de quelques cas d’étude métiers pour différentes configurations d’ACC.\n\n\n\n\n\n\n\n\n\n\n2. Maitriser l’énergie pour la durabilité de la matière communicante : application au projet McBIM \nPrésentateurs : William Derigent et Michael David (CRAN – Université de Lorraine) \nRésumé :\nEn 2009\, le CRAN a débuté l’étude du concept de « matières communicantes »\, qui sont des matériaux capables de traiter\, d’échanger de l’information et de stocker des données dans leur structure interne. L’objectif du projet ANR McBIM\, porté par le CRAN\, est de concevoir un béton intelligent\, instrumenté dès sa fabrication avec des capteurs communicants sans fil\, et connecté à son environnement et aux services du BIM (Building Information Modelling) tout au long de son cycle de vie. Construire ce béton impose de pouvoir lever les obstacles scientifiques sous-jacents liés à la problématique de préservation d’énergie qui sont a) la conception de communications sans-fil robustes\, peu impactées par l’environnement béton\, et surtout sobres énergétiquement b) la définition de techniques de récupération d’énergie radiofréquence pour étendre la durée de vie des capteurs enfouis\, c) la définition de nouvelles stratégies de gestion du réseau de nœuds communicants\, permettant de contrôler les flux de collecte et l’homogénéité de la dispersion énergétique. C’est ce dernier point (c) qui sera plus particulièrement développé dans cet exposé\, celui qui permet de lier l’ensemble des techniques en s’appuyant sur la modélisation sous forme de système multi-agents et sur la notion de jumeau numérique du réseau. \n15h30 Pause \nSession 2 (15h35 – 17h05) \n\n\n\n\n\nLearning Energy Efficient Processor Speeds in Real Time Systems\n\n\n\nPrésentateurs : Bruno Gaujal (Inria Grenoble – Rhône-Alpes\, LIG – Laboratoire d’Informatique de Grenoble\, UGA – Université Grenoble Alpes) \nContributeurs : Alain Girault et Stéphan Plassart (Inria Grenoble – Rhône-Alpes\, LIG – Laboratoire d’Informatique de Grenoble\, UGA – Université Grenoble Alpes) \n\n\n\n\nRésumé :\nWe present an algorithm that learns the parameters of a Markov Decision Process (MDP)\, that is then used to compute an efficient speed policy for a single core processor to execute real time jobs while minimizing its energy consumption. The learning mechanism is based on the measurement of real time jobs whose features (release time\, size and deadlines) are unknown at the begining of the learning period. Once the learning phase is completed\, the speed that the processor should use in all possible configurations of the jobs is computed and will be used in the exploitation phase to minimize the energy consumption while completing all jobs before their deadlines. \nReported experiments show that the energy consumption of the learned speed policy is very close to the case where job features are known in advance\, using both simulation of generic jobs and real traces from the automobile industry. \n2. Machine Learning Interactif pour les opérateurs du réseau électrique français : application à l’explication des contraintes de transits (titre provisoire) \nPrésentateurs : Laure Crochepierre (LORIA-Inria Univerѕité de Lorraine\, RTE) et Lydia Boudjeloud-Assala (LORIA-CentraleSupélec Metz) \n17h05 Pause \n17h10-17h45 Table Ronde
URL:https://www.loria.fr/event/journee-federation-charles-hermite-ia-et-energie/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210222T160000
DTEND;TZID=Europe/Paris:20210222T173000
DTSTAMP:20210218T085445Z
CREATED:20210218T085445Z
LAST-MODIFIED:20210218T085445Z
UID:11544-1614009600-1614015000@www.loria.fr
SUMMARY:PhD defense: Sylvain Cecchetto
DESCRIPTION:Sylvain Cecchetto (Carbone) will defend his PhD on Monday\, February 22nd at 4pm. \nHis thesis is entitled « Data flow analysis to build control flow graph of obfuscated codes »\, his presentation will be held in French.\n\n \nAbstract:\nThe increase in cyber attacks around the world makes malicious code analysis a priority research area. This software uses various protection methods\, also known as obfuscations\, to bypass antivirus software and slow down the analysis process. In this context\, this thesis provides a solution to build the Control Float Graph (CFG) of obfuscated binary code. We developed the BOA platform (Basic blOck Analysis) which performs a static analysis of a protected binary code. For this\, we have defined a semantics based on the BINSEC tool to which we have added continuations. These allow on one hand to control the self-modifications\, and on the other hand to simulate the operating system to handle system calls and interruptions. The static analysis is done by symbolically executing the binary code and calculating the values of the system states using SMT solvers. Thus\, we perform a data flow analysis to build the CFG by calculating the transfer addresses. Finally\, loop handling is performed by transforming a CFG into a pushdown automaton. BOA is able to compute dynamic jump addresses\, to detect opaque predicates\, to compute return addresses on a stack even if they have been falsified\, to manage interrupt handler falsifications\, to rebuild import tables on the fly\, and finally\, to manage self-modifications. We validated the BOA correction using the Tigress code obfuscator. Then\, we tested BOA on 35 known packers and showed that in 30 cases\, BOA was able to completely or partially rebuild the initially protected binary. Finally\, we detected the opaque predicates protecting XTunnel\, a malware used during the 2016 U.S. elections\, and we partially unpacked a sample of the Emotet Trojan\, which on 14/10/2020 was detected by only 7 antivirus programs out of the 63 offered by VirusTotal This work contributes to the development of tools for static analysis of malicious code. In contrast to dynamic methods\, this solution allows an analysis without executing the binary\, which offers a double advantage : on the one hand\, a static approach is easier to deploy\, and on the other hand\, since the malicious code is not executed\, it cannot warn its author.Keywords: Malware\, Obfuscation\, Data flow\, Symbolic execution\, Control flow graph.Jury members:Referes:Valérie Viet Triem Tong – CentraleSupélec Rennes José Fernandez – Polytechnique MontréalExaminers:Nadia Tawbi – Université LavalSarah Zennou – AirbusStephan Merz – Université de LorraineGuest: \nSébastien Bardin – CEA LIST\nColas Le Guernic – Verimag\nSupervisors: \nJean-Yves Marion – Université de Lorraine\nGuillaume Bonfante – Université de Lorraine
URL:https://www.loria.fr/event/phd-defense-sylvain-cecchetto/
LOCATION:Teams
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210226T090000
DTEND;TZID=Europe/Paris:20210226T103000
DTSTAMP:20210225T122432Z
CREATED:20210225T112147Z
LAST-MODIFIED:20210225T122432Z
UID:11617-1614330000-1614335400@www.loria.fr
SUMMARY:PhD defense : Pierre-Edouard Osche
DESCRIPTION:Pierre-Edouard Osche (Kiwi) will defend his thesis on Friday\, 26th February at 9 am. \nHis thesis is entitled “Sequence-based recommendations in a multidimensional space » and supervised by Anne Boyer and Sylvain Castagnos. \nAbstract:\nRecommender systems are a fundamental research topic at the intersection of several major disciplines such as machine learning\, human-computer interaction and cognitive sciences. They also constitute an ambitious application framework for the community of researchers in Artificial Intelligence by their great complexity and the numerous constraints they generate. \nThe purpose of these systems is to improve the interaction between the general audience and the systems of search and access to information. It has become difficult to identify the most relevant items in the context of big data. The goal is thus to assist users in their explorations (whether in a virtual or physical environment)\, but also to propose items that may interest them but that they would not consult spontaneously. \nCurrent systems have largely proven their added value and are based on various machine learning techniques (numerical or symbolic\, supervised or not\, etc.) [Castagnos\, 2008]. Nevertheless\, they still suffer from limitations when making recommendations of sequences (recommending items in a specific order may depend on requirements\, progressiveness\, context\, time constraints\, etc.). Some models\, such as the DANCE model [Castagnos\, 2015]\, integrate this temporal dimension by following in real time the evolution in diversity of resources consulted by users to better understand the exploration context. In [Bonnin\, 2010]\, the author also proposes a temporal model capable of detecting frequent consultation patterns in a history of consultations\, in order to provide a priori resource recommendations related to the same context. Nevertheless\, while temporal and spatial modeling have been made possible [Zheng\, 2015]\, state-of-the-art models that focus on sequence recommendations or on the overall quality of the sequence are still too rare. \nIn the framework of this thesis\, we will focus on defining a new formalism and a methodological framework allowing : (1) the definition of human factors leading to decision making and user satisfaction; (2) the construction of a generic and multi-criteria model (physical or temporal constraints\, diversity\, progressiveness\, etc.)\, integrating these human factors in order to recommend relevant resources in a coherent sequence; (3) a holistic evaluation of user satisfaction with its recommendation path. The evaluation of recommendations\, all domains included\, is currently done recommendation by recommendation with each evaluation metric taken independently (accuracy\, diversity\, novelty\, coverage\, …). Thus\, we expect a more comprehensive evaluation framework\, measuring the progressiveness and the completeness of the path. \nSuch a multi-criteria recommendation model has many application frameworks. As an example\, it can be used in the context of online music listening with the recommendation of adaptive playlists (recommendation of music sequences to change the atmosphere in a place such as a bar\, to raise or lower the emotion felt by the audience progressively\, or to adapt to the complementary/similar/different expectations of a group). It can also be useful to adapt the recommendation path to the learner’s progress and the teacher’s pedagogical scenario in an e-education context. Let us also mention the tourism field where this model could integrate the spatial and temporal constraints of a physical environment (cities\, museums\, etc.). \nKeywords: Recommender systems\, Multi-agent systems\, User modeling. \nCommittee: \nRewievers:\n– Mme Sylvie Calabretto\, Professeur\, INSA de Lyon\, France\n– M. Laurent Vercouter\, Professeur\, INSA de Rouen\, France \nExaminer:\n– M. Laurent Vigneron\, Professeur\, Université de Lorraine\, France \nSupervisor:\n– M. Sylvain Castagnos\, Maître de conférences\, Université de Lorraine\, France
URL:https://www.loria.fr/event/phd-defense-pierre-edouard-osche/
LOCATION:online
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210226T140000
DTEND;TZID=Europe/Paris:20210226T153000
DTSTAMP:20210219T145022Z
CREATED:20210219T145011Z
LAST-MODIFIED:20210219T145022Z
UID:11605-1614348000-1614353400@www.loria.fr
SUMMARY:PhD defense : Anastasia Shimorina (Synalp)
DESCRIPTION:Anastasia Shimorina (Synalp) will defend her thesis on Friday\, 26th February at 2pm. \nHer thesis is entitled « Natural Language Generation: from Data Creation to Evaluation via Modelling » and supervised by Claire Gardent and Yannick Parmentier. \nAbstract:\nNatural language generation is a process of generating a natural language text from some input. This input can be texts\, documents\, images\, tables\, knowledge graphs\, databases\, dialogue acts\, meaning representations\, etc. Recent methods in natural language generation\, mostly based on neural modelling\, have yielded significant improvements in the field. Despite this recent success\, numerous issues with generation prevail\, such as faithfulness to the source\, developing multilingual models\, few-shot generation. This thesis explores several facets of natural language generation from creating training datasets and developing models to evaluating proposed methods and model outputs. \nIn this thesis\, we address the issue of multilinguality and propose possible strategies to semi-automatically translate corpora for data-to-text generation. We show that named entities constitute a major stumbling block in translation exemplified by the English-Russian translation pair. We proceed to handle rare entities in data-to-text modelling exploring two mechanisms: copying and delexicalisation. We demonstrate that rare entities strongly impact performance and that the impact of these two mechanisms greatly varies depending on how datasets are constructed. Getting back to multilinguality\, we also develop a modular approach for shallow surface realisation in several languages. Our approach splits the surface realisation task into three submodules: word ordering\, morphological inflection and contraction generation. We show\, via delexicalisation\, that the word ordering component mainly depends on syntactic information. Along with the modelling\, we also propose a framework for error analysis\, focused on word order\, for the shallow surface realisation task. The framework enables to provide linguistic insights into model performance on the sentence level and identify patterns where models underperform. Finally\, we also touch upon the subject of evaluation design while assessing automatic and human metrics\, highlighting the difference between the sentence-level and system-level type of evaluation. \nKeywords: natural language generation\, data-to-text generation\, surface realisation\, evaluation\, error analysis \nCommittee: \nReviewers:\n– Emiel Krahmer\, Full Professor\, Tilburg University\, the Netherlands\n– Kees van Deemter\, Full Professor\, Utrecht University\, the Netherlands \nExaminer:\n– Dimitra Gkatzia\, Associate Professor\, Edinburgh Napier University\, UK \nSupervisors:\n– Claire Gardent\, Directrice de recherche\, CNRS\, LORIA\, France\n– Yannick Parmentier\, Maı̂tre de conférences\, Université de Lorraine\, France
URL:https://www.loria.fr/event/phd-defense-anastasia-shimorina/
LOCATION:online
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210304T150000
DTEND;TZID=Europe/Paris:20210304T160000
DTSTAMP:20210302T154719Z
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:20210304T195532Z
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:20210219T145520Z
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:20210303T142722Z
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:20210312T122646Z
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:20210317T091328Z
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:20210312T122217Z
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:20210323T143513Z
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:20210316T154038Z
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:20210225T122349Z
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:20210310T144619Z
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
END:VCALENDAR