BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.17.4.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:LORIA
X-ORIGINAL-URL:https://www.loria.fr
X-WR-CALDESC:Évènements pour LORIA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART: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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190503T110000
DTEND;TZID=Europe/Paris:20190503T120000
DTSTAMP:20190502T133117Z
CREATED:20190502T133112Z
LAST-MODIFIED:20190502T133117Z
UID:7111-1556881200-1556884800@www.loria.fr
SUMMARY:MALOTEC Seminar - May\, the 3rd
DESCRIPTION:Friday\, May the 3rd we will welcome Abdelkader Ouali. He will give a talk from 11h00 through 12h00 in Room A008. \nTitle: Pattern set mining using integer linear programming \nAbstract: In this seminar\, I will present a hybrid approach based on Integer Linear Programming that responds effectively to different\nqueries of pattern set mining. The interest of this approach is illustrated by two well-known problems in data mining: conceptual\nclustering and tiling. Finally\, I will present some perspectives on how to use constraint programming to address some multicriteria tasks in\ndata mining. \nFor further information
URL:https://www.loria.fr/event/malotec-seminar-may-the-3rd/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190503T140000
DTEND;TZID=Europe/Paris:20190503T150000
DTSTAMP:20190418T111403Z
CREATED:20190418T111403Z
LAST-MODIFIED:20190418T111403Z
UID:7037-1556892000-1556895600@www.loria.fr
SUMMARY:Exposé Etienne André - D2
DESCRIPTION:Etienne André\,de l’Université Paris 13 fera un exposé le vendredi 3 mai à 14h00 en salle A008 intitulé « Monitoring real-time systems under uncertainty » \nAbstract : \nGiven a log and a specification\, timed pattern matching aims at exhibiting for which start and end dates a specification holds on that log. For example\, « a given action is always followed by another action before a given deadline ». This problem has strong connections with monitoring real-time systems. We address here timed pattern matching in presence of an uncertain specification\, i.e.\, that may contain timing parameters (e.g.\, the deadline can be uncertain or unknown). That is\, we want to know for which start and end dates\, and for what values of the deadline\, this property holds. Or what is the minimum or maximum deadline (together with the corresponding start and end dates) for which this property holds.I  will first give a brief introduction to parametric timed model checking. Then I will report on a framework for timed pattern matching based on parametric timed model checking. In contrast to most parametric timed problems\, the solution is effectively computable\, and we perform experiments using IMITATOR to show the applicability of our approach. \n 
URL:https://www.loria.fr/event/expose-etienne-andre-d2/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190527T133000
DTEND;TZID=Europe/Paris:20190527T143000
DTSTAMP:20190520T092729Z
CREATED:20190520T071515Z
LAST-MODIFIED:20190520T092729Z
UID:7219-1558963800-1558967400@www.loria.fr
SUMMARY:Séminaire SSL : D. Aranha "Return of the Insecure Brazilian Voting Machines"
DESCRIPTION:This talk presents a detailed and up-to-date security analysis of the voting software used in the last Brazilian elections by more than 140 million voters. It is mainly based on results obtained in a restricted hacking challenge organized by the Superior Electoral Court (SEC)\, the national electoral authority. During the event\, multiple serious vulnerabilities (hard-coded cryptographic keys and insufficient integrity checks\, among others) were detected in the voting software\, which\, when combined\, compromised the main security properties of the equipment\, namely ballot secrecy and software integrity. We trace the history of the vulnerabilities to a previous security analysis\, providing some perspective about how the system evolved in the past 7 years. As far as we know\, this was the most in-depth compromise of an official large-scale voting system ever performed under such severely restricted conditions. \nJoint work with Pedro Y. S. Barbosa\, Thiago N. C. Cardoso\, Caio Lüders and Paulo Matias. \n\nDiego F. Aranha is an Assistant Professor in the Department of Engineering at Aarhus University. He holds a PhD degree in Computer Science from the University of Campinas and has worked as a visiting PhD student for 1 year at the University of Waterloo. His professional experience is in Cryptography and Computer Security\, with a special interest in the efficient implementation of cryptographic algorithms and security analysis of real-world systems. He coordinated two teams of independent researchers capable of detecting and exploring vulnerabilities in the software of the Brazilian voting machines during controlled tests organized by the national electoral authority.\nHe received the Google Latin America Research Award for research on privacy twice\, and the MIT TechReview’s Innovators Under 35 Brazil Award for his work in electronic voting.
URL:https://www.loria.fr/event/seminaire-ssl-par-d-aranha-return-of-the-insecure-brazilian-voting-machines/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190528T140000
DTEND;TZID=Europe/Paris:20190528T150000
DTSTAMP:20190424T123633Z
CREATED:20190424T123628Z
LAST-MODIFIED:20190424T123633Z
UID:7082-1559052000-1559055600@www.loria.fr
SUMMARY:TALC seminar : talk of Angelique Monnier
DESCRIPTION:Date: Tuesday\, 28th May 2019 at 2pm\nPlace: LORIA\, room A008\nSpeaker: Angeliki Monnier (Université de Lorraine – CREM) \nTitle: Understanding ICT uses as “habitus”? \nAbstract:\nThis presentation will address the uses of information and communication\ntechnologies (ICT)\, particularly social media\, as “habitus”\, inspired by\nPierre Bourdieu’s Field Theory. My thesis draws on an empirical study\,\nconducted on the professional network LinkedIn\, which focused on\ndiscussion groups held by Greek and French expatriates\, respectively.\nMore particularly\, analysis has shown that discussions are not conducted\nin the same way between Greek and French expatriates. For the former\,\nthe question is the image of the country\, tarnished by the economic\ncrisis. For the latter\, it is the direct contact with the Other\, on the\nbackground of the French colonial past\, which colors the discussions.\nMy argument is that the representations and “patterns of thought” that\ndetermine how Greek and French expatriates get involved in a discussion\ngroup within a professional social media are socio-historically\ndetermined and could be associated to distinct habitus. Following Pierre\nBourdieu’s theory\, these divergences could be related to the positions\nthat Greece and France hold within the international migration field.
URL:https://www.loria.fr/event/talc-seminar-talk-of-angelique-monnier/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20190529
DTEND;VALUE=DATE:20190530
DTSTAMP:20190527T150259Z
CREATED:20190527T145619Z
LAST-MODIFIED:20190527T150259Z
UID:7337-1559088000-1559174399@www.loria.fr
SUMMARY:Journée du Département 1
DESCRIPTION:Algorithmique\, calcul\, image et géométrie\nProgramme de la journée : \n\n9h30 Jimmy Etienne\, MFX : Curved slicing for additive manufacturing\n9h50 Gabrielle De Micheli\, Caramba : Recovering ECDSA cryptographic keys from partial information\n10h10 Charles Duménil\, Gamble : Expected size of the Delaunay triangulation of random points on a surface\n\n10h30 Pause \n\n11h Aude Le Gluher\, Caramba : How much time does it take to factor an integer ?\n11h20 George Krait\, Gamble : Numerical Algorithm for the Topology of Singular Plane Curves\n11h40 Semyon Efremov & Thibaut Tricard\, MFX : Procedural phasor noise\n13h30 Remi Decelle\, Adagio : Measuring wood quality of logs from low-cost sensors at the sawmill or at the road side\n13h50 Paul Huynh\, Caramba : NIST’s lightweight cryptography initiative\n\nConsultez le descriptif des interventions \n\nEn savoir plus sur le D1 \nRetrouvez l’ensemble des séminaires du D1 \nConsultez le site internet du D1 (en anglais) \n 
URL:https://www.loria.fr/event/journee-du-departement-1/
CATEGORIES:Séminaire
END:VEVENT
END:VCALENDAR