BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.16.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:LORIA
X-ORIGINAL-URL:https://www.loria.fr
X-WR-CALDESC:Évènements pour LORIA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20181028T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20191027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20201025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190301T093000
DTEND;TZID=Europe/Paris:20190301T110000
DTSTAMP:20260516T143642
CREATED:20190218T131956Z
LAST-MODIFIED:20190218T131956Z
UID:6572-1551432600-1551438000@www.loria.fr
SUMMARY:Seminar : Xiaofang Wang
DESCRIPTION:Xiaofang Wang (Inria Rennes) will give a seminar on March 1st at 9.30 am in room A006. \nHer presentation is entitled « From Image segmentation and active colloids tracking\, to weakly supervised object detection ». \nI will present my research activities\, covering four axes in machine learning. They are unsupervised learning for image segmentation and active colloids tracking\, weakly supervsed object detection\, supervised learning for 3D object classification and domain adaptation in transfer learning. First\, a short overview on all axes is introduced. Then I will present several works in depth\, including graph based image segmentation and object tracking\, as well as what is weakly supervised in object detection and our contribution. Finally\, a theorectical introduction on the domain adaptation and our proposals will be discussed. Please find more details here:https://team.inria.fr/rainbow/fr/xiaofang-wang/.
URL:https://www.loria.fr/event/seminar-xiaofang-wang/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20190304
DTEND;VALUE=DATE:20190309
DTSTAMP:20260516T143642
CREATED:20190304T085520Z
LAST-MODIFIED:20190312T172715Z
UID:6588-1551657600-1552089599@www.loria.fr
SUMMARY:Kyutech - Loria - Université de Lorraine Workshop
DESCRIPTION:The 2nd Kyutech – University of Lorraine – Loria International Joint Workshop 2019 will take place between March 4th and March 8th at Kyushu Institute of Technology. \nTeams NeuroRhythms\, Biscuit and Larsen will give presentations about robotics\, neural networks and home care. \nOrganized by Kyushu Institute of Technology\, Loria and University of Lorraine\, this workshop aims to develop international research collaborations\, joint papers and capacity development for graduate students. \nLast year this workshop took place at Nancy and these events are largely impulsed by Patrick Henaff\, professor at University of Lorraine and teacher at Mines Nancy. \nLoria is implicated in two important partnership with Japan : JAIST and Kyutech. \nProgram
URL:https://www.loria.fr/event/kyutech-loria-universite-de-lorraine-workshop/
CATEGORIES:Manifestation
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190308T133000
DTEND;TZID=Europe/Paris:20190308T150000
DTSTAMP:20260516T143642
CREATED:20190115T104422Z
LAST-MODIFIED:20190115T104422Z
UID:6383-1552051800-1552057200@www.loria.fr
SUMMARY:D3 Seminar : David Gutierrez Estevez\, Samsung
DESCRIPTION:Next D3 Seminar will take place on Friday\, March 8th at 1.30 pm in room A008. \nDavid Gutierrez Estevez (Samsung) will give a presentation entitled « 5G Architecture and Elastic Network Slicing: A View from the 5G-MoNarch Project ». \nAbstract:  Vertical markets and industries are addressing a large diversity of heterogeneous services\, use cases\, and applications in 5G. It is currently common understanding that for networks to be able to satisfy those needs\, a flexible\, adaptable\, and programmable architecture based on network slicing is required. Moreover\, a softwarization and cloudification of the networks is already underway\, where network functions (NFs) are transformed from monolithic pieces of equipment to programs running over a shared pool of computational and communication resources. In this talk\, an overview will be given on the topic of 5G architecture with a special emphasis on network slicing. Furthermore\, the talk will encompass the view on the topic from the 5G-PPP research project 5G-MoNArch (5G MobileNetwork Architecture for diverse services\, use cases\, and applications in 5G and beyond)\, which has been working for the last 18 months on designing an architecture that will combine today’s consolidated concepts (such as virtualization\, slicing and orchestration of access and core functions) with several novel innovations targeted at optimizing the envisioned architecture. In particular\, the talk will look at the network resource elasticity innovation\, a key means to make an efficient use of the computational resources in 5G systems aided by artificial intelligence and data analytics. \nBio: Dr. David M. Gutierrez Estevez obtained his Engineering Degree in Telecommunications (Hons.) from the Universidad de Granada\, Spain\, and his M.S. and Ph.D. degrees from Georgia Institute of Technology in Atlanta\, USA. He developed his Ph.D. thesis at the Broadband Wireless Networking Laboratory under the supervision of Prof. Ian F. Akyildiz\, obtaining the Researcher of the Year Award in 2013. From Sept. 2014 to Sept. 2015\, David worked for Huawei Technologies as Principal Research Engineer in Silicon Valley in the area of cloud computing. Previous to that\, David had held an internship position at the Corporate R&D Division of Qualcomm\, as well as research assistant and intern positions at Fraunhofer Heinrich Hertz Institute and Fraunhofer Institute for Integrated Circuits\, both in Germany. Since January 2016\, David is with the 5G Research and Standards team of the Samsung Electronics R&D Institute UK\, currently holding a Principal Engineer position where he leads several research projects and participates in different standardization activities related to network architecture. \n 
URL:https://www.loria.fr/event/d3-seminar-david-gutierrez-estevez-samsung/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20190311
DTEND;VALUE=DATE:20190315
DTSTAMP:20260516T143642
CREATED:20190118T095144Z
LAST-MODIFIED:20190118T095144Z
UID:6417-1552262400-1552607999@www.loria.fr
SUMMARY:MLA2019 : Workshop « Mathematical Logic and its Applications »
DESCRIPTION:Le Loria accueillera la troisième édition du Workshop « Mathematical Logic and its Applications »\, (MLA)\, du 11 au 14 mars 2019. Les deux premières éditions ont eu lieu en 2016 et 2018 respectivement à Kyoto et Kanazawa.  La série de workshops a été initiée dans le cadre du programme JSPS Core-to-Core “Mathematical Logic and its Applications”\, coordonné par le JAIST\, en coopération avec plusieurs instituts au Japon et à l’étranger\, dont le Loria.  Cette troisième édition sera de nouveau soutenue par le programme JSPS Core-to-Core\, et s’inscrit dans l’accord de collaboration entre le JAIST et le Loria qui a été signé le 7 novembre 2016. \nLes thèmes scientifiques du workshop concernent la logique intuitioniste\, la théorie des types\, les logiques non-classiques\, la théorie de la récursion\, la théorie de la preuve\, l’extraction de programme\, la complexité.  Le workshop est présidé par Mathieu Hoyrup (Loria) et Mizuhito Ogawa (JAIST\, Japon). \n30 à 40 personnes seront attendues sur ces quatre jours.  Le programme sera composé d’exposés invités et de contributions internationales\, une dizaine de pays étant représentés. \nToutes les informations
URL:https://www.loria.fr/event/mla2019-workshop-mathematical-logic-and-its-applications/
CATEGORIES:Manifestation
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20190311
DTEND;VALUE=DATE:20190315
DTSTAMP:20260516T143642
CREATED:20190208T101437Z
LAST-MODIFIED:20190208T101437Z
UID:6527-1552262400-1552607999@www.loria.fr
SUMMARY:MLA 2019
DESCRIPTION:The Third Workshop on Mathematical Logic and its Applications will take place at Loria between March 11th and March 14th. \nMore information : mla2019.loria.fr \nWorkshop Description\nThe workshop brings together researchers of mathematical logic and its related areas\, and would provide a forum for interplay between these areas. This workshop\, organised by Loria\, will be held as a part of the JSPS Core-to-Core Program “Mathematical Logic and its Applications”\, which is led by Japan Advanced Institute of Science and Technology (JAIST) in cooperation with several institutes both in Japan and abroad. Anyone\, not restricted to the members of the project\, is welcome to participate. \nScope\nThe scope includes (but is not limited to) the following topics and their applications: \n\nIntuitionistic logic\nType theory\nProof theory\nConstructive analysis/topology\nProgram extraction\nReverse mathematics\nComputable analysis/topology\nRecursion theory (Computability theory)\nNon-classical logic\nComputational complexity\n\nSubmission\nExtended abstracts (1-2 pages) of original work are welcome.\nThe deadline is January 28\, 2019.\nUpload your submission via EasyChair. \nImportant dates\nSubmission: January 28\, 2019\nNotification: February 1st\, 2019\nDeadline for registration: February 20\, 2019\nWorkshop: March 11-14\, 2019
URL:https://www.loria.fr/event/mla-2019/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190312T140000
DTEND;TZID=Europe/Paris:20190312T170000
DTSTAMP:20260516T143642
CREATED:20190311T091932Z
LAST-MODIFIED:20190312T144501Z
UID:6621-1552399200-1552410000@www.loria.fr
SUMMARY:PhD Defense - Iordan Iordanov (team Gamble)
DESCRIPTION:Iordan Iordanov\, PhD student in Gamble team will defense his thesis entitled « Delaunay triangulations of a family of symmetric hyperbolic surfaces in practice ». The defense is planned for Tuesday\, 12 March 2019 in room C005 at 14h00.\n\nAbstract :\n\n\nThe Bolza surface is the most symmetric compact orientable hyperbolic surface of genus 2. For any genus higher than 2\, there exists one compact orientable surface constructed in a similar way as the Bolza surface having the same kind of symmetry. We refer to this family of surfaces as symmetric hyperbolic surfaces. This thesis deals with the computation of Delaunay triangulations of symmetric hyperbolic surfaces.\nDelaunay triangulations of compact surfaces can be seen as periodic Delaunay triangulations of their universal cover (in our case\, the hyperbolic plane). A Delaunay triangulation is for us a simplicial complex. However\, not all sets of points define a simplicial decomposition of a symmetric hyperbolic surface. In the literature\, an algorithm has been proposed to deal with this issue by using so-called dummy points: initially a triangulation of the surface is constructed with a set of dummy points that defines a Delaunay triangulation of the surface\, then input points are inserted with the well- known incremental algorithm by Bowyer\, and finally the dummy points are removed\, if the triangulation remains a simplicial complex after their removal. For the Bolza surface\, the set of dummy points to initialize the triangulation is given. The existing algorithm computes a triangulation of the Bolza surface as a periodic triangulation of the hyperbolic plane and requires to identify a suitable subset of the hyperbolic plane in which to work.\nWe study the properties of Delaunay triangulations of the Bolza surface defined by sets of points containing the proposed set of dummy points\, and we describe in detail an implementation of the incremental algorithm for it. We begin by identifying a subset of the hyperbolic plane that contains at least one representative for each face of a Delaunay triangulation of the surface\, which enables us to define a unique canonical representative\niiin the hyperbolic plane for each face on the surface. We give a data structure to represent a Delaunay triangulation of the Bolza surface via the canonical representatives of its faces in the hyperbolic plane. We detail the construction of such a triangulation and additional operations that enable the location of points and the removal of vertices. We also report results on the algebraic degree of predicates needed for all operations.\nWe provide a fully dynamic implementation for the Bolza surface\, supporting insertion of new points\, removal of existing vertices\, point location\, and construction of dual objects. Our implementation is based on CGAL\, the Computational Geometry Algorithms Library\, and is currently under revision for integration in the library. To incorporate our code into CGAL\, all the objects that we introduce must be compatible with the existing framework and comply with the standards adopted by the library. We give a detailed description of the classes used to represent and handle periodic hyperbolic triangulations and related objects. Benchmarks and tests are performed to evaluate our implementation\, and a simple application is given in the form of a CGAL demo.\nWe discuss an extension of our implementation to symmetric hyperbolic surfaces of genus higher than 2. We propose three methods to generate sets of dummy points for each surface and present the advantages and shortcomings of each method. We identify a suitable subset of the hyperbolic plane that contains at least one representative for each face of a Delaunay triangulation of the surface\, and we define a canonical representative in the hyperbolic plane for each face on the surface. We describe a data structure to represent such a triangulation via the canonical representatives of its faces\, and give algorithms for the initialization of the triangulation with dummy points. Finally\, we discuss a preliminary implementation in which we examine the difficulties of having efficient exact predicates for the construction of Delaunay triangulations of symmetric hyperbolic surfaces.
URL:https://www.loria.fr/event/phd-defense-jordan-iordanov-team-gamble/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190319T100000
DTEND;TZID=Europe/Paris:20190319T120000
DTSTAMP:20260516T143642
CREATED:20190314T154615Z
LAST-MODIFIED:20190314T154615Z
UID:6677-1552989600-1552996800@www.loria.fr
SUMMARY:PhD defense : Meihui Gao
DESCRIPTION:Meihui Gar will defekt her thesis on Tuesday\, 19 March at 10h00 in room A008. \nHer presentation is entitled « Models and Methods for Network Function Virtualization (NFV) Architectures ». \nJury:\n\nPr.  Bernard FORTZ                        (Université Libre de Bruxelles)                                Rapporteur / Reviewer\nPr.  Luigi DE GIOVANNI                 (Università degli Studi di Padova)                          Rapporteur / Reviewer\nPr.  Stefano SECCI                          (Conservatoire national des arts et métiers)         Examinatuer / Examiner\n\nDr.  Éric GOURDIN                          (Orange Gardens)                                                     Examinateur / Examiner\n\nPr.  Bernardetta ADDIS                   (Université de Lorraine)                                           Co-directeur de thèse / Co-supervisor\nPr.  Ye Qiong SONG                        (Université de Lorraine)                                           Directeur de thèse / Supervisor\n\n\nAbstract:\nDue to the exponential growth of service demands\, telecommunication networks are populated with a large and increasing variety of proprietary hardware appliances\, increasing the cost and the complexity of the network management. The NFV paradigm is proposed to overcome this problem\, allowing dynamical allocation of Virtual Network Functions (VNFs) to make network function provision and operation more flexible and cost-effective. A key problem in NFV is the NFV service chaining: given a network where some nodes are connected with computational servers and a set of demands asking for network services composed of a sequence of VNF instances. VNF instances need to be installed on servers and the demands must be routed in such a way that each demand accesses the requested VNFs. Despite thelarge number of research papers\, little has been done towards achieving cost-efficient VNFs Placement and demands Routing (VNF-PR). From an optimization point of view\, the problem can be modeled as the combination of a facility location problem (for the VNF location and server dimensioning) and a network design problem (for the demands routing). Both problems are widely studied in the literature\, but their combination represent a new challenge. \n\nIn this thesis\, we focus on the VNF-PR problem. Our objective is to study the problem structure and features\, analyze and compare the most promising formulations\, and finally propose exact and heuristic methods to solve efficiently the problem. In the first stage\, we study the VNF-PR problem structures and features. For this\, we extend the work in [1] by considering more realistic features and constraints of NFV infrastructures and we propose a linear programming model to solve it. Then\, we design a math-heuristic algorithm to scale with multiple objectives\, which allows us to study further the mutual impact between classical traffic engineering and NFV infrastructures efficiency goals. We generate scenarios with different VNF forwarding profiles\, different cases of demand distribution and different levels of end-to-end latency bound to evaluate the proposed method. Computational results show that our method can provide a stable and close-to-optimum solution for the considered problem and there is a trade-off achievable between classical traffic engineering and NFV infrastructures cost-efficiency goals. In the second stage\, our goal is to investigate the problem complexity and properties and to analyze and compare different mathematical programming models. To do so\, we move into the theoretical part of the problem. We formalize a simplified\, yet significant variant\, the VNF-PR with simple path routing (VNF-PR SP ) problem. We prove the NP-completeness of the VNF-PR SP problem. Further\, we derive problem properties and use them to help in speeding up the optimization. In order to better understand the behavior of different mathematical programming models\, we generate a common test bed with more than 100 different test instances under different capacity settings and topology features\, on which we evaluate and compare the two most promising formulations (i.e.\, PR and SP) proposed in the literature. We prove both theoretically and computationally that the continuous relaxation of SP always provides a bound no worse than the one of PR. Then\, we introduce additional inequalities to strengthen the formulations\, and we extend the formulations to address more general versions of the problem with multiple VNF types and multiple orders. Finally\, we address the problem scalability by proposing exact and heuristic methods to deal with large size instances (with up to 60 nodes and 1800 demands) of the VNF-PR SP problem. In our exact methods\, we partially fix the solution and solve the model to complete it. In our heuristic methods\, we combine the mathematical programming models with a local search technique\, which allows us to explore quickly the reduced solution space to provide a feasible solution. We show that: our exact methods can solve efficiently (e.g.\, less than 2 seconds under some capacity cases) the small size instances (with less than 30 nodes and 300 demands) of the problem; our proposed heuristic methods can solve efficiently medium size instances (with between 20 and 30 nodes\, 300 and 1000 demands) of challenging capacity cases and provide feasible solutions for large size instances of the most difficult capacity cases\, for which the models cannot find any feasible solution even with large computational time (i.e.\, 2hours).\n\nKeywords: Network Function Virtualization (NFV)\, Resource Allocation\, Operations Research
URL:https://www.loria.fr/event/phd-defense-meihui-gao/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190319T140000
DTEND;TZID=Europe/Paris:20190319T150000
DTSTAMP:20260516T143642
CREATED:20190315T142954Z
LAST-MODIFIED:20190319T085158Z
UID:6679-1553004000-1553007600@www.loria.fr
SUMMARY:Séminaire : Joël Legrand
DESCRIPTION:Joël Legrand\, MCF à Lille de l’équipe Inria Magnet\, viendra nous présenter ses travaux le mardi 19 mars à 14h en salle A007 à CentraleSupélec (2 rue Edouard Belin\, Metz). \nSa présentation est intitulée « Syntax-based Word Sequence Modeling using Deep Learning ». \n \nAbstract: \nTraditionally\, natural language processing (NLP) relied on generative models with task specific and manually engineered features.\nRecently deep learning approaches provided state of-the-art results in various fields such as computer vision\, speech processing and natural language processing.\nThe central idea behind these approaches is to learn features and models simultaneously\, in an end-to-end manner\, and making as few assumptions as possible.\nIn NLP\, word embeddings\, mapping words in a dictionary on a continuous low-dimensional vector space\, have proven to be very efficient for a large variety of tasks while requiring almost no a-priori linguistic assumptions. \nIn this talk\, I will present some results on representations of segments of sentences using deep neural network models.\nIn particular\, I will show how syntactic structures\, such as consistuency and dependency syntactic trees\, can be leveraged for the\npurpose of solving NLP tasks that involve complex sentence-level relationships.\nI will first introduce the key concepts of deep learning for NLP. I will then focus on two empirical studies concerning the tasks of\nsyntactic parsing using recursive neural networks (RNN) and relationship extraction from text using tree-LSTM with dependency structures. \nSelected publications:\n[1]. Joint RNN-based greedy parsing and word composition.\nJoël Legrand and Ronan Collobert.\nProceeding of the 3rd International Conference on Learning\nRepresentations (ICLR 2015)\nhttp://arxiv.org/pdf/1412.7028 \n[2] Syntax-based Transfer Learning for the Task of Biomedical Relation Extraction\nJoël Legrand\, Yannick Toussaint\, Chedy Raïssi\, Adrien Coulet\nProceeding of the Ninth International Workshop on Health Text Mining and\nInformation Analysis (LOUHI 2018)\nhttps://hal.inria.fr/hal-01869071/document \nShort bio:\nJoël Legrand received his MSc degree in Computer Science from the\nUniversité de Lorraine and his Ph.D in Electrical Engineering from the\nÉcole Polytechnique Fédérale de Lausanne (EPFL\, Switzerland).\nHe recently joined the  MAGNET team (Cristal\, INRIA-CNRS-Université de\nLille) as an associate professor (maître de conférences).
URL:https://www.loria.fr/event/seminaire-joel-legrand/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190319T140000
DTEND;TZID=Europe/Paris:20190319T153000
DTSTAMP:20260516T143642
CREATED:20190313T105411Z
LAST-MODIFIED:20190313T105411Z
UID:6659-1553004000-1553009400@www.loria.fr
SUMMARY:Seminar : Adrien Boiret
DESCRIPTION:Adrien Boiret will give a presentation on Tuesday\, 19th March at 2pm in room A008. \nHis talk is entitled « Extend the RPNI algorithm for Symbolic Learning to Transducers with Lookahead ». \n \nAbstract:\nWe consider the problem of passive symbolic learning of tree and word transducers.\nSymbolic learning means learning an exact target (automaton\, transducer…) using exact information on its (words\, input/output pairs…).\nThe passive learning problem deals with identifying a specific transducer in normal form from a finite set of behaviour examples (as opposed to the active learning that uses student-teacher interactions). \nSymbolic learning problems are solved in word languages using the RPNI algorithm\, that relies heavily on the Myhill-Nerode characterization of a minimal normal form on DFA.\nThe extensions of RPNI to word transformations and tree languages follow the same pattern: first\, a Myhill-Nerode theorem is identified\, then the normal form it induces can be learnt from examples.\n\nIn this talk I will present another extension of the RPNI model that necessitates a departure from this schema to learn rational functions on words\, performed by transducers with lookahead.\nThe notable difference is that the nature of the minimal normal form on these transducers is ill adapted to classic RPNI methods\, and thus a new normal form has to be found.
URL:https://www.loria.fr/event/seminar-adrien-boiret/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190319T183000
DTEND;TZID=Europe/Paris:20190319T200000
DTSTAMP:20260516T143642
CREATED:20190208T101143Z
LAST-MODIFIED:20190208T101143Z
UID:6522-1553020200-1553025600@www.loria.fr
SUMMARY:Sciences en lumière : Khéops\, mystérieuses découvertes
DESCRIPTION:Rendez-vous le mardi 19 mars à 18h30 à Image Est (9 rue Michel Ney\, Nancy) pour la projection du film « Khéops\, mystérieuses découvertes »\, accompagnée par Jean-Baptiste Mouret\, directeur de recherche Inria dans l’équipe Larsen. \nUne mission internationale d’envergure\, ScanPyramids\, a décidé de scanner littéralement les pyramides d’Egypte. Les meilleurs spécialistes au monde en techniques de visualisation non-invasives ont enfin l’autorisation de regarder à travers ces tombes millénaires !\nGrâce à des détecteurs de particules cosmiques\, des drones et des caméras infra-rouge thermiques\, le mystère des pyramides pourrait enfin être définitivement résolu. Va t-on découvrir des chambres et des couloirs secrets ? Ce scan grandeur nature va t-il pouvoir trancher entre toutes les théories existantes ? Ce film propose tout le suivi de cette mission scientifique. Il relate les péripéties et le succès de cette aventure scientifique et historique exceptionnelle qui a abouti à la première grande découverte dans la pyramide de Khéops depuis plus de 1000 ans. \nAccompagné par Jean-Baptiste Mouret\, directeur de recherche Inria au sein de l’équipe Larsen (Inria/Loria) \nUN FILM DE FLORENCE TRAN (52 min / 2017 / France / Bonne PiocheProductions\, Heritage Innovation & Preservation Institute (HIP)\, Faculté des ingénieurs de l’Université du Caire\, NHK Japan Broadcasting Corp\, France Télévisions) \nEn partenariat avec Image’Est
URL:https://www.loria.fr/event/sciences-en-lumiere-kheops-mysterieuses-decouvertes/
CATEGORIES:Manifestation
ATTACH;FMTTYPE=image/jpeg:https://www.loria.fr/wp-content/uploads/2019/02/Flyer-Web_2019-03-19_Nancy_Khéops_Page_1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20190326
DTEND;VALUE=DATE:20190327
DTSTAMP:20260516T143642
CREATED:20190208T102258Z
LAST-MODIFIED:20190208T102258Z
UID:6529-1553558400-1553644799@www.loria.fr
SUMMARY:Grande Region Security and Reliability Day 2019
DESCRIPTION:The Grande Region Security and Reliability Day will take place on March 26th. \nMore information \nSecurity and reliability are interdisciplinary areas\, drawing from several fields: mathematics (number theory\, statistics\, logic)\, computer science (algorithms\, information theory\, cryptology\, formal methods\, computational complexity\, software engineering)\, electrical engineering (electronics\, signal acquisition and processing\, secure hardware design)\, management (security and quality policies\, risk assessment) and social aspects (security awareness\, ethical and legal issues\, privacy). \nThe objective of the Grande Region Security and Reliability Day (GRSRD) is to increase scientific interaction in security and reliability at the regional level. The workshop provides a platform for exchange of ideas\, discussion and co-operation. It focuses on the Grande Region\, but is open to submissions and participation of the whole scientific community working in security and reliability. The GRSRD is jointly organized by the University of Luxembourg\, LORIA-INRIA Nancy\, Saarland University/CISPA\, and previously the University of Trier.
URL:https://www.loria.fr/event/grande-region-security-and-reliability-day-2019/
CATEGORIES:Manifestation
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190327T110000
DTEND;TZID=Europe/Paris:20190327T120000
DTSTAMP:20260516T143642
CREATED:20190325T090107Z
LAST-MODIFIED:20190325T090116Z
UID:6773-1553684400-1553688000@www.loria.fr
SUMMARY:MALOTEC Seminar : Saïd Jabbour
DESCRIPTION:Next MALOTEC seminar will take place on Wednesday March 27th at 11am in room B013. \nSaïd Jabbour (Université d’Artois\, Centre de recherche en informatique de lens (CRIL)) will give a presentation entitled « Data mining by constraints ». \nAbstract: In this presentation\, I will address the issue of data mining\nby constraints. I will present some contributions on declarative\napproaches for different data mining tasks including frequent itemset\nmining and its various condensed forms\, association rules\, sequential\npattern mining\, uncertain frequent itemset mining and gradual itemset\nmining. To highlight the cross-fertilization between symbolic AI and\ndata mining\, I will show how linear constraints can be used to summarize\nlarge graphs\, how data mining techniques can be exploited to compress\nBoolean formulas and finally how the concept of symmetry\, widely\nexplored in SAT/CP\, is extended to pattern mining. \nFor more information: http://www.cril.univ-artois.fr/~jabbour/
URL:https://www.loria.fr/event/malotec-seminar-4/
CATEGORIES:Séminaire
END:VEVENT
END:VCALENDAR