BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.17.4.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.loria.fr
X-WR-CALDESC:Évènements pour LORIA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20181028T010000
END:STANDARD
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:20210518
DTEND;VALUE=DATE:20210618
DTSTAMP:20210517T144006Z
CREATED:20210503T141736Z
LAST-MODIFIED:20210517T144006Z
UID:12383-1621296000-1623974399@www.loria.fr
SUMMARY:Department 1 seminar
DESCRIPTION:The Department 1 seminar will take place from 18th May to 17th June online. \nProgram: \n\nMardi 18 mai\, 13h30\n\nLéo Valque\, Gamble : Rounding polygonal meshes \nFlorian Delconte\, Adagio : Tree Defect Segmentation using Geometric Features and CNN \n\n\nMercredi 19 mai\, 13h30\n\nDavid Lopez\, Pixel : Triangulation de Delaunay : comment préserver le volume ? \nMatthieu Zins\, Tangram : « Object-Based Visual Localization From Ellipsoidal Model and 3D-Aware Ellipse Prediction » \n\n\nJeudi 20 mai\, 13h30\n\nYoussef Assis\, Tangram : Intracranial aneurysms detection using deep learning \nMelike Aydinlilar\, MFX : Ray-Tracing Implicit Surfaces \n\n\nVendredi 21 mai\, 13h30\n\nMarco Freire\, MFX : Layout problems and generative design for shape modeling in computational fabrication \nDavid Desobry\, Pixel : Designing 2D and 3D Non-Orthogonal Frame Fields \nQuentin Yang\, Caramba : Coercion resistance with cast-as-intended verification \n\n\nLundi 14 juin\, 11h30\n\nNariman Khaledian\, Tangram : Toward a Functional Model of the Mitral Valve \nJustine Basselin\, Pixel : Restricted Power diagram on the GPU \n\n\nMardi 15 juin\, 11h30\n\nAbdelkarim Elassam\, Tangram : Horizon Line and Vanishing points detection using Deep Learning \nLouis Massucci\, ABC : Statistical learning theory and hybrid dynamical system identification \n\n\nMercredi 16 juin\, 11h30\n\nGuillaume Coiffier\, Pixel : Improving global parametrizations for quadmeshing \nNuwan Herath Mudiyanselage\, Gamble : Fast algorithm for the visualization of surfaces \n\n\nJeudi 17 juin\, 11h30\n\nHamid Boukerrou\, Caramba : TBA \nFrançois Protais\, Pixel : Computing Foldover-free maps
URL:https://www.loria.fr/event/department-1-seminar/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210504T110000
DTEND;TZID=Europe/Paris:20210504T120000
DTSTAMP:20210430T132528Z
CREATED:20210430T132513Z
LAST-MODIFIED:20210430T132528Z
UID:12370-1620126000-1620129600@www.loria.fr
SUMMARY:D3 Seminar: Modélisation et optimisation de planification de réseaux RFID à grande échelle
DESCRIPTION:Le prochain séminaire du D3 aura lieu le mardi 4 mai à 11h sur Teams. \nAtef Jaballah post-doctorant dans l’équipe Optimist\, fera une présentation intitulée « Modélisation et optimisation de planification de réseaux RFID à grande échelle ». \n \nRésumé : \nLa croissance énorme des sociétés industrielles nécessite le déploiement des réseaux RFID à grande échelle. Ce qui nécessite l’installation d’un grand nombre de composants RFID (lecteurs\, étiquettes\, middleware et autres). En conséquence\, le coût et la complexité des réseaux RFID augmentent en raison du grand nombre de lecteurs RFID à installer.  Ma thèse s’est intéressée à des problèmes liés au déploiement optimisé des réseaux RFID. En particulier\, nous nous sommes focalisés sur les trois problèmes suivants : (1) le problème de la planification d’un réseau RFID  (RFID Network Planning — RNP) \, (2) le problème de l’arrangement des lecteurs RFID tout en maximisant la couverture et minimisant les collisions\, et (3) le problème du profilage de la taille des étiquettes dans les systèmes RFID. \nLe problème RNP a été prouvé NP-difficile par analogie avec le problème du positionnement d’antennes dans les réseaux cellulaires. C’est un problème d’optimisation multi-objectif avec un espace de solutions très large et bruité\, pour lequel les approches méta-heuristiques conviennent le mieux.  Nous proposons une nouvelle variante de l’algorithme de recherche coucou (Cuckoo Search – CS)\, dénommé auto-adaptative CS algorithme (Self Adaptive Cuckoo Search-SACS) où les paramètres de contrôle de l’algorithme CS sont adaptés en temps réel\, selon l’avancement du processus d’optimisation pour résoudre ce problème.  Ensuite\, nous intéressons au problème d’ordonnancement des lecteurs RFID afin de réduire les chevauchements des régions couvertes par les lecteurs et minimiser les collions. Ce problème est connu sous le nom de problème RCCAA (Reader Coverage Collision Avoidance Arrangement). Pour résoudre ce problème\, nous proposons un algorithme d’approximation qui est capable de résoudre le problème RCCAA en évitant les différents types de collisions. \nLe dernier problème abordé dans ma thèse est le problème du profilage de la taille des étiquettes dans les systèmes RFID ou (Tag Size Profiling -TSP problem). Le problème du TSP consiste à estimer les tailles des sous-régions du système RFID couvertes par plusieurs lecteurs. La résolution du problème TSP permet de déterminer l’ordonnancement optimal des lecteurs qui maximise le débit d’identification des étiquettes. Nous prouvons que la construction de système linéaire optimale adéquat pour résoudre le problème TSP est une tâche est NP difficile. Ensuite\, nous développons un nouvel algorithme approximatif qui est capable de résoudre une telle tâche en un temps raisonnable. \nAbstract:  \nRadio Frequency IDentification (RFID ) is a key technology of the Internet of Things (IoT).  RFID has the possibility of enabling  machines to  identify\, control  and localize the physical objects  through networks in real time.  Due to its low cost\, small size and ability to communicate in different environments (liquids\, gas…) without power source\,  RFID is frequently used in different sectors : supply chain management\, electronic security\, retail marketing\, smart university\, military and health-care. RFID is a system composed  by  tags  sensitive to electromagnetic fields created bya reader antenna. Each tag encapsulate a unique identification and can be attached to objects in order to monitor them. However\, many challenges remain to be addressed before  RFID can reach its full potential in the IoT.  Particularly\, readers scheduling and RFID network planning  (RNP)  are among these most important challenges.  Essentially\, the readers scheduling avoids collision and the RNP  assures the most suitable quality of service and cost efficiency. \nOwing to the limited interrogation range of RFID readers\, multiple readers should be deployed to ensure full tag coverage.   The arbitrary deployment of readers causes several problems: wastage of readers\, collision and load imbalance between readers.  Finding the optimal number of readers to deploy so as obtain full tag coverage\, the optimal placement of these readers and the optimal configuration of their parameters is known as an RNP problem.  The RNP problem is a multiobjective optimization problem with a large number of variables and uncertain parameters.   This dissertation presents a new variant of the cuckoo search algorithm  to plan large-scale RFID networks and overcome the deployment challenges described above. In some cases\, a good planning can not completely eliminate overlap between readers\, hence the necessity of readers scheduling to activate the neighbors readers in a different time to avoids collisions.  In this context\, a particular problem known as the Reader-Coverage Collision Avoidance Arrangement (RCCAA) problem has received great attention in the literature.  The RCCAA problem consists in activating  RFID readers and adjusting their interrogation ranges in order to cover the maximum number of tags without collision. In this manuscript\, we propose the maximum-weight-independent-set-based algorithm II to solve the RCCAA problem. Another important problem that has great importance in readers scheduling is  to know the Tag Size Profile  (TSP) of the system.   TSP consists in estimating the size of sub-regions in an RFID system covered by several readers.  In order to achieve this goal\,   the sub-regions are considered as variable and  the adequate linear system is constructed by these variables and solve them.   In this dissertation\, we show that the determination of the minimal set of schedule instances to construct an adequate linear system is NP-hard\, and we propose a time-efficient approximate algorithm based on a k-partial set cover to solve it.
URL:https://www.loria.fr/event/d3-seminar-2/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20210419
DTEND;VALUE=DATE:20210421
DTSTAMP:20201203T101217Z
CREATED:20201203T101217Z
LAST-MODIFIED:20201203T101217Z
UID:11302-1618790400-1618963199@www.loria.fr
SUMMARY:Workshop on Human Evaluation of NLP Systems (HumEval)
DESCRIPTION:EACL’21\, Kiev\, Ukraine\, 19-20 April 2021\nFirst Call for Papers\nThe HumEval Workshop invites the submission of long and short papers on substantial\, original\, and unpublished research on all aspects of human evaluation of NLP systems\, both intrinsic and extrinsic\, including but by no means limited to NLP systems whose output is language. More on: humeval.github.io. \nInvited Speakers\n\nMohit Bansal\, UNC Chapel Hill\, US\nMargaret Mitchell\, Google\, US\nLucia Specia\, UCL\, UK\n\nImportant Dates\n\nDec 2: First Call for Workshop Papers\nDec 18: Second Call for Workshop Papers\nJan 18: Workshop Paper Due Date\nFeb 18: Notification of Acceptance\nMar 01: Camera-ready papers due\nApr 19-20: Workshop Dates\nAll deadlines are 11.59 pm UTC-12.\n\nWorkshop Topic and Content\nHuman evaluation plays a central role in NLP\, from the large-scale crowd-sourced evaluations carried out e.g. by the WMT workshops\, to the much smaller experiments routinely encountered in conference papers. Moreover\, while NLP embraced automatic evaluation metrics from BLEU (Papineni et al\, 2001) onwards\, the field has always been acutely aware of their limitations (Callison-Burch et al.\, 2006; Reiter and Belz\, 2009; Novikova et al.\, 2017; Reiter\, 2018)\, and has gauged their trustworthiness in terms of how well\, and how consistently\, they correlate with human evaluation scores (Over et al.\, 2007; Gatt and Belz\, 2008; Bojar et al.\, 2016; Shimorina\, 2018; Ma et al.\, 2019; Mille et al.\, 2019; Dušek et al.\, 2020). \nYet there is growing unease about how human evaluations are conducted in NLP. Researchers have pointed out the less than perfect experimental and reporting standards that prevail (van der Lee et al.\, 2019). Only a small proportion of papers provide enough detail for reproduction of human evaluations\, and in many cases the information provided is not even enough to support the conclusions drawn. More than 200 different quality criteria (Fluency\, Grammaticality\, etc.) have been used in NLP  (Howcroft et al.\, 2020). Different papers use the same quality criterion name with different definitions\, and the same definition with different names. As a result\, we currently do not have a way of determining whether two evaluations assess the same thing which poses problems for both meta-evaluation and reproducibility assessments (Belz et al.\, 2020). \nReproducibility in the context of automatically computed system scores has recently attracted a lot of attention\, against the background of a troubling history (Pedersen\, 2008; Mieskes et al.\, 2019)\, where reproduction is perceived as failing in 24.9% of cases for own results\, and in 56.7% for another team’s (Mieskes et al.\, 2019). Initiatives have included the Reproducibility Challenge (Pineau et al.\, 2019\, Sinha et al.\, 2020); the Reproduction Paper special category at COLING’18; the reproducibility programme at NeurIPS’19 comprising code submission\, a reproducibility challenge\, and the ML Reproducibility checklist\, also adopted by EMNLP’20 and AAAI’21; and the REPROLANG shared task at LREC’20 (Branco et al.\, 2020). \nHowever\, reproducibility in the context of system scores obtained via human evaluations has barely been addressed at all\, with a tiny number of papers (e.g. Belz & Kow\, 2010; Cooper & Shardlow\, 2020) reporting attempted reproductions of results. The developments in reproducibility of automatically computed scores listed above are important\, but it is concerning that not a single one of the initiatives and events above addresses human evaluations. E.g. if a paper fully complies with all of the NeurIPS’19/EMNLP’20 reproducibility criteria\, any human evaluation results reported in it may not be reproducible to any degree\, simply because the criteria do not address human evaluation in any way. \nWith this workshop we wish to create a forum for current human evaluation research and future directions\, a space for researchers working with human evaluations to exchange ideas and begin to address the issues that human evaluation in NLP currently faces\, including aspects of experimental design\, reporting standards\, meta-evaluation and reproducibility. We invite papers on topics including\, but not limited to\, the following: \n\n\nExperimental design for human evaluations \n\n\nReproducibility of human evaluations \n\n\nEthical considerations in human evaluation of computational systems \n\n\nQuality assurance for human evaluation \n\n\nCrowdsourcing for human evaluation \n\n\nIssues in meta-evaluation of automatic metrics by correlation with human evaluations \n\n\nAlternative forms of meta-evaluation and validation of human evaluations \n\n\nComparability of different human evaluations \n\n\nMethods for assessing the quality of human evaluations \n\n\nMethods for assessing the reliability of human evaluations \n\n\nWork on measuring inter-evaluator and intra-evaluator agreement \n\n\nFrameworks\, model cards and checklists for human evaluation \n\n\nExplorations of the role of human evaluation in the context of Responsible AI and Accountable AI \n\n\nProtocols for human evaluation experiments in NLP \n\n\nWe welcome work on the above topics and more from any subfield of NLP (and ML/AI more generally)\, with a particular focus on evaluation of systems that produce language as output. We explicitly encourage the submission of work on both intrinsic and extrinsic evaluation. \nPaper Submission Information\nLong Papers:\nLong papers must describe substantial\, original\, completed and unpublished work. Wherever appropriate\, concrete evaluation and analysis should be included. \nLong papers may consist of up to eight (8) pages of content\, plus unlimited pages of references. Final versions of long papers will be given one additional page of content (up to 9 pages) so that reviewers’ comments can be taken into account. \nLong papers will be presented orally or as posters as determined by the programme committee. Cecisions as to which papers will be presented orally and which as posters will be based on the nature rather than the quality of the work. There will be no distinction in the proceedings between long papers presented orally and as posters. \nShort Papers:\nShort paper submissions must describe original and unpublished work. Short papers should have a point that can be made in a few pages. Examples of short papers are a focused contribution\, a negative result\, an opinion piece\, an interesting application nugget\, a small set of interesting results. \nShort papers may consist of up to four (4) pages of content\, plus unlimited pages of references. Final versions of short papers will be given one additional page of content (up to 5 pages) so that reviewers’ comments can be taken into account. \nShort papers will be presented orally or as posters as determined by the programme committee. While short papers will be distinguished from long papers in the proceedings\, there will be no distinction in the proceedings between short papers presented orally and as posters. \nReview forms will be made available prior to the deadlines. For more information on applicable policies\, see the ACL Policies for Submission\, Review\, and Citation. \nMultiple Submission Policy\nHumEval’21 allows multiple submissions. However\, if a submission has already been\, or is planned to be\, submitted to another event\, this must be clearly stated in the submission \nEthics Policy\nAuthors are required to honour the ethical code set out in the ACL Code of Ethics. \nThe consideration of the ethical impact of our research\, use of data\, and potential applications of our work has always been an important consideration\, and as artificial intelligence is becoming more mainstream\, these issues are increasingly pertinent. We ask that all authors read the code\, and ensure that their work is conformant to this code. Where a paper may raise ethical issues\, we ask that you include in the paper an explicit discussion of these issues\, which will be taken into account in the review process. We reserve the right to reject papers on ethical grounds\, where the authors are judged to have operated counter to the ACL Code of Ethics\, or have inadequately addressed legitimate ethical concerns with their work. \nPaper Submission and Templates\nSubmission is electronic\, using the Softconf START conference management system. For electronic submission of all papers\, please use: https://www.softconf.com/eacl2021/HumEval2021. Both long and short papers must follow the ACL Author Guidelines\, and must use the EACL’21 templates. You can find the EACL-2021 LaTeX template here or download the zip file. \nOrganisers\n\nAnya Belz\, University of Brighton\, UK\nShubham Agarwal\, Heriot Watt University\, UK\nYvette Graham\, Trinity College Dublin\, Ireland\nEhud Reiter\, University of Aberdeen\nAnastasia Shimorina\, Université de Lorraine / LORIA\n\nPC Members\n\n\n\n\n\n\n\n\nMohit Bansal\, UNC Chapel Hill\, US \n\n\nSaad Mahamood\, Trivago\, DE \n\n\n\n\nKevin B. Cohen\, University of Colorado\, US \n\n\nNitika Mathur\, University of Melbourne\, Australia \n\n\n\n\nKees van Deemter\, Utrecht University\, NL \n\n\nMargot Mieskes\, UAS Darmstadt\, DE \n\n\n\n\nOndrej Dusek\, Charles University\, Czechia \n\n\nEmiel van Miltenburg\, Tilburg University\, NL \n\n\n\n\nKarën Fort\, Sorbonne University\, France \n\n\nMargaret Mitchell\, Google\, US \n\n\n\n\nAnette Frank\, University of Heidelberg\, DE \n\n\nMathias Mueller\, University of Zurich\, CH \n\n\n\n\nClaire Gardent\, CNRS/LORIA Nancy\, France \n\n\nMalvina Nissim\, Groningen University\, NL \n\n\n\n\nAlbert Gatt\, Malta University\, Malta \n\n\nJuri Opitz\, University of Heidelberg\, DE \n\n\n\n\nDimitra Gkatzia\, Edinburgh Napier University\, UK \n\n\nRamakanth Pasunuru\, UNC Chapel Hill\, US \n\n\n\n\nHelen Hastie\, Heriot-Watt University\, UK \n\n\nMaxime Peyrard\, EPFL\, CH \n\n\n\n\nDavid Howcroft\, Heriot Watt University\, UK \n\n\nInioluwa Deborah Raji\, Ai Now Institute\, US \n\n\n\n\nJackie Chi Kit Cheung\, McGill University\, Canada \n\n\nVerena Rieser\, Heriot Watt University\, UK \n\n\n\n\nSamuel Läubli\, University of Zurich\, CH \n\n\nSamira Shaikh\, UNC\, US \n\n\n\n\nChris van der Lee\, Tilburg University\, NL \n\n\nLucia Specia\, UCL\, UK \n\n\n\n\nNelson Liu\, Washington University\, US \n\n\nWei Zhao\, TU Darmstadt\, DE \n\n\n\n\nQun Liu\, Huawei Noah’s Ark Lab\, China \n\n\n\n\n\n\nContact Information\nhumeval.ws@gmail.com \nhttps://humeval.github.io
URL:https://www.loria.fr/event/workshop-on-human-evaluation-of-nlp-systems-humeval/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210415T160000
DTEND;TZID=Europe/Paris:20210415T170000
DTSTAMP:20210401T090927Z
CREATED:20210401T090802Z
LAST-MODIFIED:20210401T090927Z
UID:11954-1618502400-1618506000@www.loria.fr
SUMMARY:DigiTrust Webinar : Enka Blanchard
DESCRIPTION:The second webinar of LUE IMPACT project DigiTrust will take place on Thursday\, 15th April at 4pm. \nPostdoctoral Researcher Enka Blanchard\, working in the DigiTrust consortium\, will give a presentation entitled “Securing everyday voting with low-tech systems” \nThe webinar will take place on Teams. \nAbstract: \nVoting is often seen as a solemn activity\, with voters exercising their rights every few years in secure conditions. However\, many voting activities happen in much more common situations\, from company boardrooms to homeowners associations or employee breakrooms. Those votes often happen by raising one’s hand or at best writing down a name on a piece of paper and putting it into a hat. With the pandemic\, those votes have been harder to organise\, creating a vacuum for new systems to take hold\, and potentially presenting new opportunities.\n\nThe talk will start with an introduction to low-tech verifiable voting systems. We will then go over the impact of the pandemic and how it led us to propose a solution that is currently in use at the University of Maryland\, Baltimore County\, as well as the details of this low-tech (non-cryptographic) verifiable voting system. Finally\, I will discuss the implications this has not only for the development but more importantly for the deployment of new voting systems.\n\n\nThe talk is based on research I recently pursued with colleagues from UMBC and LaBRI. The relevant papers and preprints are available below:\n\nEnka Blanchard and Ted Selker. Origami voting: a non-cryptographic approach to transparent ballot verification. In VOTING – 5th Workshop on Advances in Secure Electronic\nVoting (https://hal.archives-ouvertes.fr/hal-02550738)\nEnka Blanchard\, Ryan Robucci\, Ted Selker\, and Alan T. Sherman. Phrase-verified voting: Verifiable low-tech remote boardroom voting. under review\nEnka Blanchard\, Sébastien Bouchard\, and Ted Selker. Visual secrets: A recognition-based security primitive and its use for boardroom voting. under review
URL:https://www.loria.fr/event/digitrust-webinar-enka-blanchard/
LOCATION:online
CATEGORIES:Séminaire
ATTACH;FMTTYPE=image/png:https://www.loria.fr/wp-content/uploads/2021/04/Webinaire-Enka-Blanchard.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210409T110000
DTEND;TZID=Europe/Paris:20210409T120000
DTSTAMP:20210407T092250Z
CREATED:20210407T092250Z
LAST-MODIFIED:20210407T092250Z
UID:11971-1617966000-1617969600@www.loria.fr
SUMMARY:MALOTEC Séminaire : Evaluating Local Explanation Methods on Ground Truth
DESCRIPTION:Evaluating local explanation methods is a difficult task due to the lack of a shared and universally accepted definition of explanation. In the literature\, one of the most common ways to assess the performance of an explanation method is to measure the fidelity of the explanation with respect to the classification of a black box model adopted by an Artificial Intelligent system for making a decision. However\, this kind of evaluation only measures the degree of adherence of the local explainer in reproducing the behavior of the black box classifier with respect to the final decision. Therefore\, the explanation provided by the local explainer could be different in the content even though it leads to the same decision of the AI system. We propose an approach that allows to measure to which extent the explanations returned by local explanation methods are correct with respect to a synthetic ground truth explanation. Indeed\, the proposed methodology enables the generation of synthetic transparent classifiers for which the reason for the decision taken\, i.e.\, a synthetic ground truth explanation\, is available by design. Experimental results show how the proposed approach allows to easily evaluate local explanations on the ground truth and to characterize the quality of local explanation methods. \n\n\nSpeaker:\nRiccardo Guidotti\, Assistant Professor at the Department of Computer Science (University of Pisa) and a member of the Knowledge Discovery and Data Mining Laboratory (KDDLab).\n\nOn TEAMS. More information at:\nhttps://malotec.loria.fr
URL:https://www.loria.fr/event/malotec-seminaire-evaluating-local-explanation-methods-on-ground-truth/
LOCATION:online
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris: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: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;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: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: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: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: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;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;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: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:20201125
DTEND;VALUE=DATE:20201128
DTSTAMP:20201016T123736Z
CREATED:20201016T123311Z
LAST-MODIFIED:20201016T123736Z
UID:11070-1606262400-1606521599@www.loria.fr
SUMMARY:Journées Françaises d'Informatique Graphique 2020
DESCRIPTION:En raison de la situation sanitaire actuelle\, la conférence aura lieu en virtuel. \nUn événement qui réunit chaque année une centaine d’experts français du domaine\, dont la moitié sont des doctorants travaillant sur le sujet. C’est donc une belle opportunité de rencontrer et recruter de jeunes talents\, de faire connaitre vos activités et de nouer des partenariats ! \nCes rencontres ont lieu chaque année depuis le milieu des années 1990. La première édition des journées appelées « AFIG » a eu lieu à Toulouse en 1994. Chaque année\, un laboratoire se propose pour les organiser dans sa ville. \nLe domaine de l’informatique graphique recoupe de nombreuses thématiques (par exemple\, modélisation 3D et traitement géométriques\, traitement d’images\, affichage 3D (temps réel\, visualisation\, réaliste)\, vision par ordinateur\, animation et simulation numérique d’objets en interactions) mais aussi de nombreuses compétences difficiles à trouver ailleurs (e.g. programmation parallèle (GPU\, OpenGL\, Cuda/OpenCL)\, C/C++ haute performance\, structures de données spatiales\, manipulation de données volumiques\, optimisation numérique sur géométries). \nCette année\, nous apportons une nouveauté au programme : nous invitons des industriels ! \nPlus d’informations sur jfig2020.sciencesconf.org.
URL:https://www.loria.fr/event/journees-francaises-dinformatique-graphique-jfig-2020/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20201103T140000
DTEND;TZID=Europe/Paris:20201103T170000
DTSTAMP:20201028T120402Z
CREATED:20201028T120352Z
LAST-MODIFIED:20201028T120402Z
UID:11114-1604412000-1604422800@www.loria.fr
SUMMARY:Groupe de Travail Eau et Numérique HYDREOS
DESCRIPTION:Le Groupe de Travail Eau & Numérique\, organisé par HYDREOS en collaboration avec la Fédération Charles Hermite\, aura lieu le mardi 3 novembre de 14 heures à 17 heures. \nEn raison des mesures sanitaires exceptionnelles\, cette rencontre se fera à distance depuis la plateforme de collaboration Teams. \nProgramme : \n\nLa gestion des données dans le domaine de l’eau : Prenez part au lancement de l’étude HYDREOS 2020 sur la gestion des données dans l’eau potable !\n\nLes capteurs IoT et leur fonctionnement dans le domaine industriel et leur application à celui de l’eau\n\nIntervention de Nicolas BABEL\, société Ewattch\n\n\nLes drones et robots aquatiques \n\nIntervention d’Anne-Sophie DIDELOT de la société Alerion\nIntervention de Pierre-Yves LEMPIRE\, de la société Bathy Drone Solutions\n\n\n\nPlus d’informations et inscriptions sur le site d’HYDREOS.
URL:https://www.loria.fr/event/groupe-de-travail-eau-et-numerique-hydreos/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20201103T093000
DTEND;TZID=Europe/Paris:20201103T113000
DTSTAMP:20201001T093027Z
CREATED:20201001T093000Z
LAST-MODIFIED:20201001T093027Z
UID:11028-1604395800-1604403000@www.loria.fr
SUMMARY:2nd study session on social networks corpora/data
DESCRIPTION:The 2nd study session on social networks corpora/data\, organized in the framework of the LUE OLKi project is scheduled on Tuesday\, 3rd Nov from 9.30am to 11.30am on the Campus Lettres et Sciences Humaines.\n\nSpeakers:\n\n\nMarie FLESCH (ATILF) – Internet language and gender: an intersectional study of a corpus of Reddit comments\nAman SINHA (IECL-ATILF) –  C-Net: Contextual Network for Sarcasm Detection\nLeonardo SANNA (University of Modena and Reggio Emilia\, Italy) – Embedded semiospheres: a semio-linguistic approach to echo chambers and filter bubbles on Facebook and Telegram using word2vec and doc2vec\nQuentin LAPORTE-CHABASSE (LORIA) – Morpho-statistical description of networks through graph modelling and Bayesian inference\n\n\n\nAttendance is subjected to the room capacity. Please register by October 27th
URL:https://www.loria.fr/event/11028/
LOCATION:Campus Lettres et Sciences Humaines\, Nancy\, 23\, boulevard Albert 1er\, Nancy\, 54000\, France
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20200706T160000
DTEND;TZID=Europe/Paris:20200706T180000
DTSTAMP:20200630T151601Z
CREATED:20200630T151405Z
LAST-MODIFIED:20200630T151601Z
UID:10631-1594051200-1594058400@www.loria.fr
SUMMARY:Séminaire philosophie-informatique
DESCRIPTION:La 5ème session du séminaire philosophie-informatique accueillera l’exposé de Constantine Sandis de l’University of Hertfordshire\, le lundi 6 juillet 2020 à 16h00. \nL’exposé sera en anglais et s’intitule : « AI Intelligibility & Rights to Explanation » \nPour rejoindre Zoom conference cliquer sur ce lien ou utiliser ce numéro :  ID de réunion : 923 7103 0915. Consulter la page Facebook de l’événement. \nRésumé : \nThe right to an explanation of automated decisions is typically described in terms of ‘providing transparency’. This is thought to render AI intelligible by disclosing the algorithms and machine learning ‘responsible for’ its output. I argue against this way of framing the very question of explainable AI before providing an alternative. \nConstantine Sandis est un philosophe de l’action\, travaillant notamment sur Ludwig Wittgenstein et David Hume. Il a publié de nombreux livres et articles\, dont un ouvrage en français\, Raisons et responsabilité : Essais de philosophie de l’action (Ithaque\, 2020). \nLe séminaire philo-info est coorganisé par les Archives Henri Poincaré (AHP-PReST) et le Loria – dans le contexte du projet OLKi. Il vous est proposé par Maël Pégny\, Anna Zielinska et Cyrille Imbert des Archives Henri-Poincaré. \n 
URL:https://www.loria.fr/event/seminaire-philosophie-informatique-2/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20200615T160000
DTEND;TZID=Europe/Paris:20200615T170000
DTSTAMP:20200610T081356Z
CREATED:20200610T081001Z
LAST-MODIFIED:20200610T081356Z
UID:10499-1592236800-1592240400@www.loria.fr
SUMMARY:Séminaire philo-info : 4ème session
DESCRIPTION:La quatrième session du séminaire philosophie-informatique aura lieu lundi 15 juin à 16h00. Il est coorganisé par les Archives Henri Poincaré (AHP-PReST) et le Loria – dans le contexte du projet OLKi.\n  \nPour participer à la réunion Zoom : cliquez ici ou composez l’ID de réunion : 954 6871 5170. Diffusion live et interactions possibles également sur Facebook.\nLe thème du séminaire : les politiques de la technique\, autour des usages du numérique dans le contexte de la Covid 19. Les questionnements soulevés : \n\nLa question de l’équilibre délicat entre la liberté et la sécurité\,\nLes applications telles que StopCovid sont-elles effectivement utiles ou visent-elles surtout à couvrir les insuffisances médicales ?\nStopCovid – l’application est-elle moins ou plus invasive que facebook/twitter etc. ?\nQuels usages détournés des applications de traçage ?\n\nSeront réunis notamment: \n\nMaxime Amblard (Loria)\nChristophe Cerisara (Loria)\nCyrille Imbert (Archives Henri-Poincaré)\nSamuel Nowakowski (Loria)\nMaël Pégny (Archives Henri-Poincaré)\nAnna C. Zielinska (Archives Henri-Poincaré)\n\n  \nOrganisation\nCe séminaire s’inscrit dans le cadre du projet LUE Open Language and Knowledge for Citizens et vous est proposé par Maël Pégny\, Anna Zielinska et Cyrille Imbert des Archives Henri-Poincaré.\n 
URL:https://www.loria.fr/event/seminaire-philo-info-4eme-session/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20200312T133000
DTEND;TZID=Europe/Paris:20200312T150000
DTSTAMP:20200306T154918Z
CREATED:20200306T154918Z
LAST-MODIFIED:20200306T154918Z
UID:9251-1584019800-1584025200@www.loria.fr
SUMMARY:Séminaire SSL par Emmanuel Thomé
DESCRIPTION:Le prochain séminaire SSL sera donné par Emmanuel Thomé\, de l’équipe CARAMBA le jeudi 12 mars\, à 13h30\, en salle A008. \nTitre : Large-scale computational records for public-key cryptography \nRésumé :\nJoint work with Fabrice Boudot\, Pierrick Gaudry\, Aurore Guillevic\, Nadia Heninger\, Paul Zimmermann. \nIn December 2019 and February 2020\, we completed several record computations related to hard problems in public-key cryptography: we factored a 240-digit RSA modulus\, we computed discrete logarithms modulo a 240-digit prime\, and while we were at it\, we also factored a 250-digit RSA modulus. Such records provide very important data points for the assessment of the computational hardness of the integer factorization (IF) and finite field discrete logarithm (DL) problems. These problems underpin the largest part of public-key cryptography that is currently in use. Previous records date back to 2016 (for DL) and 2009 (for IF). \nThis talk reports on how these computations were performed\, and on how we chose parameters for the Number Field Sieve algorithm in order to minimize the running time. We also give some data on the scalability of our approach\, and how it required harnessing a formidable computing power\, with thousands of CPU cores from several facilities\, working in parallel over several months. We also show that our work goes well beyond improving on previous records by using a lot of hardware: even if we had used identical hardware\, our larger computation would have been faster than the smaller\, previous record (for DL).
URL:https://www.loria.fr/event/seminaire-ssl-par-emmanuel-thome/
LOCATION:A008
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20200206T133000
DTEND;TZID=Europe/Paris:20200206T153000
DTSTAMP:20200115T091902Z
CREATED:20200115T091902Z
LAST-MODIFIED:20200115T091902Z
UID:8873-1580995800-1581003000@www.loria.fr
SUMMARY:Séminaire SSL par Adi Shamir
DESCRIPTION:Le prochain séminaire sera un peu particulier puisqu’il s’agira de la projection de l’exposé invité donné en septembre par Adi Shamir dans le cadre de la conférence Esorics 2019. \nThe European Symposium on Research in Computer Security \nLa projection aura lieu le jeudi 6 février\, à 13h30\, dans l’amphithéâtre du Loria. \nTitre : The Insecurity of Machine Learning: Problems and Solutions \nAbstract : The development of deep neural networks in the last decade had revolutionized machine learning and led to major improvements in the precision with which we can perform many computational tasks. However\, the discovery five years ago of adversarial examples in which tiny changes in the input can fool well trained neural networks makes it difficult to trust such results when the input can be manipulated by an adversary. \nThis problem has many applications and implications in object recognition\, autonomous driving\, cyber security\, etc\, but it is still far from being understood. In particular\, there had been no convincing explanations why such adversarial examples exist\, and which parameters determine the number of input coordinates one has to change in order to mislead the network. \nIn this talk I will describe a simple mathematical framework which enables us to think about this problem from a fresh perspective\, turning the existence of adversarial examples in deep neural networks from a baffling phenomenon into an unavoidable consequence of the geometry of R^n under the Hamming distance\, which can be quantitatively analyzed.
URL:https://www.loria.fr/event/seminaire-ssl-par-adi-shamir/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20200205T110000
DTEND;TZID=Europe/Paris:20200205T123000
DTSTAMP:20200203T123846Z
CREATED:20200203T122640Z
LAST-MODIFIED:20200203T123846Z
UID:8956-1580900400-1580905800@www.loria.fr
SUMMARY:Séminaire du D2 par Luigi Liquori
DESCRIPTION:Title : « Why reductions have to be synchronised in intersection (and union) typed lambda-calculi ? »\nLuigi Liquori\, Inria Sophia-Antipolis\n \n\n\nAbstract:\n\nWe present the ∆-calculus\, an explicitly typed λ-calculus with strong pairs\, projections and explicit type coercions. The calculus can be parametrized with different intersection type theories\, as described in the Barendregt-Dekker-Statman book on λ-calculi with types\, producing a family of ∆-calculi with related intersection typed systems. We show why annotating pure λ-calculus with intersection types is not easy: a classical example is the difficulty to decorate the bound variable of the explicitly typed polymorphic identity λx: ?.x such that the type of the identity is (σ → σ) ∩ (τ → τ ): previous attempts showed that the full power of the intersection type discipline can be easily lost. We show why intersection typed systems need a kind of synchronised reduction to fix the subject reduction theorem. The same problematics also appear when decorating λ-calculus with union-types. Finally\, we show how the ∆-calculus can be raised to a ∆-framework by adding dependent-types as in the Edinburgh Logical Framework.
URL:https://www.loria.fr/event/seminaire-du-d2-par-luigi-liquori/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20200128T133000
DTEND;TZID=Europe/Paris:20200128T170000
DTSTAMP:20200113T094117Z
CREATED:20200113T094117Z
LAST-MODIFIED:20200113T094117Z
UID:8855-1580218200-1580230800@www.loria.fr
SUMMARY:Séminaire philosophie-informatique
DESCRIPTION:L’invité du séminaire sera Alexei GRINBAUM\, philosophe et physicien. Chercheur au laboratoire Larsim du CEA-Saclay\, il est spécialiste de l’information quantique. Depuis 2003\, il s’intéresse aux questions éthiques liées aux nouvelles technologies\, notamment aux nanotechnologies\, à l’intelligence artificielle et à la robotique. Il a été coordinateur pour la France de l’Observatoire européen des nanotechnologies et partenaire du projet européen « Recherche et innovation responsables en pratique » (RRI-Practice). Membre du Comité national pilote d’éthique du numérique et de l’IA et de la Commission d’éthique de la recherche en numérique (Cerna)\, il a publié « Mécanique des étreintes » (Encre Marine\, 2014) et « Les robots et le mal » (Desclée de Brouwer\, 2019). \n\nLa valeur éthique du hasard pour les systèmes autonomes\nDes robots domestiques se font délateurs\, des agents conversationnels injurient leurs interlocuteurs. Pire encore : des systèmes informatiques participent aux conflits humains et parfois même les provoquent. Le 18 mars 2018\, un véhicule autonome de la société Uber a tué une femme qui traversait la rue dans une ville de l’Arizona. Ce fut la première mort d’un piéton provoquée par un algorithme.\nQui est responsable ? La réponse à cette question compte parmi les défis les plus urgents à relever dans notre rapport aux technologies numériques. Mais il ne s’agit pas de savoir comment rendre l’intelligence artificielle bienveillante. Il s’agit de faire en sorte qu’elle ne se substitue pas à l’homme en tant qu’agent moral. Seul le recours au hasard\, et ceci dès sa conception\, peut libérer la machine de la responsabilité qu’on veut lui faire porter. \nCe séminaire s’inscrit dans le cadre du projet LUE Open Language and Knowledge for Citizens et vous est proposé par Maël Pégny\, Anna Zielinska et Cyrille Imbert\, nos partenaires des Archives Henri-Poincaré. \n  \n\nWe will welcome Alexei GRINBAUM for a philosophy-informatics seminar on Jan. 28th at 13:30 in LORIA C005. \nAlexei Grinbaum\, Ph.D.\, HDR\, is a physicist and philosopher at LARSIM\, the Philosophy of Science Group at CEA-Saclay near Paris. His main interest is in the foundations of quantum theory. He also writes on the ethical and social aspects of emerging technologies\, including nanotechnology\, synthetic biology\, robotics and artificial intelligence. He was coordinator for France of the « European Observatory of Nanotechnologies » and partner in the project “Responsible Research and Innovation in Practice”. Grinbaum is a member of the French national ethics committee for digital technologies and AI as well as of the French ethics commission for research in information technology (Cerna). His books include « Mécanique des étreintes » (2014) and « Les robots et le mal » (2019). \n\nChance as a value for artificial intelligence\nDeep learning techniques lead to fundamentally non-interpretable decisions made by the machine. Although such choices do not have an explanation\, they impact the users in significant ways. If the ultimate innovator is a machine\, what is the meaning of responsible conduct? I argue in a recent book that the capacity to extract an AI system from human judgment\, by reducing transparency in favor of opacity\, is an essential value in machine ethics. This can be achieved through the use of randomness\, as illustrated with the example of the trolley dilemma. Methodologically\, a comparison of common motives between technological setups and mythological narratives is used to achieve ethical insights. \nThis seminar is part of the LUE project Open Language and Knowledge for Citizens and is initiated by our colleagues Maël Pégny\, Anna Zielinska et Cyrille Imbert\, from the Archives Henri-Poincaré Lab. \n 
URL:https://www.loria.fr/event/seminaire-philosophie-informatique/
LOCATION:C005
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20191219T110000
DTEND;TZID=Europe/Paris:20191219T120000
DTSTAMP:20191206T091831Z
CREATED:20191206T091810Z
LAST-MODIFIED:20191206T091831Z
UID:8736-1576753200-1576756800@www.loria.fr
SUMMARY:CAPSID Seminar by Juan Cortés
DESCRIPTION:Seminar by Juan Cortés\, LAAS-CNRS\, Toulouse\, France \nTitle: Several stories about tripeptides: basic components for modeling flexible protein structures \nSummary:\nFrom a mechanical point of view\, fragments of three consecutive amino acid residues (called tripeptides hereafter) are very interesting elements of polypeptide chains. Indeed\, if we consider the bond torsion angles as the main degrees of freedom\, the 6 angles in a tripeptide (3 pairs of phi-psi angles\, neglecting the variation of omega angles) are the minimal number allowing full relative mobility of the two ends of the chain. Besides\, using techniques originating from robotics\, the angle values corresponding to a given pose of the two ends the can be obtained very efficiently. This property has been exploited over decades within conformational sampling methods applied to cyclic peptides or protein loops. It can also be used to enhance conformational sampling of globular proteins using Monte Carlo methods\, or to conceive sophisticated algorithms for modeling large-amplitude conformational transitions. In the first part of my presentation\, I will briefly talk about all these applications. \nTripeptides are also interesting elements from a structural point of view. They are minimalistic fragments capturing local\, sequence-dependent structural preferences of proteins. To encode and to analyze these structural properties\, we have constructed an exhaustive database to tripeptide conformations extracted from experimentally-determined high-resolution protein structures. In the second part of the talk\, I will show how this database can be used to construct realistic models of intrinsically disordered proteins (IDPs) and to predict the propensity of some regions to form secondary structure elements. \n 
URL:https://www.loria.fr/event/capsid-seminar-by-juan-cortes/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20191209T103000
DTEND;TZID=Europe/Paris:20191209T113000
DTSTAMP:20191203T132428Z
CREATED:20191203T132300Z
LAST-MODIFIED:20191203T132428Z
UID:8727-1575887400-1575891000@www.loria.fr
SUMMARY:D3 seminar by Gabriele Castellano
DESCRIPTION:D3 seminar by Gabriele Castellano from Politecnico di Torino. \nTitle: « On the Orchestration of Dynamic Services over Distributed IT Infrastructures » \n  \nAbstract: \nEdge Computing is moving resources toward the network borders\, thus enabling the deployment of a pool of novel applications that benefit from the new distributed infrastructure. However\, due to the heterogeneity of such applications\, specific orchestration strategies need to be adopted for each deployment request. Each application can potentially require different optimization criteria and may prefer particular reactions upon the occurrence of the same event. This work proposes a Service-Defined approach for orchestrating cloud/edge services in a distributed fashion\, where each application can define its own orchestration strategy by means of declarative statements\, which are parsed into a Service-Defined Orchestrator (SDO).\nMoreover\, to coordinate the coexistence of a variety of SDOs on the same infrastructure while preserving the resource assignment optimality\, a fully Distributed Resources AssiGnment and OrchestratioN algorithm (DRAGON) is proposed\, which seeks optimal partitioning of shared resources between different actors.\nThe advantages of the Service-Defined orchestration approach have been evaluated over some representative edge use cases\, and convergence and performance properties of DRAGON have been measured on a prototype implementation\, assessing the benefits compared to conventional orchestration approaches. \n  \nBio: \nGabriele Castellano is a Ph.D. student from Politecnico di Torino\, where he received his Master’s degree in Computer Engineering in 2016. His research interests include service virtualization\, resource orchestration\, distributed optimization\, and software-defined networking. In 2017-2018\, he has been a research fellow at Saint Louis University\, where he worked on distributed algorithms for edge resource allocation. He is currently pursuing an internship at Telefonica I+D (Barcelona)\, on orchestrating Machine Learning based inference tasks at the edge of the network. \n 
URL:https://www.loria.fr/event/d3-seminar-by-gabriele-castellano/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20191205T133000
DTEND;TZID=Europe/Paris:20191205T150000
DTSTAMP:20191122T090750Z
CREATED:20191122T090232Z
LAST-MODIFIED:20191122T090750Z
UID:8654-1575552600-1575558000@www.loria.fr
SUMMARY:Séminaire SSL : Emmanuelle Anceaume
DESCRIPTION:Emmanuelle Anceaume (CNRS\, équipe CIDRE\, IRISA) présentera ses travaux de recherche le jeudi 5 décembre à 13h30\, salle A008 dans le cadre du séminaire SSL. \nTitle: Abstractions for permissionless distributed systems \nAbstract: \nPermissionless distributed systems are distributed systems in which (i) the number of participants for carrying out the protocol is not known before hand\, and is not even known during the course of the execution\, (ii) the right to contribute (e.g.\, by proposing a new value of interest for the other participants) and to participate (e.g.\, by reading new decided values) is not controlled by a (trustworthy) third authority\, and (iii) participants communicate over a weakly connected communication topology (such as a peer-to-peer network). The permissionless blockchain technology exactly complies with such features.  During this presentation I will present some of the most important abstractions that allow to support the construction of such distributed systems. \nLa totalité du programme du séminaire SSL est disponible sur la page web : http://seminaire-securite.loria.fr/
URL:https://www.loria.fr/event/seminaire-ssl-emmanuelle-anceaume/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20191128T133000
DTEND;TZID=Europe/Paris:20191128T143000
DTSTAMP:20191114T091955Z
CREATED:20191114T091929Z
LAST-MODIFIED:20191114T091955Z
UID:8605-1574947800-1574951400@www.loria.fr
SUMMARY:Séminaire SSL par Ralf Sasse
DESCRIPTION:Le prochain exposé du séminaire SSL aura lieu jeudi 28 novembre à 13h30\, salle A008. L’orateur sera Ralf Sasse\, de l’ETH Zurich. \n  \nTitle: Seems Legit: Automated Analysis of Subtle Attacks on Protocols that Use Signatures (joint work with Dennis Jackson\, Cas Cremers\, Katriel Cohn-Gordon) \n  \nAbstract: \nThe standard definition of security for digital signatures — existential unforgeability — does not ensure certain properties that protocol designers might expect. For example\, in many modern signature schemes\, one signature may verify against multiple distinct public keys. It is left to protocol designers to ensure that the absence of these properties does not lead to attacks. \nModern automated protocol analysis tools are able to provably exclude large classes of attacks on complex real-world protocols such as TLS 1.3 and 5G. However\, their abstraction of signatures (implicitly) assumes much more than existential unforgeability\, thereby missing several classes of practical attacks. \nWe give a hierarchy of new formal models for signature schemes that captures these subtleties\, and thereby allows us to analyse (often unexpected) behaviours of real-world protocols that were previously out of reach of symbolic analysis. We implement our models in the Tamarin Prover\, yielding the first way to perform these analyses automatically\, and validate them on several case studies. In the process\, we find new attacks on\nDRKey and SOAP’s WS-Security\, both protocols which were previously proven secure in traditional symbolic models. \n  \nLa suite du programme sera prochainement annoncée\, et sera également disponible en ligne au fur et à mesure sur seminaire-securite.loria.fr. \n 
URL:https://www.loria.fr/event/seminaire-ssl-par-ralf-sasse/
LOCATION:A008
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20191115T103000
DTEND;TZID=Europe/Paris:20191115T113000
DTSTAMP:20191112T151127Z
CREATED:20191112T151122Z
LAST-MODIFIED:20191112T151127Z
UID:8588-1573813800-1573817400@www.loria.fr
SUMMARY:D3 and D5 Seminar with Danielle Palosi (ETH Zurich)
DESCRIPTION:November\, Friday 15th at 10.30 am in room C005\,  Daniele Palossi from the ETH Zurich will give a talk for the in joint D3-D5 seminar. The general topic will be how to run a convolutionnal neural network on a tiny quadcopter (10cm / 27g) using a new kind of CPU architecture (PULP). The exact title of her talk is : PULP-DroNet: Open Source and Open Hardware Artificial Intelligence for Fully Autonomous Navigation on Nano-UAVs\n\nAfter the seminar\, Daniele will try to setup a demo in the “creativ’lab” arena (bat. C).\n\nAbstract: \n\nNano-size unmanned aerial vehicles (UAVs)\, with few centimeters of diameter and sub-10 Watts of total power budget\, have so far been considered incapable of running sophisticated visual-based autonomous navigation software without external aid from base-stations\, ad-hoc local positioning infrastructure\, and powerful external computation servers.\n\nIn this talk\, we present what is\, to the best of our knowledge\, the first 27g nano-UAV system able to run aboard an end-to-end\, closed-loop visual pipeline for autonomous navigation based on a state-of-the-art deep-learning algorithm\, built upon the open-source Crazyflie 2.0 nano-quadrotor. Our visual navigation engine is enabled by the combination of an ultra-low power computing device (the GAP8 system-on-chip) with a novel methodology for the deployment of deep convolutional neural networks (CNNs). We enable onboard real-time execution of the DroNet state-of-the-art deep CNN at 6 frame-per-second within 64mW and up to 18fps while still consuming on average just 3.5% of the power envelope of the deployed nano-aircraft. Field experiments demonstrate that the system’s high responsiveness prevents collisions with unexpected dynamic obstacles up to a flight speed of 1.5m/s. In addition\, we also demonstrate the capability of our visual navigation engine of fully autonomous indoor navigation on a 113m previously unseen path.
URL:https://www.loria.fr/event/d3-and-d5-seminar-with-danielle-palosi-eth-zurich/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20191114T133000
DTEND;TZID=Europe/Paris:20191114T180000
DTSTAMP:20191112T083903Z
CREATED:20191112T083832Z
LAST-MODIFIED:20191112T083903Z
UID:8581-1573738200-1573754400@www.loria.fr
SUMMARY:Sécurité et confiance dans les échanges des données de santé
DESCRIPTION:Le jeudi 14 novembre\, aura lieu à l’École de Chirurgie de Nancy\, la journée de la Fédération Charles Hermite consacrée à la sécurité et la confiance dans les échanges des données de santé. \nProgramme\n13h30-13h45 : Accueil – présentation de la journée\n13h45-14h30 : « Le cadre réglementaire de l’accès aux données de santé (entrepôts et\nrecherches)»\, Mme A. Vidal\, CNIL\n14h30-15h30 : « Protection des images médicales (2D/3D) : insertion de données cachées\, chiffrement sélectif et partage de secret »\, Pr W. Puech\, LIRMM Montpellier\n15h30-15h50 : Pause café\n15h50-16h20 : « Conformité et sécurité des traitements de données de santé »\, Dr Renato\nBrasselet\, PULSY (ex GCS Télésanté Lorraine)\n16h20-16h50 : « Scuba une chaîne d’outils pour la sécurité des objets connectés »\, Pr A. Lahmadi\, équipe RESIST\, LORIA\n16h50-17h45 : Visite école de chirurgie incluant démo plateforme de télémédecine MedVC issue du projet européen HIPERMED (CRAN) et conclusion de la journée. \nL’inscription est gratuite\, merci cependant de confirmer votre participation par mail à nathalie.benito@univ-lorraine.fr. \nLieu :\nÉcole de Chirurgie de Nancy\, (Faculté de Médecine – Bât D – 2ème étage) \nComité d’organisation\nJ-M Moureaux (CRAN)\nS. Mézières (IECL)\nN. Jay (CHRU Nancy\, LORIA) R. Lhoste (LORIA) \n 
URL:https://www.loria.fr/event/securite-et-confiance-dans-les-echanges-des-donnees-de-sante/
CATEGORIES:Séminaire
END:VEVENT
END:VCALENDAR