BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.17.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
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:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20201025T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20221030T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210504T110000
DTEND;TZID=Europe/Paris:20210504T120000
DTSTAMP:20210430T132528Z
CREATED:20210430T132513Z
LAST-MODIFIED:20210430T132528Z
UID:12370-1620126000-1620129600@www.loria.fr
SUMMARY:D3 Seminar: Modélisation et optimisation de planification de réseaux RFID à grande échelle
DESCRIPTION:Le prochain séminaire du D3 aura lieu le mardi 4 mai à 11h sur Teams. \nAtef Jaballah post-doctorant dans l’équipe Optimist\, fera une présentation intitulée « Modélisation et optimisation de planification de réseaux RFID à grande échelle ». \n \nRésumé : \nLa croissance énorme des sociétés industrielles nécessite le déploiement des réseaux RFID à grande échelle. Ce qui nécessite l’installation d’un grand nombre de composants RFID (lecteurs\, étiquettes\, middleware et autres). En conséquence\, le coût et la complexité des réseaux RFID augmentent en raison du grand nombre de lecteurs RFID à installer.  Ma thèse s’est intéressée à des problèmes liés au déploiement optimisé des réseaux RFID. En particulier\, nous nous sommes focalisés sur les trois problèmes suivants : (1) le problème de la planification d’un réseau RFID  (RFID Network Planning — RNP) \, (2) le problème de l’arrangement des lecteurs RFID tout en maximisant la couverture et minimisant les collisions\, et (3) le problème du profilage de la taille des étiquettes dans les systèmes RFID. \nLe problème RNP a été prouvé NP-difficile par analogie avec le problème du positionnement d’antennes dans les réseaux cellulaires. C’est un problème d’optimisation multi-objectif avec un espace de solutions très large et bruité\, pour lequel les approches méta-heuristiques conviennent le mieux.  Nous proposons une nouvelle variante de l’algorithme de recherche coucou (Cuckoo Search – CS)\, dénommé auto-adaptative CS algorithme (Self Adaptive Cuckoo Search-SACS) où les paramètres de contrôle de l’algorithme CS sont adaptés en temps réel\, selon l’avancement du processus d’optimisation pour résoudre ce problème.  Ensuite\, nous intéressons au problème d’ordonnancement des lecteurs RFID afin de réduire les chevauchements des régions couvertes par les lecteurs et minimiser les collions. Ce problème est connu sous le nom de problème RCCAA (Reader Coverage Collision Avoidance Arrangement). Pour résoudre ce problème\, nous proposons un algorithme d’approximation qui est capable de résoudre le problème RCCAA en évitant les différents types de collisions. \nLe dernier problème abordé dans ma thèse est le problème du profilage de la taille des étiquettes dans les systèmes RFID ou (Tag Size Profiling -TSP problem). Le problème du TSP consiste à estimer les tailles des sous-régions du système RFID couvertes par plusieurs lecteurs. La résolution du problème TSP permet de déterminer l’ordonnancement optimal des lecteurs qui maximise le débit d’identification des étiquettes. Nous prouvons que la construction de système linéaire optimale adéquat pour résoudre le problème TSP est une tâche est NP difficile. Ensuite\, nous développons un nouvel algorithme approximatif qui est capable de résoudre une telle tâche en un temps raisonnable. \nAbstract:  \nRadio Frequency IDentification (RFID ) is a key technology of the Internet of Things (IoT).  RFID has the possibility of enabling  machines to  identify\, control  and localize the physical objects  through networks in real time.  Due to its low cost\, small size and ability to communicate in different environments (liquids\, gas…) without power source\,  RFID is frequently used in different sectors : supply chain management\, electronic security\, retail marketing\, smart university\, military and health-care. RFID is a system composed  by  tags  sensitive to electromagnetic fields created bya reader antenna. Each tag encapsulate a unique identification and can be attached to objects in order to monitor them. However\, many challenges remain to be addressed before  RFID can reach its full potential in the IoT.  Particularly\, readers scheduling and RFID network planning  (RNP)  are among these most important challenges.  Essentially\, the readers scheduling avoids collision and the RNP  assures the most suitable quality of service and cost efficiency. \nOwing to the limited interrogation range of RFID readers\, multiple readers should be deployed to ensure full tag coverage.   The arbitrary deployment of readers causes several problems: wastage of readers\, collision and load imbalance between readers.  Finding the optimal number of readers to deploy so as obtain full tag coverage\, the optimal placement of these readers and the optimal configuration of their parameters is known as an RNP problem.  The RNP problem is a multiobjective optimization problem with a large number of variables and uncertain parameters.   This dissertation presents a new variant of the cuckoo search algorithm  to plan large-scale RFID networks and overcome the deployment challenges described above. In some cases\, a good planning can not completely eliminate overlap between readers\, hence the necessity of readers scheduling to activate the neighbors readers in a different time to avoids collisions.  In this context\, a particular problem known as the Reader-Coverage Collision Avoidance Arrangement (RCCAA) problem has received great attention in the literature.  The RCCAA problem consists in activating  RFID readers and adjusting their interrogation ranges in order to cover the maximum number of tags without collision. In this manuscript\, we propose the maximum-weight-independent-set-based algorithm II to solve the RCCAA problem. Another important problem that has great importance in readers scheduling is  to know the Tag Size Profile  (TSP) of the system.   TSP consists in estimating the size of sub-regions in an RFID system covered by several readers.  In order to achieve this goal\,   the sub-regions are considered as variable and  the adequate linear system is constructed by these variables and solve them.   In this dissertation\, we show that the determination of the minimal set of schedule instances to construct an adequate linear system is NP-hard\, and we propose a time-efficient approximate algorithm based on a k-partial set cover to solve it.
URL:https://www.loria.fr/event/d3-seminar-2/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20210518
DTEND;VALUE=DATE:20210618
DTSTAMP:20210517T144006Z
CREATED:20210503T141736Z
LAST-MODIFIED:20210517T144006Z
UID:12383-1621296000-1623974399@www.loria.fr
SUMMARY:Department 1 seminar
DESCRIPTION:The Department 1 seminar will take place from 18th May to 17th June online. \nProgram: \n\nMardi 18 mai\, 13h30\n\nLéo Valque\, Gamble : Rounding polygonal meshes \nFlorian Delconte\, Adagio : Tree Defect Segmentation using Geometric Features and CNN \n\n\nMercredi 19 mai\, 13h30\n\nDavid Lopez\, Pixel : Triangulation de Delaunay : comment préserver le volume ? \nMatthieu Zins\, Tangram : « Object-Based Visual Localization From Ellipsoidal Model and 3D-Aware Ellipse Prediction » \n\n\nJeudi 20 mai\, 13h30\n\nYoussef Assis\, Tangram : Intracranial aneurysms detection using deep learning \nMelike Aydinlilar\, MFX : Ray-Tracing Implicit Surfaces \n\n\nVendredi 21 mai\, 13h30\n\nMarco Freire\, MFX : Layout problems and generative design for shape modeling in computational fabrication \nDavid Desobry\, Pixel : Designing 2D and 3D Non-Orthogonal Frame Fields \nQuentin Yang\, Caramba : Coercion resistance with cast-as-intended verification \n\n\nLundi 14 juin\, 11h30\n\nNariman Khaledian\, Tangram : Toward a Functional Model of the Mitral Valve \nJustine Basselin\, Pixel : Restricted Power diagram on the GPU \n\n\nMardi 15 juin\, 11h30\n\nAbdelkarim Elassam\, Tangram : Horizon Line and Vanishing points detection using Deep Learning \nLouis Massucci\, ABC : Statistical learning theory and hybrid dynamical system identification \n\n\nMercredi 16 juin\, 11h30\n\nGuillaume Coiffier\, Pixel : Improving global parametrizations for quadmeshing \nNuwan Herath Mudiyanselage\, Gamble : Fast algorithm for the visualization of surfaces \n\n\nJeudi 17 juin\, 11h30\n\nHamid Boukerrou\, Caramba : TBA \nFrançois Protais\, Pixel : Computing Foldover-free maps
URL:https://www.loria.fr/event/department-1-seminar/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210520T140000
DTEND;TZID=Europe/Paris:20210520T160000
DTSTAMP:20210518T134106Z
CREATED:20210517T102244Z
LAST-MODIFIED:20210518T134106Z
UID:12455-1621519200-1621526400@www.loria.fr
SUMMARY:CISPA - LORIA seminar
DESCRIPTION:The Second Virtual Workshop Day of the French-German Center for Cybersecurity will take place on Thursday\, 20th May. \n02:00 p.m. to 02:05 p.m. Introduction by Prof. Marine Minier and Dr Antoine Joux (Directors of the French-German Center for Cybersecurity)\n\n02:05 p.m. to 02:30 p.m.: Dr Jérôme François (Inria Research Scientist with RESIST Team): In-network security monitoring\nAbstract: Monitoring is a critical task of network operations to serve as support as many other ones such as fault management\, security\, trouble-shooting\, QoS… Recently\, network softwarization empowers the paradigm of programmable networks where network functions or even tasks of these functions can be programmed with high flexibility to fit user or operator needs independently of hardware used. Programming network data-plane allows to program the processing of each packet and is supported by novel technologies like P4. In this talk\, we will bring the gap between data-plane programming with P4 and network monitoring by highlighting what possibilities exist to support an enhance in-network security monitoring rather than offloading the latter to a server as usual. In particular\, we will discuss how complex (malicious) behaviors can be tracked with extended finite state machines and how network switch could support real number operations that is a requirement for expecting AI to be run in-network.\n\n02:30 p.m. to 02:40 p.m.: Q&A\n\n02:40 p.m. to 03:05 p.m.: Dr Antoine Joux (Faculty at CISPA): Subset-sum collisions\nAbstract: In this talk\, we revisit the subset-sum collision problem in a parameter regime where lattice reduction technique are expected to be costly. For this\, we turn to combinatorial algorithms based on the representation technique and show how they can be applied to the subset-sum collision problem. After a survey of the state of the art\, we present two algorithmic strategy: first\, a reduction to the resolution of ordinary subset sum problem and\, second\, a direct application of the representation technique. Quite surprisingly\, for a given number of elements in the subset-sum\, the subset-sum collision problem is (with current algorithms) harder that the subset-sum inversion problem. This contrasts with the general intuition that collisions are easier to find than pre-images.\n\n03:05 p.m. to 03:15 p.m.: Q&A\n\n03:15 p.m. to 03:30 p.m.: Final discussion\n\n03:30 p.m. to 04:00 p.m. Virtual Coffee on gather.town
URL:https://www.loria.fr/event/cispa-loria-seminar/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20210525
DTEND;VALUE=DATE:20210528
DTSTAMP:20201130T094609Z
CREATED:20201130T094517Z
LAST-MODIFIED:20201130T094609Z
UID:11245-1621900800-1622159999@www.loria.fr
SUMMARY:ISMVL2021 IEEE International Symposium on Multiple-Valued Logic
DESCRIPTION:The Technical Committee on Multiple-Valued Logic of the IEEE Computer Society will hold its 51st annual symposium in fully online\, on May 25-27\, 2021. \nThe symposium will bring together researchers from computer science\, engineering\, mathematics\, and further disciplines to discuss new developments and directions for future research in the area of multi-valued logic and related fields. Research papers\, surveys\, or tutorial papers on any subject in these areas are within the scope of the symposium. \nThe proceedings of ISMVLs are in the Ei compendex that is the broadest and most complete engineering literature database available in the world. \nPaper submission\nAuthors should submit papers as PDF files following the IEEE style guidelines for conference proceedings. Each manuscript shall include a 50-100 word abstract and shall not exceed 6 pages. All accepted papers will be published by IEEE. The authors of selected papers will be invited after the conference to prepare an extended version of their\npaper to be published in the journal of Mulitple-Valued Logic and Soft Computing. \n\nAbstract Submission Deadline: December 21\, 2020\nManuscript Submittion Deadline: December 28\, 2020\n\nA link to the submission system will be available soon at: www.mvl.jpn.org/ISMVL2021 \nSupport the MVL community by joining the TCMVL (free for IEEE members). More information is available at:\nwww.ieee.org/membership-catalog
URL:https://www.loria.fr/event/ismvl-2021-ieee-international-symposium-on-multiple-valued-logic/
CATEGORIES:Séminaire
END:VEVENT
END:VCALENDAR