BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.16.3//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:20170326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20171029T010000
END:STANDARD
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:20181107T083000
DTEND;TZID=Europe/Paris:20181107T170000
DTSTAMP:20260608T022826
CREATED:20181026T134019Z
LAST-MODIFIED:20181026T134020Z
UID:6144-1541579400-1541610000@www.loria.fr
SUMMARY:Forum des Sciences Cognitives
DESCRIPTION:Le prochain Forum des Sciences Cognitives à Nancy\, organisé par l’IDMC (Institut des Sciences du Digital\, Management & Cognition\, ex-UFR de Mathématiques et Informatique) de l’Université de Lorraine et par EKOS\, l’Association des étudiant·es en Sciences Cognitives\, aura lieu le mercredi 7 novembre prochain dans les locaux de l’École des Mines de Nancy\, campus ARTEM. \nLe matin auront lieu des conférences: \n\nVincent Claveau (CNRS – IRISA de Rennes)Le traitement automatique des langues à la chasse aux fakenews\nArnaud Malon (Crédit Mutuel)Manifeste pour un web éthique\nThomas Cohu (Proxem) Intelligence artificielle et traitement du langage\n\nL’après-midi auront lieu différents ateliers thématiques (accès prioritaire aux étudiant·es de l’IDMC): \n\nUX design\nIA & Deep Learning\nSilver technologies\nAncien·ne·s : Que sont-ils·elles devenu·e·s ?\nRecrutement dans le numérique : we need you!\nStands & démos\n\nProgramme détaillé :http://institut-sciences-digitales.fr/evenements-idmc/forum-sciences-cognitives-2018/Entrée libre\, sur inscription\, dans la limite des places disponibles. 
URL:https://www.loria.fr/event/forum-des-sciences-cognitives/
LOCATION:Mines Nancy – Campus Artem
CATEGORIES:Manifestation
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181108T110000
DTEND;TZID=Europe/Paris:20181109T150000
DTSTAMP:20260608T022826
CREATED:20181022T073508Z
LAST-MODIFIED:20181022T073508Z
UID:6120-1541674800-1541775600@www.loria.fr
SUMMARY:Journées Informatique Quantique 2018
DESCRIPTION:Les Journées Informatique Quantique sont organisées par le groupe de travail Informatique Quantique (GT IQ) du GdR IM du CNRS. Elles se dérouleront au LORIA à Nancy. \nLes Journées Informatique Quantique ont pour but de rassembler la communauté travaillant dans les différents domaines que recouvre l’informatique quantique. Une série d’exposés permettra de prendre connaissance des travaux des participants. Les jeunes chercheurs\, tout particulièrement les doctorants et post-doctorants\, sont vivement encouragés à présenter leurs résultats récents ou travaux en cours. \nL’inscription est gratuite mais obligatoire par mail à jiq18@services.cnrs.fr avant le 26 octobre 2018. \nProgramme :  \nJeudi 8 novembre : \n11h-11h30 : Shane Mansfield (LIP6) – Continuous Variable Contextuality \n11h30 – 12h : Clément Meignant (LIP6) – Distributing graph states as multipartite resources over arbitrary quantum networks \n12h – 12h30 : Alessandro Luongo (IRIF\, Atos) – Quantum algorithms for classification \n12h30 – 14h : Pause \n14h – 15h : Omar Fawzi (LIP) – TBA \n15h – 15h30 : Yassine Hamoudi (IRIF) – Quantum Chebyshev’s inequality and applications \n15h30 – 16h : Pause \n16h – 16h30 : Francesco Arzani (LIP6/LORIA) – Quantum secret sharing using squeezing and almost any passive interferometer \n16h30 – 17h : Julian Wechs (Inst. Néel) – Communication through coherent control of quantum channels \n17h – 17h30 : Léo Colisson (LIP6) – On the possibility of classical client blind quantum computing \n17h30 – 18h : Yixin Shen (IRIF) – Quantum lattice enumeration \nVendredi 9 novembre :  \nUne partie du programme du vendredi sera commune avec la rencontre du projet ANR SoftQPro \n9h – 9h30 : Shraddha Singh (LIP6) – Quantum protocol zoo \n9h30 – 10h : Christophe Vuillot (TU Delft) – Quantum error correction with the Toric-GKP code \n10h – 10h30 : Johanna Seif (LIP) – Algorithmic aspects of quantum coding \n10h30 – 11h : Pause \n11h – 11h30 : Vladimir Zamdzhiev (LORIA) – Entanglement analysis for a first-order quantum programming language with inductive datatypes \n11h30 – 12h : Renaud Vilmart (LORIA) – Completeness of graphical languages for mixed states and completely positive maps \n12h – 12h30 : Benoît Valiron (LRI) – TBA \n12h30 – 14h : Pause \n14h – 14h30 : Simon Martiel (Atos) – TBA \n14h30 – 15h : Valentin Perrelle (CEA) – TBA
URL:https://www.loria.fr/event/journees-informatique-quantique-2018/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181108T140000
DTEND;TZID=Europe/Paris:20181108T153000
DTSTAMP:20260608T022826
CREATED:20181017T115959Z
LAST-MODIFIED:20181017T115959Z
UID:6110-1541685600-1541691000@www.loria.fr
SUMMARY:Department 1 seminar : Chee Yap (New York University)
DESCRIPTION:The next seminar of Department 1 will take place on Thursday\, November 8th at 2pm in room A008. \nChee Yap (New York University) will give a presentation entitled « Subdivision Path Planning in Robotics: Theory and Practice ».  \nABSTRACT: \nMotion planning is a fundamental problem in robotics. We propose to design path planners based on three foundations: (1) The notion of resolution-exact » planners. Conceptually\, it avoids the zero problem of exact computation. (2) The use of soft predicates » for achieving such algorithms in the subdivision approach. (3) The feature-based technique » for constructing such soft predicates. We formulate an algorithmic framework called Soft Subdivision Search » (SSS) that incorporates these ideas. There are many parallels between our framework and the well-known Sampling or Probabilistic Roadmap framework. Both frameworks lead to algorithms that are – practical – easy to implement – flexible and extensible – with adaptive and local complexity. In contrast to sampling and previous resolution approaches\, SSS confers strong theoretical guarantees\, including halting. In a series of papers we demonstrated the power of these ideas\, by producing planners for planar robots with 2\, 3 and 4 degrees of freedom (DOF) that outperform or matches state-of-art sampling-based planners. Most recently\, we produced a planner for two spatial robots (rod and ring) with 5 DOFs. Non-heuristic planners for such robots has been considered a challenge for the subdivision approach. We outline a general axiomatic theory underlying these results\, including subdivision in non-Euclidean configuration spaces\, Joint work with Y.J.Chiang\, C.H.Hsu\, C.Wang\, Z.Luo\, B.Zhou\, J.P.Ryan.\n\nPage of Department 1 seminars
URL:https://www.loria.fr/event/department-1-seminar-chee-yap-new-york-university/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181109T140000
DTEND;TZID=Europe/Paris:20181109T150000
DTSTAMP:20260608T022826
CREATED:20181107T130948Z
LAST-MODIFIED:20181107T131026Z
UID:6163-1541772000-1541775600@www.loria.fr
SUMMARY:PhD Defense : Gabin Personeni
DESCRIPTION:Gabin Personeni (Orpailleur) will defend his thesis on Friday\, November 9th at 2pm in room A008. \nHis thesis is entitled « Contribution of domain ontologies for knowledge discovery in biomedical data ». \n \nThe jury will be composed of the following 8 members :\n\nRapporteurs\n-Olivier Dameron\, Maître de Conférences à l’Université de Rennes 1\n-Céline Rouveirol\, Professeur à l’Université Paris 13\nExaminateurs\n-Jérôme Azé\, Professeur à l’Université de Montpellier\n-Anne Boyer\, Professeur à l’Université de Lorraine\n-Adrien Coulet\, Maître de Conférences à l’Université de Lorraine\n-Marie-Dominique\, Chargée de Recherches\, CNRS\nInvités\n-Michel Dumontier\, Distinguished Professor\, Maastricht University\n-Malika Smaïl-Tabbone\,  Maître de Conférences à l’Université de Lorraine\n\n\n\n\nAbstract\n\n\n   The semantic Web proposes standards and tools to formalize and share knowledge on the Web\, in the form of ontologies. Biomedical ontologies and associated data represents a vast collection of complex\, heterogeneous and linked knowledge. The analysis of such knowledge presents great opportunities in healthcare\, for instance in pharmacovigilance. This thesis explores several ways to make use of this biomedical knowledge in the data mining step of a knowledge discovery process. In particular\, we propose three methods in which several ontologies cooperate to improve data mining results.\n A first contribution of this thesis describes a method based on pattern structures\, an extension of formal concept analysis\, to extract associations between adverse drug events from patient data. In this context\, a phenotype ontology and a drug ontology cooperate to allow a semantic comparison of these complex adverse events\, and leading to the discovery of associations between such events at varying degrees of generalization\, for instance\, at the drug or drug class level.\nA second contribution uses a numeric method based on semantic similarity measures to classify different types of genetic intellectual disabilities\, characterized by both their phenotypes and the functions of their linked genes. We study two different similarity measures\, applied with different combinations of phenotypic and gene function ontologies. In particular\, we investigate the influence of each domain of knowledge represented in each ontology on the classification process\, and how they can cooperate to improve that process.\nFinally\, a third contribution uses the data component of the semantic Web\, the Linked Open Data (LOD)\, together with linked ontologies\, to characterize genes responsible for intellectual deficiencies. We use Inductive Logic Programming\, a suitable method to mine relational data such as LOD while exploiting domain knowledge from ontologies by using reasoning mechanisms. Here\, ILP allows to extract from LOD and ontologies a descriptive and predictive model of genes responsible for intellectual disabilities.\nThese contributions illustrates the possibility of having several ontologies cooperate to improve various data mining processes.
URL:https://www.loria.fr/event/phd-defense-gabin-personeni/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181114T140000
DTEND;TZID=Europe/Paris:20181114T153000
DTSTAMP:20260608T022826
CREATED:20181022T112723Z
LAST-MODIFIED:20181022T112723Z
UID:6130-1542204000-1542209400@www.loria.fr
SUMMARY:TALC Seminar : Antoine Deleforge
DESCRIPTION:Next TALC seminar will take place on Wednesday\, November 14th at 2pm in room C005. Antoine Deleforge (Multispeech) will give a presentation entitled « Audio signal processing with a little help from echoes ». \nAbstract:\nWhen a sound wave propagates from a point source through a medium and is reflected on surfaces before reaching microphones\, the measured signals\nconsist of mixtures of the direct path signal with delayed and attenuated copies of itself. This acoustical phenomenon is referred to as echoes\, or reverberation\, and is generally considered as a nuisance in audio signal processing. After introducing some basic signal processing and acoustic background\, this seminar will present recent works showing how acoustic echoes can be blindly estimated from audio recordings\, and how the knowledge of such echoes can actually help some audio signal processing tasks such as beamforming\, source separation or sound source localization. \nNext seminars: http://talc.loria.fr/
URL:https://www.loria.fr/event/talc-seminar-antoine-deleforge/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181115T133000
DTEND;TZID=Europe/Paris:20181115T150000
DTSTAMP:20260608T022826
CREATED:20181008T081838Z
LAST-MODIFIED:20181008T081839Z
UID:6088-1542288600-1542294000@www.loria.fr
SUMMARY:SSL Seminar : Corinna Schmitt
DESCRIPTION:Next SSL Seminar will take place on Thursday\, November 15th at 1.30 pm in room C005. \nCorinna Schmitt (Universität der Bundeswehr München) will give a presentation entitled « Authentication in IoT Networks ». \nToday over 35 billion devices are connected with each other building the Internet of Things (IoT). The device diversity ranges from constrained devices (e.g.\, sensor\, Smartwatches) over Tables and Smartphone to resource-rich devices like notebooks and servers. In parallel the stack in IoT shows also diversity and includes usage of many standards and third-party services at the same time from collection point to the application. Manifold data is collected all the time and the users have less knowledge about it\, but their awareness of misuse rises.\nBased on this quite complex situation\, authentication in IoT networks is important. But which authentication are we speaking of here? In general two opportunities exist: (1) authentication within the deployed network (e.g.\, between the devices using encryption and handshakes) and (2) authentication from the user side controlling the access. In this talk the focus is placed on the second opportunity\, namely user authentication. Most techniques are smartcard based\, but the Web-based approach developed within SecureWSN is different: It is based on credentials and automatically handled requests without involvement of third-parties giving data owner full control of access. Thus\, first features of the GDPR strengthening ownership are included in SecureWSN. \nBio: Corinna Schmitt holds a Diploma in Bioinformatics (Dipl. Informatik (Bioinformatik)) from the Eberhard-Karls University of Tübingen (Germany) and a Doctor in Computer Science (Dr. rer. nat.) from the Technische Universität München (Germany). She established an efficient data transmission protocol – called TinyIPFIX – with additional features for aggregation\, compression\, and secure transmission\, complementing it with an user-friendly and flexible GUI (CoMaDa).\nFrom spring 2013 to May 2018 she was employed at the University of Zurich (Switzerland) as « Head of Mobile and Trusted Communications » at the Communication Systems Group (CSG) of Prof. Dr. B. Stiller. Her focus was on constrained networks\, security and privacy issues\, as well as on Internet of Things related issues. After several years of visiting status at the goup of Prof. Dr. Gabi Dreo-Rodosek at the Universität der Bundeswehr München (Germany) she joint the affiliated Research Institute CODE as researcher and laboratory supervisor. Her research focuses is the same as at the CSG-Group with expands to the application area of military communication and Smart City.\nHer work is documented in more than 30 publications\, including 8 book chapters\, the RFC 8272 on « TinyIPFIX for Smart Meters in Constrained Networks »\, and the ITU-T recommendation Y.3013 on « Socio-economic Assessment of Future Networks by Tussle Analysis ». She contributes / contributed to several EU projects (e.g.\, CONCORDIA\, AutHoNe\, SmartenIT\, FLAMINGO\, symbIoTe) and different standardization organizations (IETF\, ITU\, ASUT) until now and continues with these activities and recruits research funds continuously. She is active in ACM and IEEE as TCP member\, as well as reviewer for several journals and organizer of conferences.
URL:https://www.loria.fr/event/ssl-seminar-corinna-schmitt/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181115T140000
DTEND;TZID=Europe/Paris:20181116T000000
DTSTAMP:20260608T022826
CREATED:20181017T130129Z
LAST-MODIFIED:20181017T130129Z
UID:6115-1542290400-1542326400@www.loria.fr
SUMMARY:Colloque Cathy Dufour 2018 : Intelligences Artificielles
DESCRIPTION:Le colloque Cathy Dufour – Intelligences Artificielles aura lieu dans l’amphi 5 de la Faculté des Sciences et Technologies de Vandoeuvre-les-Nancy le 15 et 16 novembre. \nAu programme : \nJeudi 15 novembre \n14h – 14h 35 : Nazim Fates (Inria Nancy)\nIntelligence artificielle : vers l’« ordination universelle » ? \n14h 40 – 15h 15 : Maxime Amblard (Université de Lorraine)\nCalculer sur la langue mais qu’y comprendre ? \n15h 15 – 15h 45 : Discussion \n16h 15 – 16h 55 : Manuel Rebuschi & Marion Renauld (Université de Lorraine)\nInteragir avec une machine ou faire-semblant ? \n16h 55 – 17h 30 : Irène Marcovici (Université de Lorraine)\nAutomates cellulaires et phénomènes d’auto-organisation : le rôle de l’aléa \n17h 35 – 18h 10 : Alain Dutech (Inria Nancy)\n« Deep Reinforcement Learning » : des fois ça marche\, souvent ça marche pas ! \n18h 10 – … : Discussion \nVendredi 16 novembre \n9h 15– 9h 50 : Marianne Clausel (Université de Lorraine)\nModélisation probabiliste et analyse de données textuelles : les approches de type topic modeling \n9h 55 – 10h 30 : Thomas Boraud (Université de Bordeaux) \n11h – 11h 35 : Frédéric Alexandre (Inria Bordeaux)\nL’Intelligence Artificielle apprend-elle de ses erreurs ? \n11h 35 – … : Discussion
URL:https://www.loria.fr/event/colloque-cathy-dufour-2018-intelligences-artificielles/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20181120
DTEND;VALUE=DATE:20181121
DTSTAMP:20260608T022826
CREATED:20181119T115026Z
LAST-MODIFIED:20181119T115026Z
UID:6223-1542672000-1542758399@www.loria.fr
SUMMARY:Department 2 PhD Day
DESCRIPTION:Department 2 PhD Day will take place on Tuesday\, November 20th. \nProgram: \n  \n9h15-9h30 Accueil (croissants) \n9h30-10h30 Première session \n\nJoseph Lallemand – Voting: You Can’t Have Privacy without Individual Verifiability\nHans-Jorg Schurr – Towards really neat proofs for SMT\n\n10h30-11h00 Pause café \n11h00-12h30 Deuxième session \n\nNicolas Schnepf – Orchestration and verification of security functions for smart environments\nSylvain Cecchetto – BOA : a CFG builder (by Basic blOck Analysis) based on system state prediction\nPierre Lermusiaux – Analysing algebraic type transformations with Pass Rewriting\n\n12h30-14h00 Repas (Pizzas) \n14h-15h30 Troisième session \n\nCharlie Jacomme – Symbolic methods applied to the automation of computational proofs\nRenaud Vilmart – A Simplified ZX-Calculus for Universal Quantum Computing\nDaniel El Ouraoui – Machine learning for instance selection in SMT solving\n\n15h30-16h Café et croissants \n16h-17h Dernière session \n\nMargaux Duroeulx – Satisfiability techniques for assessing systems reliability\nItsaka Rakotonirina – Symmetries of equivalence in security protocols\n\n\n \nSylvain Cecchetto – BOA : a CFG builder (by Basic blOck Analysis) based on system state prediction\nThis research is targeting people who want to study a binary for which the do not have the source code. These people include malware analysts who want to be able to understand the behavior and/or the dangerousness of an unknown program. We can also think about reversers who might want to be able to extract and recover the code of a specific part of a binary\, or\, also to analyse a program used in a constrained environment like an airplane\, in order to evaluate the risks that it crash or reach an unwanted state. Overall\, this research can be useful in domains like malware detection\, reverse engineering and system protections. In order to analyse the behavior of a program for which we do not have the source code (typically in a malware analysis case)\, it is almost mandatory for the analyst to disassemble its binary code\, that is to list all program instructions. However\, as Schwarz\, Debray ans Andrews explained\, the disassembly step is undecidable due to dynamic jumps instructions. Unfortunately\, the problem remains\, and partial solutions are based on heuristics. Two properties are desired during this step\, (i) the completeness that aims to recover all instructions that the binary contains without missing and (ii) the correction that aims to only disassemble instructions that can be executed. Furthermore\, we have to deal with obfuscated binaries. Obfuscation techniques are designed to protect code/program against human and automated analysis. The obfuscation can be legitimate to protect intellectual property or doubtful in the case of a malware because the author want to slow down the analyst. In 2003\, Linn and Debray expose some obfuscated techniques in order to make loose any standard disassembly tool. On another side\, Kruegel\, Robertson\, Valeur and Vigna in 2004 propose to add some improvement on existing disassembly algorithms in order to be able to disassemble obfuscated binaries like the ones build with the Linn and Debray techniques. Finally we are facing the game of cat and mouse between\, in the first side\, always better obfuscated techniques and in other side\, disassembly tools that have to be more and more robust. Usually\, the disassembly step is followed by the control flow graph reconstruction. This step aims to construct an oriented graph from the basic blocks (previously obtained during disassembly) in which the links describe the different paths that the binary can take during an execution. This construction is undecidable in general since it involves variable values during execution. Furthermore\, as we said\, obfuscation techniques like self-code-modification\, call stack tampering or opaque predicate can make difficult both\, disassembly and control flow graph constructions steps. \nIn order to improve the disassembly and control flow graph constructions steps some works have be done based on symbolic execution techniques like it is shown by Yadegari and Debray in 2015. As Schwartz\, Avgerinos and Brumley said in 2010\, this method allows to reason about the behavior of a program on many different inputs at one time by building a logical formula that represents a program execution. In this paper we propose a new approach called BOA (for Basic blOck Analysis) to solve (at least partially) the disassembly and control flow graph construction problems. This method is based on symbolic execution at a basic block level. This technique aims to compute a partial system state as pre and post conditions of BB. Then\, from this partial system state we can compute dynamic jump/call instructions target addresses\, detect call stack tampering\, opaque predicate or self-code-modifications. \n\n \nMargaux Duroeulx – Satisfiability techniques for assessing systems reliability\nFault trees (FTs) or reliability block diagrams are commonly used representations for the reliability assessment of systems. In our work\, we aim at using satisfiability (SAT) techniques as a building block in this analysis\, based on the computation of minimal cut sets or tie sets from the system’s structure function. We previously introduced the use of SAT techniques for computing tie sets of systems with a structure function that depends only on the working status of components. We now extend the approach to systems where the order of failures matters\, and that can be represented by a dynamic fault tree (DFT). \nBeyond the gates available in an ordinary FT (such as conjunction\, disjunction or k out of n)\, a DFT may contain three types of dynamic gates indicating priority conjunction\, functional dependency\, and spare components. The corresponding structure function depends not only on the working status of components but also on the temporal order between component failures\, represented by additional propositional variables in the SAT encoding. The appropriate generalization of a tie set is then a Tie Set with Sequence (TSS). Whereas an ordinary tie set only reflects the set of components that are functioning correctly\, a TSS also records the order in which component failures occurred. Standard tie and cut sets can be organized in a Hasse diagram that reflects the complete partial order between these configurations due to component failures\, and the Hasse diagram provides a convenient basis for computing the reliability function. We show that this representation extends to tie and cut set sequences. \nOur approach generates the structure function from a DFT\, uses a SAT solver for efficiently computing the minimal TSSs\, and obtains the reliability polynomial based on the positions of the TSSs in the Hasse diagram. According to the type of analysis the user is interested in\, our method can therefore provide qualitative results in the form of tie set sequences or quantitative results by computing the probability of system failure after a given period of time. \n\n \nDaniel El Ouraoui – Machine learning for instance selection in SMT solving\nSatisfiability modulo theories (SMT) solvers have increased their capabilities to solve many different problems with the development of ever more effective decision procedures. Hence state of the art SMT solvers have now established themselves as one of the best solutions to tackle ground quantifier-free first order problems. Nevertheless\, automated theorem provers (ATP) based on superposition techniques remain incredibly better to handle quantified formulas. One reason is that they are fully understanding the semantics of quantifiers\, whereas SMT solvers try to heuristically find a set of instances which could lead to solve the grounded problem. Often\, these techniques produce a very large number of instances\, many of them being useless. Generally\, only 10% of the instances are useful. This often explains why SMT solvers fail to prove simple first order problems. We suggest to apply state of the art machine learning techniques as classifiers for instances on top of the process. We show that such techniques can indeed lead to significantly smaller numbers of generated instances\, and even more\, can be used to solve new problems that could not be solved before. \n\n \nCharlie Jacomme – Symbolic methods applied to the automation of computational proofs\nAfter having introduced two classical models used in the formal verification of security protocols – the Symbolic model and the Computational model – we will show how the former may be used to improve proofs automation in the latter. \n\n \nJoseph Lallemand – Voting: You Can’t Have Privacy without Individual Verifiability\nElectronic voting typically aims at two main security goals: vote privacy and verifiability. These two goals are often seen as antagonistic and some national agencies even impose a hierarchy between them: first privacy\, and then verifiability as an additional feature. Verifiability typically includes individual verifiability (a voter can check that her ballot is counted); universal verifiability (anyone can check that the result corresponds to the published ballots); and eligibility verifiability (only legitimate voters may vote). We show that actually\, privacy implies individual verifiability. In other words\, systems without individual verifiability cannot achieve privacy (under the same trust assumptions). To demonstrate the generality of our result\, we show this implication in two different settings\, namely cryptographic and symbolic models\, for standard notions of privacy and individual verifiability. Our findings also highlight limitations in existing privacy definitions in cryptographic settings. \n\n \nPierre Lermusiaux – Analysing algebraic type transformations with Pass Rewriting\nProgram transformation is a common practice in computer science\, and its many applications can have a range of different objectives. For example\, a program written in an original high level language could be either translated into machine code for execution purposes\, or towards a language suitable for formal verification. In all cases\, the transformation is often realized in several phases\, called passes\, each performing a smaller transformation\, thus going through a number of intermediate languages. \nWhile languages often have a lot of different constructions\, only a few are generally concerned for each one of these passes. Some languages\, such as Tom and Stratego\, use rewriting strategies to effectively implement traversal operation so as to not have to deal with unchanged constructions. Another interesting solution\, with a similar pattern matching approach\, is proposed by the Nanopass framework: using autogeneration techniques on these same trivial cases. In order to ensure the correctness of the overall transformation\, w.r.t. the target language\, each pass should be able to guarantee that the intermediate program is well-formed in the context of its corresponding language. However\, neither mentioned solution manages to satisfyingly provide such guarantees. \nTherefore\, we propose a new formalism for transformation techniques\, based on pattern matching and rewriting\, with an expressive power comparable to above solutions. Moreover\, it will enable statically performing type analysis on the transformation\, in order to improve on their limitation. The interest of this formalism will be largely based on this type analysis\, which would allow the definition of transformations in a general context while still providing syntactical guarantees. \n\n \nItsaka Rakotonirina – Symmetries of equivalence in security protocols\nSecurity protocols are distributed programs specifying how some agents can exchange some messages remotely\, through an untrusted network. These protocols are expected to offer some privacy guarantees against dishonnest parties controlling the communication network\, but their analysis has proved tedious and error-prone when performed by hand. Efficient automated tools exist to support flaw detection\, e.g. the recent DEEPSEC prover\, but still have some shortcomings in terms of scalability (the underlying theoretical problem exhibiting a high complexity). In this work we present techniques exploiting the properties that typical systems have\, e.g. internal symmetries\, to reduce the practical cost of performing security analyses and therefore improve on the scope automated analysers. An implementation of these techniques is in progress. \n\n \nNicolas Schnepf – Orchestration and verification of security functions for smart environments\nSecurity threats against smart environments are exponentially growing for several years due to lack of market preventive methods. A solution proposed by researchers consists in chaining security functions for dynamically protecting those devices: in particular\, those chains would benefit of the programmability provided by software defined networks (SDN) for automating their deployment and their adjustment. Nevertheless\, the multiplication and the complexity of such chains of security functions increase the risk of introducing misconfigurations in network policies: because of this complexity\, the validation of such chains require the use of formal methods for guarantying their correctness before their deployment. \nThe goal of this PhD is to design a framework for the orchestration and the verification of chains of security functions. In our previous work we already designed an approach for the validation of security policy called synaptic: this framework relies on formal methods for validating the correctness of SDN policies. Complementary to this work we proposed an approach for automatically profiling android applications in order to identify their security requirements. The remaining part of our work will consist in designing an approach for automatically generating or selecting chains of security functions corresponding to the applications running on a device. \n\n \nHans-Jorg Schurr – Towards really neat proofs for SMT\nveriT is a state of the art Satisfiability Modulo Theories (SMT) solver. Given an unsatisfiable input problem\, veriT can output a certificate – a proof – of its unsatisifiability. These proofs serve at least two purposes. On the one hand\, they can be checked by an external proof checker\, relieving the SMT solver from the responsibility of being trustworthy\, on the other hand they can be used by client systems for further processing. In the past the proofs generated by veriT have been partially reconstructed in the interactive theorem prover Isabelle/HOL. We discuss ongoing work on improving SMT proof production. While work is constrained by the architecture of the SMT solver\, the requirements on the format are given by typical use cases. Overall\, our goal is to ensure veriT produces proofs which are easy to check\, while maintaining performance. \n\n \nRenaud Vilmart – A Simplified ZX-Calculus for Universal Quantum Computing\nThe ZX-Calculus is a powerful graphical language for reasoning about quantum processes and quantum computing. It has various applications\, ranging from foundations of quantum mechanics and models of quantum computation\, to compilation of quantum circuits\, quantum error correction\, … Complete axiomatisations have recently been provided for the first approximately universal fragment of the language\, and right after that for the whole language. These axiomatisations\, even though complete\, suffered one major drawback: some of their axioms involve a lot of nodes\, and consequently they are hard to use\, and their interpretations are far-fetched\, if not non-existent. We provide a simplified axiomatisation for the general ZX-Calculus\, giving the calculus one of its main initial features back: intuitiveness.
URL:https://www.loria.fr/event/department-2-phd-day-2/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181120T134500
DTEND;TZID=Europe/Paris:20181120T150000
DTSTAMP:20260608T022826
CREATED:20181114T160716Z
LAST-MODIFIED:20181114T160716Z
UID:6208-1542721500-1542726000@www.loria.fr
SUMMARY:PhD Defense : Amaury L'Huillier
DESCRIPTION:Amaury L’huillier (Kiwi) will defend his thesis on Tuesday\, November 20th at 1.45pm in room C005. \nHis thesis is entitled « Modeling diversity over time to understand user context in recommender systems ». \n \nComposition du jury : \nRapporteurs:– Max Chevalier : Professeur\, Université Paul Sabatier– Catherine Berrut : Professeur\, Université Grenoble AlpesExaminateurs: \n– Miguel Couceiro : Professeur\, Université de Lorraine– Francis Rousseaux : Professeur\, Université de Reims Champagne-Ardenne\nDirecteurs de thèse :– Anne Boyer : Professeur\, Université de Lorraine– Sylvain Castagnos : Maître de conférences\, Université de Lorraine\n\n\nModéliser la diversité au cours du temps pour comprendre le contexte de l’utilisateur dans les systèmes de recommandation.\n\n\nRÉSUMÉ—————\n\nLes systèmes de recommandation se sont imposés comme étant des outils indispensables face à une quantité de données qui ne cesse chaque jour de croître depuis l’avènement d’Internet. Leur objectif est de proposer aux utilisateurs des items susceptibles de les intéresser sans que ces derniers n’aient besoin d’agir pour les obtenir. Après s’être majoritairement focalisés sur la précision de la prédiction d’intérêt\, ces systèmes ont évolué pour prendre en compte d’autres critères dans leur processus de recommandation\, tels que les facteurs humains inhérents à la prise de décision\, afin d’améliorer la qualité et l’utilité des recommandations. Cependant\, la prise en compte de certains facteurs humains tels que la diversité et le contexte demeure critiquable. Alors que le contexte des utilisateurs est inféré sur la base d’informations collectées à l’insu de leur vie privée\, la prise en compte de la diversité est quant à elle réduite à une dimension qu’un système se doit de maximiser. Or\, certains travaux récents démontrent que la diversité correspond à un besoin évoluant dynamiquement au cours du temps\, et dont la proportion à insuffler dans les recommandations est dépendante de la tâche effectuée (i.e du contexte). Partant du postulat inverse selon lequel l’analyse de l’évolution de la diversité au cours du temps permet de définir le contexte de l’utilisateur\, nous proposons dans ce manuscrit une nouvelle approche de modélisation contextuelle basée sur la diversité. En effet\, nous soutenons qu’une variation de diversité remarquable peut être la conséquence d’un changement de contexte et qu’il faut alors adapter la stratégie de recommandation en conséquence. Nous présentons la première approche de la littérature permettant de modéliser en temps réel l’évolution de la diversité\, ainsi qu’une nouvelle famille de contextes dits implicites n’exploitant aucune donnée sensible. La possibilité de remplacer les contextes traditionnels (explicites) par les contextes implicites est confirmée de plusieurs manières. Premièrement\, nous démontrons sur deux corpus issus d’applications réelles qu’il existe un fort recouvrement entre les changements de contextes explicites et les changements de contextes implicites. Deuxièmement\, une étude utilisateur impliquant de nombreux participants nous permet de démontrer l’existence de liens entre les contextes explicites et les caractéristiques des items consultés dans ces derniers. Fort de ces constats et du potentiel offert par nos modèles\, nous présentons également plusieurs approches de recommandation et de prise en compte des besoins des utilisateurs.\n\nMots-clés: Systèmes de recommandation\, diversité\, contexte\, vie privée\n\n\n\n\nAbstract\n————\n\nRecommender Systems (RS) have become essential tools to deal with an endless increasing amount of data available on the Internet. Their goal is to provide items that may interest users before they have to find them by themselves. After being exclusively focused on the precision of users’ interests prediction task\, RS had to evolve by taking into account other criteria like human factors involved in the decision-making process while computing recommendations\, so as to improve their quality and usefulness of recommendations. Nevertheless\, the way some human factors\, such as context and diversity needs\, are managed remains open to criticism. While context-aware recommendations relies on exploiting data that are collected without any consideration for users’ privacy\, diversity has been coming down to a dimension which has to be maximized. However recent studies demonstrate that diversity corresponds to a need which evolves dynamically over time. In addition\, the optimal amount of diversity to provide in the recommendations depends on the on-going task of users (i.e their contexts). Thereby\, we argue that analyzing the evolution of diversity over time would be a promising way to define a user’s context\, under the condition that context is now defined by item attributes. Indeed\, we support the idea that a sudden variation of diversity can reflect a change of user’s context which requires to adapt the recommendation strategy. We present in this manuscript the first approach to model the evolution of diversity over time and a new kind of context\, called “implicit contexts”\, that are respectful of privacy (in opposition to explicit contexts). We confirm the benefits of implicit contexts compared to explicit contexts from several points of view. As a first step\, using two large music streaming datasets we demonstrate that explicit and implicit context changes are highly correlated. As a second step\, a user study involving many participants allowed us to demonstrate the links between the explicit contexts and the characteristics of the items consulted in the meantime. Based on these observations and the advantages offered by our models\, we also present several approaches to provide privacy-preserving context-aware recommendations and to take into account user’s needs.\n\nKeywords: Recommender Systems\, diversity\, context\, privacy
URL:https://www.loria.fr/event/phd-defense-amaury-lhuillier/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181121T140000
DTEND;TZID=Europe/Paris:20181121T160000
DTSTAMP:20260608T022826
CREATED:20181003T065520Z
LAST-MODIFIED:20181003T065520Z
UID:6035-1542808800-1542816000@www.loria.fr
SUMMARY:TALC Seminar : Emmanuel Dupoux
DESCRIPTION:Next TALC Seminar will take place on Wednesday\, November 21\, at 2pm in room A008. \nEmmanuel Dupoux (EHESS\, Laboratoire de Sciences Cognitives et Psycholinguistique) will give a talk entitled « Towards developmental AI ». \nAbstract:\nEven though current machine learning techniques yield systems that achieve parity with humans on several high level tasks\, the learning algorithms themselves are orders of magnitude less data efficient than those used by humans\, as evidenced by the speed and resilience with which infants learn language and common sense. I review some of our recent attempts to reverse engineer such abilities in the area of unsupervised or weakly supervised learning of speech representations and speech terms\, and the learning the laws of intuitive physics by observation of videos. I argue that a triple effort in data collection\, algorithm development and fine grained human/machine comparisons is needed to uncover these developmental algorithms.
URL:https://www.loria.fr/event/talc-seminar-emmanuel-dupoux/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181127T133000
DTEND;TZID=Europe/Paris:20181127T150000
DTSTAMP:20260608T022826
CREATED:20181113T160453Z
LAST-MODIFIED:20181119T095640Z
UID:6199-1543325400-1543330800@www.loria.fr
SUMMARY:Colloquium Loria : Claire Mathieu
DESCRIPTION:Claire Mathieu is the next speaker of Loria’s colloquium. \nShe will give a presentation entitled « Stable Matching in Practice » on Tuesday\, November 27th at 1:30 pm in the Amphitheater. \nAbstract \nStable matching methods\, based on the algorithm designed by Gale and Shapley\, are used around the world in many applications such as college admissions. Several criteria measure the quality of the result: number of students assigned; rank of the college assigned to the applicant in their preference list; robustness; running time; etc. \nAfter reviewing properties of the algorithm in the pure\, ideal setting\, we present issues arising in practice. The input data is uncertain and evolves with time\, so a one-shot algorithm does not suffice. It is not feasible for admission committees to meet continuously\, so the process cannot be fully dynamic. To reconcile those competing constraints\, a hybrid implementation proceeding partly online on the student side was recently proposed for college admissions in France. The system also incorporates side constraints on joint assignment to schools and to dorms. \nAbout the Speaker\nClaire Mathieu does research on the design and analysis of algorithms\, with a focus on approximation algorithms\, particularly approximation schemes for NP-hard problems. A former student of Ecole normale supérieure\, she received a PhD in Computer Science in 1988 at Paris-Sud University. She has held research and faculty positions at CNRS\, Paris-Sud University\, Ecole Polytechnique\, Brown University\, and Collège de France. She is currently a CNRS research director in Paris\, France. \n  \nTo attend the colloquium\, people from outside the laboratory may send an email to marie.baron (at) loria.fr before Friday\, November 23rd.
URL:https://www.loria.fr/event/colloquium-loria-claire-mathieu/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181128T103000
DTEND;TZID=Europe/Paris:20181128T120000
DTSTAMP:20260608T022826
CREATED:20181114T160120Z
LAST-MODIFIED:20181127T083232Z
UID:6206-1543401000-1543406400@www.loria.fr
SUMMARY:PhD Defense : Yacine Abboud
DESCRIPTION:Yacine Abboud (Kiwi) will defend his thesis on Wednesday\, November 28th in room A008 at 10.30 am. \nHis thesis is entitled « Pattern mining: between accessibility and robustness« . \n \nDissertation committee:\n——————————— \nReviewers:\n– Sandra BRINGAY : Full Professor\, University of Montpellier 3\n– Omar BOUCELMA : Full Professor\, University of Aix-Marseille \nExaminers: \n– Vincent GUIGUE: Associate Professor\, UPMC – LIP6\n– François CHAROY : Full Professor\, University of Lorraine \n\nThesis supervisors:\n– Anne BOYER : Full Professor\, University of Lorraine\n– Armelle BRUN : Associate Professor\, University of Lorraine \nAbstract \n———— \nInformation now occupies a central place in our daily lives\, it is both ubiquitous and easy to access. Yet extracting information from data is often an inaccessible process. Indeed\, even though data mining methods are now accessible to all\, the results of these mining are often complex to obtain and exploit for the user. Pattern mining combined with the use of constraints is a very promising direction of the literature to both improve the efficiency of the mining and make its results more apprehensible to the user. However\, the combination of constraints desired by the user is often problematic because it does not always fit with the characteristics of the searched data such as noise. In this thesis\, we propose two new constraints and an algorithm to overcome this issue. The robustness constraint allows to mine noisy data while preserving the added value of the contiguity constraint. The extended closedness constraint improves the apprehensibility of the set of extracted patterns while being more noise-resistant than the conventional closedness constraint. The C3Ro algorithm is a generic sequential pattern mining algorithm that integrates many constraints\, including the two new constraints that we have introduced\, to provide the user the most efficient mining possible while reducing the size of the set of extracted patterns. C3Ro competes with the best pattern mining algorithms in the literature in terms of execution time while consuming significantly less memory. C3Ro has been experienced in extracting competencies from web-based job postings. \nKeywords: data mining\, pattern mining\, closed contiguous sequential pattern mining\, constraints\, noise-resistant
URL:https://www.loria.fr/event/phd-defense-yacine-abboud/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181129T133000
DTEND;TZID=Europe/Paris:20181129T150000
DTSTAMP:20260608T022826
CREATED:20181114T161613Z
LAST-MODIFIED:20181114T161613Z
UID:6211-1543498200-1543503600@www.loria.fr
SUMMARY:MFX Seminar : Jean-Baptiste Labrune
DESCRIPTION:Jean-Baptiste Labrune will give a seminar on Thursday\, November 29th at 1:30 pm in the Amphitheater. \nHis presentation is entitled « Radical Design: augmented environments for building dynamic objects with active matter ». \n \n\nAbstract :\n\nProgrammable matter\, also called active matter\, is a class of physical and biological materials that allow new kind of affordances and interactions (Tibbits\, Active Matter\, MIT Press\, 2017). Static entities become dynamic and can shapeshift\, turn elastic or solid on demand. Active matter is still a prototype in laboratories\, hence not easily available nor simple to use for non-experts.\nHowever\, like VLSI opened the field for advanced software engineering\, technologies such as 3D / 4D printing and bio/nano-assemblers will probably popularize them soon. In this new context\, how will we program but also design with these new materials? What will be the appropriate tools and interaction paradigms to build this world that Ivan Sutherland defined as « ultimate » ?\nOn the basis of my research as PhD at INRIA and postdoc at the MIT Medialab\, i will show some initial answers to these questions. I will detail in particular how the vision of Radical Atoms (Ishii\, Labrune & al 2012) proposes a new kind of paradigm called Radical Design\, connecting biology\, material science\, computational modelling of microstructures\, HCI and design.\n\n\n—\n\n\nJean-Baptiste Labrune is a designer & researcher\, specialized in the study of creative places and processes. His researches focus on the notion of « Exaptation »\, the way in which users of technology reconfigure and hack it\, producing original and unexpected functions and uses. He completed his Phd at INRIA and postdoc at MIT\, then became researcher at Bell Labs and interaction design professor at ENSAD (Arts Décos School). He organizes and lead many « hybrid » workshops in art & sciences places in France (Arts Décos\, Beaux-Arts\, Palais de Tokyo\, Mains d’Oeuvres) & internationally (Mediamatic\, Interaction Design Institute Ivréa\, IMAL\, Hangar\, Hyperwerk\, Akademie Schloss Solitude\, MIT Medialab).\n\n\nhttp://radicaldesign.eu
URL:https://www.loria.fr/event/mfx-seminar-jean-baptiste-labrune/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20181205
DTEND;VALUE=DATE:20181207
DTSTAMP:20260608T022826
CREATED:20181127T161357Z
LAST-MODIFIED:20181127T161358Z
UID:6267-1543968000-1544140799@www.loria.fr
SUMMARY:QCM-BioChem days
DESCRIPTION:On the 5 and 6 of December\, the LORIA will host the meetings of the Mastodons Project: \nQCM-BioChem: Quality in Consensualizing and Mining biological and chemical datasets \nThe QCM-BioChem consortium is the result of the fusion of 3 Mastodons projects (QualiBioConsensus\, HyQual and DECADE) and that aims to address and tackle challenges arising from the large and wide variety of biological and chemical data as well as the different methodologies in knowledge discovery. The novelty of the approaches developed in QCM-BioChem relies on the consideration and explanation of quality criteria in terms of data\, and methods for data mining and data analysis. For further details:https://www.lri.fr/~cohen/QCM-BioChem.html \nThis meeting days will comprise 2 keynote presentations\,\n-Antti Kuusisto on December 5 at 14h00\, Room B013\n-Jérôme Lang on December 6 at 14h00\, Room C005\nfollowed by several contributed presentations. \nProgram of December 5 (room B013): \n14h00-15h00: Antti Kuusisto (Tampere University of Technology)\nTitle: Computational Logics – A Theoretical Perspective \n15h15-15h45: Arnaud Soulet (LI\, Université de Tours)\nTitle: Representativeness of knowledge bases with the generalized Benford’s Law \n15h45-16h15: Coffee break \n16h15-16h45: Tatiana Makahlova (LORIA\, Université de Lorraine)\nTitle: The Application of MDL in the Mining of Numerical Data \n17h00-17h45: Sylvie Hamel (Université de Montréal)\nTitle: Space reduction techniques for the median of permutations problem \nProgram of December 6 (room C005): \n10h00-10h45: Henry Soldano (LIPN\, Université Paris-Nord)\nTitle: Bi-pattern mining of attributed two-mode and directed networks \n10h45-11h00: Coffee break \n11h00-11h30: Lamine Diop (LI\, Université de Tours)\nTitle: Sequential Pattern Sampling with Norm Constraints \n11h45-12h15: Nyoman Juniarta (LORIA\, Université de Lorraine)\nTitle: Application of Biclustering to the discovery of constant and gradual Patterns \n12h30-14h00: Lunch break \n14h00-15h00: Jérôme Lang (LAMSADE\, Université Paris-Dauphine)\nTitle: From social choice to preference learning \n15h00-15h30: Coffee break \n15h30-16h00: Guilherme Alves (LORIA\, Université de Lorraine)\nTitle: A framework for online clustering based on evolving semi-supervision \n16h15-16h45: Kevin Dalleau (LORIA\, Université de Lorraine)\nTitle: Tackling (some) preprocessing issues using unsupervised extremely randomized trees \n======================================= \nThe complete program together with the abstracts\, of all presentations of this event can be found at:\nhttps://malotec.loria.fr/journees-mastodons-qcm-biochem
URL:https://www.loria.fr/event/qcm-biochem-days/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181205T140000
DTEND;TZID=Europe/Paris:20181205T153000
DTSTAMP:20260608T022826
CREATED:20181130T150405Z
LAST-MODIFIED:20181130T150405Z
UID:6286-1544018400-1544023800@www.loria.fr
SUMMARY:TALC Seminar : Chloé Braud (Synalp)
DESCRIPTION:Next TALC Seminar will take place on Wednesday\, December 5th at 2pm in room A008. \nChloé Braud (Synalp) will give a presentation entitled « Transfer learning for discourse parsing ». \n \nAbstract:\nDiscourse structures describe the organization of documents in terms of discourse or rhetorical relations (such as « Explanation » or « Contrast ») linking clauses and sentences. Discourse analysis could be useful for various downstream applications\, such as automatic summarization\, question-answering or sentiment analysis. However\, the range of applications and the performance are still limited by the low scores of the existing discourse parsers and their focus on English. \nDiscourse parsing is known to be a hard task: It involves several complex and interacting factors\, touching upon all layers of linguistic analysis\, from syntax\, semantics up to pragmatics. Consequently\, also annotation is complex and time consuming\, and hence available annotated corpora are sparse and limited in size. \nIn this presentation\, I will present attempts to tackle these issues using transfer learning strategies. First\, I will describe experiments on identifying implicit discourse relations (i.e. lacking a discourse connective such as « but » or « because ») by transferring knowledge from the explicit examples to the implicit ones\, either by augmenting the size of the training set\, or by building a task-tailored representation of the words.I will then present two full discourse parsers. The first one involves a combination of several corpora annotated for different languages\, leading to improvements on English and to the first systems for Basque and Dutch developed without any training data. The second parser relies on multi-task learning to transfer information among several discourse related tasks.
URL:https://www.loria.fr/event/talc-seminar-chloe-braud-synalp/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181206T100000
DTEND;TZID=Europe/Paris:20181206T120000
DTSTAMP:20260608T022826
CREATED:20181204T143414Z
LAST-MODIFIED:20181204T143414Z
UID:6292-1544090400-1544097600@www.loria.fr
SUMMARY:PhD Defense : Pierre Kimmel
DESCRIPTION:Pierre Kimmel (Types team) will defend his thesis on Thursday\, December 6th at 10am in room B013. \nHis presentation is entitled « Modal extensions of resource logics : expressiveness and calculi ». \n \nThe jury members are  : \n\nNicolas Olivetti\, Professeur Université Aix-Marseille\, LSIS\, Marseille\nSerenella Cerrito\, Professeur Université Evry Val d’Essonne\, IBISC\, Evry\nDavid Pym\, Professeur University College London\, Londres\nHans van Ditmarsch\, Directeur de recherche CNRS\, LORIA\, Nancy\nDidier Galmiche\, Professeur Université de Lorraine\, LORIA\, Nancy\nDominique Larchey-Wendling\, Chargé de recherche CNRS\, LORIA\, Nancy\n\nAbstract : \nThe design of new logical formalisms is at the heart of several problems in formal methods. Those formalisms must respond to requirements both concerning modelling (they must be able to describe certain systems) and computing (they must provide complete and sound calculus methods). In this context\, we look at resource logics\, and in particular BI and BBI logics\, that deal with the separation and sharing of resources and have led to several separation logics whose applications to software verification have been widely developped recently.\n\nWe propose in this thesis\, starting from BI and BBI logics\, to study some modal and epistemic separation logics by focusing on their modelling capacities and their expresiveness\, as well as on the new proof calculi for those logics.\nA first study deals with the modelling of dynamic resource properties through new logic LTBI\, which is a temporal separation logic\, based on BI logic and temporal modalities. This logic notably offers interesting perspectives intemporal branching modelling\, allowing for instance to characterize multi-thread processes.\nA complementary study concerns the modelling of access by agents to properties under the conditions of\nposessing some resources\, through a new logic ERL\, which is an epistemic separation logic\, based on BBI logic and epistemic modalities. This logic allows many modellings of access control systems.\nIn order to extend the expressivity of such separation logics\, like BBI logic and its variants\, a study on the\ninternalization of resources symbols in the logic’s syntax has been developed through the new logics HRL and\nHBBI (hybrid version of BBI). Internalization allows both the extension of the expressivity of logics and the\naxiomatisation of BBI logic and some of its variants.\nIn addition to the conception of those logics\, the study of their semantics and their modelling capacities\, a part\nof this thesis is dedicated to the definition of proof calculi\, here tableaux calculi\, for those new logics\, as well as\ntheir proofs of soundness and completeness.
URL:https://www.loria.fr/event/phd-defense-pierre-kimmel/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181207T100000
DTEND;TZID=Europe/Paris:20181207T113000
DTSTAMP:20260608T022826
CREATED:20181130T145532Z
LAST-MODIFIED:20181130T145539Z
UID:6283-1544176800-1544182200@www.loria.fr
SUMMARY:D4 Seminar : Philippe Muller (IRIT\, Toulouse)
DESCRIPTION:Next D4 Seminar will take place on Friday\, December 7th at 10am in room A008. \nPhilippe Muller (IRIT\, Toulouse) will give a presentation entitled « Sentential distributional semantics: Learning semantic sentence representations and their compositions ». \n \nAbstract: \n(Joint work with Damien Sileo et Tim van de Cruys) \nDistributional semantics aims at automatic representation of textual semantic content based on the observation of a large representative corpus. There is a large body of work on lexical distributional semantics\, based on the assumption that words appearing in similar contexts should have similar semantic representations. This popularized the representation of words as vectors in a semantic space.More recently\, a lot of effort in the NLP field has been devoted to building similar representations for sentences\, or even larger textual elements. \nThis raises several questions: how to build sentence representations from word representations in vector spaces\, preferably in a compositional manner\, and how to guide the representations so that they capture important semantic aspect at the sentence level?Arguably\, sequential compositional models such as recurrent neural network offer a simple composition at the lexical level that can be used in supervised settings to make accurate predictions in textual classification\, while building a representation of the sentential context in their internal state. This is however specific to each task\, and researchers have tried to find ways of building so-called « universal » sentence representations\, or more exactly transferable representations. In this perspective several settings have been proposed that evokes supervised distributional approaches at the word level\, with auxilliary tasks that could induce semantically relevant representations at the sentence level: for instance trying to predict if two sentences follow each other in a text\, or if one is a consequence of the other. These in turn must compose the two sentences in a way that allows for the learning of their relationships. Composition of representations is also important in all tasks that involve predicting a relation between a pair of textual elements: sentence similarity\, entailment\, discourse relations.\nThe compositions considered in NLP are often quite superficial\, and we will show more expressive compositions by taking inspiration from Statistical Relational Learning. Moreover we propose an unsupervised training task to induce sentence representations\, based on the prediction of discourse connections between sentences in a large corpus.
URL:https://www.loria.fr/event/d4-seminar-philippe-muller/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181211T200000
DTEND;TZID=Europe/Paris:20181211T220000
DTSTAMP:20260608T022826
CREATED:20181121T132547Z
LAST-MODIFIED:20181121T132606Z
UID:6233-1544558400-1544565600@www.loria.fr
SUMMARY:Conférence-débat : Olivier Rey
DESCRIPTION:Olivier Rey\, chercheur au CNRS\, sera l’invité de la prochaine conférence-débat du Loria. \nRendez-vous le mardi 11 décembre à 20 heures à la Salle d’Honneur des Universités pour son exposé intitulé « Penser avec le transhumanisme ». \nRésumé : \n« Je marche à l’aide des pieds\, je philosophe à l’aide des sots »\, disait Georges Bataille. C’est en cela que les transhumanistes peuvent nous être utiles : même si ce qu’ils annoncent n’a pas grand sens\, leur discours constitue un instrument de choix pour dégager les forces qui façonnent notre époque\, sonder les fantasmes qui la travaillent. \nLe transhumanisme est récent\, mais il est aussi\, à sa manière\, le produit d’un mouvement amorcé voici plusieurs siècles\, dont il aide à comprendre les tenants et les aboutissants. Là où croît le transhumanisme\, peut croître aussi l’intelligence de notre situation historique\, et le sens des véritables réformes qu’il nous faudrait opérer dans nos modes de pensée et nos façons d’agir. \nMathématicien et philosophe\, Olivier Rey est membre de l’Institut d’histoire et de philosophie des sciences et techniques (IHPST) de Paris. Il a enseigné les mathématiques à l’Ecole Polytechnique et enseigne aujourd’hui la philosophie à l’Université Paris 1 Panthéon-Sorbonne. \nIl est l’auteur de nombreux essais tels que « Une question de taille »\, pour lequel il a reçu le Prix Bristol des Lumières 2014\, et « Leurre et malheur du transhumanisme »\, publié en octobre 2018 aux éditions Desclée de Brouwer\, qu’il présentera lors de cette conférence. \nNazim Fatès\, chargé de recherche Inria au Loria introduira et animera cette conférence. \nEntrée libre et gratuite dans la limite des places assises disponibles. \nInfos pratiques :\nMardi 11 décembre\n20 heures\nSalle d’honneur des universités\n11\, place Carnot\n54000 Nancy
URL:https://www.loria.fr/event/conference-debat-olivier-rey/
CATEGORIES:Manifestation
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20181212
DTEND;VALUE=DATE:20181213
DTSTAMP:20260608T022826
CREATED:20181129T094132Z
LAST-MODIFIED:20181129T094144Z
UID:6272-1544572800-1544659199@www.loria.fr
SUMMARY:Journée Fédération Charles Hermite : Modélisation mathématique et solutions pour la mobilité dans les réseaux sans fil
DESCRIPTION:La Fédération Charles Hermite (FCH) organise le mercredi 12 décembre 2018\, dans les locaux de l’IECL de Nancy\, une Journée Scientifique sur la thématique : « Modélisation mathématique et solutions pour la mobilité dans les réseaux sans fil ». \n \nProgramme : \n9h45 – 10h15 : Café d’Accueil \n10h15 – 11h15 : Nicola Roberto Zema (LRI- Université Paris-Sud)\nAn overview of multi-domain problems and solutions for controlled mobility in wireless networks \n11h20 – 12h20 : Marceau Coupechoux (LTCI – Telecom Paris Tech)\nOptimal Trajectories of UAV Base Stations \n12h20-13h45 : Pause déjeuner \n13h45-14h45 : Arnaud Casteigts (LABRI – Université de Bordeaux)\nFinding and Exploiting Structure in Highly-Dynamic Networks \n14h50-15h50 : Anastasios Giovanidis (Lip6 – UPMC / CNRS)\nSuccessful file transmission in mobile D2D networks with caches \n15h50-16h15 : Pause café \n16h15-17h15 : Jean-Philippe Georges\, Francis Lepage\, Vincent Lecuire (CRAN – Université de Lorraine)\nCommunications par réseaux de capteurs pour des systèmes en mobilité sur trajectoires connues \nProgramme complet
URL:https://www.loria.fr/event/journee-federation-charles-hermite-2/
LOCATION:IECL\, Institut Élie Cartan de Lorraine
CATEGORIES:Manifestation
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181212T100000
DTEND;TZID=Europe/Paris:20181212T120000
DTSTAMP:20260608T022826
CREATED:20181128T133309Z
LAST-MODIFIED:20181128T133309Z
UID:6270-1544608800-1544616000@www.loria.fr
SUMMARY:HDR : Bernadetta Addis
DESCRIPTION:Bernadetta Addis will defend her « Habilitation à diriger des recherches » on Wednesday\, December 12th at 10 am in room A008\, with a presentation entitled « A journey through optimization:from global to discrete optimization and back ». \n \nJury/Commitee : \nPr. Jean-Charles BILLAUT (Université de Tours)\nPr. Bernard FORTZ (Université Libre de Bruxelles) – reviewer\nPr. Martine LABBÉ (Université Libre de Bruxelles)\nPr. Ammar OULAMARA (Université de Lorraine)\nPr. Laura PALAGI (Sapienza Università di Roma) – reviewer\nPr. Alain QUILLIOT (Université Clermont Auvergne) – reviewer \nSummary:\nMy contributions (and also my research project) are divided along two axes: one dedicated to global optimization and the other to discrete optimization problems resulting from ICT  (Information and Communication Technology) applications.\nThe common elements between these two axes are represented by: the design of mathematical programming models to solve applied problems (green-networking\, placement and routing of virtualized network functions\, optimal design of spatial trajectories\, gas separation processes by membranes\, etc.)\, the analysis of underlying mathematical structures and their use in the design of effective optimization algorithms (heuristic and exact) for large scale problems.
URL:https://www.loria.fr/event/hdr-bernadetta-addis/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20181214
DTEND;VALUE=DATE:20181215
DTSTAMP:20260608T022826
CREATED:20181119T114036Z
LAST-MODIFIED:20181206T080349Z
UID:6221-1544745600-1544831999@www.loria.fr
SUMMARY:Department 3 PhD day
DESCRIPTION:Departement 3 organizes its annual PhD Day on Friday\, December 14th in room C005\, to allow all the PhD students of the department to present their ongoing work and to share their experiences. \nSchedule \nProgram: \n\n\n\n9:00 – 9:05 Welcome (Ye-Qiong Song) \n9:05 – 10:30 session 1: Modeling\, simulation and experimental methods \nBéatrice Linot (20’ + 5’ Q&A)\nTrust in Computer-Supported crisis management information sharing \nThomas Paris (20’ + 5’ Q&A)\nComplex system modeling by composition \nAbdulqawi Saif (20’ + 5’ Q&A)\nContributions of experimental methods for I/O systems and testbed experiments \nJean-Baptiste Wiart (5’)\nDefinition of a domain specific language for the cosimulation of microgrid powered hydrogen \nThéo Docquier (5’)\nDesign\, modeling and co-simulation of real-time industrial IoT for smart grids \n10:30 – 10:50 coffee break \n10:50 – 12:00 session 2: Internet of Things\, SDN and security \nMingxiao Ma (20’ + 5’ Q&A)\nStudy of Synchronization Attacks on Distributed and Cooperative Control in Microgrid Systems \nGrégoire Denis (5’)\nMalicious attacks detection and resilience in cyber-physical systems through joint dynamic resource scheduling and synthesis of adaptive control laws \nAdrien Hemmer (5’)\nPredictive Security Monitoring for Large-Scale Internet-of-Things \nAbir LARABA (5’)\nData-Driven Intelligent Monitoring for Software-Defined Networks \nAhmad ABBOUD (5’)\nCompressed and Verifiable Filtering Rules in Software-defined Networking \n\n\n\n\n\n\nVirgile Dauge (20’ + 5’ Q&A)\nSystèmes Cyber-Physiques autonomes et communicants en milieux hostiles. Application à l’exploration par robots mobiles \n12:00 – 12:30 Invited session \nProf. Enrico Natalizio (25’ + 5’ Q&A)\n5G and UAVs: synergies to exploit for an Internet of Intelligent Things \n12:30 – 14:00 Buffet & Discussion \n14:00 – 15:15 session 3: Security \nHoang-Long Nguyen (20’ + 5’ Q&A)\nTransparency Approach using Blockchain to End to End Encryption (E2EE) \nNicolas Schnepf (20’ + 5’ Q&A)\nOrchestration and verification of security functions for smart environments \nVictorien Elvinger (20’ + 5’ Q&A)\nPrunable tamper-evident log in peer-to-peer systems \n15:15 – 15:30 coffee break \n15:30 – 17:10 session 4: Safety\, Performance and Optimization \nLouis Viard (20’ + 5’ Q&A)\nMonitor-Centric Mission Definition For Cyber-Physical Systems \nQuentin Laporte-Chabasse (20’ + 5’ Q&A)\nA topological characterisation of peer-to-peer inter-organisational collaboration \nBilal Messaoudi (20’ + 5’ Q&A)\nMultiple periods vehicle routing problems: a case study \nHoai-Le NGUYEN (20’ + 5’ Q&A)\nStudying group performance and behavior in collaborative editing
URL:https://www.loria.fr/event/department-3-phd-day-2/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20181214
DTEND;VALUE=DATE:20181215
DTSTAMP:20260608T022826
CREATED:20181129T105220Z
LAST-MODIFIED:20181130T153711Z
UID:6276-1544745600-1544831999@www.loria.fr
SUMMARY:Journée Fédération Charles Hermite : Systèmes de numération\, combinatoire et théorie des nombres
DESCRIPTION:Le vendredi 14 décembre 2018 aura lieu une Journée Charles Hermite sur le thème des systèmes de numération\, combinatoire et théorie des nombres. Cette journée scientifique est organisée conjointement par l’IECL et le LORIA avec le soutien de la Fédération Charles Hermite. Les exposés auront lieu à l’IECL. \n \nOrateurs : \nYann Bugeaud (Université de Strasbourg)\nMichael Drmota (Université technique de Vienne\, Autriche)\nMichaël Rao (ENS Lyon)\nJoël Rivat (Université d’Aix-Marseille) \nProgramme et inscriptions \n 
URL:https://www.loria.fr/event/journee-federation-charles-hermite-systemes-de-numeration-combinatoireet-theorie-des-nombres/
CATEGORIES:Manifestation
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181214T100000
DTEND;TZID=Europe/Paris:20181214T120000
DTSTAMP:20260608T022826
CREATED:20181211T101044Z
LAST-MODIFIED:20181211T101044Z
UID:6303-1544781600-1544788800@www.loria.fr
SUMMARY:PhD defense : Konstantinos Chatzilygeroudis
DESCRIPTION:Konstantinos Chatzilygeroudis will defend his thesis on Friday\, December 14th at 10am in room A008. \nHis presentation is entitled « Micro-Data Reinforcement Learning for Adaptive Robots ». \n \nThe jury members are: \n\nPierre-Yves OUDEYER\, Directeur de recherche\, Inria Bordeaux Sud-Ouest\, France\nYiannis DEMIRIS\, Professor\, Imperial College London\, UK\nVerena V. HAFNER\, Professor\, Humboldt-Universität zu Berlin\, Germany\nAlain DUTECH\, Chargé de recherche\, Inria\, CNRS\, Université de Lorraine\, France\nAude BILLARD\, Professor\, EPFL\, Switzerland\n\nSupervisor: \n\nJean-Baptiste MOURET\, Directeur de recherche\, Inria\, CNRS\, Université de Lorraine\, France\n\nAbstract: \nRobots have to face the real world\, in which trying something might take seconds\, hours\, or even days. Unfortunately\, the current state-of-the-art reinforcement learning algorithms (e.g.\, deep reinforcement learning) require big interaction times to find effective policies. In this thesis\, we explored approaches that tackle the challenge of learning by trial-and-error in a few minutes on physical robots. We call this challenge “micro-data reinforcement learning”. \nIn our first contribution\, we introduced a novel learning algorithm called “Reset-free Trial-and-Error” that allows complex robots to quickly recover from unknown circumstances (e.g.\, damages or different terrain) while completing their tasks and taking the environment into account; in particular\, a physical damaged hexapod robot recovered most of its locomotion abilities in an environment with obstacles\, and without any human intervention. \nIn our second contribution\, we introduced a novel model-based reinforcement learning algorithm\, called Black-DROPS that: (1) does not impose any constraint on the reward function or the policy (they are treated as black-boxes)\, (2) is as data-efficient as the state-of-the-art algorithm for data-efficient RL in robotics\, and (3) is as fast (or faster) than analytical approaches when several cores are available. We additionally proposed Multi-DEX\, a model-based policy search approach\, that takes inspiration from novelty-based ideas and effectively solved several sparse reward scenarios. \nIn our third contribution\, we introduced a new model learning procedure in Black-DROPS (we call it GP-MI) that leverages parameterized black-box priors to scale up to high-dimensional systems; for instance\, it found high-performing walking policies for a physical damaged hexapod robot (48D state and 18D action space) in less than 1 minute of interaction time. \nFinally\, in the last part of the thesis\, we explored a few ideas on how to incorporate safety constraints\, robustness and leverage multiple priors in Bayesian optimization in order to tackle the micro-data reinforcement learning challenge. \nThroughout this thesis\, our goal was to design algorithms that work on physical robots\, and not only in simulation. Consequently\, all the proposed approaches have been evaluated on at least one physical robot. Overall\, this thesis aimed at providing methods and algorithms that will allow physical robots to be more autonomous and be able to learn in a handful of trials.
URL:https://www.loria.fr/event/phd-defense-konstantinos-chatzilygeroudis/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181217T103000
DTEND;TZID=Europe/Paris:20181217T123000
DTSTAMP:20260608T022826
CREATED:20181213T111900Z
LAST-MODIFIED:20181213T111900Z
UID:6309-1545042600-1545049800@www.loria.fr
SUMMARY:PhD Defense : Daishi Kondo
DESCRIPTION:Daishi Kondo will defend his thesis on Monday\, December 17th at 10.30am in room C005. \nHis presentation is entitled « Preventing information leakage in NDN with name and flow filters ».  \nThe jury members are:\n\nReporter:\nMiki Yamamoto\, Professor at Kansai University\nToru Hasegawa\, Professor at Osaka University\n\nExaminer:\nGiovanna Carofiglio\, Distinguished Engineer / Senior Director at Cisco Systems\nHouda Labiod\, Professor at Telecom ParisTech\nIsabelle Chrisment\, Professor at University of Lorraine\nSylvain Contassot-Vivier\, Professor at University of Lorraine\n\nInvited:\nHideki Tode\, Professor at Osaka Prefecture University\nTohru Asami\, CEO at ATR\n\nSupervisor:\nOlivier Perrin\, Professor at University of Lorraine\nThomas Silverston\, Associate Professor at Shibaura Institute of Technology\n\nAbstract:\n\nIn recent years\, Named Data Networking (NDN) has emerged as one of the most promising future networking architectures. To be adopted at Internet scale\, NDN needs to resolve the inherent issues of the current Internet. Since information leakage from an enterprise is one of the big issues even in the Internet and it is very crucial to assess the risk before replacing the Internet with NDN completely\, this thesis investigates whether a new security threat causing the information leakage can happen in NDN. Assuming that (i) a computer is located in the enterprise network that is based on an NDN architecture\, (ii) the computer has been already compromised by suspicious media such as a malicious email\, and (iii) the company installs a firewall connected to the NDN-based future Internet\, this thesis focuses on a situation that the compromised computer (i.e.\, malware) attempts to send leaked data to the outside attacker.\n\nNDN is basically a « pull »-based architecture and there are only two kinds of packets: Interest and Data\, which are a request and a response packet\, respectively. In order to retrieve content\, a consumer first sends the Interest to NDN network and then obtains the corresponding Data from the producer or the intermediate NDN node. In other words\, they cannot send a Data unless they receive the Interest packet. Therefore\, as one of the naive methods to mitigate information leakage through a Data\, an enterprise network firewall can carefully inspect a Data to publish\, and produce it instead of the inside employee in the network (i.e.\, a whitelist). In this case\, all the publicly-accessible content is on the firewall.\n\nHowever\, the firewall cannot manage a naming policy on the outside content and NDN forwarding nodes do not verify whether the name really exists. That causes a risk of information leakage through an Interest by malware’s hiding information such as customer information in the Interest name and sending it toward the outside attacker. The malware can pretend to access outside content\, so that it is quite difficult for the firewall to detect the information leakage attack. This thesis argues that the information leakage attack through an Interest in NDN should be one of the essential security attacks at protocol level and it is important to develop the detection method of this attack.\n\nThe contributions of this thesis are fivefold. Firstly\, this thesis proposes an information leakage attack through a Data and through an Interest in NDN. This thesis investigates the one through an Interest deeply\, and\, as a more advanced attack for the attacker to hide the malicious activity\, this thesis proposes a steganography-embedded Interest name to perform information leakage efficiently. To the best of author’s knowledge\, this is the first research about the information leakage attack in NDN.\n\nSecondly\, in order to address the information leakage attack\, this thesis proposes an NDN firewall which monitors and processes the NDN traffic coming from the consumers with the whitelist and blacklist. To design the firewall\, this thesis focuses on two requirements: (i) designing an NDN firewall independent from NDN Forwarding Daemon (NFD)\, which deicides how to forward an Interest\, and (ii) performing a fast lookup of the names or name prefixes in the whitelist and blacklist. By utilizing a cuckoo filter\, which is a probabilistic filter\, the proposed NDN firewall provides Interest packet filtering based on the names or name prefixes in the lists that can be updated on the fly. While satisfying the requirements and providing the functions\, the firewall implementation achieves high performance. Specifically\, the throughput degradation with the firewall is only from 0.912% to 2.34%\, which will be acceptable in an enterprise network.\n\nThirdly\, this thesis proposes an NDN name filter to classify a name in the Interest as legitimate or anomalous. Since NDN has not been deployed at large scale\, a dataset about NDN traffic does not exist. Assuming that it is highly possible for the future NDN naming policy to become the one naturally evolved from the current Uniform Resource Locator (URL) naming policy\, this thesis utilizes content names based on URLs collected by a web crawler. By using search engine information and applying the name dataset to an isolation forest\, this thesis builds NDN name filters. This thesis evaluates the performances of the name filters and shows that the proposed name filters can choke drastically the information leakage throughput per Interest and malware has to send 137 times more Interest packets to leak information than without using the filters.\n\nThe name filter can\, indeed\, reduce the throughput per Interest\, but to ameliorate the speed of this attack\, malware can send numerous Interests within a short period of time. Moreover\, the malware can even exploit an Interest with an explicit payload in the name (like HTTP POST message in the Internet)\, which is out of scope in the proposed name filter and can increase the information leakage throughput by adopting a longer payload. That is the limitation of the name filter. To take traffic flow to the NDN firewall from the consumer into account\, fourthly\, this thesis proposes an NDN flow monitored at an NDN firewall. At first\, this thesis introduces the concept of NDN flow and specifies it strictly\, which has not yet been standardized in NDN research. Then\, this thesis proposes a method to generate an NDN flow dataset analogically derived from the HTTP flow dataset in the current Internet because there is no dataset about NDN traffic.\n\nFifthly\, in order to deal with the drawbacks of the NDN name filter\, this thesis proposes an NDN flow filter to classify a flow as legitimate or not. Based on the generated NDN flow dataset\, this thesis builds an NDN flow filter against the information leakage attack. By applying the obtained dataset to a Support Vector Machine (SVM)\, this thesis builds an NDN flow filter against the information leakage attack\, and the performance evaluation shows that the information leakage throughput choked by the flow filter is from 1.87·10−4 to 8.08·10−3 times that of only by the name filter\, and the throughput choked by the name and flow filter under banning Interests with an explicit payload in the name reaches at most 1.72 Kbps. Thus\, the flow filter complements the name filter and greatly chokes the information leakage throughput.
URL:https://www.loria.fr/event/phd-defense-daishi-kondo/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181217T133000
DTEND;TZID=Europe/Paris:20181217T153000
DTSTAMP:20260608T022826
CREATED:20181213T080435Z
LAST-MODIFIED:20181213T080435Z
UID:6307-1545053400-1545060600@www.loria.fr
SUMMARY:PhD Defense : Oriane Dermy
DESCRIPTION:Oriane Dermy (Larsen) will defend her thesis on Monday\, December 17th at 1:30pm in room A008. \nHer presentation will be in French and is entitled « Prédiction du mouvement pour la robotique collaborative : du simple geste au mouvement corps entier ». \n \nRapporteurs : \nRachid Alami\, Directeur de recherche CNRS\, LAAS\nDaney David\, Chargé de recherche INRIA\, Bordeaux \n\nExaminateurs : \nCatherine Pelachaud\, Directeur de recherche\, CNRS\, Isir UPCM \n\nDirecteurs de thèse : \nSerena Ivaldi\, Chargée de recherche INRIA\, LORIA\nFrançois Charpillet\, Directeur de recherche INRIA\, LORIA \nRésumé :\nCette thèse se situe à l’intersection de l’apprentissage automatique et de la robotique humanoïde\, dans la thématique de l’interaction homme-robot\, et dans le domaine de la cobotique (robotique collaborative). Elle se focalise sur les interactions non verbales humain-robot\, en particulier sur l’interaction gestuelle. La prédiction de l’intention\, la compréhension et la reproduction de gestes sont donc des questions centrales de cette thèse.\nDans un premier temps\, il s’agit de faire apprendre au robot des gestes par démonstration : un utilisateur prend le robot par le bras et lui fait réaliser les gestes à apprendre et ce\, plusieurs fois. Le robot doit ensuite être capable de reproduire ces différents mouvements tout en les généralisant pour s’adapter au contexte. Pour cela\, à l’aide de ses capteurs proprioceptifs\, il interprète les signaux perçus pour comprendre le mouvement que lui fait réaliser l’utilisateur\, afin d’en générer des similaires par la suite.Dans un second temps\, le robot apprend à reconnaître l’intention de l’humain avec lequel il interagit et cela\, à partir des gestes que ce dernier initie : il s’agit ensuite pour le robot de produire les gestes adaptés à la situation et correspondant aux attentes de l’utilisateur. Cela nécessite que le robot comprenne la gestuelle de l’utilisateur. Pour cela\, différentes modalités perceptives ont été explorées. À l’aide de capteurs proprioceptifs\, le robot ressent les gestes de l’utilisateur au travers de son propre corps : il s’agit alors d’interaction physique humain-robot.À l’aide de capteurs visuels\, le robot interprète le mouvement de la tête de l’utilisateur. Enfin\, à l’aide de capteurs externes\, le robot reconnaît et prédit le mouvement corps entier de l’utilisateur. Dans ce dernier cas\, l’utilisateur porte lui-même des capteurs (vêtement X-Sens) qui transmettent sa posture au robot. De plus\, le couplage de ces modalités a été étudié. D’un point de vue méthodologique\, nous venons de voir que les questions d’apprentissage et dereconnaissance de séries temporelles (les gestes) ont été centrales dans cette thèse. Pour cela\, deux approches ont été développées. La première est fondée sur la modélisation statistique de primitives de mouvements (correspondant aux gestes) : les ProMPs. La seconde\, ajoute à la première du Deep Learning\, par l’utilisation d’auto-encodeurs\, afin de modéliser des gestes corps entier contenant beaucoup d’informations\, tout en permettant une prédiction en temps réel mou. Lors de cette thèse\, différents enjeux ont notamment été pris en compte pour la création et le développement de nos méthodes. Ces enjeux concernent : la prédiction des durées des trajectoires\, la réduction de la charge cognitive et motrice imposée à l’utilisateur\, le besoin de rapidité (temps réel mou) et de précision dans les prédictions.
URL:https://www.loria.fr/event/phd-defense-oriane-dermy/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20181218
DTEND;VALUE=DATE:20181219
DTSTAMP:20260608T022826
CREATED:20181130T153648Z
LAST-MODIFIED:20181130T153648Z
UID:6288-1545091200-1545177599@www.loria.fr
SUMMARY:Journée Fédération Charles Hermite : Automates cellulaires et dynamiques sur réseaux
DESCRIPTION:Dans le cadre de la Fédération Charles Hermite (IECL & LORIA)\, une rencontre sur le thème « Automates cellulaires et dynamiques sur réseaux » est organisée le mardi 18 décembre à l’IECL. \nProgramme : \n10h15-11h15 : Régine Marchand (IECL\, Université de Lorraine) \n11h30-12h : Martin Schüle (ZHAW\, Zurich)\nThe classification problem of elementary cellular automata and the quest for natural computation \n12h-12h30 : J. Ricardo G. Mendonça (EACH\, Univ. de São Paulo / LPTMS\, Univ. Paris-Sud)\nCellular automata under noise: empirical findings and applications \n14h-15h : Thomas Nowak (LRI\, Université Paris-Sud) \n15h30-16h : Nicolas Gauville (LORIA\, Université de Lorraine) \n16h-16h30 : Jérôme Casse (NYU Shanghai)\nUne généralisation du TASEP synchrone (sur le tore) – A generalisation of the parallel TASEP (on tore) \nProgramme complet et informations pratiques
URL:https://www.loria.fr/event/journee-federation-charles-hermite-automates-cellulaires-et-dynamiques-sur-reseaux/
LOCATION:IECL\, Institut Élie Cartan de Lorraine
CATEGORIES:Manifestation
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181218T133000
DTEND;TZID=Europe/Paris:20181218T160000
DTSTAMP:20260608T022826
CREATED:20181214T085711Z
LAST-MODIFIED:20181214T085807Z
UID:6315-1545139800-1545148800@www.loria.fr
SUMMARY:PhD Defense : Maxime Compastié
DESCRIPTION:Maxime Compastié\, PhD student in Resist team will defend his thesis entitled « Software-defined security for distributed clouds » on Tuesday\, December 18th at 1:30 PM in Room B013. \nPhD Commitee:\n– Nora CUPPENS\, Full Professor\, IMT Atlantique – Reporter\n– Thierry GAYRAUD\, Full Professor\, Toulouse University – Reporter\n– Véronique LEGRAND\, Associate Professor\, Conservatoire National des Arts et Métiers – Examiner\n– Pierre-Etienne MOREAU\, Full Professor\, Lorraine University – Examiner\n– Olivier FESTOR\, Full Professor\, Lorraine University – Examiner / PhD Supervisor\n– Rémi BADONNEL\, Associate\, Lorraine University – Examiner / PhD Advisor\n– Ruan HE\, Chief Cloud Architect\, Tencent – Invited / Industrial Advisor\n– Sok-Yen LOUI\, Research Engineer\, Orange Labs – Invited / Industrial Advisor \nAbstract:\nIn this thesis\, we propose an approach for software-defined security in distributed clouds. More specifically\, we show to what extent this programmability can contribute to the protection of distributed cloud services\, through the generation of securized unikernel images. These ones are instanciated in the form of lightweight virtual machines\, whose attack surface is limited and whose security is driven by a security orchestrator. The contributions of this thesis are threefold. First\, we present a logical architecture supporting the programmability of security mechanims in a multi-cloud and multi-tenant context. It permits to align and parameterize these mechanisms for cloud services whose resources are spread over several providers and tenants. Second\, we introduce a method for generating securized unikernel images in an on-the-fly manner. This one permits to lead to specific and contrained resources\, that integrate security mechanisms as soon as the image generation phase. These ones may be built in a reactive or proactive manner\, in order to address elasticity requirements. Third\, we propose to extend the TOSCA orchestration language\, so that is is possible to generate automatically securised resources\, according to different security levels in phase with the orchestration. Finally\, we detail a prototyping and extensive series of experiments that are used to evaluate the benefits and limits of the proposed approach. \nKeywords: Security Management\, Programmability\, Distributed Cloud\, Orchestration\, Unikernel
URL:https://www.loria.fr/event/phd-defines-maxime-compastie/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181220T133000
DTEND;TZID=Europe/Paris:20181220T150000
DTSTAMP:20260608T022826
CREATED:20181218T160836Z
LAST-MODIFIED:20181218T160836Z
UID:6342-1545312600-1545318000@www.loria.fr
SUMMARY:Séminaire SSL
DESCRIPTION:Next SSL Seminar will take place on Thursday\, December 20th at 1.30 pm in room C005. \nTayssir Touili (CNRS – LIPN) will give a presentation entitled « On static malware detection ». \n \nThe number of malware is growing extraordinarily fast. A malware may bring serious damage.\nThus\, it is crucial to have efficient up-to-date virus detectors. A robust malware detection technique needs  to check the behavior (not\nthe syntax) of the program without executing it. We show in this talk how using behavior  signatures allow to efficiently detect malwares in a completely static way. We applied  our techniques to detect several malwares. Our  tool was able to detect more than 800 malwares. Several of these malwares could not be detected by well-known anti-viruses such as Avira\, Avast\, Norton\, Kaspersky and McAfee
URL:https://www.loria.fr/event/seminaire-ssl/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190114T100000
DTEND;TZID=Europe/Paris:20190114T173000
DTSTAMP:20260608T022826
CREATED:20181219T133236Z
LAST-MODIFIED:20181219T133312Z
UID:6344-1547460000-1547487000@www.loria.fr
SUMMARY:Histoire et mémoire de l'informatique universitaire à Nancy (1950-2010)
DESCRIPTION:Lundi 14 janvier 2019 – 10:00 – 17:30\n\n\n\n\nUniversité de Lorraine (Nancy)\, Campus Lettres et Sciences Humaines\, Place Godefroy de Bouillon\, Salle G04\n\n\n********************************************************************************************************************************************** \nAprès Grenoble et Toulouse la Faculté des sciences de Nancy a été l’une des premières en France à développer des \n programmes de recherche et d’enseignement en « informatique ». À cette époque le terme n’existe pas encore dans la langue française et cette nouvelle discipline trouve d’abord ses origines dans l’analyse numérique et les mathématiques appliquées. \nAprès une année exploratoire\, tout commence par la mise en place par Jean Legras\, en 1958-59\, d’un cours de troisième cycle d’Analyse et de calcul numérique et par l’utilisation de calculateurs électroniques (IBM 604 puis 650). En 1961\, Jean Legras dirige la première thèse en « informatique » soutenue en France par Marion Créhange\, Structure du code de programmation. Suivront ensuite les travaux décisifs de Claude Pair sur le langage Algol et les théories de la programmation. \nSouvent mal considérée à ses débuts par les mathématiciens partisans des approches formelles des mathématiques – Nancy est à cette époque un des sièges du mouvement Bourbaki – cette nouvelle discipline s’installera cependant durablement dans le paysage universitaire local et national à travers différentes constructions institutionnelles qui parfois coexisteront au gré de regroupements et de changements de tutelle ou de direction : création d’un premier Centre de calcul en 1959\, fondation d’une équipe puis d’un Centre de Recherche en Informatique de Nancy (CRIN) en 1973-1976\, installation de l’Institut de Recherche en Informatique et Automatique (INRIA Lorraine) et de l’Institut de l’information scientifique et technique (INIST) dans les années 1980\, fondation du Centre de Recherche en Automatique de Nancy (CRAN) dans les mêmes années et du Laboratoire lorrain de recherche en informatique et ses applications (LORIA). \nL’histoire de l’informatique universitaire à Nancy dépasse largement le cadre strict de l’histoire de l’informatique ou même du « numérique ». Elle est une invitation à penser les processus de développement et d’installation d’une nouvelle discipline sur le temps long\, dans un contexte de concurrence scientifique et institutionnelle avec d’autres pôles universitaires. Elle appelle à penser le rôle de différents acteurs – professeurs\, ingénieurs\, techniciens\, étudiants – dans ce processus historique. Elle pose la question des processus institutionnels\, politiques et socio-économiques qui ont abouti à l’installation en Lorraine\, territoire fortement marqué par la désindustrialisation\, de structures de recherche et d’enseignement dédiées à cette discipline. Il s’agira donc de reconstituer l’écosystème informatique universitaire nancéien : non seulement ses lieux et ses modalités de formation et de recherche\, mais également ses relations avec les organismes de recherche nationaux (CNRS et INRIA)\, les collectivités locales\, les différents plans nationaux qui ont rythmé le développement de l’informatique en France et le monde économique et industriel. \nCette journée d’étude donnera la parole à ses principaux acteurs\, souvent eux-mêmes à l’origine de travaux historiques sur le sujet. Elle accueillera ainsi : Marion Créhange\, Jean-Claude Derniame\, Jean-Pierre Finance\, Marie-Christine Haton\, Jean-Paul Haton\, Bernard Legras\, Pierre Lescanne\, Claude Pair et Jean-Marie Pierrel. Elle sera ouverte par Pierre Éric Mounier-Kuhn\, historien de l’informatique\, auteur notamment de L’informatique en France\, de la Seconde Guerre Mondiale au Plan Calcul – L’émergence d’une science (2010). \nCette journée est ouverte au public\, sur inscription\, dans la limite des places disponibles. \nPour plus de détails écrire à Laurent Rollet. \n  \n\n\n\n\nProgramme: \n\n\n  \n10h00 : Ouverture de la journée \n10h15 : Pierre-Éric Mounier-Kuhn – « Histoire de l’informatique : historiographie et approches » \n10h35 : Bernard Legras – « Mon père Jean Legras (1914-2012)\, mathématicien lorrain\, promoteur de l’informatique en Lorraine » \n10h55 : Marion Créhange – « De 1957 à 1968 et même 1975 : une création clairvoyante et courageuse. Du défrichage au décollage » \n11h15 : Discussion \n11h30 : Claude Pair – « À tout CRIN : de la naissance à la maturité (1963-1976) » \n11h50 : Jean-Claude Derniame – « Du CRIN au LORIA (1981-1985) » \n12h10 : Discussion \n12h30 : Pause déjeuner \n14h00 : Jean-Pierre Finance – « De l’adolescence à l’âge adulte : dix ans du développement de la recherche en informatique à Nancy (1985-1994) » \n14h20 : Marie-Christine Haton – « 60 ans d’Informatique universitaire à Nancy\, une vue chronologique graphique » \n14h40 : Jean-Paul Haton – « L’intelligence artificielle à Nancy : une longue histoire » \n15h00 : Discussion \n15h15 : Pause \n15h30 : Pierre Lescanne – « Logique et informatique à Nancy » \n15h50 : Jean-Marie Pierrel – « Informatique et traitement numérique de la langue à Nancy : plus d’un demi-siècle d’histoire commune » \n16h10 : Discussion \n16h30 : Table ronde « Quelle histoire pour l’informatique universitaire nancéienne ? » \n\nPlus d’infos
URL:https://www.loria.fr/event/histoire-et-memoire-de-linformatique-universitaire-a-nancy-1950-2010/
CATEGORIES:Séminaire
ATTACH;FMTTYPE=image/jpeg:https://www.loria.fr/wp-content/uploads/2016/12/logo_loria_abrege.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20190115
DTEND;VALUE=DATE:20190116
DTSTAMP:20260608T022826
CREATED:20190110T105313Z
LAST-MODIFIED:20190110T105313Z
UID:6373-1547510400-1547596799@www.loria.fr
SUMMARY:Journée FCH : Méthodes et modèles pour comprendre les réseaux biologiques
DESCRIPTION:La prochaine journée Fédération Charles Hermite aura lieu le mardi 15 janvier 2019 en salle C005\, en lien avec la thèse d’Athénaïs VAGINAY cofinancée par la fédération et les laboratoires CRAN et LORIA. \nCelle-ci est intitulée «Méthodes et modèles pour comprendre les réseaux biologiques» et comprendra cinq interventions et des échanges autour des problématiques de modélisation\, construction et analyse de réseaux biologiques complexes et notamment des perturbations occasionnées par des maladies. \nProgramme : \n9h : Accueil \n9h15 : Introduction à la journée\, Malika SMAIL-TABBONE (LORIA\, UL)\,Taha BOUKHOBZA (CRAN\, UL) \n9h30 : « Unfoldings as a Tool in Fault Diagnosis and in Systems Biology »\, Stefan HAAR (Laboratoire Spécification et Vérification\, CNRS & ENS de Cachan) \n10h45 : Pause café ou thé \n11h15 : « Régression à logits cumulatifs pénalisée pour l’inférence de réseaux »\, Clémence KARMANN (Laboratoire IECL\, UL) \n12h : Repas – Buffet offert par la FCH \n14h15 : « Réseaux biologiques au service de la compréhension des maladies génétiques »\, Olivier POCH (Laboratoire ICUBE\, CNRS & Université de Strasbourg) \n15h30 : « Reprogrammation comportementale des réseaux moléculaires : modélisation\, algorithmes et application au cancer » \,\nCélia BIANE-FOURATI (Laboratoire IBISC\, Université Paris-Saclay) \n16h15 : « Modélisation stochastique de l’expression des gènes et inférence de réseaux de régulation »\, Ulysse HERBACH (Laboratoire IECL\, UL) \n17h : Bilan et discussion \nInscription demandée par envoi d’un simple message à Nathalie.Benito@univ-lorraine.fr
URL:https://www.loria.fr/event/journee-fch-methodes-et-modeles-pour-comprendre-les-reseaux-biologiques/
CATEGORIES:Manifestation
END:VEVENT
END:VCALENDAR