BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.15.20//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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181107T083000
DTEND;TZID=Europe/Paris:20181107T170000
DTSTAMP:20260511T164920
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:20260511T164920
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:20260511T164920
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:20260511T164920
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:20260511T164920
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:20260511T164920
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:20260511T164920
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:20260511T164920
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:20260511T164920
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:20260511T164920
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:20260511T164920
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:20260511T164920
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:20260511T164920
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
END:VCALENDAR