BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.16.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:LORIA
X-ORIGINAL-URL:https://www.loria.fr
X-WR-CALDESC:Events for 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:20211201T110000
DTEND;TZID=Europe/Paris:20211201T120000
DTSTAMP:20260520T152532
CREATED:20211104T154931Z
LAST-MODIFIED:20211124T145949Z
UID:14165-1638356400-1638360000@www.loria.fr
SUMMARY:D5 Seminar: Yvonne Delevoye
DESCRIPTION:Next D5 Seminar will take place on Wednesday\, 1st December at 11am in the Amphitheater with Yvonne Delevoye\, Professor in Cognitive Psychology at the Université de Lille – Human motor performance ; Leader of the Playful City Lille community-based research project. \nShe will make a presentation entitled “Move your body and I will tell you how you feel: Motor timing to reveal affective states”. \nAsbtract: \nEmotions influence decisions to act. Anger\, fear and joy are coded by contrasting gestures and attitudes in social situations. During my talk\, I will expose the methods and results developed in our laboratory around the general theme of emotional body movements. \nThe aim of our work is to demonstrate that emotions impact not only the decision to act and the gesture to produce\, but also the way a movement unfolds through space and time. \nIn a first study\, I will report how music can change body kinematics both in simple actions (finger tapping) and in gait. In a second study\, we used imagery to trigger emotional movements. Here\, a total of eight actors were invited to recall a life-event that engaged social human events that triggered contrasting states of emotions\, before walking freely through a gymnasium following a marked path. Markers (18) placed on body-joints provided the means to collect 3D kinematics of whole-body movements in a series of 30s gait trials. The findings confirm that high-energy emotions (anger; joy) are characterized by faster gait patterns compared to that observed in low-energy emotions (sadness; contentment). Negative-valanced emotions (anger; fear; sadness) were characterized by closed postures (shoulders in; head down) and more jerky patterns compared to that observed in positive-valanced emotions (joy; contentment). The final part of my talk will present how markerless technology can now offer ecological studies. By applying cross-wavelet techniques\, our work suggests that clustering techniques applied to 3D whole-body actions may offer a window in the cognitive mechanisms of emotional body movements. \nKeywords: Kinematics\, Motor Control\, Time Series\, Affective States\, Posture \n  \n  \nBiography: \nTheme: “Motor tempo\, interactions and emotional body movements”\nAfter a PhD thesis in behavioral neuroscience (Birmingham\, UK – Prof. Alan Wing)\, I studied the role of motor prediction in the emergence of the sense of agency and in the sensory experience of the body in action. The concepts of effort\, tolerance\, pleasure are at the heart of a reflection around emotional body movement. \nTeacher and researcher at the University of Lille since 2004\, I work in a multidisciplinary team to develop studies in action psychology in laboratory-set and natural environments (3D kinematics; physiological responses; eye tracking) and also in virtual reality (UNITY). Through public (ANR) and private fundings\, our results have confirmed that emotional experiences depend on the ability to properly predict expected sensations. We have shown that the spontaneous tempo is the pace for which actions are the easiest to plan and control; it is the pace for which our predictions are the best. Thus\, spontaneous tempo could be the cadence promoting minimal effort for the emergence of pleasurable experiences. \nSince 2017\, we have created a research group to create innovating tools to measure how human adults predict and maintain the same behavior over time. More specifically\, we study the psycho-physiological mechanisms influencing emotional motor behaviors with the analysis of brain activities (FNIRS)\, physiological responses (Empatia) and motor behavior modulations (Qualysis). Various inductions are used as music\, odors and colored designs. \nProfessor in neuropsychology since 2012\, I lead the collaborative project entitled Sport-Plaisir with Decathlon from 2013 to 2016. Today\, I am the main investigator of the Living Lab project POC Playful City\, funded by the University of Lille and the University of Lille MEL from 2018 to 2020. In collaboration with Trinoma\, our future studies will aim to develop increased and interactive sensory environments in the Lille agglomeration using the new generation of markerless 3D camera systems. This project is funded in part by the CNRS (80Prime) and is developed at the Imaginarium Building in Tourcoing. \n 
URL:https://www.loria.fr/event/d5-seminar-yvonne-delevoye/
LOCATION:Amphithéâtre du Loria
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20211203T130000
DTEND;TZID=Europe/Paris:20211203T140000
DTSTAMP:20260520T152532
CREATED:20211118T113553Z
LAST-MODIFIED:20211118T113652Z
UID:14228-1638536400-1638540000@www.loria.fr
SUMMARY:Projection film : Voyage autour des sciences
DESCRIPTION:Venez à la projection du film documentaire réalisé par l’équipe de “Science vagabonde” et échangeons autour des la place des sciences dans notre société ! \nSynopsis \nLa science se fait-elle uniquement dans des laboratoires ? La perçoit-on de la même manière dans n’importe quelle région ou pays du monde ? … Pour répondre à ces questions\, Mariana et Thibaud\, couple franco-mexicain passionné de sciences et de voyages\, se lancent dans une aventure hors du commun : un voyage autour des sciences. Sac sur le dos et caméra à la main\, ils traverseront huit pays américains à la rencontre de scientifiques pour recueillir leurs témoignages. Du Mexique au Costa Rica\, en passant par les États-Unis et Cuba\, les rencontres qu’ils feront changeront leur regard sur les sciences et la société. Changeront-elles le vôtre ?
URL:https://www.loria.fr/event/projection-film-voyage-autour-des-sciences/
LOCATION:Amphithéâtre du Loria
CATEGORIES:Projection
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20211207T114000
DTEND;TZID=Europe/Paris:20211207T121500
DTSTAMP:20260520T152532
CREATED:20211203T165840Z
LAST-MODIFIED:20211203T165840Z
UID:14484-1638877200-1638879300@www.loria.fr
SUMMARY:Signature du laboratoire commun Cybermallix - 360 Grand Est
DESCRIPTION:Rendez-vous le mardi 7 décembre à 11h40 dans le Hall Rhin – transformation numérique de 360 Grand Est\, pour la signature officielle du laboratoire commun Cybermallix. \nFace aux virus et malwares\, Cybermallix contre attaque :\nLe CNRS\, l’Université de Lorraine\, Inria et WALLIX\, éditeur européen de logiciels de cybersécurité\, allient leurs compétences pour renforcer la lutte contre les malwares. L’objectif est de concevoir et de développer des solutions de cybersécurité prédictive\, basées sur l’intelligence artificielle\, afin de maximiser la détection de logiciels malveillants. \nEn présence de : \n\nJean-Noël de Galzain\, Fondateur et PDG de WALLIX\nJean-Luc Moullet\, Directeur général délégué à l’innovation du CNRS\nKarl Tombre\, Vice-président Stratégie Européenne et Internationale de l’Université de Lorraine\nFrançois Cuny\, Directeur général délégué à l’innovation d’Inria\nJean-Yves Marion\, Directeur du Loria\n\nPlus d’informations et inscriptions sur le site de 360 Grand Est \n360 Grand Est\, sous l’impulsion de la Région Grand Est et avec le soutien de l’Etat et de ses partenaires CCI Grand Est\, BPI\, la Banque des Territoires et l’ADEME\, est le rendez-vous incontournable de l’innovation et de la croissance en région Grand Est.
URL:https://www.loria.fr/event/signature-du-laboratoire-commun-cybermallix-360-grand-est/
LOCATION:360 Grand Est
CATEGORIES:Manifestation
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20211207T140000
DTEND;TZID=Europe/Paris:20211207T170000
DTSTAMP:20260520T152532
CREATED:20211129T083519Z
LAST-MODIFIED:20211129T083519Z
UID:14306-1638885600-1638896400@www.loria.fr
SUMMARY:PhD Defense: Yann Bernard
DESCRIPTION:Yann Bernard (Biscuit) will defend his thesis on Tuesday\, December 7th at 2pm. \nHis presentation will be in French and is entitled “Calcul neuromorphique pour l’exploration et la catégorisation robuste d’environnement visuel et multimodal dans les systèmes embarqués”. \n\n \nRésumé :\n\nTandis que la quête pour des systèmes de calcul toujours plus puissants se confronte à des contraintes matérielles de plus en plus fortes\, des avancées majeures en termes d’efficacité de calcul sont supposées bénéficier d’approches non conventionnelles et de nouveaux modèles de calcul tels que le calcul inspiré du cerveau. Le cerveau est une architecture de calcul massivement parallèle avec des interconnexions denses entre les unités de calcul. Les systèmes neurobiologiques sont donc une source d’inspiration naturelle pour la science et l’ingénierie informatiques. Les améliorations technologiques rapides des supports de calcul ont récemment renforcé cette tendance à travers deux conséquences complémentaires mais apparemment contradictoires : d’une part en offrant une énorme puissance de calcul\, elles ont rendu possible la simulation de très grandes structures neuronales comme les réseaux profonds\, et d’autre part en atteignant leurs limites technologiques et conceptuelles\, elles ont motivé l’émergence de paradigmes informatiques alternatifs basés sur des concepts bio-inspirés. Parmi ceux-ci\, les principes de l’apprentissage non supervisé retiennent de plus en plus l’attention. \nDans ce contexte\, le premier objectif de cette thèse a été de combiner cartes auto-organisatrices (SOM) et champs neuronaux dynamiques (DNF) pour l’exploration et la catégorisation d’environnements réels perçus au travers de capteurs visuels de différentes natures. Le second objectif a été de préparer le portage de ce calcul de nature neuromorphique sur un substrat matériel numérique. Ces deux objectifs visaient à définir un dispositif de calcul matériel qui pourra être couplé à différents capteurs de manière à permettre à un système autonome de construire sa propre représentation de l’environnement perceptif dans lequel il évolue. Nous avons ainsi proposé et évalué un modèle de détection de nouveauté à partir de SOM. Les considérations matérielles nous ont ensuite amené à des optimisations algorithmiques significatives dans le fonctionnement des SOM. Enfin\, nous avons complémenté le modèle avec des DNF pour augmenter le niveau d’abstraction avec un mécanisme attentionnel de suivi de cible.
URL:https://www.loria.fr/event/phd-defense-yann-bernard/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20211207T160000
DTEND;TZID=Europe/Paris:20211207T180000
DTSTAMP:20260520T152532
CREATED:20211206T102620Z
LAST-MODIFIED:20211206T102620Z
UID:14560-1638892800-1638900000@www.loria.fr
SUMMARY:PhD defense: Aude Le Gluher (Caramba)
DESCRIPTION:Aude Le Gluher (Caramba) will defend her thesis on Tuesday\, 7th December at 4pm in room A008. \nHer presentation will be in English and is entitled “Symbolic computation and complexity analyses for number theory and cryptography”. \nSummary : This thesis focuses on three problems that all relate to cryptography: the factorization of integers\, the computation of discrete logarithms in multiplicative sugroups of finite fields and the computation of Riemann-Roch spaces on plane projective curves.\nTo this day\, the Number Field Sieve (NFS for short) is the most efficient algorithm allowing to factor integers and compute discrete logarithms in finite fields\, both in theory and in practice. First\, we thoroughly study the asymptotic complexity of this algorithm. We prove very precise asymptotic formulas for the asymptotic complexity of NFS and show that\, unfortunately\, these formulas cannot be used to extrapolate NFS computing times for cryptographically-relevant input sizes. Indeed\, such sizes are far smaller than the sizes needed for the use of the asymptotic formulas to even make sense. This study allows to question the standard method used to establish key sizes for RSA-based cryptography.\nSince relying on its asymptotic complexity seems a questionable method to predict practical computing times for the Number Field Sieve\, we turn to another approach: simulation. Thus\, we study an algorithm that simulates a step of the NFS algorithm\, namely\, the filtering step. The end goal of such an algorithm is to partly predict the behaviour of a computation done with an NFS implementation without actually running it\, which would be too costly. We describe this simulation tool in detail\, propose a number of experiments aimed at assessing its reliability and accuracy\, and present their results.\nFinally\, we present a probabilistic algorithm for the computation of Riemann-Roch spaces on projective plane nodal curves\, whose efficiency rests on two extensively studied building blocks in modern computer algebra: fast arithmetic of univariate polynomials and fast linear algebra. As a by-product\, our algorithm also yields a fast method for computing the group law on the Jacobian of a plane curve. We assess the efficiency of this algorithm both theoretically through a complexity analysis and experimentally using an implementation we made. \nJury:\n\nM. Karim Belabas\, Université de Bordeaux (rapporteur)\nM. Laurent Imbert\, Université de Montpellier (rapporteur)\nMme Cécile Dartyge\, Université de Lorraine (examinatrice)\nMme Vanessa Vitse\, Université Grenoble-Alpes (examinatrice)\nM. Thorsten Kleinjung\, EPFL (invité)\nM. Pierre-Jean Spaenlehauer\, Inria Nancy-Grand Est (directeur de thèse)\nM. Emmanuel Thomé\, Inria Nancy-Grand Est (directeur de thèse)
URL:https://www.loria.fr/event/phd-defense-aude-le-gluher-caramba/
LOCATION:A008
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20211209T083000
DTEND;TZID=Europe/Paris:20211209T170000
DTSTAMP:20260520T152532
CREATED:20211102T092938Z
LAST-MODIFIED:20211102T092938Z
UID:14158-1639038600-1639069200@www.loria.fr
SUMMARY:Journée Scientifique Fédération Charles Hermite : "Pseudorandomness\, cryptography and number theory"
DESCRIPTION:8h30-9h00 : Accueil \n\n\n09h00-10h00 : Domingo GÓMEZ-PÉREZ (Santander\, Espagne) \n10h00-10h30 : Pause-café \n10h30-11h30 : Marine MINIER (LORIA) \n11h40-12h40 : Cathy SWAENEPOEL (IMJ\, Paris) \n12h40-14h30 : Repas \n14h30-15h30 : Sihem MESNAGER (Université de Paris VIII) \n15h30-16h00 : Pause-café \n\n\n16h00-17h00 : László MÉRAI (RICAM\, Linz\, Autriche) \nInscription gratuite et obligatoire ici avant le 19 novembre \n\n\n\n\nJS Fédération Charles Hermite 09/12/21\nOrganisateurs : Cécile DARTYGE (IECL)\nDamien JAMET (LORIA)\nPierre POPOLI (IECL)\nThomas STOLL (IECL)
URL:https://www.loria.fr/event/journee-scientifique-federation-charles-hermite-pseudorandomness-cryptography-and-number-theory/
LOCATION:Amphithéâtre du Loria
CATEGORIES:Autres
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20211213
DTEND;VALUE=DATE:20211214
DTSTAMP:20260520T152532
CREATED:20211206T101436Z
LAST-MODIFIED:20211206T101436Z
UID:14558-1639353600-1639439999@www.loria.fr
SUMMARY:Department 3 PhD Day
DESCRIPTION:The Department 3 PhD Day will take place on Monday\, December 13th in the room C005 of Loria. \nProgram: \n8:30 – 8:55 Welcome coffee and pastries (room A008) \n9:00 – 9:30 Opening session (room C005)\nThomas Lambert (MCF\, joined LORIA in sept. 2021)\nMaking Distributed Applications Communication-Aware \n9:30 – 10:35 session 1 (room C005)\nMohamed Oulaaffart (20’)\nAutomating Security Enhancement for Cloud Services \nAdrien Hemmer (20’)\nPredictive Security Monitoring for Large-Scale Internet-of-Things \nJean-Philippe Eisenbarth (20’)\nEthereum’s Peer-to-Peer Network Monitoring and Sybil Attack prevention \nOmar Anser (5’)\nAutomation of security counter-measures in Mobile-Edge Computing infrastructure \n10:35 – 10:55 coffee break (room A008) \n11:00 – 12:40 session 2 (room C005)\nDebashisha Mishra (20’)\nUAV Cellular Communication for Vertical Industries in 5G and Beyond \nAmalia Macali (20’)\nDesigning exact optimization methods for process synthesis \nPhilippe Graff (20’)\nDevelopment and orchestration of microservices for low latency and secure applications. \nRunbo Su (20’)\nPDTM: Phase-based dynamic Trust Management for Internet of Things \nAlexandre Bourbeillon (20’)\nMeasuring trust in distributed collaborative systems \n12:45 – 14:00 Lunch at the Canteen \n14:00 – 16:10 session 3 (room C005)\nAmaury Saint-Jore (20’)\nMulti-Agent\, Machine / Deep / Continuous Learning and Augmented / Mixed reality for\nnetworked\, collaborative and mobile robots \nPierre-Antoine Rault (20’)\nAccess Control and Security Mecanisms in Distributed Systems with no Central Authority \nClelie Amiot (20’)\nTrustworthy cognitive assistants for large-scale collaboration \nMatthieu Nicolas (20’)\nEfficient (re)naming in Conflict-free Replicated Data Types (CRDTs) \nMaxime Samson (20’)\nAssister la conception et la configuration de réseaux TSN par une approche basée sur les\nmodèles \nImene Zaidi (co-supervised UL-UHA) (20’)\nGestion optimisée de la charge de flotte de véhicules électriques \nEnzo d’Andréa (5’)\nReusable and Adaptable Machine Learning for Network Security \nDiego Vega (5’)\nCombining co-simulation with optimization and learning\n___________________________________________________________________________\nAppendix: Abstracts of the presentations \nSession 1\nMohamed OULAAFFART\nAutomating Security Enhancement for Cloud Services\nAbstract: The main objectives of this PhD thesis are to propose\, design and evaluate automated\nsecurity strategies for protecting cloud services\, with a particular focus on challenges related to\nthe migration of resources composing these services. The first part of the work will be dedicated\nto the elaboration of a state-of-the-art\, taking into account the analysis of existing orchestration\nlanguages\, such as the TOSCA language (Topology and Orchestration Specification for Cloud\nApplications)\, for building and implementing elaborated cloud services\, as well as current\nsecurity mechanisms that have been proposed so far for protecting cloud elementary resources.\nThe second part will consist in proposing a security management framework\, as well as\nautomation algorithms to support the security enhancement of cloud services\, during the\nmigration of resources. This enhancement will potentially rely on both endogeneous security\nmechanisms through the hardening of cloud resources\, as well exogeneous security\nmechanisms based on the activation of chains of security functions. The third part will be\nfocused on the development of a proof-of-concept prototype\, and the performance evaluation\nof the proposed security automation strategies. The analyzed use cases will consider the specific\nrequirements expressed by the H2020 Concordia project\, and will give a specific interest to\nvulnerability management issues.\nkey words : Security\, Enhancement\, Composite Services\, Orchestration\, Cloud\,\nAutomation\, Migration. \nAdrien HEMMER\nPredictive Security Monitoring for Large-Scale Internet-of-Things\nAbstract: Recently\, Internet-of-Things has grown in importance in multiple domain such as\ndomestic with smart-homes or industrial with the industry 4.0. It is complex to manage IoT\ninfrastructure because each of its device can be really different\, in addition they lack power and\ncompute efficiency. Moreover\, to add in complexity\, the devices can be made by several third\nparties that do not use the same protocols for collecting or sending information. As a result\,\nsuch a system is too complex to be absolutely secured\, and is naturally a source of potential\nthreats.\nThe objective of the thesis\, in the context of the European H2020 project SecureIoT\, to define\nand evaluate a predictive security framework for IoT for devices from multiple domains. The\nchallenging goal is to observe evidences of future attacks or misuse by collecting and\nintegrating heterogeneous data. In the new IoT architecture under construction\, a security\nengine has to be designed for the predictive analysis. This engine has to perform a security\nassessment\, using collected data\, and support decision on counter-measures. However\, the\ngathered data have to be meaningful in order to detect abnormal behaviours of systems.\nFurthermore\, the monitoring and collection process have to be scalable to handle complex realtime\necosystem. \nJean-Philippe EISENBARTH\nEthereum’s Peer-to-Peer Network Monitoring and Sybil Attack prevention\nAbstract: Public blockchains\, like Ethereum\, rely on an underlying peer-to-peer (P2P) network\nto disseminate transactions and blocks between nodes. With the rise of blockchain applications\nand cryptocurrencies values\, they have become critical infrastructures which still lack\ncomprehensive studies. In this paper\, we propose to investigate the reliability of the Ethereum\nP2P network. We developed our own dependable crawler to collect information about the peers\ncomposing the network over one month. Our data analysis regarding the size of the network\,\nthe geographical distribution of peers and the churn rate shows good network properties.\nHowever\, in a second time\, we investigate suspicious patterns that can denote a Sybil attack.\nWe find that many nodes hold numerous identities in the network and could become a threat.\nTo mitigate future Sybil attacks\, we propose an architecture to detect suspicious nodes and\nrevoke them. It is based on a central monitoring system\, a smart contract to propagate the\ninformation and an external revocation tool to help clients remove their connections to\nsuspicious peers. Our experiment on Ethereum’s Test network proved that our solution is\neffective. \nOmar ANSER\nAutomation of security counter-measures in Mobile- Edge Computing infrastructure\nAbstract:Nowadays\, cybersecurity is a major concern everywhere with the growth of co\nnnected devices that are beyond common computers. People are connected using their\nsmartphone but also with Internet-of-Things (IoT) devices. Everything tends to be connected\nin buildings\, cars\, factories\, cities\, airplanes… with all the risks that induces.\nTo circumvent these problems\, decades of research and development have led to build new\ntechniques and tools to fight back to the attacks over Internet. Nonetheless\, the number of\nattacks and their magnitude still grow.\nAs a result\, guaranteeing a high level of security is very challenging. New methods to\ncounteract against new threats and attacks will be proposed. However\, a practical problem is to\nproperly use the arsenal of all these techniques: What to use? For which purposes? When? How\nto configure it? What should be given as inputs… Hence\, a large set of questions remain even\nif you assume that you have all possible techniques at your disposal. Unfortunately security is\nstill mostly manual or only assisted. Developing an autopilot for managing the security of\nconnected systems is an ultimate goal but highly challenging.\nThis thesis aims at proposing a framework and techniques to empower the automation of\nnetwork security assuming a highly dynamic environment\, in particular Mobile-Edge\nComputing infrastructure and 5G. \nSession 2\nDebashisha MISHRA\nUAV Cellular Communication for Vertical Industries in 5G and Beyond\nAbstract: UAV and Cellular technology are two mutual beneficial ecosystems. In this\npresentation\, two integration paradigms are highlighted for enabling support towards emerging\nbusiness verticals (e.g.\, automotive\, multi-media\, industry 4.0 etc.) in 5G and beyond systems:\n(1) UAV as an Aerial Base Station (UAV-BS)\, and (2) UAV as an Aerial User of the existing\n5G network (UAV-UE). In the first paradigm (UAV-BS)\, we showcase and reason on the\nemerging network slicing approach for UAV-BS platform catering services from\nheterogeneous business verticals. In the second paradigm (UAV-UE)\, feasibility of realizing\ninter-UAV communication based on cellular Sidelink (PC5 radio interface) is discussed. We\nalso provide a technical overview of potential options to leverage UAV communication in 6G\nera. \nAmalia MACALI\nDesigning exact optimization methods for process synthesis\nAbstract: The main topics of my PhD is the optimization of membrane separation technology.\nMembrane separation technology is often used to achieve gas purification and it can be used in\ndifferent aspects of the industry. The performance of membrane separation depends on the\noperating conditions and the interconnections between the selected equipment. Membranes for\ngas separation can be made of different materials\, and each material leads to different\npermeability performances. When a mixture of gas enters the membrane some components\nhaving low permeability pass through the membrane as in a tube\, forming the retentate output\,\nwhereas other components with higher permeability drop through the material\, forming the\npermeated output of the membrane. When a high level of purity is required\, one separation\nstage is not enough\, and multiple stages are needed. In this case\, a problem of membrane system\ndesign has to be solved where the number of stages\, the interconnections and the operating\nconditions for each stage have to be chosen. The objective function to be considered is the cost\nof the system\, ensuring a certain level of performance in terms of purity and recovery of the\ndesired gas. Up to now\, the problem has been solved using a heuristic global optimization\napproach\, which was a combination of multistart and a problem tailored Monotonic Basin\nHopping. The proposed method was applied to optimize and analyse several well-known and\nimportant gas separation cases. The degrees of freedom of the optimization model were\nincreased case by case considering more parameters as decision variables and optimizing the\nseparation process design. The obtained results were good\, but since the algorithm is heuristic\,\nthere is no guarantee of finding the global optimal solution \nPhilippe GRAFF\nDevelopment and orchestration of microservices for low latency and secure applications.\nAbstract: Within the scope of the ANR project MOSAICO (Orange\, Montimage\, UTT\,\nLORIA)\, this PhD project proposes to design\, implement and validate micro-services based on\noptimized virtualized network functions but integrated in a more global architecture using\nseveral different network programmability technologies.\nTo achieve this ambitious goal\, the project will adopt an experimental methodology organized\nin 4 tasks.\nThe first one will consist in studying the different micro-services architecture for the network\nand selecting the most suitable one for our case study.\nIn a second step\, the identification\, specification and design of micro-services and the definition\nof the global architecture of the project will be carried out in partnership with the other partners.\nThe first function to be created will be a flow classifier based on machine learning techniques\nand allowing the detection of real-time flows in order to process them in a specific way.\nThe specified micro-services will then be implemented and evaluated in a synthetic\nenvironment close to reality in order to verify their adequacy with the strong QoS and security\nconstraints of the project.\nFinally\, the last task that will be carried out jointly with an engineer aims at evaluating the\nwhole solution applied to an immersive service in real conditions such as cloud gaming. \nRunbo SU\nPDTM: Phase-based dynamic Trust Management for Internet of Things\nAbstract : Un modèle de la gestion de la confiance qui permet de maintenir la fiabilité des\nsystèmes IoT et en même temps identifier les attaques de malveillants en calculant les scores\nde confiance des noeuds de manière diversifiée et dynamique en termes de phases. \nAlexandre BOURBEILLON\nMeasuring trust in distributed collaborative systems\nAbstract: In recent years\, the growth of the Internet has led to the development of collaborative\ndistributed systems. In such systems\, a large number of users contribute simultaneously to\naccomplish a common task. One of the best-known examples of collaborative distributed\nsystems is Wikipedia\, which is the biggest open encyclopedia existing. Wikipedia’s\nmain objective is to produce neutral and high-quality articles. To achieve this kind of goal\,\nbeing able to measure how well we can trust any user is very important. It allows the platform\nto adapt its policies and other users to adapt their behaviour regarding previous interactions.\nMoreover\, it is an efficient way to design strategies to handle harmful contributors and thus\nincrease the quality of the content and the number of contributors.\nThe objective of the thesis is to define and validate trust metrics that help predict how well a\nuser of a distributed collaborative system will behave in the future based on its previous\ncontributions in Wikipedia. Our aim is to base this metric on the quality of each contribution\nproduced by the user. We investigated the usage of several metrics to compute the quality of a\ncontribution using the notion of longevity. Longevity is a measure of quality based on how well\nthe contribution will survive to future edits and be maintained in the document. \nSession 3\nAmaury SAINT-JORE\nMulti-Agent\, Machine / Deep / Continuous Learning and Augmented / Mixed reality for\nnetworked\, collaborative and mobile robots\nAbstract: The overall objective is to develop a system of interconnected robots seen as Cyber-\nPhysical Systems (CPS) allowing to carry out autonomous missions in complex environments\ninteracting with operators and increasing their context awareness.\n– The primary objective is to help the Human being in different tasks.\n– This multi-agent system is composed of mobile and agile ground robots and aerial UAVs\,\ncapturing different data in the field from several points of views: images\, geolocation\, sounds\,\netc.\n– Data\, information and experiences can be exchanged between robots but also transmitted to\ncomputers carried by one or more operators to help them carry out their mission.\n– Data can be viewed using an augmented / mixed reality headset providing digital and spatial\ninformation.\n– Each agent will be assigned one or more AIs\, to perform object recognition\, environment\nmodelling\, or to define the path and guidelines to be followed\, or to monitor other agents. A\nglobal distributed AI is embedded on the robot\, and the operators will allow the supervision of\neach agent and their associated AI\, as well as assess the state and evolution of the system as a\nwhole.\nThe system continuously adapts the individual and collective response to the situation\naccording to different scales. \nPierre-Antoine RAULT\nAccess Control and Security Mecanisms in Distributed Systems with no Central\nAuthority\nAbstract: Distributed applications are part of our everyday lives\, but too often their good\noperation depends on central servers\, which are single points of failure and performance\nbottlenecks. Designing systems for fully distributed communications however still requires\nporting common mechanisms needed for feature-rich applications: user rights differentiation\,\nend-to-end confidentiality\, administrators and other application-specific roles. We rely on\nconflict-free replicated data types (CRDT) to allow each user to exchange independently and\nconcurrently without coordination\, and present our own CRDT to manage a distributed access\ncontrol policy. To verify that policy stays consistent\, we examine different applicative use cases\npertaining to collaborative edition\, and design conflict resolution strategies at the document and\npolicy levels. In order to guarantee confidentiality in a distributed setting\, we also consider\nsecure communication protocols and how to integrate their operation in a collaborative group.\nTo that end\, we plan to extend our work with a novel CRDT tying key exchanges from select\nasynchronous key exchange protocols to policy operations affecting group membership. \nClelie AMIOT\nTrustworthy cognitive assistants for large-scale collaboration\nAbstract: Collaborative endeavors are happening on an increasingly larger scale. Digitalization\nand globalization allow organizations to collaborate across borders and time zones on projects\nlike commercial releases\, academic research\, or crisis management. However\, those\ncollaborations bring their challenges: ever growing data to parse\, different levels of security\nclearances to manage\, and varying vocabularies\, expertise\, and processes to coordinate.\nCognitive assistants are a promising solution to help decision-making and reduce mistakes\ncaused by this overload of constraints. My thesis investigates how implementing a cognitive\nagent in a large-scale collaboration can be done while maintaining trust in the tool. Indeed\, an\nuntrustworthy tool will not be used or will cause delays by being over-monitored\, such as using\nbackchannels to check the tool’s information and actions. We highlighted a clear difference in\nreception between human and robot assistants\, where people showed higher compliance to a\nchatbot’s advice but lower engagement in the reasoning process. Our work will also investigate\nthe impact of a chatbot assistant on a team’s dynamics performing a collaborative task and how\nit can be adjusted for efficient and trustful collaboration. \nMatthieu NICOLAS\nEfficient (re)naming in Conflict-free Replicated Data Types (CRDTs)\nAbstract: To achieve high availability\, large-scale distributed systems have to replicate data\nand to minimise coordination between nodes. For these purposes\, literature and industry\nincreasingly adopt CRDTs to design such systems. CRDTs are new specifications of existing\ndata types\, e.g. Set or Sequence. While CRDTs have the same behaviour as previous\nspecifications in sequential executions\, they actually shine in distributed settings as they\nnatively support concurrent updates. To this end\, CRDTs embed in their specification conflict\nresolution mechanisms. These mechanisms usually rely on identifiers attached to elements of\nthe data structure to resolve conflicts in a deterministic and coordination-free manner.\nIdentifiers have to comply with several constraints\, such as being unique or belonging to a dense\ntotal order. These constraints may hinder the identifier size from being bounded. Identifiers\nhence tend to grow as the system progresses\, which increases the overhead of CRDT over time\nand leads to performance issues. To address this issue\, we propose a novel Sequence CRDT\nwhich embeds a renaming mechanism. It enables nodes to reassign shorter identifiers to\nelements in an uncoordinated manner. Experimental results demonstrate that this mechanism\ndecreases the overhead of the replicated data structure and eventually minimises it. \nMaxime SAMSON\nAssister la conception et la configuration de réseaux TSN par une approche basée sur les\nmodèles\nAbstract: Les nouvelles fonctionnalités qu’apportent les standards définis par le groupe de\ntravail IEEE 802.1 TSN à la commutation Ethernet permettent son utilisation pour des réseaux\ntemps réel. Ces nouvelles fonctionnalités rendent possible la conception de réseaux Ethernet\ndéterministes\, mais au prix d’un effort de configuration très important. Cette difficulté de\nconfiguration s’applique à la fois aux équipements réseaux et aux outils utilisés pour concevoir\nces réseaux\, par exemple des simulateurs.\nNotre approche est basée sur les modèles et permet la génération automatique de la\nconfiguration d’un réseau TSN pour des outils tels que des simulateurs. Cette approche simplifie\nlest étapes de conception et de configuration du réseau et assure la cohérence entre les\nconfigurations générées pour les différentes cibles. La grande diversité des outils de conception\,\ntant par leur nombre que par les différentes fonctionnalités de TSN qu’ils supportent\, permet à\nune approche de génération d’offrir un gain de de temps important en simplifiant leur utilisation. \nImene ZAIDI (co-supervised UL-UHA)\nGestion optimisée de la charge de flotte de véhicules électriques\nAbstract : Dans le cadre de la lutte contre la crise climatique\, plusieurs gouvernements ont pris\ndes mesures visant à encourager l’adoption des véhicules électriques pour diminuer l’émission\nde gaz à effet de serre. Actuellement les véhicules électriques sont encore peu nombreux sur le\nréseau routier et leur impact sur le réseau électrique reste faible. Néanmoins\, il s’avère\nimportant d’anticiper une éventuelle saturation des stations de recharges en cas de déploiement\nmassif de ces véhicules dans les années à venir. Aussi\, il est primordial de proposer des outils\nopérationnels permettant aux stations d’assurer de la qualité de service de recharge tout en\nrespectant les contraintes physiques imposées par les opérateurs des réseaux électrique. C’est\nl’objectif assigné à ce travail de thèse. Plus précisément\, l’objet de ces travaux portent sur la\nrecharge intelligente qui va permettre aux opérateurs des stations de recharge d’optimiser la\nplanification de la recharge afin de répondre le mieux possible aux attentes des usagers et en\nmême temps de minimiser le coût et la consommation d’énergie. Pour cela\, nous travaillons sur\nla modélisation mathématique des différentes variantes de problème de planification de la\nrecharge des véhicules électriques. Nous étudions également la classe de complexité de ces\nproblèmes. De plus\, nous proposons des nouveaux algorithmes d’optimisation adaptés à ces\nproblèmes y compris des algorithmes d’optimisation en temps réel. Enfin\, nous sommes amenés\nà faire des simulations et des tests pour valider les approches développées. \nEnzo d’ANDREA\nReusable and Adaptable Machine Learning for Network Security\nAbstract: Cybersecurity is a major concern everywhere with the growth of connected devices.\nThe attack surface therefore increases with the number of devices but also with the number of\napplications they support. Techniques used by attackers and defenders evolved and includes\ncomplex mechanisms with for example massive use of encryption which serves both attackers\nand defenders. As a result\, machine learning and artificial intelligence has become a major field\nof study regarding network security.\nWith the use of Machine Learning comes the problem of choosing the right set of features\,\nmetrics but also algorithm. The reusability of existing results is limited as context-specific\ninterpretation or adaptation is required. There exists some proposal\, especially for port numbers\nor IP adresses\, but proposed metrics are usually too coarse-grained and are far from being\nsatisfactory.\nA major research challenge is the definition of network-based features that are both meaningful\nand reusable in a variety of scenarios. A second challenge is to select the right sets of attributes\nwith the context\, with criteria being for example the contribution to final results\, but also cost\nto collect and transform.\nThe first objective of the thesis is to define new representations of network data as features for\nML algorithms. The second objective of the thesis is to define a method to automatically select\nthe right set of features. \nDiego VEGA\nCombining co-simulation with optimization and learning\nAbstract: The thesis aims to explore the relationships between co-simulation\, optimization and\nlearning having in mind to propose a global decision support approach based on cosimulation.\nThe relationships between co-simulation\, optimization and learning can be\nconsidered in multiple ways. A first point of view can be to consider optimization and learning\nas “beside” the co-simulation tool and being able to execute it to obtain data and/or to modify\nthe parameters or the structure of the multi-model. These relationships can also be conceived\nat different levels: at the level of a component/model or at the level of the composite/system.\nAnother point of view is to consider that optimization and learning are part of the co-simulation\nas a component (and therefore as a model) of decision within the simulated system. The central\nidea of study is to question the DEVS formalism and the associated concept of System\, Entity\nStructure in order to assess to what extent they are compatible with these different notions of\noptimization and learning\, and under what assumptions according to each of the facets\ncompatibility can exist. A first (restricted) case study will be chosen and confronted with a first\nproposal of definitions\, then in an incremental way\, the proposal will be improved and again\nconfronted with one or several case studies.
URL:https://www.loria.fr/event/department-3-phd-day/
LOCATION:C005
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20211213T140000
DTEND;TZID=Europe/Paris:20211213T170000
DTSTAMP:20260520T152532
CREATED:20211209T155353Z
LAST-MODIFIED:20211209T155353Z
UID:14577-1639404000-1639414800@www.loria.fr
SUMMARY:PhD Defense: Waldez Azevedo Gomes Junior (Larsen)
DESCRIPTION:Waldez Azevedo Gomes Junior (Larsen) will defend his thesis on Monday\, December 13th at 2pm in room A008. \nHis presentation is entitled “Improving Ergonomics Through Physical Human-Robot Collaboration” and will be in English. \nAbstract: \nThis thesis aims to provide tools for improving ergonomics at work environments. Some work activities in industry are commonly executed by workers in a non-ergonomic fashion\, which may lead to musculoskeletal disorders in the short or in the long term. \nWork-related Musculoskeletal Disorders (WMSDs) are a major health issue worldwide\, that also represents important costs both for society and companies. WMSDs are known to be caused by multiple factors\, such as repetitive motion\, excessive force\, and awkward\, non-ergonomic body postures. Not surprisingly\, work environments with such factors may present an incidence of WMSDs of up to 3 or 4 times higher than in the overall population.\nHere\, our approach is to evaluate the human motion with respect to ergonomics indexes\, optimize the motion\, and intervene on the task based on the optimized motion. \nTo evaluate the body posture ergonomics\, we developed a Digital Human Model (DHM) simulation capable of replaying whole-body motions.\nIn simulation\, the initial movement can be iteratively improved\, until an optimal ergonomic whole-body motion is obtained.\nWe make the case that a robot in physical interaction with a human could drive the human towards more ergonomic whole-body motions\, possibly to an ergonomically optimal motion. To design a robot controller that influences the body posture\, we first investigate the human motor behavior in a human-human co-manipulation study. In this human dyad study\, we observed motor behavior patterns that were used to design a collaboration controller for physical human-robot interaction (pHRI). In a new study\, the same co-manipulation task was then executed by humans collaborating with a Franka Emika Panda robot.
URL:https://www.loria.fr/event/phd-defense-waldez-azevedo-gomes-junior-larsen/
LOCATION:A008
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20211214T100000
DTEND;TZID=Europe/Paris:20211214T130000
DTSTAMP:20260520T152532
CREATED:20211209T160125Z
LAST-MODIFIED:20211209T160125Z
UID:14579-1639476000-1639486800@www.loria.fr
SUMMARY:PhD defense: Nicolas Furnon (Multispeech)
DESCRIPTION:Nicolas Furnon (Multispeech) will defend his thesis on Tuesday\, December 14th at 10am in room C005. \nHis presentation is entitled “DNN-based speech enhancement in ad-hoc microphone arrays”. \nAbstract:\n\nDNN-based speech enhancement in ad-hoc microphone arrays \nAd-hoc microphone arrays (AHMA) are formed by the network of microphones embedded in our daily-life devices like phones\, computers or smart speakers. They offer a big potential for natural language processing\, especially speech enhancement\, which consists in removing the noise from the recordings. However\, this processing step is hindered by the small size of the devices and by their asynchronous recordings. \nThis thesis proposes a speech enhancement solution adapted to the usage conditions of ad-hoc microphone arrays\, by combining the modelling power of deep neural networks (DNNs) with the flexibility of use of AHMAs. We conduct a detailed empirical analysis of our system to validate its efficiency and to highlight the benefits of jointly using DNNs and distributed speech enhancement algorithms. \nBesides\, we develop our solution in order to make it robust to the challenges of the usage conditions of ad-hoc microphone arrays. We study its behaviour when the number of devices in the AHMA varies\, and when the signals of different devices are not synchronised. We propose a solution to adapt our system to each of these conditions. Lastly\, we propose an extension of our system to make it a suitable solution to source separation in a meeting scenario.
URL:https://www.loria.fr/event/phd-defense-nicolas-furnon-multispeech/
LOCATION:C005
CATEGORIES:Soutenance
END:VEVENT
END:VCALENDAR