Search

Your search keyword '"Centre National de la Recherche Scientifique (CNRS)"' showing total 227,718 results
Start Over Author "Centre National de la Recherche Scientifique (CNRS)" Topic 02 engineering and technology
227,718 results on '"Centre National de la Recherche Scientifique (CNRS)"'

1. A random growth model with any real or theoretical degree distribution

Author

Frédéric Giroire, Stéphane Pérennes, Thibaud Trolliet, Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), Combinatorics, Optimization and Algorithms for Telecommunications (COATI), COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), This work has been supported by the French government through the UCA JEDI(ANR-15-IDEX-01) and EUR DS4H (ANR-17-EURE-004) Investments in the Futureprojects, by the SNIF project, and by Inria associated team EfDyNet., ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015), Université Nice Sophia Antipolis (1965 - 2019) (UNS), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), EfdyNet, SNIF, and ANR-17-EURE-0004,UCA DS4H,UCA Systèmes Numériques pour l'Homme(2017)

Subjects
FOS: Computer and information sciences, Random Growth Model, General Computer Science, Twitter, 02 engineering and technology, Poisson distribution, Preferential attachment, Power law, Complex Networks, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], Theoretical Computer Science, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], symbols.namesake, Random Graphs, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Statistical physics, Mathematics, Social and Information Networks (cs.SI), Degree (graph theory), Preferential Attachment, Computer Science - Social and Information Networks, Function (mathematics), Complex network, Heavy-Tailed Distributions, Degree distribution, Degree Distribution, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], symbols, 020201 artificial intelligence & image processing, Node (circuits)
Abstract

The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree distribution. The degree distribution can either be theoretical or extracted from a real-world network. The main idea is to invert the recurrence equation commonly used to compute the degree distribution in order to find a convenient attachment function for node connections - commonly chosen as linear. We compute this attachment function for some classical distributions, as the power-law, broken power-law, geometric and Poisson distributions. We also use the model on an undirected version of the Twitter network, for which the degree distribution has an unusual shape. We finally show that the divergence of chosen attachment functions is heavily links to the heavy-tailed property of the obtained degree distributions., Comment: 23 pages, 3 figures

Published
2023

2. Latency-Aware Strategies for Deploying Data Stream Processing Applications on Large Cloud-Edge Infrastructure

Author

Laurent Lefèvre, Alexandre da Silva Veith, Marcos Dias De Assuncao, Department of Computer Science [University of Toronto] (DCS), University of Toronto, Ecole de Technologie Supérieure [Montréal] (ETS), Algorithms and Software Architectures for Distributed and HPC Platforms (AVALON), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Laboratoire de l'Informatique du Parallélisme (LIP), and Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Computer Networks and Communications, business.industry, Data stream mining, Computer science, 020206 networking & telecommunications, Cloud computing, 02 engineering and technology, Computer Science Applications, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Hardware and Architecture, Scalability, 0202 electrical engineering, electronic engineering, information engineering, Overhead (computing), 020201 artificial intelligence & image processing, The Internet, Enhanced Data Rates for GSM Evolution, Latency (engineering), business, Software, Edge computing, Information Systems, Computer network
Abstract

International audience; Internet of Things (IoT) applications often require the processing of data streams generated by devices dispersed over a large geographical area. Traditionally, these data streams are forwarded to a distant cloud for processing, thus resulting in high application end-to-end latency. Recent work explores the combination of resources located in clouds and at the edges of the Internet, called cloud-edge infrastructure, for deploying Data Stream Processing (DSP) applications. Most previous work, however, fails to scale to very large IoT settings. This paper introduces deployment strategies for the placement of DSP applications on to cloud-edge infrastructure. The strategies split an application graph into regions and consider regions with stringent time requirements for edge placement. The proposed Aggregate End-to-End Latency Strategy with Region Patterns and Latency Awareness (AELS+RP+LA) decreases the number of evaluated resources when computing an operator’s placement by considering the communication overhead across computing resources. Simulation results show that, unlike the state-of-the-art, AELS+RP+LA scales to environments with more than 100k resources with negligible impact on the application end-to-end latency.

Published
2023

3. Sufficient Conditions for Global Integral Action via Incremental Forwarding for Input-Affine Nonlinear Systems

Author

Vincent Andrieu, Daniele Astolfi, Mattia Giaccagli, Lorenzo Marconi, Laboratoire d'automatique, de génie des procédés et de génie pharmaceutique (LAGEPP), Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-École Supérieure Chimie Physique Électronique de Lyon-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), Dept. Of Electrical, Electronic And Information Engineering, University Of Bologna, and University of Bologna

Subjects
0209 industrial biotechnology, Integral action, Affine nonlinear system, 020901 industrial engineering & automation, Control and Systems Engineering, Computer science, Control theory, [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], 02 engineering and technology, Electrical and Electronic Engineering, ComputingMilieux_MISCELLANEOUS, Computer Science Applications
Abstract

International audience

Published
2022

4. A New Belief-Based Incomplete Pattern Unsupervised Classification Method

Author

Zhe Liu, Zuo-Wei Zhang, Ma Zongfang, Hao Wang, Yiru Zhang, Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Xi'an University of Science and Technology, Norwegian University of Science and Technology (NTNU), Declarative & Reliable management of Uncertain, user-generated Interlinked Data (DRUID), GESTION DES DONNÉES ET DE LA CONNAISSANCE (IRISA-D7), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), and Université de Rennes (UR)

Subjects
0209 industrial biotechnology, unsupervised classification, Computer science, 02 engineering and technology, Fuzzy logic, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Task (project management), 020901 industrial engineering & automation, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], belief functions theory, Classifier (linguistics), 0202 electrical engineering, electronic engineering, information engineering, incomplete pattern, Cluster analysis, business.industry, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], Pattern recognition, Missing data, fuzzy c-means, Computer Science Applications, Computational Theory and Mathematics, Classification methods, 020201 artificial intelligence & image processing, Artificial intelligence, business, clustering, Information Systems
Abstract

The clustering of incomplete patterns is a very challenging task because the estimations may negatively affect the distribution of real centers and thus cause uncertainty and imprecision in the results. To address this problem, a new belief-based incomplete pattern unsupervised classification method (BPC) is proposed in this paper. Firstly, the complete patterns are grouped into a few clusters by a classical soft method like fuzzy c-means to obtain the corresponding reliable centers and thereby are partitioned into reliable patterns and unreliable ones by an optimization method. Secondly, a basic classifier trained by reliable patterns is employed to classifies unreliable patterns and the incomplete patterns edited by the neighbors. In this way, most of the edited incomplete patterns can be submitted to specific clusters. Finally, some ambiguous patterns will be carefully repartitioned again by a new distance-based rule depending on the obtained reliable centers and belief functions theory. By doing this, a few patterns that are very difficult to classify between different specific clusters will be reasonably submitted to meta-cluster which can characterize the uncertainty and imprecision of the clusters due to missing values. The simulation results show that the BPC has the potential to deal with real datasets. © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Published
2022

5. Humanitarian aid and local responses: the aftermath of the rebuilding effort on Tongoa island, Vanuatu

Author

Maëlle Calandra, IDEX-ISITE initiative 16-IDEX-0001 CAP 20-25/challenge 4 (CAP 20-25), Laboratoire de psychologie sociale et de psychologie cognitive (LAPSCO), Université Blaise Pascal - Clermont-Ferrand 2 (UBP)-Centre National de la Recherche Scientifique (CNRS), Centre de Recherche et de Documentation sur l'Océanie (CREDO), École des hautes études en sciences sociales (EHESS)-Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-Université Blaise Pascal - Clermont-Ferrand 2 (UBP), and Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-École des hautes études en sciences sociales (EHESS)

Subjects
History, 010504 meteorology & atmospheric sciences, 0211 other engineering and technologies, Context (language use), 02 engineering and technology, 01 natural sciences, Natural hazard, Vernacular architecture, medicine, Humans, Anthropology, Cultural, ComputingMilieux_MISCELLANEOUS, 0105 earth and related environmental sciences, Confusion, 021110 strategic, defence & security studies, geography, geography.geographical_feature_category, Humanitarian aid, business.industry, General Social Sciences, Storm, [SHS.ANTHRO-SE]Humanities and Social Sciences/Social Anthropology and ethnology, Economy, 13. Climate action, Archipelago, Damages, General Earth and Planetary Sciences, medicine.symptom, business
Abstract

Cyclone Pam swept through the archipelago of Vanuatu on 13-14 March 2015, with wind speeds exceeding those recorded anywhere in the South Pacific since the 1980s. Southern and central parts of the country were particularly affected. Material damage on Tongoa, one of the most afflicted islands, was extensive, but no deaths were reported. During the storm, villagers found shelter in their kitchen, in what is considered locally as a 'lifeboat'. The aftermath was managed and mitigated by international aid organisations. On Tongoa, this included a 'Shelter Cluster' programme, under which villagers were given house rebuilding kits. Elaborating upon extensive ethnographic investigations on site between 2011 and 2018, this paper explores and reveals the ways in which this aid generated confusion among the local population. In a larger context of regular disasters triggered by natural hazards, locals have found endogenous ways of dealing with such extreme climatic events, for the most part without any external assistance.في الفترة من 13 إلى 14 مارس 2015 ، اجتاح إعصار بام أرخبيل منطقة فان واتو بسرعات رياح تجاوزت تلك المسجلة في أي مكان في منطقة جنوب المحيط الهادئ منذ الثمانينيات. وقد تأثرت الأجزاء الجنوبية والوسطى من البلاد بشكل خاص. في تونغوا، إحدى الجزر الأكثر تضررًا، كانت الأضرار المادية جسيمة على الرغم من عدم الإبلاغ عن أي حالة وفاة. خلال العاصفة، وجد القرويون المأوى في مطبخهم، والذي اعتبروه محليًا "قوارب نجاة". تمت إدارة تداعيات الكارثة والتخفيف من حدتها من قبل منظمات الإغاثة الدولية. وشمل ذلك في تونغوا برنامج "مجموعة المأوى" حيث تم تزويد القرويين بمجموعات أدوات إعادة بناء المنازل. بالتفصيل في التحقيقات الإثنوغرافية المكثفة في الموقع التي أجريت بين عامي 2011 و 2018 ، تستكشف هذه المقالة وتكشف الطرق التي تسببت بها هذه المساعدة في حدوث ارتباك بين السكان المحليين. في سياق أكبر من الكوارث العادية التي تسببها الأخطار الطبيعية، وجد السكان المحليون طرقًا داخلية للتعامل مع مثل هذه الأحداث المناخية المتطرفة ، في الجزء الأكبر من دون أي مساعدات خارجية - مما يكشف عن ديناميكية المساعدات الإنسانية الكلمات الدالة: إعصار بام ، كارثة ، مساعدات إنسانية ، إعادة بناء ما بعد الكارثة ، تو نغوا ، فان واتو ، العمارة العامية.2015年3月13日-14日，飓风帕姆席卷瓦努阿图群岛，风速超过了自1980年代以来南太平洋地区任何地方的记录。该国南部和中部地区受到的影响尤其严重。汤戈阿是受灾最为严重的岛屿之一，虽然没有死亡报告，但财产损失很大。暴风雨期间，村民们都躲在厨房里避难，厨房被当地人视为是“救生艇”。国际援助组织为这场灾难提供了善后工作和减灾帮助。这包括一项“避难所助建”计划，向村民提供房屋重建工具包。本文详细阐述了2011年至2018年间，在现场进行的大范围民族学调查，探讨并揭示了这种援助对当地人造成混乱的各种情况。对于周期性的自然灾害，当地人在大多数没有任何外界援助的情况下，已经掌握了一些在处理此类极端气候事件的老办法，这也揭示了人道主义援助的动态 关键词：飓风帕姆，灾难，人道主义援助，灾后重建，汤戈阿，瓦努阿图，乡土建筑.

Published
2022

6. Approximation algorithms for replenishment problems with fixed turnover times

Author

Yang Jiao, R. Ravi, Thomas Bosman, Martijn van Ee, Leen Stougie, Alberto Marchetti-Spaccamela, Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands, Vrije Universiteit Amsterdam [Amsterdam] (VU), Tepper School of Business, Carnegie Mellon University [Pittsburgh] (CMU), Università degli Studi di Roma 'La Sapienza' = Sapienza University [Rome] (UNIROMA), Equipe de recherche européenne en algorithmique et biologie formelle et expérimentale (ERABLE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Centrum Wiskunde & Informatica (CWI), University of Amsterdam [Amsterdam] (UvA), Netherlands Defence Academy, Boeing Research and Technology Europe, Laboratoire de Biométrie et Biologie Evolutive - UMR 5558 (LBBE), Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-VetAgro Sup - Institut national d'enseignement supérieur et de recherche en alimentation, santé animale, sciences agronomiques et de l'environnement (VAS)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-VetAgro Sup - Institut national d'enseignement supérieur et de recherche en alimentation, santé animale, sciences agronomiques et de l'environnement (VAS)-Centre National de la Recherche Scientifique (CNRS)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), The research of YJ and RR was supported in part by the U. S. National Science Foundation under award numbers CCF-1527032 and CCF-1655442, and the U. S. Office of Naval Research under award number N00014-18-1-2099. The research of LS was supported by the Netherlands Organisation for Scientific Research (NWO) through the Gravitation Programme Networks (024.002.003), Bender, Michael A., Farach-Colton, Martin, Mosteiro, Miguel A., Econometrics and Operations Research, Tinbergen Institute, Amsterdam Business Research Institute, Università degli Studi di Roma 'La Sapienza' = Sapienza University [Rome], and Operations Analytics

Subjects
FOS: Computer and information sciences, Schedule, Mathematical optimization, Optimization problem, Computational complexity theory, General Computer Science, Computer science, 0211 other engineering and technologies, Time horizon, G.2.2, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Traveling salesman, Computer Science - Data Structures and Algorithms, Inventory routing, Data Structures and Algorithms (cs.DS), [INFO]Computer Science [cs], Approximation algorithms, F.2.2, 021103 operations research, Applied Mathematics, Approximation algorithm, SDG 8 - Decent Work and Economic Growth, Pinwheel scheduling, Computer Science Applications, Periodic maintenance, 010201 computation theory & mathematics, Replenishment problem, Node (circuits), Routing (electronic design automation), Constant (mathematics)
Abstract

We introduce and study a class of optimization problems we call replenishment problems with fixed turnover times: a very natural model that has received little attention in the literature. Clients with capacity for storing a certain commodity are located at various places; at each client the commodity depletes within a certain time, the turnover time, which is constant but can vary between locations. Clients should never run empty. The natural feature that makes this problem interesting is that we may schedule a replenishment (well) before a client becomes empty, but then the next replenishment will be due earlier also. This added workload needs to be balanced against the cost of routing vehicles to do the replenishments. In this paper, we focus on the aspect of minimizing routing costs. However, the framework of recurring tasks, in which the next job of a task must be done within a fixed amount of time after the previous one is much more general and gives an adequate model for many practical situations. Note that our problem has an infinite time horizon. However, it can be fully characterized by a compact input, containing only the location of each client and a turnover time. This makes determining its computational complexity highly challenging and indeed it remains essentially unresolved. We study the problem for two objectives: min–avg minimizes the average tour cost and min–max minimizes the maximum tour cost over all days. For min–max we derive a logarithmic factor approximation for the problem on general metrics and a 6-approximation for the problem on trees, for which we have a proof of NP-hardness. For min–avg we present a logarithmic factor approximation on general metrics, a 2-approximation for trees, and a pseudopolynomial time algorithm for the line. Many intriguing problems remain open.

Published
2022

7. Do You Believe Your (Social Media) Data? A Personal Story on Location Data Biases, Errors, and Plausibility as Well as Their Visualization

Author

Tobias Isenberg, Zujany Salazar, Rafael Blanco, Catherine Plaisant, Analysis and Visualization (AVIZ), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Interaction avec l'Humain (IaH), Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Télécom SudParis (TSP), University of Maryland [Baltimore], CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Interaction avec l'Humain (IaH), and CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)

Subjects
iNaturalist, Data obfuscation, [SCCO.COMP]Cognitive science/Computer science, 020207 software engineering, 02 engineering and technology, Data error, Citizen science, Computer Graphics and Computer-Aided Design, Social media data, Bias, Signal Processing, Computer Graphics, 0202 electrical engineering, electronic engineering, information engineering, Humans, Data bias, Panoramio, Computer Vision and Pattern Recognition, Flickr, Social Media, Data plausibility, Software
Abstract

We present a case study on a journey about a personal data collection of carnivorous plant species habitats, and the resulting scientific exploration of location data biases, data errors, location hiding, and data plausibility. While initially driven by personal interest, our work led to the analysis and development of various means for visualizing threats to insight from geo-tagged social media data. In the course of this endeavor we analyzed local and global geographic distributions and their inaccuracies. We also contribute Motion Plausibility Profiles-a new means for visualizing how believable a specific contributor's location data is or if it was likely manipulated. We then compared our own repurposed social media dataset with data from a dedicated citizen science project. Compared to biases and errors in the literature on traditional citizen science data, with our visualizations we could also identify some new types or show new aspects for known ones. Moreover, we demonstrate several types of errors and biases for repurposed social media data. Please note that people with color impairments may consider our alternative paper version.

Published
2022

8. Nonatomic aggregative games with infinitely many types

Author

Paulin Jacquot, Cheng Wan, Centre de Mathématiques Appliquées - Ecole Polytechnique (CMAP), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), TROPICAL (TROPICAL), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Optimisation, Simulation, Risque et Statistiques pour les Marchés de l’Energie (EDF R&D OSIRIS), EDF R&D (EDF R&D), and EDF (EDF)-EDF (EDF)

Subjects
FOS: Computer and information sciences, TheoryofComputation_MISCELLANEOUS, Computer Science::Computer Science and Game Theory, Information Systems and Management, General Computer Science, media_common.quotation_subject, 0211 other engineering and technologies, Monotonic function, 02 engineering and technology, Management Science and Operations Research, generalized variational inequality, Industrial and Manufacturing Engineering, nonatomic aggregative game, Computer Science - Computer Science and Game Theory, 0502 economics and business, Convergence (routing), FOS: Mathematics, 050207 economics, Mathematics - Optimization and Control, Finite set, Parametric statistics, Mathematics, media_common, Sequence, 021103 operations research, 05 social sciences, ComputingMilieux_PERSONALCOMPUTING, TheoryofComputation_GENERAL, Coupling (probability), Infinity, Optimization and Control (math.OC), variational equilibrium, Modeling and Simulation, Variational inequality, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], coupling aggregative constraints, Mathematical economics, monotone game, Computer Science and Game Theory (cs.GT)
Abstract

We define and analyze the notion of variational Wardrop equilibrium for nonatomic aggregative games with an infinity of players types. These equilibria are characterized through an infinite-dimensional variational inequality. We show, under monotonicity conditions, a convergence theorem enables to approximate such an equilibrium with arbitrary precision. To this end, we introduce a sequence of nonatomic games with a finite number of players types, which approximates the initial game. We show the existence of a symmetric Wardrop equilibrium in each of these games. We prove that those symmetric equilibria converge to an equilibrium of the infinite game, and that they can be computed as solutions of finite-dimensional variational inequalities. The model is illustrated through an example from smart grids: the description of a large population of electricity consumers by a parametric distribution gives a nonatomic game with an infinity of different players types, with actions subject to coupling constraints., arXiv admin note: substantial text overlap with arXiv:1806.06230

Published
2022

9. Mesh Denoising With Facet Graph Convolutions

Author

Edmond Boyer, Matthieu Armando, Jean-Sébastien Franco, Capture and Analysis of Shapes in Motion (MORPHEO), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Kuntzmann (LJK), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Institut National de Recherche en Informatique et en Automatique (Inria), MSR-Inria, and ANR-19-P3IA-0003,MIAI,MIAI @ Grenoble Alpes(2019)

Subjects
Computer science, Noise reduction, Mesh denoising, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], 020207 software engineering, 02 engineering and technology, [INFO.INFO-NE]Computer Science [cs]/Neural and Evolutionary Computing [cs.NE], Geometric deep learning, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], Computer Graphics and Computer-Aided Design, Graph, Vertex (geometry), Convolution, Feature preserving, Normal filtering, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Signal Processing, 0202 electrical engineering, electronic engineering, information engineering, Polygon mesh, Computer Vision and Pattern Recognition, Algorithm, Graph convolutions, Software, ComputingMethodologies_COMPUTERGRAPHICS
Abstract

code available at the following address:https://gitlab.inria.fr/marmando/deep-mesh-denoizing; International audience; We examine the problem of mesh denoising, which consists of removing noise from corrupted 3D meshes while preserving existing geometric features. Most mesh denoising methods require a lot of mesh-specific parameter fine-tuning, to account for specific features and noise types. In recent years, data-driven methods have demonstrated their robustness and effectiveness with respect to noise and feature properties on a wide variety of geometry and image problems. Most existing mesh denoising methods still use hand-crafted features, and locally denoise facets rather than examine the mesh globally. In this work, we propose the use of a fully end-to-end learning strategy based on graph convolutions, where meaningful features are learned directly by our network. It operates on a graph of facets, directly on the existing topology of the mesh, without resampling, and follows a multi-scale design to extract geometric features at different resolution levels. Similar to most recent pipelines, given a noisy mesh, we first denoise face normals with our novel approach, then update vertex positions accordingly. Our method performs significantly better than the current state-of-the-art learning-based methods. Additionally, we show that it can be trained on noisy data, without explicit correspondence between noisy and ground-truth facets. We also propose a multi-scale denoising strategy, better suited to correct noise with a low spatial frequency.

Published
2022

10. Stochastic String Stability of Vehicle Platoons via Cooperative Adaptive Cruise Control With Lossy Communication

Author

Geert Heijenk, Anton A. Stoorvogel, Paolo Frasca, Francesco Acciani, Department of Applied Mathematics [Twente], University of Twente [Netherlands], Dynamics and Control of Networks (DANCE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-GIPSA Pôle Automatique et Diagnostic (GIPSA-PAD), Grenoble Images Parole Signal Automatique (GIPSA-lab), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Grenoble Alpes (UGA), Digital Society Institute, Design and Analysis of Communication Systems, Hybrid Systems, and University of Twente

Subjects
Stability criteria, Computer science, Autonomous vehicles, Systems and Control (eess.SY), 02 engineering and technology, Vehicle dynamics, Lossy compression, Stability (probability), string stability, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Stochastic processes, Control theory, 0502 economics and business, FOS: Electrical engineering, electronic engineering, information engineering, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Propagation losses, Delays, Mathematics - Optimization and Control, Automatic control, 050210 logistics & transportation, Packet loss, Mechanical Engineering, 05 social sciences, String (computer science), 22/2 OA procedure, Variance (accounting), Computer Science Applications, Vehicle platooning, Cooperative Adaptive Cruise Control, Optimization and Control (math.OC), Cruise control, Automotive Engineering, Computer Science - Systems and Control, 020201 artificial intelligence & image processing, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
Abstract

This paper is about obtaining stable vehicle platooning by using Cooperative Adaptive Cruise Control when the communication is unreliable and suffers from message losses. We model communication losses as independent random events and we propose an original design for the cooperative controller, which mitigates the effect of losses. This objective is obtained by a switching controller that has a twofold objective: on the one hand, it promotes both plant stability and string stability of the average error dynamics by an $H_infty$ approach, and on the other hand it minimizes the variance around the average. We show by simulations that the proposed controller is able to compensate even for high probability of losses., Comment: 10 pages, 7 figures; submitted to journal

Published
2022

11. BiSuT: A NoC-Based Bit-Shuffling Technique for Multiple Permanent Faults Mitigation

Author

Daniel Chillet, Romain Mercier, Youri Helen, Angeliki Kritikakou, Cedric Killian, Architectures matérielles spécialisées pour l’ère post loi-de-Moore (TARAN), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-ARCHITECTURE (IRISA-D3), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Centre Electronique de l'Armement [Bruz] (CELAR / DGA), Ministère de la Défense, Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and ANR-18-CE25-0006,SHNoC,SHNoC : un réseau embarqué sur puce multi-technologies et sûr de fonctionnement(2018)

Subjects
[INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR], Shuffling, Exploit, Computer science, business.industry, Transistor, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.1: Network Architecture and Design, Fault tolerance, Hardware_PERFORMANCEANDRELIABILITY, 02 engineering and technology, Computer Graphics and Computer-Aided Design, Field (computer science), 020202 computer hardware & architecture, law.invention, Bit (horse), law, Embedded system, 0202 electrical engineering, electronic engineering, information engineering, Electrical and Electronic Engineering, business, Hamming code, Software
Abstract

International audience; Since several decades, fault tolerance has become a major research field due to transistor shrinking and core number increasing in System-on-Chip (SoC). Especially, faults occurring to Network-on-Chips (NoCs) of those systems have a significant impact, due to the high amount of data, crossing the NoC, for the communication among Intellectual Properties (IPs). Furthermore, existing fault tolerant approaches cannot efficiently deal with several permanent faults, which occur in NoC routers. To address these limitations, we propose the Bit Shuffling meThod (BiSuT) for fault tolerant NoCs that reduces the impact of faults on data communications. To achieve that, the proposed approach exploits, at run-time, the position of permanent faults and changes the order of bits inside a flit. Our method reduces, as much as possible, the impact of faults by transferring the faults on Least Significant Bits (LSBs), instead of keeping them on Most Significant Bits (MSBs). The results obtained by extensive evaluations show that BiSuT can reduce the impact of multiple permanent faults, with low hardware costs, compared to existing approaches, like Hamming code.

Published
2022

12. Yet Another Computation-Oriented Necessary and Sufficient Condition for Stabilizability of Switched Linear Systems

Author

Mirko Fiacchini, GIPSA - Modelling and Optimal Decision for Uncertain Systems (GIPSA-MODUS), GIPSA Pôle Automatique et Diagnostic (GIPSA-PAD), Grenoble Images Parole Signal Automatique (GIPSA-lab), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Grenoble Alpes (UGA), and ANR-18-CE40-0010,HANDY,Systèmes Dynamiques Hybrides et en Réseau(2018)

Subjects
Switched linear systems, 020301 aerospace & aeronautics, 0209 industrial biotechnology, convex analysis, Computation, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], Linear system, Mathematics::Optimization and Control, Regular polygon, stabilizability, 02 engineering and technology, Space (mathematics), [SPI.AUTO]Engineering Sciences [physics]/Automatic, Computer Science Applications, Exponential convergence rate, 020901 industrial engineering & automation, 0203 mechanical engineering, Cover (topology), Computer Science::Systems and Control, Control and Systems Engineering, Conic section, Applied mathematics, Partition (number theory), Electrical and Electronic Engineering, Mathematics
Abstract

International audience; This paper presents a computational method to test the stabilizability of discrete-time switched linear systems. The existence of a conic cover of the space on whose elements a convex condition holds is proved to be necessary and sufficient for stabilizability. An algorithm for computing a conic partition that satisfies the new necessary and sufficient condition is given. The algorithm, that allows also to determine bounds on the exponential convergence rate, is proved to overcome the conservatism of conditions equivalent to periodic stabilizability and is applied to a four dimensional system.

Published
2022

13. Partial Extended Observability Certification and Optimal Design of Moving-Horizon Estimators

Author

Mazen Alamir, GIPSA - Modelling and Optimal Decision for Uncertain Systems (GIPSA-MODUS), GIPSA Pôle Automatique et Diagnostic (GIPSA-PAD), Grenoble Images Parole Signal Automatique (GIPSA-lab), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Grenoble Images Parole Signal Automatique (GIPSA-lab), and Université Grenoble Alpes (UGA)

Subjects
Optimal design, 020301 aerospace & aeronautics, 0209 industrial biotechnology, Observation target, Computer science, Horizon, Certification via randomized optimization, Estimator, 02 engineering and technology, Certification, State (functional analysis), Partial Observability, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Computer Science Applications, 020901 industrial engineering & automation, 0203 mechanical engineering, Control and Systems Engineering, Moving-Horizon Estimation, A priori and a posteriori, Applied mathematics, Observability, Electrical and Electronic Engineering, Nonlinear Systems, Parametric statistics
Abstract

International audience; This paper addresses the observability analysis and the optimal design of observation parameters in the presence of noisy measurements and parametric uncertainties. The notion of almost !-observability is introduced and a systematic procedure to assess its satisfaction for a given system with a priori known measurement noise statistics and parameter discrepancy is sketched. Moreover, the concept of observation-target quantities is introduced in order to analyze the precision with which specific chosen expressions of the state and the parameters can be reconstructed. The overall framework is exposed and validated through an illustrative example.

Published
2022

14. Scheduled service network design with revenue management considerations and an intermodal barge transportation illustration

Author

Teodor Gabriel Crainic, Ioana-Codruta Bilegan, Yunfei Wang, Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201 (LAMIH), Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-INSA Institut National des Sciences Appliquées Hauts-de-France (INSA Hauts-De-France), and Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Centre National de la Recherche Scientifique (CNRS)-INSA Institut National des Sciences Appliquées Hauts-de-France (INSA Hauts-De-France)

Subjects
Information Systems and Management, General Computer Science, Operations research, Computer science, 0211 other engineering and technologies, Tariff, Transportation, 02 engineering and technology, Management Science and Operations Research, Network topology, Industrial and Manufacturing Engineering, Resource (project management), 0502 economics and business, [INFO]Computer Science [cs], Resource management, Service (business), 050210 logistics & transportation, 021103 operations research, Revenue management, 05 social sciences, Schedule (project management), Network planning and design, Consolidation-based intermodal barge transport, Scheduled service network design, Modeling and Simulation, Barge transport
Abstract

International audience; The objective of the paper is to study the integration of revenue management considerations into service network design models targeting the tactical planning of intermodal consolidation-based freight transportation carriers. Revenue management strategies and mechanisms are broadly used within passenger transportation. Although identified as a desirable feature for freight transportation, interest growing within the industry, few contributions have addressed the topic. Moreover, almost none of those target the challenging issue of the interactions between the planning of the carrier’s services and operations, on the one hand, and the revenue-management strategy it could implement, on the other hand. We propose a new scheduled service network design model with resource and revenue management model, which selects the services and schedule to be repeatedly operated over the next season, allocates and routes the main resources supporting the selected services, and routes the demand flows between their respective origins and destinations. The objective of the model is the maximization of the expected net revenue of the carrier when several customer categories, with specific service requirements, as well as several tariff and operation classes are considered. Our interest goes beyond the modeling challenges raised by the problem setting, to exploring the impacts of this new approach on the decision types and on the structure of the service network solutions obtained. The results of extensive experiments, in terms of demand distribution, network topology, fare class and quality-of-service, provide a proof of concept of the proposed modeling framework and its capability for insightful analyses. Experimentation was conducted using an off-the-shelf software to solve the corresponding mixed-integer linear programming formulation for realistically dimensioned barge intermodal transportation instances.

Published
2022

15. Black-Box Optimization Revisited: Improving Algorithm Selection Wizards Through Massive Benchmarking

Author

Laurent Meunier, Paco Wong, Jeremy Rapin, Antoine Moreau, Olivier Teytaud, Carola Doerr, Baptiste Roziere, Herilalaina Rakotoarison, Facebook AI Research [Paris] (FAIR), Facebook, Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), TAckling the Underspecified (TAU), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), The Chinese University of Hong Kong [Hong Kong], Université Clermont Auvergne (UCA), SIGMA Clermont (SIGMA Clermont), Institut Pascal (IP), Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), Recherche Opérationnelle (RO), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), and Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)

Subjects
FOS: Computer and information sciences, Computer Science - Machine Learning, Optimization problem, Computer science, 02 engineering and technology, Overfitting, Machine learning, computer.software_genre, Machine Learning (cs.LG), [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Theoretical Computer Science, [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], Black box, 0202 electrical engineering, electronic engineering, information engineering, business.industry, Black-Box Optimization, Suite, Benchmarking, Wizard, Range (mathematics), Computational Theory and Mathematics, Benchmark (computing), 020201 artificial intelligence & image processing, Artificial intelligence, business, computer, Software
Abstract

International audience; Existing studies in black-box optimization for machine learning suffer from low generalizability, caused by a typically selective choice of problem instances used for training and testing different optimization algorithms. Among other issues, this practice promotes overfitting and poor-performing user guidelines. To address this shortcoming, we propose in this work a benchmark suite, OptimSuite, which covers a broad range of black-box optimization problems, ranging from academic benchmarks to real-world applications, from discrete over numerical to mixed-integer problems, from small to very large-scale problems, from noisy over dynamic to static problems, etc. We demonstrate the advantages of such a broad collection by deriving from it Automated Black Box Optimizer (ABBO), a general-purpose algorithm selection wizard. Using three different types of algorithm selection techniques, ABBO achieves competitive performance on all benchmark suites. It significantly outperforms previous state of the art on some of them, including YABBOB and LSGO. ABBO relies on many high-quality base components. Its excellent performance is obtained without any task-specific parametrization. The OptimSuite benchmark collection, the ABBO wizard and its base solvers have all been merged into the open-source Nevergrad platform, where they are available for reproducible research.

Published
2022

16. Robust Output Feedback MPC for LPV Systems Using Interval Observers

Author

Alex dos Reis de Souza, Tarek Raïssi, Denis Efimov, Finite-time control and estimation for distributed systems (VALSE), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Centre d'études et de recherche en informatique et communications (CEDRIC), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM), and This work was partially supported by the IPL COSY, and by the Ministry of Science and Higher Education of Russian Federation, passport of goszadanie n° 2019-0898.

Subjects
0209 industrial biotechnology, output feedback, Observer (quantum physics), Computer science, Stability (learning theory), 02 engineering and technology, Interval (mathematics), Constraint satisfaction, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Computer Science Applications, Model predictive control, 020901 industrial engineering & automation, Control and Systems Engineering, Control theory, Bounded function, Predictive control, Electrical and Electronic Engineering, Robust control, robust control
Abstract

International audience; This work addresses the problem of robust output feedback model predictive control for discrete-time, constrained, linear parameter-varying systems subject to (bounded) state and measurement disturbances. The vector of scheduling parameters is assumed to be an unmeasurable signal taking values in a given compact set. The proposed controller incorporates an interval observer, that uses the available measurement to update the setmembership estimation of the states, and an interval predictor, used in the prediction step of the MPC algorithm. The resulting MPC scheme offers guarantees on recursive feasibility, constraint satisfaction, and input-to-state stability in the terminal set. Furthermore, this novel algorithm shows low computation complexity and ease of implementation (similar to conventional MPC schemes).

Published
2022

17. Dynamic Ride-Hailing with Electric Vehicles

Author

Martin Cousineau, Jorge E. Mendoza, Justin C. Goodson, Nicholas Kullman, Recherche Opérationnelle, Ordonnancement, Transport ERL 7002 (ROOT), Laboratoire d'Informatique Fondamentale et Appliquée de Tours (LIFAT), Université de Tours-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université de Tours-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Université de Tours (UT)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université de Tours (UT)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL)

Subjects
Service (business), 050210 logistics & transportation, 021103 operations research, Profit (accounting), Artificial neural network, Operations research, Computer science, 05 social sciences, 0211 other engineering and technologies, Transportation, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 02 engineering and technology, Operator (computer programming), 0502 economics and business, Civil and Structural Engineering
Abstract

International audience; We consider the problem of an operator controlling a fleet of electric vehicles for use in a ride-hailing service. The operator, seeking to maximize profit, must assign vehicles to requests as they arise as well as recharge and reposition vehicles in anticipation of future requests. To solve this problem, we employ deep reinforcement learning, developing policies whose decision making uses [Formula: see text]-value approximations learned by deep neural networks. We compare these policies against a reoptimization-based policy and against dual bounds on the value of an optimal policy, including the value of an optimal policy with perfect information, which we establish using a Benders-based decomposition. We assess performance on instances derived from real data for the island of Manhattan in New York City. We find that, across instances of varying size, our best policy trained with deep reinforcement learning outperforms the reoptimization approach. We also provide evidence that this policy may be effectively scaled and deployed on larger instances without retraining.

Published
2022

18. Theoretical Performance of LoRa System in Multipath and Interference Channels

Author

Philippe Rostaing, Roland Gautier, Clément Demeslay, Equipe Security, Intelligence and Integrity of Information (Lab-STICC_SI3), Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), Institut Mines-Télécom [Paris] (IMT)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-Institut Mines-Télécom [Paris] (IMT)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), and Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)

Subjects
Signal Processing (eess.SP), Computer Networks and Communications, Computer science, Monte Carlo method, 02 engineering and technology, Interference (wave propagation), Discrete Fourier transform, LoRa interference, symbols.namesake, LoRa waveform, FOS: Electrical engineering, electronic engineering, information engineering, 0202 electrical engineering, electronic engineering, information engineering, Waveform, Fading, Electrical Engineering and Systems Science - Signal Processing, performance analysis, Computer Science::Information Theory, Detector, 020206 networking & telecommunications, Computer Science Applications, multi-path channel, Additive white Gaussian noise, Hardware and Architecture, Signal Processing, symbols, 020201 artificial intelligence & image processing, chirp modulation, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Algorithm, Information Systems, Communication channel
Abstract

International audience; This paper presents a semi-analytical approximation of Symbol Error Rate (SER) for the well known LoRa Internet of Things (IoT) modulation scheme in the following two scenarios: 1) in multi-path frequency selective fading channel with Additive White Gaussian Noise (AW GN) and 2) in the presence of a second interfering LoRa user in flat-fading AW GN channel. Performances for both coherent and non-coherent cases are derived by considering the common Discrete Fourier transform (DF T) based detector on the received LoRa waveform. By considering these two scenarios, the detector exhibits parasitic peaks that severely degrade the performance of the LoRa receiver. We propose in that sense a theoretical expression for this result, from which a unified framework based on peak detection probabilities allows us to derive SER, which is validated by Monte Carlo simulations. Fast computation of the derived closedform SER allows to carry out deep performance analysis for these two scenarios.

Published
2022

19. Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem

Author

Halil Şen, Rodolphe Griset, François Vanderbeck, Boris Detienne, Marc Porcheron, Pascale Bendotti, Optimisation, Simulation, Risque et Statistiques pour les Marchés de l’Energie (EDF R&D OSIRIS), EDF R&D (EDF R&D), EDF (EDF)-EDF (EDF), Reformulations based algorithms for Combinatorial Optimization (Realopt), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS), RealOpt, Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS), Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation (EDGE), and Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest

Subjects
Mathematical optimization, Information Systems and Management, General Computer Science, Computer science, Benders decomposition, 020209 energy, 0211 other engineering and technologies, ComputerApplications_COMPUTERSINOTHERSYSTEMS, 02 engineering and technology, Management Science and Operations Research, Benders' decomposition, Electricity demand, 7. Clean energy, Industrial and Manufacturing Engineering, Dantzig-Wolfe decomposition, 0202 electrical engineering, electronic engineering, information engineering, Decomposition (computer science), Production (economics), 021103 operations research, business.industry, Scale (chemistry), Nuclear outage scheduling, Integer programming, OR in energy, Modeling and Simulation, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Electricity, business
Abstract

International audience; Optimizing nuclear unit outages is of significant economic importance for the French electricity company EDF, as these outages induce a substitute production by other more expensive means to fulfill electricity demand. This problem is quite challenging given the specific operating constraints of nuclear units, the stochasticity of both the demand and non-nuclear units availability, and the scale of the instances. To tackle these difficulties we use a combined decomposition approach. The operating constraints of the nuclear units are built into a Dantzig-Wolfe pricing subproblem whose solutions define the columns of a demand covering formulation. The scenarios of demand and non-nuclear units availability are handled in a Benders decomposition. Our approach is shown to scale up to the real-life instances of the French nuclear fleet.

Published
2022

20. Modeling In-Flight Ice Accretion Under Uncertain Conditions

Author

Alberto Guardone, Tommaso Bellosta, Giulio Gori, Olivier Le Maitre, Pietro Marco Congedo, Uncertainty Quantification in Scientific Computing and Engineering (PLATON), Centre de Mathématiques Appliquées - Ecole Polytechnique (CMAP), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Dipartimento di Scienze e Tecnologie Aerospaziali [Milano] (DAER), Politecnico di Milano [Milan] (POLIMI), European Project: 722734,H2020 Pilier Excellent Science,H2020-MSCA-ITN-2016,UTOPIAE(2017), and European Project: 824310,H2020,H2020-MG-2018-SingleStage-INEA,ICE GENESIS(2020)

Subjects
[PHYS.PHYS.PHYS-FLU-DYN]Physics [physics]/Physics [physics]/Fluid Dynamics [physics.flu-dyn], 020301 aerospace & aeronautics, Aerospace Engineering, 02 engineering and technology, Geophysics, Ice accretion, 01 natural sciences, Physics::Geophysics, 010305 fluids & plasmas, 0203 mechanical engineering, 0103 physical sciences, Astrophysics::Earth and Planetary Astrophysics, ComputingMilieux_MISCELLANEOUS, Physics::Atmospheric and Oceanic Physics, Geology, Parametric statistics, Icing
Abstract

International audience; In-flight ice accretion under parametric uncertainty is investigated. Three test cases are presented which reproduce experiments carried out at the NASA's Glenn Icing Research Tunnel (IRT) facility. A preliminary accuracy assessment, achieved comparing numerical predictions against experimental observations, confirm the robustness and the predictiveness of the computerized icing model. Besides, sensitivity analyses highlight the variance of the targeted outputs with respect to the different uncertain inputs. In rime icing conditions, a predominant role is played by the uncertainty affecting the airfoil angle of attack, the cloud liquid water content and the droplets’ mean volume diameter. In glaze icing condition, the sensitivity analysis shows instead that the output variability is due mainly to the ambient temperature uncertainty. Results expose a major criticality of standard uncertainty quantification techniques. The issue is inherent the approximation of the full icing model behavior in domain regions scarcely affected by ice build up. To mitigate the issue, a non-linear regression method is proposed and applied.

Published
2022

21. Diagnosability of Event Patterns in Safe Labeled Time Petri Nets: A Model-Checking Approach

Author

Audine Subias, Yannick Pencolé, Équipe DIagnostic, Supervision et COnduite (LAAS-DISCO), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, and Institut National des Sciences Appliquées (INSA)

Subjects
Model checking, Single fault, Theoretical computer science, Pattern, Property (programming), Computer science, Specific time, Time Petri nets, 020206 networking & telecommunications, 02 engineering and technology, Petri net, Fault Diagnosis, Diagnosability, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Control and Systems Engineering, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, 020201 artificial intelligence & image processing, Discrete Event Systems (DES), Electrical and Electronic Engineering, Event (probability theory)
Abstract

International audience; Checking the diagnosability of a time discrete event system usually consists in determining whether a single fault event can always be identified with certainty after a finite amount of time. The aim of this paper is to extend this type of analysis to more complex behaviors, called event patterns, and to propose an effective method to check diagnosability with the use of modelchecking techniques. To do so, we propose to convert the pattern diagnosability problem into checking a linear-time property over a specific time Petri net. Note to Practitioners-This paper is motivated by the problem of improving the monitoring and the supervision of systems like automated and robotised manufacturing systems. Based on a model of the system, the paper proposes a method to assert with certainty whether the available set of sensors will always provide enough information to ensure that a complex and unexpected behavior has not happened in the system. The proposed method uses a publicly available model-checking tool to perform this analysis.

Published
2022

22. Antenna Radiation Efficiency Estimation From Backscattering Measurement Performed Within Reverberation Chambers

Author

Wafa Krouka, Francois Sarrazin, Julien de Rosny, Adnane Labdouni, Elodie Richalot, Electronique, Systèmes de communication et Microsystèmes (ESYCOM), Conservatoire National des Arts et Métiers [CNAM] (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, Institut Langevin - Ondes et Images (UMR7587) (IL), Ecole Superieure de Physique et de Chimie Industrielles de la Ville de Paris (ESPCI Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP)

Subjects
contactless measurement, backscattering measurement, FOS: Physical sciences, quality factor, 020206 networking & telecommunications, Applied Physics (physics.app-ph), Physics - Applied Physics, 02 engineering and technology, Condensed Matter Physics, reverberation chamber, Atomic and Molecular Physics, and Optics, [SPI.ELEC]Engineering Sciences [physics]/Electromagnetism, Antenna radiation efficiency, 0202 electrical engineering, electronic engineering, information engineering, Electrical and Electronic Engineering
Abstract

This paper presents a contactless measurement method for antenna radiation efficiency estimation within reverberation chambers (RCs). This method does not require to connect any analyzer to the antenna under test (AUT). The AUT radiation efficiency is obtained from the differential measurement of the RC composite $Q$-factor estimated for two AUT load conditions, namely an open circuit and a \SI[detect-weight]{50}{\ohm} load. Remotely-controlled RF switches are used in order to keep the setup identical for both measurements. The method is experimentally validated in two RCs of different volumes (1~m$^3$ and 19~m$^3$) with a wideband patch antenna in the 1.8~GHz to 2.8~GHz frequency range. The estimated efficiency is found to be in very good agreement with the one obtained through a conventional invasive RC measurement technique. This new method is suitable for miniature and buried antenna characterization without access to its port.

Published
2022

23. Hybrid renewable energy systems based on micro-cogeneration

Author

MONICA SIROUX, Sonja Kallio, Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)-École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Réseau nanophotonique et optique, Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Matériaux et nanosciences d'Alsace (FMNGE), Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, and Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)

Subjects
060102 archaeology, Microgrid energy management, 020209 energy, 06 humanities and the arts, 02 engineering and technology, Sciences de l'ingénieur [physics]/Génie civil, 7. Clean energy, Energy conversion, Renewable energy sources, Hybrid renewable energy systems, TK1-9971, [SPI.GCIV]Engineering Sciences [physics]/Civil Engineering, General Energy, Solar energy, 13. Climate action, 0202 electrical engineering, electronic engineering, information engineering, 0601 history and archaeology, Electrical engineering. Electronics. Nuclear engineering, Micro-cogeneration
Abstract

Hybrid renewable energy systems (HRES) are seeing as a solution to overcome the fluctuation and randomness of certain renewable energy sources, such as solar and wind power. Coupling the fluctuating renewable energy sources with the controllable sources, such as biomass-fueled micro-cogeneration, constitute an HRES that significantly reduces CO2 emissions and primary energy consumption. The purpose of this work is to review research works on hybrid renewable energy systems based on micro-cogeneration and to present a case study of optimizing a solar-based micro-cogeneration system. First, renewable energy-fueled micro-cogeneration systems are presented according to the prime mover technology: Stirling engine, organic Rankine cycle and photovoltaic-thermal (PVT). The different prime movers are assessed according to their advantages, disadvantages and market availability. Next, several research works on hybrid renewable energy systems including solar and micro-cogeneration technologies are summarized and key findings are highlighted. Finally, the results of the case study are presented for reasoning the necessity of system hybridization. The results indicated that more experimental data on HRES and research effort on energy management strategies and stochastic optimization models are required. The results of the case study showed maximum thermal and electrical reliability of 68% and 70%, respectively. The optimized PVT/battery/thermal storage system was not able to cover all energy demand of the case study but supporting heat and electricity sources are required.

Published
2022

24. Scheduling with a processing time oracle

Author

Fanny Dufossé, Christoph Dürr, Noël Nadal, Denis Trystram, Óscar C. Vásquez, Data Aware Large Scale Computing (DATAMOVE ), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Recherche Opérationnelle (RO), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Universidad de Santiago de Chile [Santiago] (USACH), ANR-18-CE25-0008,Energumen,Optimiser l'énergie des plates-formes de calcul à large échelle(2018), ANR-19-CE48-0016,AlgoriDAM,Théorie algorithmique de nouveaux modèles de données(2019), and ANR-19-P3IA-0003,MIAI,MIAI @ Grenoble Alpes(2019)

Subjects
FOS: Computer and information sciences, 021103 operations research, Scheduling, Processing time oracle, Applied Mathematics, Uncertainty, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Competitive ratio, 010201 computation theory & mathematics, Modeling and Simulation, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), [MATH]Mathematics [math]
Abstract

International audience; In this paper we study a single machine scheduling problem with the objective of minimizing the sum of completion times. Each of the given jobs is either short or long. However the processing times are initially hidden to the algorithm, but can be tested. This is done by executing a processing time oracle, which reveals the processing time of a given job. Each test occupies a time unit in the schedule, therefore the algorithm must decide for which jobs it will call the processing time oracle. The objective value of the resulting schedule is compared with the objective value of an optimal schedule, which is computed using full information. The resulting competitive ratio measures the price of hidden processing times, and the goal is to design an algorithm with minimal competitive ratio. Two models are studied in this paper. In the non-adaptive model, the algorithm needs to decide beforehand which jobs to test, and which jobs to execute untested. However in the adaptive model, the algorithm can make these decisions adaptively depending on the outcomes of the job tests. In both models we provide optimal polynomial time algorithms following a two-phase strategy, which consist of a first phase where jobs are tested, and a second phase where jobs are executed obliviously. Experiments give strong evidence that optimal algorithms have this structure. Proving this property is left as an open problem

Published
2022

25. Optimizing subscriber migrations for a telecommunication operator in uncertain context

Author

Adrien Cambier, Adam Ouorou, Matthieu Chardy, Michael Poss, Rosa Figueiredo, Orange Labs [Chatillon], Orange Labs, Laboratoire Informatique d'Avignon (LIA), Centre d'Enseignement et de Recherche en Informatique - CERI-Avignon Université (AU), Orange Labs [Issy les Moulineaux], France Télécom, Méthodes Algorithmes pour l'Ordonnancement et les Réseaux (MAORE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI, and Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Mixed-Integer Linear Programming, Information Systems and Management, General Computer Science, Computer science, 0211 other engineering and technologies, Robust Optimization, Polytope, 02 engineering and technology, Management Science and Operations Research, Robust optimization problem, Industrial and Manufacturing Engineering, Through-the-lens metering, 0502 economics and business, [INFO]Computer Science [cs], OR in telecommunications, [MATH]Mathematics [math], 050210 logistics & transportation, 021103 operations research, business.industry, 05 social sciences, Capacity Expansion, Robust optimization, Bass model, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Modeling and Simulation, Scalability, Telecommunications, business
Abstract

Preprint submitted to EJOR; We consider a telecommunications company expanding its network capacity to face an increasing demand. The company can also invest in marketing to incentivize clients to shift to more recent technologies, hopefully leading to cheaper overall costs. To model the effect of marketing campaigns, previous works have relied on the Bass model. Since that model only provides a rough approximation of the actual shifting mechanism, the purpose of this work is to consider uncertainty in the shifting mechanism through the lens of robust optimization. We thus assume that the (discrete) shifting function can take any value in a given polytope and wish to optimize against the worst-case realization. The resulting robust optimization problem possesses integer recourse variables and non-linear dependencies on the uncertain parameters. We address these difficulties as follows. First, the integer recourse is tackled heuristically through a piece-wise constant policy dictated by a prior partition of the uncertainty polytope. Second, the non-linearities are handled by a careful analysis of the dominating scenarios. The scalability and economical relevance of our models are assessed through numerical experiments performed on realistic instances. In particular, we choose one of these instances to perform a case study with simulations illustrating the possible benefit of using robust optimization.

Published
2022

26. Adaptive Optimization Method in Digital Twin Conveyor Systems via Range-Inspection Control

Author

Yi Yang, Tian Wang, Fei Tao, Hichem Snoussi, Jiaxiang Cheng, Christian Esposito, Shaanxi University of Science and Technology, School of Automation and Electrical Engineering [Beijing] (University of Science and Technology Beijing), Signal Processing Laboratory (SPL), Wuhan University [China], Laboratorio CINI-Item 'Carlo Savy', Consorzio Interuniversitario Nazionale per l'Informatica (CINI), Laboratoire Modélisation et Sûreté des Systèmes (LM2S), Institut Charles Delaunay (ICD), Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS), and Beihang University (BUAA)

Subjects
021103 operations research, Optimization problem, Computer science, Adaptive optimization, Control (management), 0211 other engineering and technologies, Control engineering, 02 engineering and technology, Optimal control, Schema (genetic algorithms), Control and Systems Engineering, Robustness (computer science), Conveyor system, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Road map, Electrical and Electronic Engineering, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience; The automated conveyor system, as the core component in the modern manufacturing world, has gained lots of attention from researchers. To optimize the operation of the conveyor system, range-inspection control (RIC) has been considered an efficient strategy to bring this conventional technology to an intelligent level. Various algorithms have been put into use to achieve optimal control. However, the current methodologies are only focusing on control optimization, not scaled into the smart manufacturing framework. The schema of alignment and corporation between the physical and virtual spaces for the system remains an important problem. Therefore, the work in this article aims for an effective framework of implementation between the physical and virtual stations in an automated conveyor system. Since increasingly more application scenarios rely on the digital twin (DT) technology to realize the integration of physical and virtual systems, we proposed the DT automated conveyor system (DT-ACS) that constructs the road map to implement the RIC-based conveyor system under the background of a smart factory. Besides, profit-sharing-based deep Q-networks (PDQNs) have been proposed to cope with the RIC optimization problem. The robustness and efficiency of the proposed PDQN were evaluated via sets of experiments. The discussion and conclusion are presented at last accordingly.

Published
2022

27. Amorphous-to-crystal transition in the layer-by-layer growth of bivalve shell prisms

Author

Julien Duboisset, Patrick Ferrand, Arthur Baroni, Tilman A. Grünewald, Hamadou Dicko, Olivier Grauby, Jeremie Vidal-Dupiol, Denis Saulnier, Le Moullac Gilles, Martin Rosenthal, Manfred Burghammer, Julius Nouet, Corinne Chevallard, Alain Baronnet, Virginie Chamard, MOSAIC (MOSAIC), Institut FRESNEL (FRESNEL), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), Coherent Optical Microscopy and X-rays (COMiX), Centre Interdisciplinaire de Nanoscience de Marseille (CINaM), Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS), Interactions Hôtes-Pathogènes-Environnements (IHPE), Université de Perpignan Via Domitia (UPVD)-Institut Français de Recherche pour l'Exploitation de la Mer (IFREMER)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Ecosystèmes Insulaires Océaniens (UMR 241) (EIO), Institut de Recherche pour le Développement (IRD)-Institut Français de Recherche pour l'Exploitation de la Mer (IFREMER)-Université de la Polynésie Française (UPF)-Institut Louis Malardé [Papeete] (ILM), Institut de Recherche pour le Développement (IRD), European Synchroton Radiation Facility [Grenoble] (ESRF), Géosciences Paris Saclay (GEOPS), Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Laboratoire Interdisciplinaire sur l'Organisation Nanométrique et Supramoléculaire (LIONS), Nanosciences et Innovation pour les Matériaux, la Biomédecine et l'Energie (ex SIS2M) (NIMBE UMR 3685), Institut Rayonnement Matière de Saclay (IRAMIS), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Institut Rayonnement Matière de Saclay (IRAMIS), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS), and European Project: 724881,H2020,3D-BioMat(2017)

Subjects
Biomineralization, Technology, CALCIUM-CARBONATE, PROTEINS, Materials Science, Biomedical Engineering, 02 engineering and technology, Biochemistry, Calcium Carbonate, Pinna nobilis, Pinctada margaritifera, Biomaterials, 03 medical and health sciences, Engineering, ORGANIC PHASES, Animals, Pinctada, Engineering, Biomedical, Molecular Biology, Mollusk prisms, 030304 developmental biology, Materials Science, Biomaterials, 0303 health sciences, Science & Technology, SPECTROSCOPY, Proteins, LOCALIZATION, General Medicine, 021001 nanoscience & nanotechnology, Bivalvia, PEARL OYSTER, STRUCTURE-PROPERTY RELATIONSHIPS, [PHYS.COND.CM-MS]Physics [physics]/Condensed Matter [cond-mat]/Materials Science [cond-mat.mtrl-sci], Vectorial ptychography, CRYSTALLIZATION, Coherent raman microscopy, Crystallization, 0210 nano-technology, MATRIX, Biotechnology
Abstract

Biomineralization integrates complex physical and chemical processes bio-controlled by the living organisms through ionic concentration regulation and organic molecules production. It allows tuning the structural, optical and mechanical properties of hard tissues during ambient-condition crystallisation, motivating a deeper understanding of the underlying processes. By combining state-of-the-art optical and X-ray microscopy methods, we investigated early-mineralized calcareous units from two bivalve species, Pinctada margaritifera and Pinna nobilis, revealing chemical and crystallographic structural insights. In these calcite units, we observed ring-like structural features correlated with a lack of calcite and an increase of amorphous calcium carbonate and proteins contents. The rings also correspond to a larger crystalline disorder and a larger strain level. Based on these observations, we propose a temporal biomineralization cycle, initiated by the production of an amorphous precursor layer, which further crystallizes with a transition front progressing radially from the unit centre, while the organics are expelled towards the prism edge. Simultaneously, along the shell thickness, the growth occurs following a layer-by-layer mode. These findings open biomimetic perspectives for the design of refined crystalline materials. STATEMENT OF SIGNIFICANCE: Calcareous biominerals are amongst the most present forms of biominerals. They exhibit astonishing structural, optical and mechanical properties while being formed at ambient synthesis conditions from ubiquitous ions, motivating the deep understanding of biomineralization. Here, we unveil the first formation steps involved in the biomineralization cycle of prismatic units of two bivalve species by applying a new multi-modal non-destructive characterization approach, sensitive to chemical and crystalline properties. The observations of structural features in mineralized units of different ages allowed the derivation of a temporal sequence for prism biomineralization, involving an amorphous precursor, a radial crystallisation front and a layer-by-layer sequence. Beyond these chemical and physical findings, the herein introduced multi-modal approach is highly relevant to other biominerals and bio-inspired studies. ispartof: ACTA BIOMATERIALIA vol:142 pages:194-207 ispartof: location:England status: published

Published
2022

28. A New Strategy for Automatic Coupling Between the Inductive PEEC Method and an Integral Electrostatic Formulation

Author

Quang-Anh Phan, Jean-Michel Guichon, Gérard Meunier, Bertrand Bannwarth, Olivier Chadebec, Laboratoire de Génie Electrique de Grenoble (G2ELab ), Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS), G2Elab-Electronique de puissance (G2Elab-EP), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), and Université Grenoble Alpes (UGA)

Subjects
Coupling, circuit coupling, Partial element equivalent circuit, Partial Element Equivalent Circuit (PEEC), External circuit, capacitance extraction, Computer science, [SPI.NRJ]Engineering Sciences [physics]/Electric power, Electrical model, 020206 networking & telecommunications, Context (language use), 02 engineering and technology, Solver, Condensed Matter Physics, Topology, Atomic and Molecular Physics, and Optics, Power electronics, Hardware_INTEGRATEDCIRCUITS, 0202 electrical engineering, electronic engineering, information engineering, Equivalent circuit, Electrical and Electronic Engineering
Abstract

International audience; This paper presents a new strategy for building an equivalent RLMC circuit for electromagnetic interconnections modellingin t he context of the Partial Element Equivalent Circuit (PEEC) method. The method consists in splitting the overall formulation (RLMC) into two independent formulations (RLM) and (C). Both formulations are used independently to calculate equivalent circuit elements. Once all the elements are calculated, they are merged into a global electrical model which is solved globally with an external circuit solver. A coupling with the similar idea was presented a few years ago and showed very good performance for the modelling of electromagnetic devices where propagative effects are negligible like in power electronics applications. However, thecoupling of the parasitic capacitances C with RLM circuit had to be carried out manually. Our new strategy allows to do it in acompletely automatic way..

Published
2022

29. A Robust Nonlinear Model Reference Adaptive Control for Disturbed Linear Systems: An LMI Approach

Author

Roberto Franco, Alejandra Ferreira de Loza, Denis Efimov, Hector Rios, Tecnológico Nacional de México (TecNM), Instituto Politecnico Nacional [Mexico] (IPN), Consejo Nacional de Ciencia y Tecnología [Mexico] (CONACYT), Finite-time control and estimation for distributed systems (VALSE), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), National Research University of Information Technologies, Mechanics and Optics [St. Petersburg] (ITMO), Roberto Franco, Héctor Ríos and Alejandra Ferreira de Loza thank the financial support from CONACYT CVU 772057, Cátedras CONACYT CVU 270504 project 922, and Cátedras CONACYT CVU 166403 project 1537, respectively, and and from TecNM projects.

Subjects
0209 industrial biotechnology, Adaptive control, Computer science, Linear system, MathematicsofComputing_NUMERICALANALYSIS, 02 engineering and technology, Nonlinear control, Model Reference Adaptive Control, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Computer Science Applications, Tracking error, Nonlinear system, 020901 industrial engineering & automation, Rate of convergence, Control and Systems Engineering, Control theory, Uncertain Linear Systems, Electrical and Electronic Engineering, Robust control, Robust Control, Nonlinear Control
Abstract

International audience; In this paper a robust nonlinear Model Reference Adaptive Control (MRAC) is proposed for disturbed linear systems, i.e., linear systems with parameter uncertainties, and external time-dependent perturbations or nonlinear unmodeled dynamics matched with the control input. The proposed nonlinear control law is composed of two nonlinear adaptive gains. Such adaptive gains allow the control to counteract the effects of some perturbations and nonlinear unmodeled dynamics ensuring asymptotic convergence of the tracking error to zero, and the boundedness of the adaptive gains. The nonlinear controller synthesis is given by a constructive method based on the solution of Linear Matrix Inequalities (LMIs). Besides, the simulation results show that, due to the nonlinearities, the rate of convergence of the proposed algorithm is faster than the provided by a classic MRAC.

Published
2022

30. Pixel-accurate road crack detection in presence of inaccurate annotations

Author

Rill-García, Rodrigo, Dokladalova, Eva, Dokládal, Petr, Laboratoire d'Informatique Gaspard-Monge (LIGM), École des Ponts ParisTech (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, Centre de Morphologie Mathématique (CMM), MINES ParisTech - École nationale supérieure des mines de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), Centre National de la Recherche Scientifique (CNRS)-Fédération de Recherche Bézout-ESIEE Paris-École des Ponts ParisTech (ENPC)-Université Paris-Est Marne-la-Vallée (UPEM), and Laboratoire Navier (NAVIER UMR 8205)

Subjects
Crack Detection, 050210 logistics & transportation, Defect Segmentation, Cognitive Neuroscience, 05 social sciences, 02 engineering and technology, Inaccurate Labels, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Computer Science Applications, Deep Learning, Weakly Supervised Learning, Artificial Intelligence, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, [MATH.TR-IMG]Mathematics [math]/domain_math.tr-img, 020201 artificial intelligence & image processing, ComputingMilieux_MISCELLANEOUS
Abstract

Recent road crack detection methods obtain appealing scores but typically allow a few pixel tolerance margin. This is acceptable for locating cracks, but not for measuring their width (indicator of the cracks' severity). Our baseline model, U-VGG19, obtains an F-score of 71.77% on CrackForest, which is superior to other approaches when no tolerance is admitted. However, increasing the scores without tolerance is difficult due to inaccurate annotations. We propose a novel synthetic dataset, Syncrack, as a benchmark for the evaluation of training with inaccurate annotations. Our results show that inaccurate annotations have a detrimental impact on the F-measure, decreasing it by up to 20%. To overcome this, we study label noise correction techniques using weakly supervised learning. Training U-VGG19 with these corrected labels improves the results on Syncrack by up to 12%. Obtained results on the CrackForest and Aigle-RN datasets support that these approaches are useful for real-life data too.

Published
2022

31. Dispelling myths on superposition attacks: formal security model and attack analyses

Author

Céline Chevalier, Luka Music, Elham Kashefi, Information Quantique [LIP6] (QI), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), School of Informatics [Edimbourg], University of Edinburgh, Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (CASCADE), Département d'informatique - ENS Paris (DI-ENS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Centre de Recherche en Economie et Droit (CRED), Université Panthéon-Assas (UP2), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Quandela SAS, Université Paris-Panthéon-Assas, and ANR-18-CE39-0015,CryptiQ,Cryptographie dans un monde quantique(2018)

Subjects
FOS: Computer and information sciences, 050101 languages & linguistics, Computer Science - Cryptography and Security, Computer science, FOS: Physical sciences, 02 engineering and technology, Computer security, computer.software_genre, Superposition principle, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph], Quantum state, Intuition (Bergson), 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], 0501 psychology and cognitive sciences, Quantum information science, Computer Science::Cryptography and Security, Quantum Physics, Applied Mathematics, 05 social sciences, TheoryofComputation_GENERAL, Mythology, Computer security model, Adversary, Cryptographic protocol, 16. Peace & justice, Computer Science Applications, 020201 artificial intelligence & image processing, Quantum Physics (quant-ph), computer, Cryptography and Security (cs.CR)
Abstract

It is of folkloric belief that the security of classical cryptographic protocols is automatically broken if the Adversary is allowed to perform superposition queries and the honest players forced to perform actions coherently on quantum states. Another widely held intuition is that enforcing measurements on the exchanged messages is enough to protect protocols from these attacks. However, the reality is much more complex. Security models dealing with superposition attacks only consider unconditional security. Conversely, security models considering computational security assume that all supposedly classical messages are measured, which forbids by construction the analysis of superposition attacks. Boneh and Zhandry have started to study the quantum computational security for classical primitives in their seminal work at Crypto'13, but only in the single-party setting. To the best of our knowledge, an equivalent model in the multiparty setting is still missing. In this work, we propose the first computational security model considering superposition attacks for multiparty protocols. We show that our new security model is satisfiable by proving the security of the well-known One-Time-Pad protocol and give an attack on a variant of the equally reputable Yao Protocol for Secure Two-Party Computations. The post-mortem of this attack reveals the precise points of failure, yielding highly counter-intuitive results: Adding extra classical communication, which is harmless for classical security, can make the protocol become subject to superposition attacks. We use this newly imparted knowledge to construct the first concrete protocol for Secure Two-Party Computation that is resistant to superposition attacks. Our results show that there is no straightforward answer to provide for either the vulnerabilities of classical protocols to superposition attacks or the adapted countermeasures., 46 pages

Published
2022

32. The search for manganese incorporation in MoSe 2 monolayer epitaxially grown on graphene

Author

Maxime Gay, Minh-Tuan Dau, Céline Vergnaud, Alain Marty, Frédéric Bonell, Hervé Boukari, Colin Paillet, Bérangère Hyot, Hanako Okuno, Pierre Mallet, Jean-Yves Veuillen, Olivier Renault, Matthieu Jamet, Commissariat à l'énergie atomique et aux énergies alternatives - Laboratoire d'Electronique et de Technologie de l'Information (CEA-LETI), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), SPINtronique et TEchnologie des Composants (SPINTEC), Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche Interdisciplinaire de Grenoble (IRIG), Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Grenoble Alpes (UGA), Nanophysique et Semiconducteurs (NPSC), Institut Néel (NEEL), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Modélisation et Exploration des Matériaux (MEM), Institut de Recherche Interdisciplinaire de Grenoble (IRIG), Nano-Electronique Quantique et Spectroscopie (QuNES), ANR-18-CE24-0007,MAGICVALLEY,Polarisation de vallée induite par couplage d'échange magnétique dans les matériaux 2D à grande échelle(2018), ANR-10-LABX-0051,LANEF,Laboratory of Alliances on Nanosciences - Energy for the Future(2010), Nanophysique et Semiconducteurs (NEEL - NPSC), and Nano-Electronique Quantique et Spectroscopie (NEEL - QuNES)

Subjects
Materials science, Graphene, General Physics and Astronomy, chemistry.chemical_element, 02 engineering and technology, Manganese, 2D materials, 021001 nanoscience & nanotechnology, Epitaxy, 01 natural sciences, law.invention, Crystallography, chemistry, law, 0103 physical sciences, Monolayer, [PHYS.COND.CM-MS]Physics [physics]/Condensed Matter [cond-mat]/Materials Science [cond-mat.mtrl-sci], Magnetic doping, [PHYS.COND]Physics [physics]/Condensed Matter [cond-mat], Scanning tunneling microscopy, 010306 general physics, 0210 nano-technology, Molecular beam epitaxy, Transmission electron microscopy, ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2022

33. Tuning absorption and emission in monolayer semiconductors: a brief survey

Author

Xavier Marie, Cedric Robert, Lei Ren, M. A. Semina, Mikhail M. Glazov, Bernhard Urbaszek, Centre d'élaboration de matériaux et d'études structurales (CEMES), Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut de Chimie de Toulouse (ICT-FR 2599), Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut de Chimie du CNRS (INC)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Institut de Chimie du CNRS (INC)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), Laboratoire de physique et chimie des nano-objets (LPCNO), Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut de Chimie de Toulouse (ICT), Institut de Recherche pour le Développement (IRD)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Institut de Recherche pour le Développement (IRD)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Fédération de recherche « Matière et interactions » (FeRMI), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS), A.F. Ioffe Physical-Technical Institute, and Russian Academy of Sciences [Moscow] (RAS)

Subjects
Materials science, business.industry, Analytical chemistry, General Physics and Astronomy, 02 engineering and technology, 021001 nanoscience & nanotechnology, 01 natural sciences, Semiconductor, 0103 physical sciences, Monolayer, [PHYS.COND.CM-MS]Physics [physics]/Condensed Matter [cond-mat]/Materials Science [cond-mat.mtrl-sci], 010306 general physics, 0210 nano-technology, business, Absorption (electromagnetic radiation), ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2022

34. Solving robust bin-packing problems with a branch-and-price approach

Author

André Rossi, Evgeny Gurevsky, Alexandre Dolgui, Xavier Schepler, Laboratoire d'Etudes et de Recherche en Informatique d'Angers (LERIA), Université d'Angers (UA), Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), and IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique)

Subjects
050210 logistics & transportation, Mathematical optimization, 021103 operations research, Information Systems and Management, General Computer Science, Bin packing problem, Computer science, Branch and price, 05 social sciences, 0211 other engineering and technologies, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 02 engineering and technology, Management Science and Operations Research, Industrial and Manufacturing Engineering, Bin, Stability radius, Robustness (computer science), Modeling and Simulation, Norm (mathematics), 0502 economics and business, Column generation, Relaxation (approximation), ComputingMilieux_MISCELLANEOUS
Abstract

One-dimensional bin-packing is a well-known combinatorial optimization problem which is strongly NP-hard. It consists of allocating a given set of items of different sizes into bins of the same capacity to minimize the number of bins used. The capacity of each bin cannot be exceeded. This paper deals with some variants of this problem to take into account the cases when there are items with uncertain sizes. The goal is to obtain robust solutions taking into account possible variations of item sizes around their nominal values. First, two robust approaches are considered which are based on a stability radius calculation, to ensure that the stability radius, measured either with the Manhattan or Chebyshev norm, is not below a given threshold. Then, a complementary robust approach is applied which is based on a relative resiliency calculation. To solve to optimality these robust variants of the bin-packing problem, a compact 0-1 linear programming formulation, which is also valid for the standard bin-packing problem, is introduced. Then, a Dantzig-Wolfe decomposition is suggested in order to provide a set-cover reformulation with a stronger linear relaxation, but an exponential number of columns. Finally, to obtain integer optimal solutions, a branch-and-price algorithm is developed, whose linear relaxation of the set-cover formulation is solved by a dynamic column generation. Numerical experiments are conducted on adapted benchmark sets from the literature. The performance of the branch-and-price algorithm allows us to investigate what protection against uncertainty is offered by each approach, and at which cost of robustness.

Published
2022

35. Design of a new yttrium silicate Environmental Barrier Coating (EBC) based on the relationship between microstructure, transport properties and protection efficiency

Author

Sébastien Fourcade, Fabrice Mauvy, Francis Rebillat, S. Arnal, Laboratoire des Composites Thermostructuraux (LCTS), Centre National de la Recherche Scientifique (CNRS)-Snecma-SAFRAN group-Université de Bordeaux (UB)-Institut de Chimie du CNRS (INC)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Institut de Chimie de la Matière Condensée de Bordeaux (ICMCB), Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS), This work was supported by SAFRAN Ceramics., and Université de Bordeaux (UB)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut de Chimie du CNRS (INC)-Snecma-SAFRAN group-Centre National de la Recherche Scientifique (CNRS)

Subjects
Materials science, Environmental barrier, Recession, chemistry.chemical_element, Sintering, 02 engineering and technology, engineering.material, 01 natural sciences, Corrosion, Coating, 0103 physical sciences, Materials Chemistry, Microstructure, Diffusion coefficient, 010302 applied physics, Conductivity, Silicate, [CHIM.MATE]Chemical Sciences/Material chemistry, Yttrium, 021001 nanoscience & nanotechnology, Grain size, chemistry, Chemical engineering, Particle-size distribution, Ceramics and Composites, engineering, Grain boundary, 0210 nano-technology
Abstract

International audience; Yttrium mono- and di-silicates are excellent candidate materials for Environmental Barrier Coatings (EBC), to protect Ceramic-Matrix Composites (CMC). A large distribution of microstructures can be generated by varying the duration of sintering, the particle size distribution of the precursor and/or the deposition method. In the present work, investigations of the corrosion resistance of yttrium silicate coatings with various microstructures in the high temperature range, under different oxidizing environments are reported. An original experimental methodology has allowed quantifying the influence of the microstructure (especially grain size and grain boundary surface area) on properties such as ionic conductivity, resistance to oxygen diffusion, volatilization rate and surface recession, and showing that they directly affect their protection efficiency against oxidation. Based on these results, guidelines for the design of an optimized yttrium silicate EBC featuring microstructural and compositional variations are proposed.

Published
2022

36. Differential Flatness-Based, Full-Order Nonlinear Control of a Modular Multilevel Converter (MMC)

Author

Francois Wallart, Jean-Yves Gauthier, Xuefang Lin-Shi, Pierre-Baptiste Steckler, Ampère, Département Automatique pour l'Ingénierie des Systèmes (AIS), Ampère (AMPERE), École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), and SuperGrid Institute SAS

Subjects
0209 industrial biotechnology, Power transmission, multilevel inverter, trajectory planning, Computer science, [SPI.NRJ]Engineering Sciences [physics]/Electric power, Topology (electrical circuits), 02 engineering and technology, Nonlinear control, AC power, state-input linearization, 020901 industrial engineering & automation, Control and Systems Engineering, Robustness (computer science), Linearization, Control theory, modular multilevel converter (MMC), power converter, Flatness, high-voltage direct current (HVdc), nonlinear control, Electrical and Electronic Engineering, Power control, Parametric statistics
Abstract

International audience; Modular multilevel converter (MMC) is an attractive topology in industrial applications such as high-voltage direct current (HVdc) transmission system where fast power control is required. The most conventional control method for MMC uses cascaded structures, where the power transmission and internal energy dynamic (outer loops) is limited by the ``frequency separation'' constraints since the dynamic choice of the currents (inner loops) must consider the tradeoff between rapidity and robustness. In this article, we present a new control method based on a differential flatness theory. The main interest of the proposed control is the possibility to obtain a very high dynamic performance of the MMC power flow, even under noisy measurements and parametric disturbances. Using the well-known average model of the MMC, a flat output is proposed, proving the differential flatness property of the MMC. Trajectory tracking controllers of ac grid active and reactive power are proposed using input-state full-order linearization. Simulation results, including losses corresponding to a realistic case of on-shore, point-to-point HVdc interconnection, are presented to show the performance of the proposed control scheme even with strong measurement noise.

Published
2022

37. A Bilevel Energy Management Strategy for HEVs Under Probabilistic Traffic Conditions

Author

Frédéric Bonnans, Pierre Martinon, Giovanni De Nunzio, Arthur Le Rhun, Thomas Leroy, IFP Energies nouvelles (IFPEN), Centre de Mathématiques Appliquées - Ecole Polytechnique (CMAP), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Dynamical Interconnected Systems in COmplex Environments (DISCO), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire des signaux et systèmes (L2S), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Laboratoire Jacques-Louis Lions (LJLL (UMR_7598)), and Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)

Subjects
Optimization, 0209 industrial biotechnology, Mathematical optimization, energy management, Discretization, Energy management, Computer science, traffic data clustering, Computation, 02 engineering and technology, Batteries, 020901 industrial engineering & automation, Stochastic processes, 0202 electrical engineering, electronic engineering, information engineering, Engines, Electrical and Electronic Engineering, Hybrid electric vehicles, Electric motors, [SPI.NRJ]Engineering Sciences [physics]/Electric power, 020208 electrical & electronic engineering, Probabilistic logic, bi-level optimization, [SPI.MECA]Engineering Sciences [physics]/Mechanics [physics.med-ph], Stochastic programming, State of charge, Torque, Control and Systems Engineering, Probability distribution, Stochastic optimization, stochastic dynamic programming
Abstract

International audience; This work proposes a new approach for the optimal energy management of a hybrid electric vehicle taking into account traffic conditions. The method is based on a bi-level decomposition. At the microscopic level, the offline part computes cost maps thanks to a stochastic optimization that considers the influence of traffic, in terms of speed/acceleration probability distributions. At the online macroscopic level, a deterministic optimization computes the ideal state of charge at the end of each road segment, using the computed cost maps. The optimal torque split can then be recovered according to the cost maps and this SoC target sequence. Since the high computational cost due to the uncertainty of traffic conditions has been managed offline, the online part should be fast enough for real-time implementation on board the vehicle. Errors due to discretization and computation in the proposed algorithm have been studied. Finally, we present numerical simulations using actual traffic data, and compare the proposed bi-level method to the best possible consumption, obtained by a deterministic optimization with full knowledge of future traffic conditions, as well as to an established solution for the energy management of a hybrid electric vehicle. The solutions show a reasonable over-consumption compared with deterministic optimization, and manageable computational times for both the offline and online part.

Published
2022

38. Detecting Specular Reflections and Cast Shadows to Estimate Reflectance and Illumination of Dynamic Indoor Scenes

Author

Eric Marchand, Salma Jiddi, Philippe Robert, Technicolor [Cesson Sévigné], Technicolor, Geomagical Labs, InterDigital R&D France, Sensor-based and interactive robotics (RAINBOW), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE (IRISA-D5), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-RÉALITÉ VIRTUELLE, HUMAINS VIRTUELS, INTERACTIONS ET ROBOTIQUE (IRISA-D5), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique)

Subjects
diffuse, reflectance, Computer science, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, 02 engineering and technology, Virtual reality, Metaverse, shadow, Shadow, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], specular, Computer vision, Specular reflection, mixed reality, ComputingMethodologies_COMPUTERGRAPHICS, business.industry, illumination, 020207 software engineering, Photometric registration, Computer Graphics and Computer-Aided Design, Reflectivity, Mixed reality, Range (mathematics), Specularity, Signal Processing, retexturing, RGB color model, Computer Vision and Pattern Recognition, Artificial intelligence, business, texture, Software
Abstract

International audience; The goal of Mixed Reality (MR) is to achieve a seamless and realistic blending between real and virtual worlds. This requires the estimation of reflectance properties and lighting characteristics of the real scene. One of the main challenges within this task consists in recovering such properties using a single RGB-D camera. In this paper, we introduce a novel framework to recover both the position and color of multiple light sources as well as the specular reflectance of real scene surfaces. This is achieved by detecting and incorporating information from both specular reflections and cast shadows. Our approach is capable of handling any textured surface and considers both static and dynamic light sources. Its effectiveness is demonstrated through a range of applications including visually-consistent mixed reality scenarios (e.g. correct real specularity removal, coherent shadows in terms of shape and intensity) and retexturing where the texture of the scene is altered whereas the incident lighting is preserved.

Published
2022

39. Robust Fixed-Time Stability: Application to Sliding-Mode Control

Author

Vincent Léchappé, Emmanuel Bernuau, Emmanuel Moulay, Franck Plestan, Systèmes et Réseaux Intelligents (XLIM-SRI), XLIM (XLIM), Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)-Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS), Ampère, Département Automatique pour l'Ingénierie des Systèmes (AIS), Ampère (AMPERE), École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-École Centrale de Lyon (ECL), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Paris-Saclay Food and Bioproduct Engineering (SayFood), AgroParisTech-Université Paris-Saclay-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Laboratoire des Sciences du Numérique de Nantes (LS2N), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), and Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)

Subjects
0209 industrial biotechnology, Sliding mode control, 020208 electrical & electronic engineering, Robust control, Scalar (physics), Fixed-time stability, 02 engineering and technology, Stability (probability), Computer Science Applications, Second order systems, Nonlinear system, 020901 industrial engineering & automation, Control and Systems Engineering, Control theory, Fixed time, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, 0202 electrical engineering, electronic engineering, information engineering, Electrical and Electronic Engineering, Constant (mathematics), Mathematics
Abstract

International audience; This article deals with robust fixed-time stability and stabilization. First, new global robust fixed-time stability results are proposed for scalar systems by using constant and variable exponent coefficients. Then, they are applied to global robust fixed-time stabilization of a class of uncertain nonlinear second order systems by using sliding mode control. All the results are illustrated in simulation.

Published
2022

40. Design of concentrated colloidal dispersions of iron oxide nanoparticles in ionic liquids: Structure and thermal stability from 25 to 200 °C

Author

J. C. Riedl, T. Fiuza, Régine Perzynski, Jerome Depeyrot, Mitradeep Sarkar, Emmanuelle Dubois, Fabrice Cousin, Véronique Peyre, Guillaume Mériguet, PHysicochimie des Electrolytes et Nanosystèmes InterfaciauX (PHENIX), Institut de Chimie du CNRS (INC)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Complex Fluid Group [Brasilia] (CFG), Instituto de Física [Brasilia], Universidade de Brasilia [Brasília] (UnB)-Universidade de Brasilia [Brasília] (UnB), Groupe Diffusion petits angles (GDPA), Laboratoire Léon Brillouin (LLB - UMR 12), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Saclay-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Saclay-Institut Rayonnement Matière de Saclay (IRAMIS), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, and Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Institut Rayonnement Matière de Saclay (IRAMIS)

Subjects
Thermogravimetric analysis, Materials science, Small-angle X-ray scattering, Iron oxide, Ionic bonding, [CHIM.MATE]Chemical Sciences/Material chemistry, 02 engineering and technology, 010402 general chemistry, 021001 nanoscience & nanotechnology, 01 natural sciences, 0104 chemical sciences, Surfaces, Coatings and Films, Electronic, Optical and Magnetic Materials, Biomaterials, chemistry.chemical_compound, Colloid and Surface Chemistry, Chemical engineering, chemistry, Dynamic light scattering, Ionic liquid, Bistriflimide, Thermal stability, [PHYS.PHYS.PHYS-CHEM-PH]Physics [physics]/Physics [physics]/Chemical Physics [physics.chem-ph], 0210 nano-technology
Abstract

Hypothesis Some of the most promising fields of application of ionic liquid-based colloids imply elevated temperatures. Their careful design and analysis is therefore essential. We assume that tuning the structure of the nanoparticle-ionic liquid interface through its composition can ensure colloidal stability for a wide temperature range, from room temperature up to 200 °C. Experiments The system under study consists of iron oxide nanoparticles (NPs) dispersed in ethylmethylimidazolium bistriflimide (EMIM TFSI). The key parameters of the solid-liquid interface, tuned at room temperature, are the surface charge density and the nature of the counterions. The thermal stability of these nanoparticle dispersions is then analysed on the short and long term up to 200 °C. A multiscale analysis is performed combining dynamic light scattering (DLS), small angle X-ray/neutron scattering (SAXS/SANS) and thermogravimetric analysis (TGA). Findings Following the proposed approach with a careful choice of the species at the solid-liquid interface, ionic liquid-based colloidal dispersions of iron oxide NPs in EMIM TFSI stable over years at room temperature can be obtained, also stable at least over days up to 200 °C and NPs concentrations up to 12 vol% ( ≈ 30 wt%) thanks to few near-surface ionic layers.

Published
2022

41. Carleman estimates for the wave equation in heterogeneous media with non-convex interface

Author

Lucie Baudouin, Pamela Godoy, Alberto Mercado, Équipe Méthodes et Algorithmes en Commande (LAAS-MAC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Universidad Tecnica Federico Santa Maria [Valparaiso] (UTFSM), ANR-11-LABX-0040,CIMI,Centre International de Mathématiques et d'Informatique (de Toulouse)(2011), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), and Université Fédérale Toulouse Midi-Pyrénées

Subjects
Transmission system, Applied Mathematics, 010102 general mathematics, Wave equation, 02 engineering and technology, [MATH]Mathematics [math], 0101 mathematics, Carleman estimates, 021001 nanoscience & nanotechnology, 0210 nano-technology, 01 natural sciences, Analysis
Abstract

International audience; A wave equation whose main coefficient is discontinuous models the evolution of waves amplitude in a media composed of at least two different materials, in which the propagation speed is different. In our mathematical setting, the spatial domain where the partial differential equation evolves is an open bounded subset of R^2 and the wave speed is assumed to be constant in each one of two sub-domains, separated by a smooth and possibly non-convex interface. This article is concerned with the construction of Carleman weights for this wave operator, allowing generalizations of previous results to the case of an interface that is not necessarily the boundary of a convex set. Indeed, using the orthogonal projection onto this interface, we define convex functions satisfying the transmission conditions imposed by the equation, such that, under usual hypothesis on the sign of the jump of the wave speed, can be used as Carleman weights.

Published
2022

42. Investigation on dung beetle's (Heliocopris Hope, 1838) chitosan valorisation for hydrogel 3D printing

Author

Godeau, Xiaomin Yu, Andrianandrasana, Freddy, Volkova, Olga, Szczepanski, Caroline, Zenerino, Arnaud, Montreuil, Olivier, Godeau, René-Paul, Kuzhir, Pavel, Godeau, Guilhem, Université Côte d'Azur (UCA), Institut de Physique de Nice (INPHYNI), Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), Michigan State University [East Lansing], Michigan State University System, Mécanismes Adaptatifs et Evolution (MECADEV), and Muséum national d'Histoire naturelle (MNHN)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Chitosan, Chitin, Hydrogels, 02 engineering and technology, General Medicine, hydrogel formation, 010402 general chemistry, 021001 nanoscience & nanotechnology, 01 natural sciences, Biochemistry, 0104 chemical sciences, Dung beetle, Coleoptera, [CHIM.POLY]Chemical Sciences/Polymers, biopolymer extraction, Structural Biology, Printing, Three-Dimensional, Animals, 0210 nano-technology, Molecular Biology
Abstract

Biopolymers and their derivatives are materials with increasing interest for industry and especially for sustainable engineering development. Among such kind of materials, carbohydrate polymer like highly deacetylated chitin (chitosan) is widely used for a wide range of applications, including material and biomedical developments. The majority of industrially produced chitosan is based on chitin extracted from crustacean exoskeleton. However, with increase of interest on this material, chitosan's production will rapidly become insufficient and other species should be investigated as new sources of chitosan. In the present work, we focus on the preparation of chitosan from giant dung beetles (Genus Heliocopris, Hope, 1838). This genus was chosen to show the possibility to take animals that develop and leave near dejection and valuate them for material applications. This work includes all the chitosan extraction procedures, chitosan characterisation IR, SEM, NMR, ash content, and deacetylation degree. Finally, the prepared carbohydrate polymer is used to form hydrogel. The prepared gel has been characterised and used for 3D printing, to show the compatibility of extracted chitosan with biomaterial application.

Published
2022

43. Development of benchmark datasets of multioriented hand gestures for speech and hearing disabled

Author

Soumi Paul, Hayat Nasser, Ayatullah Faruk Mollah, Arpan Bhattacharyya, Phuc Ngo, Mita Nasipuri, Isabelle Debled-Rennesson, Subhadip Basu, Department of Computer Science & Engineering, Jadavpur University, Kolkata 700032, India, Applying Discrete Algorithms to Genomics and Imagery (ADAGIO), Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), and Department of Computer Science & Engineering, Aliah University, Kolkata 700160, India

Subjects
Computer Networks and Communications, Hardware and Architecture, 0202 electrical engineering, electronic engineering, information engineering, Media Technology, [SCCO.COMP]Cognitive science/Computer science, 020207 software engineering, 020201 artificial intelligence & image processing, 02 engineering and technology, ComputingMilieux_MISCELLANEOUS, Software
Abstract

International audience

Published
2022

44. GREENHOME: A Household Energy Consumption and CO 2 Footprint Metering Environment

Author

Genoveva Vargas-Solar, Maysaa Khalil, Javier A. Espinosa-Oviedo, José-Luis Zechinelli-Martini, Base de Données (BD), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Environnement de Réseaux Autonomes (ERA), Laboratoire Informatique et Société Numérique (LIST3N), Université de Technologie de Troyes (UTT)-Université de Technologie de Troyes (UTT), Entrepôts, Représentation et Ingénierie des Connaissances (ERIC), Université Lumière - Lyon 2 (UL2)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon, Universidad de las Américas [Puebla] (UDLAP), TU Delft, Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), and Université de Technologie de Troyes (UTT)

Subjects
[INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Computer Networks and Communications, 020209 energy, Energy metering, 02 engineering and technology, 010501 environmental sciences, 7. Clean energy, 01 natural sciences, smart analytics, 13. Climate action, Architecture, 0202 electrical engineering, electronic engineering, information engineering, Information systems, InformationSystems_MISCELLANEOUS, 0105 earth and related environmental sciences
Abstract

This article presents the GREENHOME environment, a toolkit providing several data analytical tools for metering household energy consumption and CO 2 footprint under different perspectives. GREENHOME enables a multi-perspective analysis of household energy consumption and CO 2 footprint using and combining several variables through various statistics and data mining algorithms. To test GREENHOME, the article reports on experiments conducted for modelling and forecasting energy consumption and CO 2 footprint in the context of the Triple-A European project.

Published
2022

45. Layered and object-based game semantics

Author

Zhong Shao, Paul-André Melliès, Arthur Oliveira Vale, Jérémie Koenig, Léo Stefanesco, Department of Computer Science (YALE), Yale University [New Haven], Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Design, study and implementation of languages for proofs and programs (PI.R2), Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Paris Cité (UPCité)-Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Collège de France - Chaire Sciences du logiciel, Collège de France (CdF (institution)), Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Paris (UP)-Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP), Chaire Sciences du logiciel, and Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Game semantics, Semantics (computer science), Computer science, Concurrency, Linear logic, 0102 computer and information sciences, 02 engineering and technology, computer.software_genre, 01 natural sciences, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], CCS Concepts: • Theory of computation → Program verification, Refinement calculus, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 0202 electrical engineering, electronic engineering, information engineering, Object type, Layer (object-oriented design), Safety, Risk, Reliability and Quality, program refinement, [INFO.INFO-MS]Computer Science [cs]/Mathematical Software [cs.MS], [MATH.MATH-CT]Mathematics [math]/Category Theory [math.CT], Abstraction (linguistics), [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], Program specifications, Programming language, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, Object (computer science), certified abstraction layers, game semantics, • Software and its engineering → Correctness object-based semantics, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], 010201 computation theory & mathematics, [MATH.MATH-AT]Mathematics [math]/Algebraic Topology [math.AT], [MATH.MATH-QA]Mathematics [math]/Quantum Algebra [math.QA], Logic and verification, [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG], Abstraction, Program semantics, computer, Software
Abstract

Large-scale software verification relies critically on the use of compositional languages, semantic models, specifications, and verification techniques. Recent work on certified abstraction layers synthesizes game semantics, the refinement calculus, and algebraic effects to enable the composition of heterogeneous components into larger certified systems. However, in existing models of certified abstraction layers, compositionality is restricted by the lack of encapsulation of state. In this paper, we present a novel game model for certified abstraction layers where the semantics of layer interfaces and implementations are defined solely based on their observable behaviors. Our key idea is to leverage Reddy's pioneer work on modeling the semantics of imperative languages not as functions on global states but as objects with their observable behaviors. We show that a layer interface can be modeled as an object type (i.e., a layer signature) plus an object strategy. A layer implementation is then essentially a regular map, in the sense of Reddy, from an object with the underlay signature to that with the overlay signature. A layer implementation is certified when its composition with the underlay object strategy implements the overlay object strategy. We also describe an extension that allows for non-determinism in layer interfaces. After formulating layer implementations as regular maps between object spaces, we move to concurrency and design a notion of concurrent object space, where sequential traces may be identified modulo permutation of independent operations. We show how to express protected shared object concurrency, and a ticket lock implementation, in a simple model based on regular maps between concurrent object spaces.

Published
2022

46. Vector Optimization with Domination Structures: Variational Principles and Applications

Author

Bao, Truong Q., Mordukhovich, Boris S., Soubeyran, Antoine, Tammer, Christiane, Northern Michigan University, Wayne State University [Detroit], Aix-Marseille Sciences Economiques (AMSE), École des hautes études en sciences sociales (EHESS)-Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), Martin-Luther-University Halle-Wittenberg, US National Science Foundation under grants DMS-1512846, US National Science Foundation under grants DMS-1808978, US Air Force Office of Scientific Research under grant #15RT0462, Australian Research Council Discovery Project DP-190100555, and École des hautes études en sciences sociales (EHESS)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)

Subjects
Variational rationality, Statistics and Probability, Numerical Analysis, 021103 operations research, Applied Mathematics, 0211 other engineering and technologies, 010103 numerical & computational mathematics, 02 engineering and technology, [SHS.ECO]Humanities and Social Sciences/Economics and Finance, 01 natural sciences, Variable ordering cones, 49J53, 90C29, 92G99, Optimization and Control (math.OC), Vector optimization, Domination structures, FOS: Mathematics, Geometry and Topology, 0101 mathematics, Mathematics - Optimization and Control, Analysis, Set-valued and variational analysis, 49J53, 90C29, 92G99
Abstract

International audience; This paper addresses a large class of vector optimization problems in infinite-dimensional spaces with respect to two important binary relations derived from domination structures. Motivated by theoretical challenges as well as by applications to some models in behavioral sciences, we establish new variational principles that can be viewed as far-going extensions of the Ekeland variational principle to cover domination vector settings. Our approach combines advantages of both primal and dual techniques in variational analysis with providing useful sufficient conditions for the existence of variational traps in behavioral science models with variable domination structures.

Published
2022

47. Improving Quantitative EDS Chemical Analysis of Alloy Nanoparticles by PCA Denoising: Part I, Reducing Reconstruction Bias

Author

Murilo Moreira, Matthias Hillenkamp, Giorgio Divitini, Luiz H. G. Tizei, Caterina Ducati, Monica A. Cotta, Varlei Rodrigues, Daniel Ugarte, Instituto de Fisica 'Gleb Wataghin' (IFGW), University of Campinas [Campinas] (UNICAMP), Agrégats et nanostructures (AGNANO), Institut Lumière Matière [Villeurbanne] (ILM), Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Department of Materials Science and Metallurgy [Cambridge University] (DMSM), University of Cambridge [UK] (CAM), Laboratoire de Physique des Solides (LPS), and Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)

Subjects
[PHYS]Physics [physics], 010302 applied physics, 02 engineering and technology, 021001 nanoscience & nanotechnology, principal components analysis (PCA), 01 natural sciences, [SPI]Engineering Sciences [physics], 0103 physical sciences, denoising, [CHIM]Chemical Sciences, energy-dispersive X-ray spectroscopy (EDS), nanoparticles, 0210 nano-technology, quantitative chemical analysis, Instrumentation
Abstract

International audience; Scanning transmission electron microscopy is a crucial tool for nanoscience, achieving sub-nanometric spatial resolution in both image and spectroscopic studies. This generates large datasets that cannot be analyzed without computational assistance. The so-called machine learning procedures can exploit redundancies and find hidden correlations. Principal component analysis (PCA) is the most popular approach to denoise data by reducing data dimensionality and extracting meaningful information; however, there are many open questions on the accuracy of reconstructions. We have used experiments and simulations to analyze the effect of PCA on quantitative chemical analysis of binary alloy (AuAg) nanoparticles using energy-dispersive X-ray spectroscopy. Our results demonstrate that it is possible to obtain very good fidelity of chemical composition distribution when the signal-to-noise ratio exceeds a certain minimal level. Accurate denoising derives from a complex interplay between redundancy (data matrix size), counting noise, and noiseless data intensity variance (associated with sample chemical composition dispersion). We have suggested several quantitative bias estimators and noise evaluation procedures to help in the analysis and design of experiments. This work demonstrates the high potential of PCA denoising, but it also highlights the limitations and pitfalls that need to be avoided to minimize artifacts and perform reliable quantification.

Published
2022

48. Wasserstein Distances, Geodesics and Barycenters of Merge Trees

Author

Jules Vidal, Julie Delon, Julien Tierny, Mathieu Pont, Algorithmes, Programmes et Résolution (APR), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Mathématiques Appliquées Paris 5 (MAP5 - UMR 8145), Institut National des Sciences Mathématiques et de leurs Interactions (INSMI)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP), Institut des Sciences du Calcul et des Données (ISCD), and Sorbonne Université (SU)

Subjects
Computational Geometry (cs.CG), FOS: Computer and information sciences, Geodesic, Computer science, Computer Vision and Pattern Recognition (cs.CV), Computation, Branch-decomposition, Computer Science - Computer Vision and Pattern Recognition, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], Computer Science - Graphics, FOS: Electrical engineering, electronic engineering, information engineering, 0202 electrical engineering, electronic engineering, information engineering, Mathematics::Metric Geometry, Cluster analysis, ComputingMilieux_MISCELLANEOUS, [INFO.INFO-MS]Computer Science [cs]/Mathematical Software [cs.MS], Image and Video Processing (eess.IV), [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], 020207 software engineering, Electrical Engineering and Systems Science - Image and Video Processing, Computer Graphics and Computer-Aided Design, Graphics (cs.GR), [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], Visualization, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], Signal Processing, Metric (mathematics), Computer Science - Computational Geometry, Edit distance, Computer Vision and Pattern Recognition, Algorithm, Software, Merge (linguistics)
Abstract

This paper presents a unified computational framework for the estimation of distances, geodesics and barycenters of merge trees. We extend recent work on the edit distance [106] and introduce a new metric, called the Wasserstein distance between merge trees, which is purposely designed to enable efficient computations of geodesics and barycenters. Specifically, our new distance is strictly equivalent to the L2-Wasserstein distance between extremum persistence diagrams, but it is restricted to a smaller solution space, namely, the space of rooted partial isomorphisms between branch decomposition trees. This enables a simple extension of existing optimization frameworks [112] for geodesics and barycenters from persistence diagrams to merge trees. We introduce a task-based algorithm which can be generically applied to distance, geodesic, barycenter or cluster computation. The task-based nature of our approach enables further accelerations with shared-memory parallelism. Extensive experiments on public ensembles and SciVis contest benchmarks demonstrate the efficiency of our approach -- with barycenter computations in the orders of minutes for the largest examples -- as well as its qualitative ability to generate representative barycenter merge trees, visually summarizing the features of interest found in the ensemble. We show the utility of our contributions with dedicated visualization applications: feature tracking, temporal reduction and ensemble clustering. We provide a lightweight C++ implementation that can be used to reproduce our results.

Published
2022

49. Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art

Author

El-Ghazali Talbi, Mehrdad Mohammadi, Patrick Meyer, Maryam Karimi-Mamaghan, Amir Mohammad Karimi-Mamaghan, Optimisation de grande taille et calcul large échelle [BONUS], Equipe DECIDE (Lab-STICC_DECIDE), Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), Institut Mines-Télécom [Paris] (IMT)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-Institut Mines-Télécom [Paris] (IMT)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL), Département Logique des Usages, Sciences sociales et Sciences de l'Information (IMT Atlantique - LUSSI), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), University of Tehran, Université de Lille - UFR des Humanités (Lille UFRH), Université de Lille, Optimisation de grande taille et calcul large échelle (BONUS), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL], École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT), IMT Atlantique (IMT Atlantique), and Université de Lille - Faculté des Humanités (Lille Humanités)

Subjects
Service (systems architecture), Information Systems and Management, General Computer Science, Computer science, media_common.quotation_subject, 0211 other engineering and technologies, Initialization, 02 engineering and technology, Management Science and Operations Research, Machine learning, computer.software_genre, Industrial and Manufacturing Engineering, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Robustness (computer science), Taxonomy (general), 0502 economics and business, [INFO]Computer Science [cs], Quality (business), Metaheuristic, ComputingMilieux_MISCELLANEOUS, media_common, 050210 logistics & transportation, 021103 operations research, business.industry, 05 social sciences, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Modeling and Simulation, Key (cryptography), State (computer science), Artificial intelligence, business, computer
Abstract

International audience; Mixed Integer Linear Programs (MILPs) are usually NP-hard mathematical programming problems, which present difficulties to obtain optimal solutions in a reasonable time for large scale models. Nowadays, metaheuristics are one of the potential tools for solving this type of problems in any context. In this paper, we focus our attention on MILPs in the specific framework of Data Envelopment Analysis (DEA), where the determination of a score of technical efficiency of a set of Decision Making Units (DMUs) is one of the main objectives. In particular, we propose a new hyper-matheuristic grounded on a MILP-based decomposition in which the optimization problem is divided into two hierarchical subproblems. The new approach decomposes the model into discrete and continuous variables, treating each subproblem through different optimization methods. In particular, metaheuristics are used for dealing with the discrete variables, whereas exact methods are used for the set of continuous variables. The metaheuristics use an indirect representation that encodes an incomplete solution for the problem, whereas the exact method is applied to decode the solution and generate a complete solution. The experimental results, based on simulated data in the context of Data Envelopment Analysis, show that the solutions obtained through the new approach outperform those found by solving the problem globally using a metaheuristic method. Finally, regarding the new hyper-matheuristic scheme, the best algorithm selection is found for a set of cooperative metaheuristics ans exact optimization algorithms.

Published
2022

50. Arc flow formulations based on dynamic programming: Theoretical foundations and applications

Author

Cláudio Alves, François Clautiaux, José Manuel Valério de Carvalho, Manuel Iori, Vinícius Loti de Lima, Institute of Computing [Campinas] (IC), Universidade Estadual de Campinas = University of Campinas (UNICAMP), Universidade do Minho = University of Minho [Braga], Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation (EDGE), Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Università degli Studi di Modena e Reggio Emilia = University of Modena and Reggio Emilia (UNIMORE), The first and fourth authors have been supported by FAPESP - Funda¸cao de Amparo a Pesquisa do Estado de Sao Paulo (under grant numbers 2017/11831-1 and 2019/12728-5). The second and the fifth authors have been supported by FCT - Funda¸cao para a Ciencia e Tecnologia within the R&D Units Project Scope: UIDB/00319/2020., Institute of Computing [Campinas] (UNICAMP), Universidade Estadual de Campinas (UNICAMP), Universidade do Minho, Reformulations based algorithms for Combinatorial Optimization (Realopt), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, and Università degli Studi di Modena e Reggio Emilia (UNIMORE)

Subjects
FOS: Computer and information sciences, Mathematical optimization, Combinatorial optimization, Dynamic Programming, Information Systems and Management, Optimization problem, General Computer Science, Computer science, Other Computer Science (cs.OH), 0211 other engineering and technologies, 02 engineering and technology, Management Science and Operations Research, Dynamic programming, Pseudo-Polynomial, Industrial and Manufacturing Engineering, Arc (geometry), Computer Science - Other Computer Science, Combinatorial Optimization, 0502 economics and business, FOS: Mathematics, Mathematics - Optimization and Control, Integer programming, 050210 logistics & transportation, Acyclic Network, 021103 operations research, Arc flow, 05 social sciences, Relaxation (iterative method), [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Solver, Acyclic network, Pseudo-polynomial, Flow network, Flow (mathematics), Optimization and Control (math.OC), Modeling and Simulation, Arc Flow
Abstract

Network flow formulations are among the most successful tools to solve optimization problems. Such formulations correspond to determining an optimal flow in a network. One particular class of network flow formulations is the arc flow, where variables represent flows on individual arcs of the network. For N P -hard problems, polynomial-sized arc flow models typically provide weak linear relaxations and may have too much symmetry to be efficient in practice. Instead, arc flow models with a pseudo-polynomial size usually provide strong relaxations and are efficient in practice. The interest in pseudo-polynomial arc flow formulations has grown considerably in the last twenty years, in which they have been used to solve many open instances of hard problems. A remarkable advantage of pseudo-polynomial arc flow models is the possibility to solve practical-sized instances directly by a Mixed Integer Linear Programming solver, avoiding the implementation of complex methods based on column generation. In this survey, we present theoretical foundations of pseudo-polynomial arc flow formulations, by showing a relation between their network and Dynamic Programming (DP). This relation allows a better understanding of the strength of these formulations, through a link with models obtained by Dantzig-Wolfe decomposition. The relation with DP also allows a new perspective to relate state-space relaxation methods for DP with arc flow models. We also present a dual point of view to contrast the linear relaxation of arc flow models with that of models based on paths and cycles. To conclude, we review the main solution methods and applications of arc flow models based on DP in several domains such as cutting, packing, scheduling, and routing.

Published
2022

Catalog

Books, media, physical & digital resources
See catalog results