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:20190920T100000
DTEND;TZID=Europe/Paris:20190920T110000
DTSTAMP:20190919T123311Z
CREATED:20190919T113257Z
LAST-MODIFIED:20190919T123311Z
UID:8020-1568973600-1568977200@www.loria.fr
SUMMARY:Talk Ahmed Ali - Qatar Computing Research Institute (QCRI)
DESCRIPTION:Ahmed Ali from the QCRI (Qatar Computing Research Institute) will give a talk on Friday 20 at 10:00 in room C005.\nHe will present his work on Automatic speech recognition developed on 1200 hours of speech. \nAbstract:  \nDialectal Arabic speech is suffering from a lack of labelled resources and a lack of orthography. There are three main challenges in dialectal Arabic speech recognition: (1) finding labelled dialectal speech\, (2) building robust dialectal speech recognition with limited labelled and (3) evaluating speech recognition for dialects with no standard orthographic rules.\nMy talk is divided into three parts: \n\nThe first section addresses dialect identification using speech data\, and introduces our novel approach in combining acoustic\, lexical and phonetic features using deep learning.\nThe second section presents our effort in the Multi-Genre Broadcast challenges. In the MGB-2\, more than 1\,200 hours lightly supervised speech data has been used for training multi-dialect broadcast system. The MGB-3 and MGB-5 will highlight the effort in building dialectal challenge in the wild\, where limited dialectal multi-general YouTube data has been used for transfer learning.\nThe third part of my talk addresses our effort in evaluating dialectal speech with no standard orthographic rules. Our methods learn from multiple transcribers and align the speech hypothesis to overcome the non-orthographic aspect. We have also automated this process by learning from twitter data different writing and propose a new evaluation metric. Finally\, we tried to estimate the word error rate with no reference transcription using decoding and language features. We show that our word error rate estimation is robust for many scenarios with and without the decoding features.\n\nBiography :  \nAhmed Ali is a Principal Engineer at the Arabic Language Technologies group (ALT) at the Qatar Computing Research Institute (QCRI). His work interests are in the area of speech recognition and natural language processing. Ahmed completed his PhD at the University of Edinburgh and BSc at Cairo University. He joined QCRI in 2011.\nPrior to joining QCRI\, Ahmed worked for Nuance in Cambridge\, UK from 2006-2011. Before Nuance\, Ahmed worked for six years at different IBM labs\, including two years at Watson\, USA\, labs. His current research on speech recognition has led to the development of state-of-the-art multi-dialect Arabic speech recognition: QCRI advanced transcription system (QATS). QATS is used by Al-Jazeera to transcribe their online content. DW and BBC have been using QATS. Ahmed’s team has won first place in the worldwide MGB-2 speech recognition competition. He also won the prestigious Qatar Foundation Best Innovation Award in 2018.
URL:https://www.loria.fr/event/talk-ahmed-ali-qatar-computing-research-institute-qcri/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190919T160000
DTEND;TZID=Europe/Paris:20190919T170000
DTSTAMP:20190913T075028Z
CREATED:20190913T075025Z
LAST-MODIFIED:20190913T075028Z
UID:7949-1568908800-1568912400@www.loria.fr
SUMMARY:Seminar 3D Printing : Tim Kuipers (Netherlands)
DESCRIPTION:Tim Kuipers (Netherlands) will be our invited speakers. He will give a talk on Thursday\, September 19\, 2019 at 16H00 in room A008.\n  \n\nTim Kuipers is a software engineer working on path planning for 3D printing at Ultimaker\, a manufacturer of desktop / concrete floor FDM 3D printers.\nHe started a PhD trajectory 2 years ago at the Delft University of Technology which is aimed on physicalizing heterogeneous model properties – everywhere from varying surface colors to varying stiffness throughout the print.\n  \nOn Thursday 19 September he will present his latest work « CrossFill: Foam Structures with Graded Density for Continuous Material Extrusion » which utilizes a space-filling surface to enforce continuous extrusion of print paths along each layer.\n  \nFor more info:\nhttps://kuipers.weblog.tudelft.nl/
URL:https://www.loria.fr/event/seminar-3d-printing-tim-kuipers-netherlands/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190919T140000
DTEND;TZID=Europe/Paris:20190919T150000
DTSTAMP:20190729T114731Z
CREATED:20190729T114731Z
LAST-MODIFIED:20190729T114731Z
UID:7766-1568901600-1568905200@www.loria.fr
SUMMARY:Seminar OLKi : "Ontology applied to data sharing"
DESCRIPTION:Adrien BARTON\, researcher at the Institut de recherche en informatique in Toulouse  will come at Loria for a philosophy-informatics seminar on Sept. 19th at 2pm in LORIA in room A008. \nThis seminar is part of the LUE project Open Language and Knowledge for Citizens and is initiated by our colleagues from the Archives Henri-Poincaré Lab. \nOntology applied to data sharing\n\nApplied ontology is a field at the crossroads of various disciplines\, including computer science and philosophy. It aims to systematically develop general categorizations that promote semantic interoperability of data (that is\, ensuring the preservation of the meaning of data when it is transmitted from one system to another). An applied ontology defines the categories of entities relevant to a field of knowledge\, and sets out formal axioms that clarify the relationships between these entities. \nAn ontology can be represented as a computer file – the OWL (Web Ontology Language) format being frequently used today. The field of biomedical ontologies is particularly active\, with the continued development of a large set of interoperable biomedical ontologies\, the OBO Foundry (http://www.obofoundry.org/). But ontologies are also widely used in many other fields (engineering\, internet of things\, geographic information systems\, environment\, ecology\, etc.). \nI will show how philosophical work on causality or the nature of informational entities can support the development of coherent ontologies\, considering various examples from biomedical ontology. I will briefly present the Quebec PARS3 project for a learning health system\, based on these ontologies\, which aims to support a coupling between care and research activities. \n 
URL:https://www.loria.fr/event/seminar-olki-ontology-applied-to-data-sharing/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190620T133000
DTEND;TZID=Europe/Paris:20190620T143000
DTSTAMP:20190520T093240Z
CREATED:20190520T093240Z
LAST-MODIFIED:20190520T093240Z
UID:7230-1561037400-1561041000@www.loria.fr
SUMMARY:Séminaire SSL : M. Korczynski (LIG - Grenoble) "Internet-wide Measurements for Cybersecurity : The Case of DNS Zone Poisoning"
DESCRIPTION:Current communication networks are increasingly becoming pervasive\, complex\, and ever-evolving due to factors like enormous growth in the number of network users\, continuous appearance of network applications\, increasing amount of data transferred\, and diversity of user behavior. Therefore\, there is a great need for comprehensive Internet-wide measurements for cybersecurity. Critical facts about the Internet security\, such as “Which domain registries are abused by the cybercriminals the most?” or « Which Internet Service Providers do not deploy source IP address filtering\, facilitating massive DDoS attacks? » remain poorly quantified. \nIn this talk\, we will discuss a number of examples of measurement studies of the domain name space. In particular\, we will explore an attack against configuration files of poorly maintained name servers allowing\, for example\, domain hijacking. We refer to this type of attack as to « zone poisoning ». The attack is as simple as sending a single RFC compliant DNS dynamic update packet to a misconfigured server. In the simplest version of an attack\, a miscreant could replace an existing A or MX DNS resource record in a zone file of a server and point the domain name to an IP address under control of an attacker. We will present the global measurement study of the vulnerability. To assess the potential impact of non-secure dynamic updates\, we scanned 290 million domains worldwide and found that among the vulnerable domains are governments\, banks and health care providers\, demonstrating that the threat impacts important services. \nWe have also issued notifications for website owners\, DNS service providers\, and network operators\, suffering from non-secure DNS dynamic updates to assess which mechanisms are more effective at remediating the vulnerability. After the introduction of the General Data Protection Regulation (GDPR) some registration information is\, however\, no longer displayed in the public WHOIS data. Therefore\, we also assessed the effectiveness of alternative communication channels and issued notifications to national CERTs. \nVia our study of the zone poisoning attack and subsequent notifications to affected parties and respective intermediaries\, we aimed to improve the security of the global DNS ecosystem and test alternative methods to contact affected parties after the introduction of the GDPR regulation.
URL:https://www.loria.fr/event/seminaire-ssl-m-korczynski-lig-grenoble-internet-wide-measurements-for-cybersecurity-the-case-of-dns-zone-poisoning/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190619T100000
DTEND;TZID=Europe/Paris:20190619T230000
DTSTAMP:20190617T142434Z
CREATED:20190617T142218Z
LAST-MODIFIED:20190617T142434Z
UID:7475-1560938400-1560985200@www.loria.fr
SUMMARY:Talk Hiroaki Wagatsuma (Kyushu Institute of Technology\, RIKEN) on Brain-inspired robotics
DESCRIPTION:Hiroaki Wagatsuma (Kyushu Institute of Technology\, RIKEN) will be at Loria until June 28th. He will give a talk entitled « Brain-inspired robotics: Neural Dynamics for the Body Coordination and Interactions with the Environment » on Wednesday 19 June\, 10:00am in room C005. \nAbstract\nThe first issue that he tackled was the elucidation of the mechanism how different time scales of a behavior and synapses are associated according to the rhythm and he currently extended it to the question of how a rhythm (a specific type of the limit cycle in the system) transits to the other\, dynamically and sophisticatedly\, i.e. a structural design of the trajectory or self-organization of multiple rhythms for a complex function. For example\, a synchronous motion spontaneously appears in communication between persons faced each other and their motions differentiate as time advances because they need to express the own expressions each other. A typical example is an interactive game with motions. For judging or proceeding from a stage to the next stage\, the counterpart with a different motion have to synchronize at some moment\, which is a result to compete and determine which is winner\, or looser. A possible hypothesis is that such a quasi-equilibrium state is emerged from the coupling between the behavioral coordination and neuronal dynamics including the coordination and a conflict in the internal decision-making process. He discussed on the issue in the talk.
URL:https://www.loria.fr/event/talk-hiroaki-wagatsuma-kyushu-institute-of-technology-riken/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190606T133000
DTEND;TZID=Europe/Paris:20190606T143000
DTSTAMP:20190520T092629Z
CREATED:20190520T092629Z
LAST-MODIFIED:20190520T092629Z
UID:7227-1559827800-1559831400@www.loria.fr
SUMMARY:Séminaire SSL : L. Hirschi (INRIA - LORIA) "Security and Privacy of 5G AKA vs. Formal Verification"
DESCRIPTION:Mobile communication networks connect much of the world’s population. The security of every user’s calls\, SMSs\, and mobile data\, depends on the guarantees provided by the Authenticated Key Exchange protocols used. For the next-generation network (5G)\, the 3GPP group has standardized the 5G AKA protocol for this purpose.\nWe first discuss a comprehensive formal model and security analysis of 5G AKA (CCS’18). We extract precise requirements from the 3GPP standards defining 5G and we identify missing security goals. Using the security protocol verification tool Tamarin\, we conduct a full\, systematic\, security evaluation of the model with respect to the 5G security goals. Our evaluation automatically identifies the minimal security assumptions required for each security goal and we find that some critical security goals are not met\, except under additional assumptions missing from the standard. Finally\, we make explicit recommendations with provably secure fixes for the attacks and weaknesses we found.\nWe then discuss a privacy vulnerability we manually found on 5G AKA but that also affects the 3G and 4G versions of AKA (PETS’19). Despite the practical relevance of this new attack\, no prior automated analyses were able to find it. Even a posteriori\, automatically finding the privacy attack and establishing claims about potential fixes are challenging. We discuss why is so and identify some remaining scientific and technical obstacles.
URL:https://www.loria.fr/event/seminaire-ssl-l-hirschi-inria-loria-security-and-privacy-of-5g-aka-vs-formal-verification/
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
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;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: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: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:20190429T110000
DTEND;TZID=Europe/Paris:20190429T120000
DTSTAMP:20190418T063622Z
CREATED:20190418T063542Z
LAST-MODIFIED:20190418T063622Z
UID:7026-1556535600-1556539200@www.loria.fr
SUMMARY:Exposé d'Ana Roxin (D4)
DESCRIPTION:Ana Roxin\, candidate sur le poste de prof à l’IUT\, viendra faire un exposé lundi 29 avril à 11 heures\, en salle A008.\n\n Titre : \n« Raisonnement et connaissances – à la recherche de l’équilibre entre expressivité et efficacité »\n\nAuteur : \nAna ROXIN\, MCF HDR 27e section du CNU\, Univ. Bourgogne Franche-Comté (UBFC)\, Laboratoire d’Informatique de Bourgogne (LIB) EA7534\n\nRésumé: \n\nLe séminaire adresse le domaine de l’IA symbolique\, plus précisément l’ingénierie des connaissances ou la représentation de connaissances métier de manière à ce qu’un ordinateur puisse les interpréter et les manipuler\, comme le ferait un humain\, et tout en assurant l’efficacité d’implémentation. Après un bref résumé de mon parcours\, les contributions présentées concernent la modélisation de savoir-faire métiers avec des approches formelles\, décidables et en intégrant une sensibilité au contexte (de l’utilisateur ou d’utilisation). En relation avec ce domaine\, de nombreuses questions existent : comment modéliser de manière expressive et décidable une connaissance ? Comment identifier des connaissances vraies\, avec de la valeur dans un environnement de traitement massif de données ? Comment dépasser les limites de l’hétérogénéité sémantique dans un environnement fortement distribué ? Comment savoir si deux représentations « parlent de la même chose »\, si elles définissent la « chose » de la même manière ou si elles présentent des points de vue concurrents ou alors approximatifs ? Mes recherches s’efforcent de répondre à ces problématiques en utilisant les technologies du « Web sémantique ». Je présenterai mes contributions en termes de conception et implémentation d’approches permettant de simuler un raisonnement humain sur des connaissances réparties\, notamment notre approche de fédération faiblement couplée d’ontologies.
URL:https://www.loria.fr/event/expose-dana-roxin-d4/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20190426
DTEND;VALUE=DATE:20190427
DTSTAMP:20190417T122620Z
CREATED:20190417T122620Z
LAST-MODIFIED:20190417T122620Z
UID:7003-1556236800-1556323199@www.loria.fr
SUMMARY:PhD Day of Department 5 : Complex Systems\, Artificial Intelligence and Robotics
DESCRIPTION:The next PhD Day of the department 5 (Complex Systems\, Artificial Intelligence and Robotics) will take place on Friday\, April 26th.\n\nHere is the program for the day: \n9:15 am: Welcome coffee/croissant and good mood in A08\n9:45 am: Presentation of Department 5 (Patrick Henaff)\n9:55 am: Presentation of each team by the team leaders Kiwi\, Neurothythms\, Biscuit\, Larsen and Capsid (5 min each)\n10:20 am: Break\n10:35 am: Presentation of the doctoral students\nEach PhD student (even new ones) will introduce itself in 2 minutes MAX\, with 1 (or 2) slides each to motivate participants to come and see you during your interactive session or to discuss with you during the many breaks during the day! You can do something quite formal (presentation of the problem etc…)\, you can also do something (completely) offbeat! — In any case\, I would need you to send me your slide in.pdf format on Thursday\, April 25 at 6pm at THE LATEST LAST POSSIBLE MOMENT OF THIS UNIVERSE  (so that I have time to merge everything\, sebastien.rimbert@inria.fr). \n12:00 – 13:15: Hall B\, lunch buffet for the D5 \n\n13:15 – 13:30: PhD student delegate election \n13h30: A008 **Interactive presentation** on Open scientific publication\nModerated by Karim Ramdani \nThen we will have interactive sessions where some doctoral students will come back in more detail on their thesis work.\n \n*** INSTRUCTIONS *** the idea is to use what you want (demo\, poster\, wooden toys\, other) to lead a discussion around your thesis subject: present it\, discuss it\, explain your problem\, show your results\, etc. These sessions will take place all over Hall B (B013\, B011\, Agora\, etc.) \n14h30 : Interactive session 1\nSARKER Bishnu\, BEUGET Maël\, EL KHADIRI Yassine\, JOUAITI Mélanie \n15h15 : Interactive session 2\nMONTH Barbara\, MALAYSIS Adrian\, FOIS Adrien\, Patricia ALVEZ-SILVA\, SCHACYKOV Andrii \n16h00 : Round tables\n– what to do after the thesis?\n– how to prepare a conference?\n– research ethics?
URL:https://www.loria.fr/event/phd-day-of-department-5-complex-systems-artificial-intelligence-and-robotics/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20190425
DTEND;VALUE=DATE:20190426
DTSTAMP:20190417T132227Z
CREATED:20190417T132212Z
LAST-MODIFIED:20190417T132227Z
UID:7012-1556150400-1556236799@www.loria.fr
SUMMARY:5ème séminaire du Réseau Lorrain de Recherche IT Neuro
DESCRIPTION:Le prochain séminaire du réseau lorrain de recherche en Neurosciences (Interdisciplinaire et Translationnelle en Neurosciences) aura lieu le jeudi 25 Avril 2019 de 8h30 à 16h00\, dans l’amphithéâtre de la Présidence de l’Université de Lorraine\, 34 cours Léopold à Nancy.\nLe thème de cette journée est « Émotions/Motivation/Addictions ».\nLors de ce séminaire\, Frédéric Alexandre\, directeur de recherche Inria à Bordeaux et responsable de l’équipe Mnemosyne fera un exposé intitulé « Modéliser le cortex frontal pour la décision motivée ».\nAu cours de cette journée\, il y aura une session libre d’une vingtaine de posters autour des neurosciences où aucun thème ne sera imposé. Les posters seront affichés dans le hall qui jouxte l’amphithéâtre et une session de visite sera organisée entre 13h30 et 14h30.\n\n\nProgramme de la journée \nEn savoir plus
URL:https://www.loria.fr/event/5eme-seminaire-du-reseau-lorrain-de-recherche-it-neuro/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190424T140000
DTEND;TZID=Europe/Paris:20190424T150000
DTSTAMP:20190423T115330Z
CREATED:20190423T115330Z
LAST-MODIFIED:20190423T115330Z
UID:7051-1556114400-1556118000@www.loria.fr
SUMMARY:Exposé Imed Laaridh (D4)
DESCRIPTION:Imed Laaridh qui candidate au poste de maitre de conférences à CentraleSupélec fera un exposé au Loria mercredi 24 avril en salle C005 à 14h. \n  \nTitre: « Traitement automatique et mesure d’intelligibilité de la parole pathologique » \nRésumé: \nL’intelligibilité de la parole est au cœur des interactions humaines. La problématique de son évaluation intéresse particulièrement la qualité de la transmission de la parole à travers différents milieux ou transducteurs\, la compréhensibilité de la parole en cas de déficit de production ou de perception de la parole par un individu\, la compréhensibilité des langues étrangères. \nDans la pratique clinique\, l’évaluation perceptive reste le moyen le plus utilisé pour la mesure de l’intelligibilité de la parole. Cependant\, cette évaluation présente plusieurs limites notamment son caractère subjectif et son coût (en temps et en ressources). \nCette présentation portera sur différentes applications des outils de traitement automatique de la parole sur de la parole pathologique. Les objectifs étant la mesure de la qualité de prononciation (au niveau phonème)\, la mesure objective de l’intelligibilité de la parole et la caractérisation des pathologies dans le cadre d’aide au diagnostic. \n 
URL:https://www.loria.fr/event/expose-imed-laaridh-d4/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190423T110000
DTEND;TZID=Europe/Paris:20190423T120000
DTSTAMP:20190417T152232Z
CREATED:20190417T152225Z
LAST-MODIFIED:20190417T152232Z
UID:7022-1556017200-1556020800@www.loria.fr
SUMMARY:MALOTEC Seminar
DESCRIPTION:For the next MALOTEC seminar\, Valia Mitsou\, who is a candidate for the position of associate professor in CentraleSupelec will give a presentation at LORIA on Tuesday April 23 at 11am in room A008 \nPresentation of the speaker : \nValia Mitsou\nUniversité Paris Diderot\nInstitut de Recherche en Informatique Fondamentale (IRIF) \nTitle: Limitation of treewidth for problems beyond NP \nAbstract: In this seminar\, we take a closer look at the parameterized complexity of problems belonging in Σ^p_2 and Π^p_2\, the second level of the polynomial hierarchy. We provide tight fine-grained bounds on their complexity with respect to the most important structural graph parameter\, the treewidth. We observe that these problems exhibit similar behavior: we show that a variety of diverse problems including ∃∀SAT\, Choosability\, as well as various problems from AI such as Abduction and Abstract Argumentation\, while they admit a $2^{2^{O(tw)}}$ algorithm\, they cannot be solved in time $2^{2^{o(tw)}}$ under the Exponential Time Hypothesis. \nFor more information
URL:https://www.loria.fr/event/malotec-seminar-5/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190404T140000
DTEND;TZID=Europe/Paris:20190404T150000
DTSTAMP:20190402T133202Z
CREATED:20190402T133158Z
LAST-MODIFIED:20190402T133202Z
UID:6900-1554386400-1554390000@www.loria.fr
SUMMARY:MALOTEC seminar : Lydia Boudjeloud-Assala
DESCRIPTION:  \n=========================================================\nMALOTEC Seminar: Thursday April 04 2019\, 2pm\, Room C005 \nLydia Boudjeloud-Assala\nUniversité de Lorraine\nLoria \nTitle: Human in the loop: Visual -massive and temporal- data mining \nAbstract: I will present a review of my research on cooperative\napproaches combining interactive visualization methods and automatic\nmethods (attributes Selection\, Clustering\, Biclustering\, and outlier\ndetection) for the knowledge discovery in massive and temporal data. I\nwill present different possibilities to involve the user in the data\nmining process in order to improve his confidence and understanding in\nthe models or obtained results. New challenges for these methods\, which\nmust be able to handle not only increasing amounts of data but also data\nthat can change over time\, will also be presented and discussed. \nFor more information \nFurther MALOTEC Seminars \n  \n 
URL:https://www.loria.fr/event/malotec-seminar-lydia-boudjeloud-assala/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190404T133000
DTEND;TZID=Europe/Paris:20190404T150000
DTSTAMP:20190305T074902Z
CREATED:20190305T074902Z
LAST-MODIFIED:20190305T074902Z
UID:6596-1554384600-1554390000@www.loria.fr
SUMMARY:SSL Seminar
DESCRIPTION:Next SSL seminar will take place on Thursday\, April 4th at 1.30 pm in room A008. \nGilles Barthe (MPI Bochum) will give a presentation entitled « Computer-aided cryptography ». \n \nWe need cryptography that we can trust. Yet the design\, analysis\, and implementation of cryptographic libraries is a challenging task\, that requires insights across various areas of mathematics and computer science. Computer-aided cryptography is a young research area which\nuses formal methods for exploring the design space of cryptographic constructions and for delivering zero-defect\, side-channel resistant\, cryptographic libraries. The talk will give an overview of our work in computer-aided cryptography and discuss some of the challenges and opportunities in cryptography and beyond.
URL:https://www.loria.fr/event/ssl-seminar-8/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190402T100000
DTEND;TZID=Europe/Paris:20190402T110000
DTSTAMP:20190329T165913Z
CREATED:20190329T142924Z
LAST-MODIFIED:20190329T165913Z
UID:6809-1554199200-1554202800@www.loria.fr
SUMMARY:Séminaire D3: Ingénierie multi-agent des collectifs cyber-physiques
DESCRIPTION:Le prochain séminaire D3 aura lieu le mardi 2 avril à 10h en salle A008. \nVoici le titre et le résumé: \nTitre : Ingénierie multi-agent des collectifs cyber-physiques (par Jean-Paul Jamont – Univ. Grenoble Alpes) \nRésumé : Les collectifs cyber-physiques sont des systèmes embarqués en réseau dans lequel les nœuds logiciels et matériels ont une autonomie de décision et coopèrent spontanément afin de participer à l’accomplissement d’objectifs du système global ou de pallier des manques de connaissances ou de compétences individuelles. Ces objectifs portent notamment sur l’état de leur environnement physique. Cette présentation introduit les nombreux défis posés par leur conception et propose une ingénierie de ces collectifs basée sur une démarche\, des modèles et des outils multi-agents. Plus loin l’ingénierie de leur couplage permettra d’aborder la notion de systèmes de systèmes cyber-physiques.
URL:https://www.loria.fr/event/seminaire-d3-ingenierie-multi-agent-des-collectifs-cyber-physiques/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190402T093000
DTEND;TZID=Europe/Paris:20190402T160000
DTSTAMP:20190329T153249Z
CREATED:20190329T153245Z
LAST-MODIFIED:20190329T153249Z
UID:6811-1554197400-1554220800@www.loria.fr
SUMMARY:Journée scientifique de l'équipe ABC
DESCRIPTION:Programme de la journée scientifique de l’équipe ABC\nRV Salle C 103 du bâtiment LORIA le 2 avril 2019 ! \nProgramme : \n9h30 – 10h00 –  Accueil des participants\n10h – 11h00  – Parisa Rastin\, Université Paris 13 Apprentissage automatique et adaptatif pour le clustering de flux de données relationnelles\n11h00 – 11h15 Pause\n11h15 – 12h15 Marianne Clausel\, Université de Lorraine Topic modeling\n12h15 – 12h35 Myriam Maumy-Bertrand\, Université de Strasbourg Sur quelques aspects du dilemme du Petit Chaperon rouge : discrimination entre la mère-grand et le grand méchant loup\n12h35 – 13h30 Repas\n13h30 – 14h30 Myriam Tami\, CentraleSupélec Uncertain Trees : Dealing with Uncertain Inputs in Regression Trees\n14h30 – 16h00 Discussion sur l’élaboration d’un projet scientifique commun\n16h00 –  Fin de la journée
URL:https://www.loria.fr/event/journee-scientifique-de-lequipe-abc/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190327T110000
DTEND;TZID=Europe/Paris:20190327T120000
DTSTAMP:20190325T090116Z
CREATED:20190325T090107Z
LAST-MODIFIED:20190325T090116Z
UID:6773-1553684400-1553688000@www.loria.fr
SUMMARY:MALOTEC Seminar : Saïd Jabbour
DESCRIPTION:Next MALOTEC seminar will take place on Wednesday March 27th at 11am in room B013. \nSaïd Jabbour (Université d’Artois\, Centre de recherche en informatique de lens (CRIL)) will give a presentation entitled « Data mining by constraints ». \nAbstract: In this presentation\, I will address the issue of data mining\nby constraints. I will present some contributions on declarative\napproaches for different data mining tasks including frequent itemset\nmining and its various condensed forms\, association rules\, sequential\npattern mining\, uncertain frequent itemset mining and gradual itemset\nmining. To highlight the cross-fertilization between symbolic AI and\ndata mining\, I will show how linear constraints can be used to summarize\nlarge graphs\, how data mining techniques can be exploited to compress\nBoolean formulas and finally how the concept of symmetry\, widely\nexplored in SAT/CP\, is extended to pattern mining. \nFor more information: http://www.cril.univ-artois.fr/~jabbour/
URL:https://www.loria.fr/event/malotec-seminar-4/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190319T140000
DTEND;TZID=Europe/Paris:20190319T153000
DTSTAMP:20190313T105411Z
CREATED:20190313T105411Z
LAST-MODIFIED:20190313T105411Z
UID:6659-1553004000-1553009400@www.loria.fr
SUMMARY:Seminar : Adrien Boiret
DESCRIPTION:Adrien Boiret will give a presentation on Tuesday\, 19th March at 2pm in room A008. \nHis talk is entitled « Extend the RPNI algorithm for Symbolic Learning to Transducers with Lookahead ». \n \nAbstract:\nWe consider the problem of passive symbolic learning of tree and word transducers.\nSymbolic learning means learning an exact target (automaton\, transducer…) using exact information on its (words\, input/output pairs…).\nThe passive learning problem deals with identifying a specific transducer in normal form from a finite set of behaviour examples (as opposed to the active learning that uses student-teacher interactions). \nSymbolic learning problems are solved in word languages using the RPNI algorithm\, that relies heavily on the Myhill-Nerode characterization of a minimal normal form on DFA.\nThe extensions of RPNI to word transformations and tree languages follow the same pattern: first\, a Myhill-Nerode theorem is identified\, then the normal form it induces can be learnt from examples.\n\nIn this talk I will present another extension of the RPNI model that necessitates a departure from this schema to learn rational functions on words\, performed by transducers with lookahead.\nThe notable difference is that the nature of the minimal normal form on these transducers is ill adapted to classic RPNI methods\, and thus a new normal form has to be found.
URL:https://www.loria.fr/event/seminar-adrien-boiret/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190319T140000
DTEND;TZID=Europe/Paris:20190319T150000
DTSTAMP:20190319T085158Z
CREATED:20190315T142954Z
LAST-MODIFIED:20190319T085158Z
UID:6679-1553004000-1553007600@www.loria.fr
SUMMARY:Séminaire : Joël Legrand
DESCRIPTION:Joël Legrand\, MCF à Lille de l’équipe Inria Magnet\, viendra nous présenter ses travaux le mardi 19 mars à 14h en salle A007 à CentraleSupélec (2 rue Edouard Belin\, Metz). \nSa présentation est intitulée « Syntax-based Word Sequence Modeling using Deep Learning ». \n \nAbstract: \nTraditionally\, natural language processing (NLP) relied on generative models with task specific and manually engineered features.\nRecently deep learning approaches provided state of-the-art results in various fields such as computer vision\, speech processing and natural language processing.\nThe central idea behind these approaches is to learn features and models simultaneously\, in an end-to-end manner\, and making as few assumptions as possible.\nIn NLP\, word embeddings\, mapping words in a dictionary on a continuous low-dimensional vector space\, have proven to be very efficient for a large variety of tasks while requiring almost no a-priori linguistic assumptions. \nIn this talk\, I will present some results on representations of segments of sentences using deep neural network models.\nIn particular\, I will show how syntactic structures\, such as consistuency and dependency syntactic trees\, can be leveraged for the\npurpose of solving NLP tasks that involve complex sentence-level relationships.\nI will first introduce the key concepts of deep learning for NLP. I will then focus on two empirical studies concerning the tasks of\nsyntactic parsing using recursive neural networks (RNN) and relationship extraction from text using tree-LSTM with dependency structures. \nSelected publications:\n[1]. Joint RNN-based greedy parsing and word composition.\nJoël Legrand and Ronan Collobert.\nProceeding of the 3rd International Conference on Learning\nRepresentations (ICLR 2015)\nhttp://arxiv.org/pdf/1412.7028 \n[2] Syntax-based Transfer Learning for the Task of Biomedical Relation Extraction\nJoël Legrand\, Yannick Toussaint\, Chedy Raïssi\, Adrien Coulet\nProceeding of the Ninth International Workshop on Health Text Mining and\nInformation Analysis (LOUHI 2018)\nhttps://hal.inria.fr/hal-01869071/document \nShort bio:\nJoël Legrand received his MSc degree in Computer Science from the\nUniversité de Lorraine and his Ph.D in Electrical Engineering from the\nÉcole Polytechnique Fédérale de Lausanne (EPFL\, Switzerland).\nHe recently joined the  MAGNET team (Cristal\, INRIA-CNRS-Université de\nLille) as an associate professor (maître de conférences).
URL:https://www.loria.fr/event/seminaire-joel-legrand/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20190311
DTEND;VALUE=DATE:20190315
DTSTAMP:20190208T101437Z
CREATED:20190208T101437Z
LAST-MODIFIED:20190208T101437Z
UID:6527-1552262400-1552607999@www.loria.fr
SUMMARY:MLA 2019
DESCRIPTION:The Third Workshop on Mathematical Logic and its Applications will take place at Loria between March 11th and March 14th. \nMore information : mla2019.loria.fr \nWorkshop Description\nThe workshop brings together researchers of mathematical logic and its related areas\, and would provide a forum for interplay between these areas. This workshop\, organised by Loria\, will be held as a part of the JSPS Core-to-Core Program “Mathematical Logic and its Applications”\, which is led by Japan Advanced Institute of Science and Technology (JAIST) in cooperation with several institutes both in Japan and abroad. Anyone\, not restricted to the members of the project\, is welcome to participate. \nScope\nThe scope includes (but is not limited to) the following topics and their applications: \n\nIntuitionistic logic\nType theory\nProof theory\nConstructive analysis/topology\nProgram extraction\nReverse mathematics\nComputable analysis/topology\nRecursion theory (Computability theory)\nNon-classical logic\nComputational complexity\n\nSubmission\nExtended abstracts (1-2 pages) of original work are welcome.\nThe deadline is January 28\, 2019.\nUpload your submission via EasyChair. \nImportant dates\nSubmission: January 28\, 2019\nNotification: February 1st\, 2019\nDeadline for registration: February 20\, 2019\nWorkshop: March 11-14\, 2019
URL:https://www.loria.fr/event/mla-2019/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190308T133000
DTEND;TZID=Europe/Paris:20190308T150000
DTSTAMP:20190115T104422Z
CREATED:20190115T104422Z
LAST-MODIFIED:20190115T104422Z
UID:6383-1552051800-1552057200@www.loria.fr
SUMMARY:D3 Seminar : David Gutierrez Estevez\, Samsung
DESCRIPTION:Next D3 Seminar will take place on Friday\, March 8th at 1.30 pm in room A008. \nDavid Gutierrez Estevez (Samsung) will give a presentation entitled « 5G Architecture and Elastic Network Slicing: A View from the 5G-MoNarch Project ». \nAbstract:  Vertical markets and industries are addressing a large diversity of heterogeneous services\, use cases\, and applications in 5G. It is currently common understanding that for networks to be able to satisfy those needs\, a flexible\, adaptable\, and programmable architecture based on network slicing is required. Moreover\, a softwarization and cloudification of the networks is already underway\, where network functions (NFs) are transformed from monolithic pieces of equipment to programs running over a shared pool of computational and communication resources. In this talk\, an overview will be given on the topic of 5G architecture with a special emphasis on network slicing. Furthermore\, the talk will encompass the view on the topic from the 5G-PPP research project 5G-MoNArch (5G MobileNetwork Architecture for diverse services\, use cases\, and applications in 5G and beyond)\, which has been working for the last 18 months on designing an architecture that will combine today’s consolidated concepts (such as virtualization\, slicing and orchestration of access and core functions) with several novel innovations targeted at optimizing the envisioned architecture. In particular\, the talk will look at the network resource elasticity innovation\, a key means to make an efficient use of the computational resources in 5G systems aided by artificial intelligence and data analytics. \nBio: Dr. David M. Gutierrez Estevez obtained his Engineering Degree in Telecommunications (Hons.) from the Universidad de Granada\, Spain\, and his M.S. and Ph.D. degrees from Georgia Institute of Technology in Atlanta\, USA. He developed his Ph.D. thesis at the Broadband Wireless Networking Laboratory under the supervision of Prof. Ian F. Akyildiz\, obtaining the Researcher of the Year Award in 2013. From Sept. 2014 to Sept. 2015\, David worked for Huawei Technologies as Principal Research Engineer in Silicon Valley in the area of cloud computing. Previous to that\, David had held an internship position at the Corporate R&D Division of Qualcomm\, as well as research assistant and intern positions at Fraunhofer Heinrich Hertz Institute and Fraunhofer Institute for Integrated Circuits\, both in Germany. Since January 2016\, David is with the 5G Research and Standards team of the Samsung Electronics R&D Institute UK\, currently holding a Principal Engineer position where he leads several research projects and participates in different standardization activities related to network architecture. \n 
URL:https://www.loria.fr/event/d3-seminar-david-gutierrez-estevez-samsung/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190301T093000
DTEND;TZID=Europe/Paris:20190301T110000
DTSTAMP:20190218T131956Z
CREATED:20190218T131956Z
LAST-MODIFIED:20190218T131956Z
UID:6572-1551432600-1551438000@www.loria.fr
SUMMARY:Seminar : Xiaofang Wang
DESCRIPTION:Xiaofang Wang (Inria Rennes) will give a seminar on March 1st at 9.30 am in room A006. \nHer presentation is entitled « From Image segmentation and active colloids tracking\, to weakly supervised object detection ». \nI will present my research activities\, covering four axes in machine learning. They are unsupervised learning for image segmentation and active colloids tracking\, weakly supervsed object detection\, supervised learning for 3D object classification and domain adaptation in transfer learning. First\, a short overview on all axes is introduced. Then I will present several works in depth\, including graph based image segmentation and object tracking\, as well as what is weakly supervised in object detection and our contribution. Finally\, a theorectical introduction on the domain adaptation and our proposals will be discussed. Please find more details here:https://team.inria.fr/rainbow/fr/xiaofang-wang/.
URL:https://www.loria.fr/event/seminar-xiaofang-wang/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190228T133000
DTEND;TZID=Europe/Paris:20190228T150000
DTSTAMP:20190207T143456Z
CREATED:20190207T143456Z
LAST-MODIFIED:20190207T143456Z
UID:6519-1551360600-1551366000@www.loria.fr
SUMMARY:SSL Seminar : Aurore Guillevic
DESCRIPTION:Next SSL Seminar will take place on Thursday\, February 28th at 1.30 pm in room A008. \nAurore Guillevic (Caramba) will give a presentation entitled « Discrete logarithm computation in finite fields GF(p^k) with NFS variants and consequences in pairing-based cryptography. » \n \nAbstract:\nPairings on elliptic curves are involved in signatures\, NIZK\, and recently in blockchains (ZK-SNARKS).\nThese pairings take as input two points on an elliptic curve E over a finite field\, and output a value in an extension of that finite field.\nUsually for efficiency reasons\, this extension degree is a power of 2 and 3 (such as 12\,18\,24)\, and moreover the characteristic of the finite field has a special form. The security relies on the hardness of\ncomputing discrete logarithms in the group of points of the curve and in the finite field extension. \nIn 2013-2016\, new variants of the function field sieve and the number field sieve algorithms turned out to be faster in certain finite fields related to pairing-based cryptography. Now small characteristic settings\n(with GF(2^(4*n))\, GF(3^(6*m))) are discarded\, and the situation of GF(p^k) where p is prime and k is small (in practice from 2 to 54) is unclear.\nThe asymptotic complexity of the Number Field Sieve algorithm in finite fields GF(p^k) (where p is prime) and its Special and Tower variants is given by an asymptotic formula of the form A^(c+o(1)) where A depends on\nthe finite field size (log p^k)\, o(1) is unknown\, and c is a constant between 1.526 and 2.201 that depends on p\, k\, and the choice of parameters in the algorithm. \nIn this work we improve the approaches of Menezes-Sarkar-Singh and Barbulescu-Duquesne to estimate the cost of a hypothetical implementation of the Special-Tower-NFS in GF(p^k) for small k (k <= 24)\, and update some parameter sizes for pairing-based cryptography. \nThis is a joint work with Shashank Singh\, IISER Bhopal\, India. \nMore information about SSL Seminars
URL:https://www.loria.fr/event/ssl-seminar-aurore-guillevic/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190228T110000
DTEND;TZID=Europe/Paris:20190228T120000
DTSTAMP:20190227T110218Z
CREATED:20190227T110218Z
LAST-MODIFIED:20190227T110218Z
UID:6581-1551351600-1551355200@www.loria.fr
SUMMARY:MALOTEC Seminar : Marc Plantevit
DESCRIPTION:Next MALOTEC seminar will take place on Thursday\, February 28th at 11am in room A008. \nMarc Plantevit (Université Claude Bernard Lyon 1 – LIRIS – CNRS UMR 5205) will give a presentation entitled « Pattern Mining in Augmented Graphs ». \n  \nMarc Plantevit\nUniversité Claude Bernard Lyon 1\nData Mining and Machine Learning (DM2L)\nLIRIS – CNRS UMR 5205 \nTitle: Pattern Mining in Augmented Graphs \nAbstract: Graphs are a powerful mathematical abstraction that enables to depict many real world phenomena. Vertices describe entities and edges identify relations between entities. Such graphs are often augmented with additional pieces of information. For instance\, the vertices or the edges are enriched with attributes describing them and are called vertex (respectively edge) attributed graphs. Graphs can also be dynamic\, i.e.\, the structure and the values of vertex attributes may evolve through time. The discovery of patterns in such graphs may provide actionable insights and boost the user knowledge. In this talk\, I will discuss the different pattern domains for augmented graphs I contributed to define. This includes the discovery of exceptional attributed subgraphs in edge or vertex attributed graphs. Then\, I will discuss how to find patterns of higher interest by taking into account the domain knowledge\, user feedback and user’s prior knowledge through different examples. \nFor more information: https://perso.liris.cnrs.fr/mplantev/doku/
URL:https://www.loria.fr/event/malotec-seminar-marc-plantevit/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190129T110000
DTEND;TZID=Europe/Paris:20190129T233000
DTSTAMP:20190116T143344Z
CREATED:20190116T143344Z
LAST-MODIFIED:20190116T143344Z
UID:6388-1548759600-1548804600@www.loria.fr
SUMMARY:OLKi project presentation
DESCRIPTION:Christophe Cerisara (Synalp) will present OLKi Project on Tuesday\, January 29th at 11am in room A008. \nHis presentation will thus concern AI applied to natural language and knowledge\, open science and resource sharing through the Fediverse. \nMore about OLKi \n 
URL:https://www.loria.fr/event/olki-project-presentation/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190118T133000
DTEND;TZID=Europe/Paris:20190118T150000
DTSTAMP:20190109T091317Z
CREATED:20190109T091317Z
LAST-MODIFIED:20190109T091317Z
UID:6361-1547818200-1547823600@www.loria.fr
SUMMARY:Colloquium Loria : Félicien Vallet
DESCRIPTION:Félicien Vallet\, ingénieur au sein du service d’expertise technologique de la CNIL est le prochain invité du colloquium du Loria. \nRendez-vous vendredi 18 janvier à 13h30 dans l’amphithéâtre pour son exposé intitulé « Présentation de la CNIL et premiers enseignements à RGPD : M+8″. \n \nRésumé : \nEntré en application le 25 mai 2018\, le RGPD renforce les droits et devoirs en matière de protection des données. En offrant un cadre européen unifié\, il dote notamment les autorités de protection des données (comme la CNIL en France) de pouvoirs plus importants. Cette présentation vise à apporter des éléments d’information sur les fonctionnements\, rôles et missions de la CNIL ainsi que sur les nouveautés introduites par le RGPD. De premiers éléments d’appréciation « post-RGPD » seront également mis en avant. Enfin\, les aspects liés à la protection des données dans un cadre de recherche pourront être discutés à l’occasion de cette présentation qui se veut interactive et ouverte à tous. \n  \nMerci aux personnes extérieures au Loria de s’inscrire auprès de Marie Baron (marie.baron (at) loria.fr) avant mercredi 16 janvier.
URL:https://www.loria.fr/event/colloquium-loria-felicien-vallet/
CATEGORIES:Séminaire
END:VEVENT
END:VCALENDAR