Topic: 02 engineering and technology - Searchworks@Jio Institute Digital Library Search Results

Showing total 176 results

Start Over Topic 02 engineering and technology

176 results

1. Property Model Methodology: A Landing Gear Operational Use Case

Author: Thomas Razafimahefa, Pascal Paper, François Guérin, Patrice Micouin, Roland Becquet, Louis Fabre, Micouin, Patrice, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), Airbus Helicopters, Aeroport International de Marseille-Provence, MathWorks, and Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU)
Subjects: [SPI.OTHER]Engineering Sciences [physics]/Other, 021103 operations research, Process (engineering), Computer science, [SPI.OTHER] Engineering Sciences [physics]/Other, media_common.quotation_subject, 0211 other engineering and technologies, Software requirements specification, 02 engineering and technology, 01 natural sciences, Conceptual framework, 0103 physical sciences, Systems engineering, Quality (business), Function (engineering), 010301 acoustics, Implementation, Lead time, Reliability (statistics), media_common
Abstract: International audience; Relevant for engineering a wide range of technological systems, Property Model Methodology (PMM) is applied in this paper to the development process of a helicopter function in the frame of the ARP4754A/ED79A. After a short presentation of the method, the case study is presented: "to retract and to extend airborne the landing gear system". Then, each stage of the PMM development process is illustrated by examples from the case study: (1) Modeling the top level requirements specification, (2) Validating the requirements specification by proof and simulation, (3) Modeling the architectural design, Refining the top level requirements into requirements specified to the different subsystems contributing to the function and Modeling the terminal subsystems detailed designs (4) Validating the requirements specified to the contributing subsystems by proof or simulation, (5) Verifying the design models by simulation and finally (6-8) Verifying physical implementations by test on the basis of all validation and verification scenarios accumulated throughout the development. At end, lessons learnt and industrial perspectives are summarized highlighting how PMM is a methodology adapted to the challenges facing to systems engineering by the globalization of development processes and showing how PMM can provide a powerful conceptual framework to support digital continuity within globalized Design Organizations. Modeling, simulation, proof and test generation activities are supported by the MATLAB and Simulink products. Introduction The aeronautic industry has to deliver more and more complicated systems in term of functions while maintaining high level of quality and safety/reliability. In the same time, competition is driving aircraft manufacturers to strongly improve their costs (including non-recurring costs) and development lead time. At the age of globalization, these systems are designed and produced by large, multicultural, geographically distributed teams belonging to different industrial organizations. This evolution introduces additional complexities (the complexity of a goal-oriented process refers to its propensity to fail [Suh, 2005]). To face these challenges, classical systems engineering approaches
Published: 2018

2. A generic exact solver for vehicle routing and related problems

Author: Eduardo Uchoa, Artur Alves Pessoa, Ruslan Sadykov, François Vanderbeck, Universidade Federal Fluminense [Rio de Janeiro] (UFF), 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), Atoptima, We would like to thank Teobaldo Bulhoes and Guillaume Marques for a large part of the implementation of the Julia–JuMP interface to the solver, Teobaldo Bulhoes, Guillaume Marques and Eduardo Queiroga for implementing, over that interface, the models corresponding to the examples of this paper, and Laurent Facq for a general support of the computing environment. Experiments presented in this paper were carried out using the PlaFRIM (Federative Platform for Research in Computer Science and Mathematics), created under the Inria PlaFRIM development action with support from Bordeaux INP, LABRI and IMB and other entities: Conseil Régional d’Aquitaine, Université de Bordeaux, CNRS and ANR in accordance to the 'Programme d’Investissements d’Avenir'. This study was financed in part by the Conselho Nacional de Científico e Tecnológico (CNPq), grant 313601/2018-6 (Produtividade 1B), and by the Funda¸c˜ao de Amparo à Pesquisa do Estado do Rio de Janeiro (FAPERJ), grant E-26/202.887/2017 (Cientista do Estado)., Plafrim, 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, 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)
Subjects: Mathematical optimization, 021103 operations research, Bin packing problem, General Mathematics, Column generation, 0211 other engineering and technologies, Integer programming, Rule-based system, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 010103 numerical & computational mathematics, 02 engineering and technology, Solver, 01 natural sciences, Vehicle routing problem, Path (graph theory), 0101 mathematics, Routing (electronic design automation), Software, Routing, Mathematics
Abstract: Major advances were recently obtained in the exact solution of vehicle routing problems (VRPs). Sophisticated branch-cut-and-price (BCP) algorithms for some of the most classical VRP variants now solve many instances with up to a few hundreds of customers. However, adapting and reimplementing those successful algorithms for other variants can be a very demanding task. This work proposes a BCP solver for a generic model that encompasses a wide class of VRPs. It incorporates the key elements found in the best existing VRP algorithms: ng-path relaxation, rank-1 cuts with limited memory, path enumeration, and rounded capacity cuts; all generalized through the new concepts of “packing set” and “elementarity set”. The concepts are also used to derive a branching rule based on accumulated resource consumption and to generalize the Ryan and Foster branching rule. Extensive experiments on several variants show that the generic solver has an excellent overall performance, in many problems being better than the best specific algorithms. Even some non-VRPs, like bin packing, vector packing and generalized assignment, can be modeled and effectively solved.
Published: 2020

3. Adaptive Request Scheduling for the I/O Forwarding Layer using Reinforcement Learning

Author: Philippe O. A. Navaux, Jean Luca Bez, Toni Cortes, Francieli Zanon Boito, Alberto Miranda, Ramon Nou, Instituto de Informática da UFRGS (UFRGS), Universidade Federal do Rio Grande do Sul [Porto Alegre] (UFRGS), Topology-Aware System-Scale Data Management for High-Performance Computing (TADAAM), 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)-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), 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), Barcelona Supercomputing Center - Centro Nacional de Supercomputacion (BSC - CNS), This study was financed in part by the Coordenac¸ao de Aperfeicoamento de Pessoal de Nıvel Superior - Brasil (CAPES) - Finance Code 001. It has also received support from the Conselho Nacional de Desenvolvimento Cientıfico e Tecnologico (CNPq), Brazil, the LICIA International Laboratory, NCSA-Inria-ANL-BSC-JSC-Riken Joint-Laboratory on Extreme Scale Computing (JLESC), the Spanish Ministry of Science and Innovation under the TIN2015–65316 grant, and the Generalitat de Catalunya under contract 2014– SGR–1051. This research received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 800144. Experiments presented in this paper were carried out using the Grid’5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www. grid5000.fr). The authors acknowledge the National Laboratory for Scientific Computing (LNCC/MCTI, Brazil) for providing HPC resources of the SDumont supercomputer, which have contributed to the research results reported within this paper., Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors, Barcelona Supercomputing Center, Universitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions, and 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)-Inria Bordeaux - Sud-Ouest
Subjects: I/O forwarding, Parallel I/O, I/O scheduling, Computer Networks and Communications, Computer science, Distributed computing, Auto-tuning, 02 engineering and technology, Scheduling (computing), I/O Scheduling, I/O Forwarding, Machine learning, Reinforcement learning, Aprenentatge automàtic, 0202 electrical engineering, electronic engineering, information engineering, Informàtica::Arquitectura de computadors [Àrees temàtiques de la UPC], Input/output, High performance I/O, 020206 networking & telecommunications, Workload, Reinforcement Learning, Hardware and Architecture, Superordinadors, 020201 artificial intelligence & image processing, High performance computing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Software
Abstract: In this paper, we propose an approach to adapt the I/O forwarding layer of HPC systems to applications’ access patterns. I/O optimization techniques can improve performance for the access patterns they were designed to target, but they often decrease performance for others. Furthermore, these techniques usually depend on the precise tune of their parameters, which commonly falls back to the users. Instead, we propose to do it dynamically at runtime based on the I/O workload observed by the system. Our approach uses a reinforcement learning technique – contextual bandits – to make the system capable of learning the best parameter value to each observed access pattern during its execution. That eliminates the need of a complicated and time-consuming previous training phase. Our case study is the TWINS scheduling algorithm, where performance improvements depend on the time window parameter, which in turn depends on the workload. We evaluate our proposal and demonstrate it can reach a precision of 88% on the parameter selection in the first hundreds of observations of an access pattern, achieving 99% of the optimal performance. We demonstrate that the system – which is expected to live for years – will be able to adapt to changes and optimize its performance after having observed an access pattern for a few (not necessarily contiguous) minutes. This study was financed in part by the Coordenaçao de Aperfeiçoamento de Pessoal de Nível Superior - Brasil (CAPES) - Finance Code 001. It has also received support from the Conselho Nacional de Desenvolvimento Científico e Tecnologico (CNPq), Brazil; the LICIA International Laboratory; NCSA-Inria-ANL-BSC-JSC-Riken Joint-Laboratory on Extreme Scale Computing (JLESC); the Spanish Ministry of Science and Innovation under the TIN2015–65316 grant; and the Generalitat de Catalunya under contract 2014– SGR–1051. This research received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 800144.
Published: 2020

4. Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment

Author: Pierrick Gaudry, Emmanuel Thomé, Fabrice Boudot, Aurore Guillevic, Nadia Heninger, Paul Zimmermann, XLIM (XLIM), Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS), Cryptology, arithmetic : algebraic methods for better algorithms (CARAMBA), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-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)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), University of California [San Diego] (UC San Diego), University of California (UC), This work was possible thanks to a 32M-hour allocation on the Juwels super-computer from the PRACE research infrastructure.Experiments presented in this paper were carried out using the Grid'5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr).This work was supported by the French 'Ministère de l'Enseignement Supérieur et de la Recherche', by the 'Conseil Régional de Lorraine', by theEuropean Union, through the 'Cyber-Entreprises' project, and by the US National Science Foundation under grant no. 1651344.High Performance Computing resources were partially provided by the EXPLOR centre hosted by the University de Lorraine.Computations carried out at the University of Pennsylvania were performed on Cisco UCS servers donated by Cisco., Daniele Micciancio, Thomas Ristenpart, Grid5000, University of California, Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), This work was possible thanks to a 32M-hour allocation on the Juwels super-computer from the PRACE research infrastructure.Experiments presented in this paper were carried out using the Grid'5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr).This work was supported by the French ``Ministère de l'Enseignement Supérieur et de la Recherche', by the ``Conseil Régional de Lorraine', by theEuropean Union, through the ``Cyber-Entreprises' project, and by the US National Science Foundation under grant no.~1651344.High Performance Computing resources were partially provided by the EXPLOR centre hosted by the University de Lorraine.Computations carried out at the University of Pennsylvania were performed on Cisco UCS servers donated by Cisco., and Daniele Micciancio, Thomas Ristenpart
Subjects: FOS: Computer and information sciences, Computer Science - Cryptography and Security, Computer science, discrete logarithm, Computation, number field sieve, 02 engineering and technology, law.invention, General number field sieve, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Software, cryptanalysis, Factorization, law, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Hardware_ARITHMETICANDLOGICSTRUCTURES, Arithmetic, factoring, business.industry, Numerical digit, Factoring, Discrete logarithm, 020201 artificial intelligence & image processing, Cryptanalysis, business, Cryptography and Security (cs.CR)
Abstract: International audience; We report on two new records: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorization of RSA-768 in 2009 and a 768-bit discrete logarithm computation in 2016. Our two computations at the 795-bit level were done using the same hardware and software, and show that computing a discrete logarithm is not much harder than a factorization of the same size. Moreover, thanks to algorithmic variants and well-chosen parameters, our computations were significantly less expensive than anticipated based on previous records.The last page of this paper also reports on the factorization of RSA-250.
Published: 2020

5. Folding a focalized acoustical vortex on a flat holographic transducer: Miniaturized selective acoustical tweezers

Author: Olivier Bou Matar, Michael Baudoin, Antoine Riaud, Jean Louis Thomas, J.-C. Gerbedoen, Nikolay Smagin, Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 (IEMN), Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF), Acoustique Impulsionnelle & Magnéto-Acoustique Non linéaire - Fluides, Interfaces Liquides & Micro-Systèmes - IEMN (AIMAN-FILMS - IEMN), Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF), Puissance - IEMN (PUISSANCE - IEMN), Fudan University [Shanghai], State Key Laboratory of ASIC and System, School of Microelectronics, Fudan University, Transduction, Propagation et Imagerie Acoustique - IEMN (TPIA - IEMN), Institut d’Électronique, de Microélectronique et de Nanotechnologie - Département Opto-Acousto-Électronique - UMR 8520 (IEMN-DOAE), Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 (IEMN), Acoustique pour les nanosciences (INSP-E3), Institut des Nanosciences de Paris (INSP), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), AcknowledgmentsWe acknowledge the platform 'WaveSurf' from Université Polytechnique Hauts-de-France for performing the measurements with the laser interferometer. We also acknowledge A. Vlandas for critical reading of the manuscript and valuable advices that helped us improve its overall quality. Funding: This work was supported by SATT Nord. Author contributions: M.B., A.R., and J.-L.T. designed the research. M.B. and J.-C.G. built the setup and performed the experiments. M.B. and A.R. performed the numerical simulations. O.B.M., J.-C.G., and N.S. performed the field measurements with the interferometer. M.B., O.B.M., A.R., and J.-L.T. analyzed and interpreted the results. M.B., O.B.M., J.-C.G., A.R., and J.-L.T. wrote the paper. All authors approved the final version of the manuscript. Competing interests: J.-L.T., O.B.M., A.R., and M.B. are inventors on a patent application related to this work filed with the European Patent Office (application no. EP17198204.4, submitted 25 October 2017). All other authors declare that they have no competing interests. Data and materials availability: All data needed to evaluate the conclusions in the paper are present in the paper and/or the Supplementary Materials. Additional data related to this paper may be requested from the authors., RENATECH, Baudoin, Michael, Médecine Personnalisée, Pharmacogénomique, Optimisation Thérapeutique (MEPPOT - U1147), Université Paris Descartes - Paris 5 (UPD5)-Institut National de la Santé et de la Recherche Médicale (INSERM), Acoustique Impulsionnelle & Magnéto-Acoustique Non linéaire - Fluides, Interfaces Liquides & Micro-Systèmes - IEMN (AIMAN-FILMS-IEMN), Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-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)-Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 (IEMN), Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Université Polytechnique Hauts-de-France (UPHF)-Centrale Lille-Institut supérieur de l'électronique et du numérique (ISEN)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Université de Lille-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), Institut d’Électronique, de Microélectronique et de Nanotechnologie (IEMN) - UMR 8520 ( IEMN ), Ecole Centrale de Lille-Institut supérieur de l'électronique et du nunérique (ISEN)-Université de Valenciennes et du Hainaut-Cambresis ( UVHC ) -Université de Lille-Centre National de la Recherche Scientifique ( CNRS ), Université Paris Sorbonne Cité, INSERM UMR-S1147, Institut des Nanosciences de Paris ( INSP ), and Université Pierre et Marie Curie - Paris 6 ( UPMC ) -Centre National de la Recherche Scientifique ( CNRS )
Subjects: [PHYS.PHYS.PHYS-FLU-DYN]Physics [physics]/Physics [physics]/Fluid Dynamics [physics.flu-dyn], [PHYS.PHYS.PHYS-CLASS-PH]Physics [physics]/Physics [physics]/Classical Physics [physics.class-ph], Materials science, Acoustics, Microfluidics, Holography, FOS: Physical sciences, Physics - Classical Physics, Applied Physics (physics.app-ph), 02 engineering and technology, 01 natural sciences, law.invention, Engineering, [ PHYS.PHYS.PHYS-CLASS-PH ] Physics [physics]/Physics [physics]/Classical Physics [physics.class-ph], law, 0103 physical sciences, Tweezers, Miniaturization, Piezoelectric substrate, 010306 general physics, Research Articles, [ PHYS.MECA.ACOU ] Physics [physics]/Mechanics [physics]/Acoustics [physics.class-ph], Applied Physics, Multidisciplinary, Fluid Dynamics (physics.flu-dyn), SciAdv r-articles, Classical Physics (physics.class-ph), Physics - Applied Physics, Physics - Fluid Dynamics, [PHYS.PHYS.PHYS-FLU-DYN] Physics [physics]/Physics [physics]/Fluid Dynamics [physics.flu-dyn], 021001 nanoscience & nanotechnology, Vortex, [PHYS.MECA.ACOU]Physics [physics]/Mechanics [physics]/Acoustics [physics.class-ph], Folding (chemistry), Transducer, [ PHYS.PHYS.PHYS-FLU-DYN ] Physics [physics]/Physics [physics]/Fluid Dynamics [physics.flu-dyn], [PHYS.PHYS.PHYS-CLASS-PH] Physics [physics]/Physics [physics]/Classical Physics [physics.class-ph], [PHYS.MECA.ACOU] Physics [physics]/Mechanics [physics]/Acoustics [physics.class-ph], 0210 nano-technology, Research Article
Abstract: Selective manipulation of micrometric objects in a standard microscopy environment is possible with miniaturized acoustical tweezers., Acoustical tweezers based on focalized acoustical vortices hold the promise of precise contactless manipulation of millimeter down to submicrometer particles, microorganisms, and cells with unprecedented combined selectivity and trapping force. Yet, the widespread dissemination of this technology has been hindered by severe limitations of current systems in terms of performance and/or miniaturization and integrability. Here, we unleash the potential of focalized acoustical vortices by developing the first flat, compact, paired single electrode focalized acoustical tweezers. These tweezers rely on spiraling transducers obtained by folding a spherical acoustical vortex on a flat piezoelectric substrate. We demonstrate the ability of these tweezers to grab and displace micrometric objects in a standard microfluidic environment with unique selectivity. The simplicity of this system and its scalability to higher frequencies open tremendous perspectives in microbiology, microrobotics, and microscopy.
Published: 2019

6. Improving hydrogeological understanding through well-test interpretation by diagnostic plot and modelling: a case study in an alluvial aquifer in France

Author: B. Dewandel, Julio Gonçalvès, Bernard Ladouche, Bruno Arfib, Thibaut Garin, Centre européen de recherche et d'enseignement des géosciences de l'environnement (CEREGE), Institut de Recherche pour le Développement (IRD)-Aix Marseille Université (AMU)-Collège de France (CdF (institution))-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Gestion de l'Eau, Acteurs, Usages (UMR G-EAU), Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Institut de Recherche pour le Développement (IRD)-AgroParisTech-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Institut Agro - Montpellier SupAgro, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro), Bureau de Recherches Géologiques et Minières (BRGM) (BRGM), This paper is part of the Karst-Huveaune project funded by Agence de l’Eau Rhône Méditerranée Corse, Région Sud-PACA, Conseil Départemental des Bouches-du-Rhône, Aix-Marseille Provence Métropole, BRGM (French Geological Survey), and Aix-Marseille University. The authors would like to thank the Antea Group Aubagne, HydroAssistance and the SPL Eau des Collines for field collaboration and access to the data., Karst-Huveaune 2018-2022, Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Institut de Recherche pour le Développement (IRD)-AgroParisTech-Institut national d’études supérieures agronomiques de Montpellier (Montpellier SupAgro), and Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)
Subjects: 010504 meteorology & atmospheric sciences, 0207 environmental engineering, Borehole, Fluvial, Aquifer, Soil science, 02 engineering and technology, Analytical solutions, 01 natural sciences, Heterogenous alluvial aquifer, Earth and Planetary Sciences (miscellaneous), [SDU.STU.HY]Sciences of the Universe [physics]/Earth Sciences/Hydrology, 020701 environmental engineering, [SDU.STU.AG]Sciences of the Universe [physics]/Earth Sciences/Applied geology, 0105 earth and related environmental sciences, Water Science and Technology, geography, Multi-model approach, geography.geographical_feature_category, Hydrogeology, Well test, 6. Clean water, Alluvial plain, Diagnostic plot, Pumping test, Drawdown (hydrology), Geology, Test data
Abstract: As part of the Springer Nature Content Sharing Initiative, you can publicly share full-text access to a view-only version of your paper by using thefollowing SharedIt link: https://rdcu.be/cCd8u; International audience; The study of groundwater resources using pumping test data is usually carried out with the Theis solution, which enables the hydraulic parameters of porous aquifers such as the transmissivity and storage coefficient, to be estimated from the water-level drawdown. However, the data fitting can fail and provide only an indication that the pumped aquifer has a complex structure. Here, a diagnostic plot on log-derivative drawdown is used to identify flow regimes and thus aquifer heterogeneities, leading to plausible conceptual models. Nevertheless, the diagnostic plot is insufficient and must be accompanied by further modelling because of the nonuniqueness of the drawdown log-derivative signal. The proposed approach is applied to an alluvial plain in France, known to be complex because the deposition processes change over time, resulting in channel belts limited by low-permeability deposits in the floodplain or three-dimensional (3D) interconnected structures. Six analytical models were used to simulate drawdown and its derivatives during a three-day transient pumping test. The diagnostic performed on the pumping well showed that four conceptual models, with highly contrasted hydrodynamic behaviours, may correspond to the diagnostic. The joint use of pumping-well and observation-well data allowed the only appropriate model to be identified—a dual-permeability model characterizing a multilayer aquifer. The conceptual model matched the geological observations in boreholes and corroborates the fluvial sequence stratigraphy of the alluvial plain. The pumping test used here is a tool to explore the 3D architecture of the fluvial reservoir at the scale of the depositional sequence in the floodplain.; El estudio de los recursos hídricos subterráneos a partir de los datos de los ensayos de bombeo suele realizarse con la solución de Theis, que permite estimar los parámetros hidráulicos de los acuíferos porosos, como la transmisividad y el coeficiente de almacenamiento, a partir del descenso del nivel del agua. Sin embargo, el ajuste de los datos puede no funcionar y proporcionar sólo una indicación de que el acuífero bombeado tiene una estructura compleja. En este caso, se utiliza un diagrama de diagnóstico de la depresión logarítmica derivada para identificar los regímenes de flujo y, por tanto, las heterogeneidades del acuífero, lo que conduce a modelos conceptuales plausibles. Sin embargo, el diagrama de diagnóstico es insuficiente y debe ir acompañado de una modelización adicional debido a la no unicidad de la señal log-derivada de la depresión. El enfoque propuesto se aplica a una llanura aluvial en Francia, conocida por su complejidad debido a que los procesos de deposición cambian con el tiempo, dando lugar a franjas de canales limitadas por depósitos de baja permeabilidad en la llanura de inundación o a estructuras tridimensionales (3D) interconectadas. Se utilizaron seis modelos analíticos para simular la depresión y sus derivados durante un ensayo de bombeo transitorio de tres días. El diagnóstico realizado en el pozo de bombeo mostró que pueden corresponder cuatro modelos conceptuales, con comportamientos hidrodinámicos muy contrastados. La utilización conjunta de los datos del pozo de bombeo y del pozo de observación permitió identificar el único modelo apropiado: un modelo de doble permeabilidad que caracteriza un acuífero multicapa. El modelo conceptual coincidió con las observaciones geológicas en pozos de sondeo y corrobora la estratigrafía de la secuencia fluvial de la llanura aluvial. El ensayo de bombeo utilizado aquí es una herramienta para explorar la arquitectura 3D del depósito fluvial a escala de la secuencia deposicional en la llanura aluvial.; L’étude des ressources en eau souterraine à partir de données d’essais de pompage est généralement réalisée avec la solution de Theis, qui permet d’estimer les paramètres hydrauliques des aquifères poreux, tels que la transmissivité et le coefficient d’emmagasinement, à partir du rabattement du niveau d’eau. Cependant, l’ajustement des données peut échouer et fournir seulement une indication relative à la complexité de la structure de l’aquifère sollicité par pompage. Ici, un tracé de diagnostic de la dérivé du rabattement selon une échelle logarithmique est utilisé pour identifier les régimes d’écoulement et donc les hétérogénéités de l’aquifère, conduisant à des modèles conceptuels plausibles. Néanmoins, le diagnostic de puits est insuffisant et doit être accompagné d’une modélisation plus poussée en raison de la non-unicité du signal de la dérivée du rabattement selon une échelle logarithmique. L’approche proposée est appliquée à une plaine alluviale en France, connue pour être complexe car les processus de dépôt ont évolué au cours du temps, donnant lieu à des zones de chenaux limitées par des dépôts peu perméables dans la plaine d’inondation ou à des structures tridimensionnelles (3D) interconnectées. Six modèles analytiques ont été utilisés pour simuler le rabattement et ses dérivés pendant un essai de pompage transitoire de trois jours. Le diagnostic réalisé sur le puits de pompage a montré que quatre modèles conceptuels, aux comportements hydrodynamiques très contrastés, peuvent correspondre au diagnostic. L’utilisation conjointe des données des puits de pompage et des puits d’observation a permis d’identifier le seul modèle approprié - un modèle à double perméabilité caractérisant un aquifère multicouche. Le modèle conceptuel correspond aux observations géologiques dans les forages et corrobore la stratigraphie séquentielle fluviale de la plaine alluviale. L’essai de pompage utilisé ici est un outil permettant d’explorer l’architecture 3D du réservoir fluvial à l’échelle de la séquence de dépôt dans la plaine d’inondation.; O estudo dos recursos hídricos subterrâneos utilizando dados de teste de vazão é comumente resolvido por meio da equação de Theis, o que permite que os parâmetros hidráulicos dos aquíferos porosos, como a transmissividade e o coeficiente de armazenamento, possam ser estimados a partir do rebaixamento do nível d’água. Porém, o ajuste dos dados pode falhar, indicando apenas que o aquífero bombeado apresenta uma estrutura complexa. Aqui, um gráfico de diagnóstico da derivada logarítmica do rebaixamento é usado para identificar o regime de fluxo e, portanto, a heterogeneidade do aquífero, levando a modelos conceituais plausíveis. Ainda assim, o gráfico de diagnóstico é insuficiente e deve ser acompanhado de mais modelos, devido ao sinal não único da derivada logarítmica do rebaixamento. A abordagem proposta foi utilizada em uma planície aluvial na França, conhecida por ser complexa, pois os processos de deposição mudam com o tempo, o que resulta em um cinturão de canais limitados por depósitos de baixa permeabilidade na planície de inundação ou por estruturas tridimensionais (3D) interconectadas. Seis modelos analíticos foram utilizados para simular o rebaixamento, e suas funções derivadas, durante um teste de bombeamento transiente de 3 dias. O diagnóstico simulado para o poço de bombeamento mostrou que quatro modelos conceituais, cada um com comportamento hidrodinâmico contrastante, podem corresponder ao diagnóstico. A junção dos dados do poço de bombeamento e dos dados de poço de observação permitiu a identificação do único modelo apropriado – um modelo de permeabilidade dual caracterizando um aquífero multicamadas. O modelo conceitual coincide com as observações da geologia dos poços e corrobora com a sequência estratigráfica fluvial da planície aluvial. O teste de bombeamento utilizado é uma ferramenta para explorar a arquitetura 3D do reservatório fluvial na escala da sequência deposicional da planície de inundação.; 利用抽水试验数据研究地下水资源通常采用 Theis 解, 它可以根据水位降深估算多孔介质含水层的水力参数, 如传导系数和蓄水系数。然而, 数据拟合可能会失败, 并且只能表明抽水含水层具有复杂的结构。在这里, 对数导数降深的诊断图用于识别流态, 从而识别含水层的异质性, 由此可形成合理的概念模型。然而, 由于降深对数导数信号的非唯一性, 仅用诊断图是不够的, 必须再建模分析。所提出的方法应用于法国众所周知复杂的冲积平原, 由于沉积过程随时间变化, 导致河岸带受到漫滩中低渗透性沉积物或三维 (3D) 互连结构的影响。在为期三天的非稳定抽水测试期间, 六个解析解模型用于模拟降深及其导数。抽水井上进行的诊断表明, 具有高度异质的水动力行为的四个概念模型可能与诊断相符。抽水井和观测井数据的联合使用可确定唯一合适的模型, 即表征多层含水层的双渗透模型。概念模型与钻孔中的地质观察相匹配, 并证实了冲积平原的河流相地层。此处使用的抽水试验是在漫滩沉积相尺度上探索冲积相储层 3D 结构的工具。
Published: 2021

7. Tuning gelatin-based hydrogel towards bioadhesive ocular tissue engineering applications

Author: Miguel Gonzalez-Andrades, James Chodosh, Sina Sharifi, Tom Eirik Mollnes, Rakibul Islam, Felisa Reyes-Ortega, Per H. Nilsson, David Alba-Molina, Claes H. Dohlman, Mohammad Mirazul Islam, Darrell J. Koza, Hannah Sharifi, [Sharifi,S, Islam,MM, Sharifi,H, Dohlman,CH, Chodosh,J, Gonzalez-Andrades,M] Massachusetts Eye and Ear and Schepens Eye Research Institute, Department of Ophthalmology, Harvard Medical School, Boston, MA, USA. [Islam, Nilsson,PH, Mollnes,TE, ] Department of Immunology, Oslo University Hospital, Rikshospitalet, University of Oslo, Oslo, Norway. [Koza,D] Department of Physical Sciences, Eastern Connecticut State University, Willimantic, CT, USA. [Nilsson,PH] Linnaeus Center for Biomaterials Chemistry, Linnaeus University, Kalmar, Sweden. [Mollnes,TE] Research Laboratory, Nordland Hospital, Bodø, Norway. [Mollnes,TE] Centre of Molecular Inflammation Research, Norwegian University of Science and Technology, Trondheim, Norway. [Reyes-Ortega,F, Alba-Molina,D, Gonzalez-Andrades,M] Maimonides Biomedical Research Institute of Cordoba (IMIBIC), Department of Ophthalmology, Reina Sofia University Hospital and University of Cordoba, Cordoba, Spain. [Mollnes,TE] Faculty of Health Sciences, K.G. Jebsen TREC, University of Tromsø, Norway., and This paper was supported by the Boston-KPro research fund and NIH/NEI P30EY003790 (Core-PA). R.S. was supported in part by the K99 grant from NIH award no. K99 EY030553. This work was performed in part at the Center for Nanoscale Systems (CNS), Harvard University, a member of the National Nanotechnology Coordinated Infrastructure Network (NNCI), which is supported by the National Science Foundation under NSF award no. 1541959. F.R-O and D.A-M were supported by the research project ICI19/00006, funded by Instituto de Salud Carlos III and co-funded by European Union (ERDF/ESF, 'A way to make Europe'/'Investing in your future'). F.R-O additionally acknowledges funding from Plan Andaluz de Investigación, Desarrollo e Innovación (PAIDI2020) Fellowship supported by Consejería de Economía, Conocimiento, Empresas y Universidad, Junta de Andalucía co-funded by Fondo Social Europeo de Andalucía 2014-2020.
Subjects: Biocompatible, Glycidyl methacrylate, Light, Anatomy::Digestive System::Liver [Medical Subject Headings], Anatomy::Urogenital System::Urinary Tract::Kidney [Medical Subject Headings], Analytical, Diagnostic and Therapeutic Techniques and Equipment::Equipment and Supplies::Bandages [Medical Subject Headings], Analytical, Diagnostic and Therapeutic Techniques and Equipment::Equipment and Supplies::Surgical Equipment::Surgical Fixation Devices::Tissue Adhesives [Medical Subject Headings], 02 engineering and technology, Gelatin, Metacrilatos, Anatomy::Cardiovascular System::Blood Vessels::Arteries::Aorta [Medical Subject Headings], Cornea, Extracellular matrix, chemistry.chemical_compound, Chemicals and Drugs::Organic Chemicals::Ethers::Ethers, Cyclic::Epoxy Compounds [Medical Subject Headings], Materiales biocompatibles, Biology (General), Materials of engineering and construction. Mechanics of materials, Disciplines and Occupations::Natural Science Disciplines::Biological Science Disciplines::Biotechnology::Biomimetics [Medical Subject Headings], Phenomena and Processes::Physical Phenomena::Optical Phenomena::Light [Medical Subject Headings], Adhesion, 021001 nanoscience & nanotechnology, Analytical, Diagnostic and Therapeutic Techniques and Equipment::Investigative Techniques::Bioprinting [Medical Subject Headings], VDP::Medical disciplines: 700::Basic medical, dental and veterinary science disciplines: 710, Chemicals and Drugs::Amino Acids, Peptides, and Proteins::Proteins::Scleroproteins::Gelatin [Medical Subject Headings], Anatomy::Sense Organs::Eye::Anterior Eye Segment::Cornea [Medical Subject Headings], Gelatina, Technology and Food and Beverages::Technology, Industry, and Agriculture::Manufactured Materials::Adhesives [Medical Subject Headings], TA401-492, Methacrylates, Biomimetic, 0210 nano-technology, Biotechnology, food.ingredient, Materials science, Biocompatibility, QH301-705.5, Bioadhesive, 0206 medical engineering, Biomedical Engineering, Article, Tissue adhesives, Hidrogeles, Biomaterials, Adhesivos tisulares, Natural-based hydrogel, food, Biomimética, Chemicals and Drugs::Complex Mixtures::Colloids::Gels::Hydrogels [Medical Subject Headings], Anatomy::Tissues::Lymphoid Tissue::Spleen [Medical Subject Headings], VDP::Medisinske Fag: 700::Basale medisinske, odontologiske og veterinærmedisinske fag: 710, Luz, 020601 biomedical engineering, Córnea, Transplantation, chemistry, Chemicals and Drugs::Organic Chemicals::Carboxylic Acids::Acids, Acyclic::Acrylates::Methacrylates [Medical Subject Headings], Adhesive, Biomedical engineering
Abstract: Gelatin based adhesives have been used in the last decades in different biomedical applications due to the excellent biocompatibility, easy processability, transparency, non-toxicity, and reasonable mechanical properties to mimic the extracellular matrix (ECM). Gelatin adhesives can be easily tuned to gain different viscoelastic and mechanical properties that facilitate its ocular application. We herein grafted glycidyl methacrylate on the gelatin backbone with a simple chemical modification of the precursor, utilizing epoxide ring-opening reactions and visible light-crosslinking. This chemical modification allows the obtaining of an elastic protein-based hydrogel (GELGYM) with excellent biomimetic properties, approaching those of the native tissue. GELGYM can be modulated to be stretched up to 4 times its initial length and withstand high tensile stresses up to 1.95 MPa with compressive strains as high as 80% compared to Gelatin-methacryloyl (GeIMA), the most studied derivative of gelatin used as a bioadhesive. GELGYM is also highly biocompatible and supports cellular adhesion, proliferation, and migration in both 2 and 3-dimensional cell-cultures. These characteristics along with its super adhesion to biological tissues such as cornea, aorta, heart, muscle, kidney, liver, and spleen suggest widespread applications of this hydrogel in many biomedical areas such as transplantation, tissue adhesive, wound dressing, bioprinting, and drug and cell delivery., Graphical abstract Image 1, Highlights • Gelatin based adhesives have been used in the last decades in different biomedical applications. • Gelatin adhesives can be easily tuned to gain different viscoelastic and mechanical properties that facilitate its ocular application. • We herein grafted glycidyl methacrylate on the gelatin backbone with a simple chemical modification of the precursor. • Epoxide ring-opening reactions and visible light-crosslinking allows the obtaining of an elastic gelatin-based hydrogel (GELGYM). • GELGYM shows excellent biomimetic properties, approaching those of the native tissue.
Published: 2021

8. Distance-Aware Relay Selection in an Energy-Efficient Discovery Protocol for 5G D2D Communication

Author: Nadège Varsier, Cesar Vargas Anamuro, Jean Schwoerer, Xavier Lagrange, Advanced technologies for operated networks (ADOPNET), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), 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)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec, Orange Labs [Meylan], Orange Labs, Département Systèmes Réseaux, Cybersécurité et Droit du numérique (IMT Atlantique - SRCD), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), This paper is part of and thereby supported by the Horizon 2020 project ONE5G (ICT-760809) receiving funds from the European Union., European Project: ICT-760809,ONE5G(2017), Université de Rennes (UR)-IMT Atlantique (IMT Atlantique), 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 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), and IMT Atlantique (IMT Atlantique)
Subjects: Computer science, stochastic geometry, 02 engineering and technology, law.invention, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-MC]Computer Science [cs]/Mobile Computing, Base station, Relay, law, Telecommunications link, 0202 electrical engineering, electronic engineering, information engineering, Path loss, Electrical and Electronic Engineering, business.industry, Applied Mathematics, energy-efficient, 020206 networking & telecommunications, Energy consumption, relay selection, Computer Science Applications, User equipment, D2D relaying, Cellular network, mMTC, business, Efficient energy use, Computer network
Abstract: International audience; Massive machine-type communications (mMTC) is one of the main services delivered by the fifth Generation (5G) mobile network. The traditional cellular architecture where all devices connect to the base station is not energy efficient. For this reason, the use of device-to-device (D2D) communications is considered to reduce the energy consumption of mMTC devices. The main idea is to use nearby user equipment (UE) as a relay and establish with it D2D communication. However, the relay selection process also consumes energy, and this consumption can be significant compared to the energy consumed during the data transmission phase. In this paper, we propose a distributed energy-efficient D2D relaying mechanism for mMTC applications. This mechanism favors the selection of the UEs with low path loss with the mMTC device. Through mathematical analysis and simulations, we show that our mechanism allows a reduction of the total energy consumption of mMTC devices (up to 75% compared to direct transmission) when they have an unfavorable link budget. Moreover, our mechanism achieves almost constant energy consumption for a large range of UE densities and distances between the mMTC device and the base station.
Published: 2021

9. More efficient periodic traversal in anonymous undirected graphs

Author: Kunihiko Sadakane, Ioannis Lignos, Leszek Gsieniec, Ralf Klasing, Jesper Jansson, Stefan Dobrev, Russell Martin, David Ilcinkas, Wing-Kin Sung, Jurek Czyzowicz, Département d'Informatique et d'Ingénierie (DII), Université du Québec en Outaouais (UQO), Institute of Mathematics, Slovak Academy of Science [Bratislava] (SAS), Department of Computer Science [Liverpool], University of Liverpool, 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), Algorithmics for computationally intensive applications over wide scale distributed platforms (CEPAGE), Université Sciences et Technologies - Bordeaux 1-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Ochanomizu University, Department of Computer Science, Durham University, Principles of Informatics Research Division, National Institute of Informatics (NII), National University of Singapore (NUS), See paper for details, ANR-07-BLAN-0322,ALADDIN,Algorithm Design and Analysis for Implicitly and Incompletely Defined Interaction Networks(2007), INRIA Futurs, See paper for details., ANR-05-MMSA-0006,ALPAGE,ALgorithmique des Plates-formes A Grande Echelle(2005), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), and Université Sciences et Technologies - Bordeaux 1 (UB)-Inria Bordeaux - Sud-Ouest
Subjects: FOS: Computer and information sciences, General Computer Science, Discrete Mathematics (cs.DM), [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Comparability graph, Constant-memory agent, 0102 computer and information sciences, 02 engineering and technology, Strength of a graph, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Upper and lower bounds, law.invention, Theoretical Computer Science, Combinatorics, Graph exploration, law, Graph power, Line graph, Graph traversal, 0202 electrical engineering, electronic engineering, information engineering, Algorithms and data structures, Oblivious agent, Undirected graph, Mathematics, Discrete mathematics, Mobile entity, Voltage graph, Three-layer partition, Butterfly graph, Periodic graph traversal, Tree traversal, 010201 computation theory & mathematics, 020201 artificial intelligence & image processing, Periodic graph (geometry), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Null graph, Span tree, Period length, Computer Science - Discrete Mathematics, Computer Science(all)
Abstract: International audience; We consider the problem of periodic graph exploration in which a mobile entity with constant memory, an agent, has to visit all n nodes of an input simple, connected, undirected graph in a periodic manner. Graphs are assumed to be anonymous, that is, nodes are unlabeled. While visiting a node, the agent may distinguish between the edges incident to it; for each node v, the endpoints of the edges incident to v are uniquely identified by different integer labels called port numbers. We are interested in algorithms for assigning the port numbers together with traversal algorithms for agents using these port numbers to obtain short traversal periods. Periodic graph exploration is unsolvable if the port numbers are set arbitrarily; see Budach (1978) [1]. However, surprisingly small periods can be achieved by carefully assigning the port numbers. Dobrev et al. (2005) [4] described an algorithm for assigning port numbers and an oblivious agent (i.e., an agent with no memory) using it, such that the agent explores any graph with n nodes within the period 10n. When the agent has access to a constant number of memory bits, the optimal length of the period was proved in Gąsieniec et al. (2008) [7] to be no more than 3.75n−2 (using a different assignment of the port numbers and a different traversal algorithm). In this paper, we improve both these bounds. More precisely, we show how to achieve a period length of at most for oblivious agents and a period length of at most 3.5n−2 for agents with constant memory. To obtain our results, we introduce a new, fast graph decomposition technique called a three-layer partition that may also be useful for solving other graph problems in the future. Finally, we present the first non-trivial lower bound, 2.8n−2, on the period length for the oblivious case.
Published: 2012

10. Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks

Author: Johannes Thürauf, Fränk Plein, Martine Labbé, Martin Schmidt, Integrated Optimization with Complex Structure (INOCS), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université libre de Bruxelles (ULB)-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), Département d'Informatique [Bruxelles] (ULB), Faculté des Sciences [Bruxelles] (ULB), Université libre de Bruxelles (ULB)-Université libre de Bruxelles (ULB), Trier University, Friedrich-Alexander Universität Erlangen-Nürnberg (FAU), and Martine Labbé has been partially supported by the Fonds de la Recherche Scientifique - FNRS under Grant no PDR T0098.18. Fränk Plein thanks the Fonds de la Recherche Scientifique - FNRS for his Aspirant fellowship supporting the research for this publication. He also thanks the Deutsche Forschungsgemeinschaft for their support within the project Z01 in CRC TRR 154. This research has been performed as part of the Energie Campus Nürnberg and is supported by funding of the Bavarian State Government. The third and fourth author also thank the DFG for their support within projects A05, B07, and B08 in CRC TRR 154. Finally, we want to thank Lars Schewe for many fruitful discussions on the topic of this paper.
Subjects: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Gas networks, Mathematical optimization, Computational complexity theory, Computer Networks and Communications, Computer science, Dimension (graph theory), 0211 other engineering and technologies, System of polynomial equations, Modèles mathématiques d'aide à la décision, 02 engineering and technology, Cycle, Optimisation de réseaux, Informatique mathématique, 0502 economics and business, Real algebraic geometry, Time complexity, European entry-exit market, 050210 logistics & transportation, computational complexity, 021103 operations research, cycle, 05 social sciences, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Maximization, potential-based flows, Potential-based flows, Computational complexity, Nonlinear system, Bookings, Flow (mathematics), bookings, Hardware and Architecture, 90B10, 90C30, 90C35, 90C90, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], gas networks, Software, Information Systems
Abstract: We show that the feasibility of a booking in the European entry-exit gas market can be decided in polynomial time on single-cycle networks that are passive, i.e. do not contain controllable elements. The feasibility of a booking can be characterized by solving polynomially many nonlinear potential-based flow models for computing so-called potential-difference maximizing load flow scenarios. We thus analyze the structure of these models and exploit both the cyclic graph structure as well as specific properties of potential-based flows. This enables us to solve the decision variant of the nonlinear potential-difference maximization by reducing it to a system of polynomials of constant dimension that is independent of the cycle's size. This system of fixed dimension can be handled with tools from real algebraic geometry to derive a polynomial-time algorithm. The characterization in terms of potential-difference maximizing load flow scenarios then leads to a polynomial-time algorithm for deciding the feasibility of a booking. Our theoretical results extend the existing knowledge about the complexity of deciding the feasibility of bookings from trees to single-cycle networks., SCOPUS: ar.j, info:eu-repo/semantics/published
Published: 2021

11. Adaptive control of Lipschitz time-delay systems by sigma modification with application to neuronal population dynamics

Author: Alain Destexhe, Jakub Orlowski, Antoine Chaillet, Mario Sigalotti, Laboratoire des signaux et systèmes (L2S), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Institut Universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), Institut des Neurosciences Paris-Saclay (NeuroPSI), Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Control And GEometry (CaGE ), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jacques-Louis Lions (LJLL (UMR_7598)), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Laboratoire Jacques-Louis Lions (LJLL (UMR_7598)), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), This paper has received support from the Institute for Control and Decision of Paris Saclay (iCODE), France and Digiteo, France. AD was supported by the CNRS, France and the European Commission (Human Brain Project H2020-945539)., Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP), and Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP)
Subjects: 0209 industrial biotechnology, Time-delay systems, Adaptive control, General Computer Science, Computer science, Mechanical Engineering, Dynamics (mechanics), Sigma, 02 engineering and technology, Dissipation, Sigma modification, Lipschitz continuity, Nonlinear system, Neuronal populations, 020901 industrial engineering & automation, Quadratic equation, Control and Systems Engineering, Control theory, Stability in the mean, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Electrical and Electronic Engineering, Neuronal population
Abstract: International audience; Adaptive control using the -modification provides an easily implementable way to stabilize systems with uncertain or fluctuating parameters. Motivated by a specific application from neuroscience, we extend here this methodology to nonlinear time-delay systems ruled by globally Lipschitz dynamics. In order to make the result more handy in practice, we provide an explicit construction of a Lyapunov–Krasovskii functional (LKF) with linear bounds and strict dissipation rate based on the knowledge of an LKF with quadratic bounds and point-wise dissipation rate. When applied to a model of neuronal populations involved in Parkinson’s disease, the benefits with respect to a pure proportional stabilization scheme are discussed through numerical simulations.
Published: 2022

12. Bayesian optimization using deep Gaussian processes with applications to aerospace system design

Author: Nouredine Melab, El-Ghazali Talbi, Mathieu Balesdent, Loïc Brevault, Ali Hebbal, DTIS, ONERA, Université Paris Saclay [Palaiseau], ONERA-Université Paris-Saclay, 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), and This work is co-funded by ONERA-The French Aerospace Lab and Université de Lille, in the context of a joint PhD thesis. Discussions with Hugh Salimbeni and Zhenwen Dai were very helpful for this work, special thanks to them. The Experiments presented in this paper were carried out using the Grid’5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr).
Subjects: Mathematical optimization, 021103 operations research, Control and Optimization, Optimization problem, Covariance function, Computer science, Mechanical Engineering, Bayesian optimization, 0211 other engineering and technologies, Aerospace Engineering, Context (language use), 02 engineering and technology, symbols.namesake, Test case, [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], symbols, Systems design, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], 021108 energy, Electrical and Electronic Engineering, Representation (mathematics), Gaussian process, ComputingMilieux_MISCELLANEOUS, Software, Civil and Structural Engineering
Abstract: Bayesian Optimization using Gaussian Processes is a popular approach to deal with optimization involving expensive black-box functions. However, because of the assumption on the stationarity of the covariance function defined in classic Gaussian Processes, this method may not be adapted for non-stationary functions involved in the optimization problem. To overcome this issue, Deep Gaussian Processes can be used as surrogate models instead of classic Gaussian Processes. This modeling technique increases the power of representation to capture the non-stationarity by considering a functional composition of stationary Gaussian Processes, providing a multiple layer structure. This paper investigates the application of Deep Gaussian Processes within Bayesian Optimization context. The specificities of this optimization method are discussed and highlighted with academic test cases. The performance of Bayesian Optimization with Deep Gaussian Processes is assessed on analytical test cases and aerospace design optimization problems and compared to the state-of-the-art stationary and non-stationary Bayesian Optimization approaches.
Published: 2020

13. A general global-local modelling framework for the deterministic optimisation of composite structures

Author: Marco Picchi Scardaoni, Marco Montemurro, Institut de Mécanique et d'Ingénierie de Bordeaux (I2M), École Nationale Supérieure d'Arts et Métiers (ENSAM), Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-Institut Polytechnique de Bordeaux-Centre National de la Recherche Scientifique (CNRS)-Université de Bordeaux (UB)-Institut National de la Recherche Agronomique (INRA), University of Pisa - Università di Pisa, and This paper presents part of the activities carried out within the research project PARSIFAL ('PrandtlPlane ARchitecture for the Sustainable Improvement of Future AirpLanes'), which has been funded by the European Union under the Horizon 2020 Research and Innovation Program (Grant Agreement n.723149)
Subjects: Mathematical optimization, Control and Optimization, Cantilever, Local modelling approach, Computer science, 0211 other engineering and technologies, 02 engineering and technology, Marsaglia polar method, Design strategy, [SPI.MECA.SOLID]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Solid mechanics [physics.class-ph], 01 natural sciences, Polar method, 021105 building & construction, Mécanique: Mécanique des structures [Sciences de l'ingénieur], 0101 mathematics, Anisotropy, Composites, Buckling, Deterministic optimisation, Global/local modelling approach, Deterministic Optimisation, Mécanique: Mécanique des solides [Sciences de l'ingénieur], Global, Optimisation et contrôle [Mathématique], Computer Graphics and Computer-Aided Design, Computer Science Applications, Design for manufacturability, 010101 applied mathematics, [SPI.MECA.STRU]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Structural mechanics [physics.class-ph], Control and Systems Engineering, Macroscopic scale, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Engineering design process, Software
Abstract: International audience; This work deals with the multi-scale optimisation of composite structures by adopting a general global-local (GL) modelling strategy to assess the structure responses at different scales. The GL modelling approach is integrated into the multi-scale two-level optimisation strategy (MS2LOS) for composite structures. The resulting design strategy is, thus, called GL-MS2LOS and aims at proposing a very general formulation of the design problem, without introducing simplifying hypotheses on the laminate stack and by considering, as design variables, the full set of geometric and mechanical parameters defining the behaviour of the composite structure at each pertinent scale. By employing a GL modelling approach, most of the limitations of well-established design strategies, based on analytical or semi-empirical models, are overcome. The GL-MS2LOS makes use of the polar formalism to describe the anisotropy of the composite at the macroscopic scale (where it is modelled as an equivalent homogeneous anisotropic plate). In this work, deterministic algorithms are exploited during the solution search phase. The challenge, when dealing with such a design problem, is to develop a suitable formulation and dedicated operators, to link global and local models physical responses and their gradients. Closed-form expressions of structural responses gradients are rigorously derived by taking into account for the coupling effects when passing from global to local models. The effectiveness of the GL-MS2LOS is proven on a meaningful benchmark: the least-weight design of a cantilever wing subject to different design requirements. Constraints include maximum allowable displacements, maximum allowable strains, blending, manufacturability requirements and buckling factor.; This work deals with the multi-scale optimisation of composite structures by adopting a general global-local (GL) modelling strategy to assess the structure responses at different scales. The GL modelling approach is integrated into the multi-scale two-level optimisation strategy (MS2LOS) for composite structures. The resulting design strategy is, thus, called GL-MS2LOS and aims at proposing a very general formulation of the design problem, without introducing simplifying hypotheses on the laminate stack and by considering, as design variables, the full set of geometric and mechanical parameters defining the behaviour of the composite structure at each pertinent scale. By employing a GL modelling approach, most of the limitations of well-established design strategies, based on analytical or semi-empirical models, are overcome. The GL-MS2LOS makes use of the polar formalism to describe the anisotropy of the composite at the macroscopic scale (where it is modelled as an equivalent homogeneous anisotropic plate). In this work, deterministic algorithms are exploited during the solution search phase. The challenge, when dealing with such a design problem, is to develop a suitable formulation and dedicated operators, to link global and local models physical responses and their gradients. Closed-form expressions of structural responses gradients are rigorously derived by taking into account for the coupling effects when passing from global to local models. The effectiveness of the GL-MS2LOS is proven on a meaningful benchmark: the least-weight design of a cantilever wing subject to different design requirements. Constraints include maximum allowable displacements, maximum allowable strains, blending, manufacturability requirements and buckling factor.
Published: 2020

14. Production-based pollution versus deforestation: optimal policy with state-independent and-dependent environmental absorption efficiency restoration process

Author: Marc Leandri, Eugene Khmelnitsky, Fouad El Ouardighi, ESSEC Business School [Cergy-Pontoise], Tel Aviv University [Tel Aviv], Centre d'études sur la mondialisation, les conflits, les territoires et les vulnérabilités (Cemotev), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), Tel Aviv University, TAU, and The authors acknowledge helpful comments from one anonymous referee. This research was supported by ESSEC Business School (France) and Tel Aviv University (Israel). The first author dedicates this paper to the memory of Mohamed El Houari, a wonderful mentor and friend.
Subjects: Pollution, Natural resource economics, Process (engineering), media_common.quotation_subject, 0211 other engineering and technologies, General Decision Sciences, Social Welfare, 02 engineering and technology, Management Science and Operations Research, History dependence, Deforestation, 11. Sustainability, Restoration process, Production (economics), 10. No inequality, Environmental absorption efficiency, media_common, 021103 operations research, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 15. Life on land, 13. Climate action, Sustainability, Environmental science, Optimal pollution, Absorption efficiency
Abstract: International audience; An important yet largely unexamined issue is how the interaction between deforestation and pollution affects economic and environmental sustainability.This article seeks to bridge the gap by introducing a dynamic model of pollution accumulation where polluting emissions can be mitigated and the absorption efficiency of pollution sinks can be restored. We assume that emissions are due to a production activity, and we include deforestation both as an additional source of emissions and as a cause of the exhaustion of environmental absorption efficiency. To account for the fact that the switching of natural sinks to a pollution source can be either possible, and in such a case even reversible, or impossible, we consider that restoration efforts can be either independent from or dependent on environmental absorption efficiency, i.e., state-independent versus state-dependent restoration efforts. We determine (i) whether production or deforestation is the most detrimental from environmental and social welfare perspectives, and (ii) how state-dependent restoration process affects pollution accumulation and deforestation policies and the related environmental and social welfare consequences.
Published: 2020

15. An iterative dynamic programming approach for the temporal knapsack problem

Author: Boris Detienne, Gaël Guillot, François Clautiaux, 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), This work was funded by Investments for the future Program IdEx Bordeaux, Cluster of ExcellenceSySNum.Experiments presented in this paper were carried out using the PLAFRIM experimental testbed,being developed under the Inria PlaFRIM development action with support from Bordeaux INP, LABRIand IMB and other entities: Conseil R ́egional d’Aquitaine, Universit ́e de Bordeaux, CNRS and ANR inaccordance to the programme d’investissements d’Avenir (see https://www.plafrim.fr/), Plafrim, 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, Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université Sciences et Technologies - Bordeaux 1-Université Bordeaux Segalen - Bordeaux 2-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université Sciences et Technologies - Bordeaux 1-Université Bordeaux Segalen - Bordeaux 2-Institut de Mathématiques de Bordeaux (IMB), and 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é 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, Generalization, Temporal knapsack, 0211 other engineering and technologies, 02 engineering and technology, Management Science and Operations Research, Industrial and Manufacturing Engineering, Set (abstract data type), symbols.namesake, Lagrangian Relaxation, 0502 economics and business, 050210 logistics & transportation, 021103 operations research, 05 social sciences, Exact algorithm, Successive Sublimation Dynamic Programming method, Exponential function, Dynamic programming, Lagrangian relaxation, Knapsack problem, Modeling and Simulation, symbols, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
Abstract: International audience; In this paper, we address the temporal knapsack problem (TKP). In this generalization of the classical knapsack problem, selected items enter and leave the knapsack at fixed dates. We solve the TKP with a dynamic program of exponential size, which is solved using a method called Successive Sublimation Dynamic Programming (SSDP). This method starts by relaxing a set of constraints from the initial problem, and iteratively reintroduces them when needed. We show that a direct application of SSDP to the temporal knapsack problem does not lead to an effective method, and that several improvements are needed to compete with the best results from the literature.
Published: 2021

16. Explaining Deep Learning Models for Speech Enhancement

Author: Sunit Sivasankaran, Emmanuel Vincent, Dominique Fohr, Microsoft Corporation [Redmond], Microsoft Corporation [Redmond, Wash.], Speech Modeling for Facilitating Oral-Based Communication (MULTISPEECH), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), This work was made with the support of the French National Research Agency, in the framework of the project VOCADOM 'Robust voice command adapted to the user and to the context for AAL' (ANR-16-CE33-0006). Experiments presented in this paper were carried out using the Grid’5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as otherorganizations (see https://www.grid5000.fr)., ANR-16-CE33-0006,VOCADOM,Commande vocale robuste adaptée à la personne et au contexte pour l'autonomie à domicile(2016), 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), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Artificial neural network, business.industry, Computer science, Deep learning, Speech recognition, Word error rate, 020206 networking & telecommunications, Context (language use), 02 engineering and technology, explainable AI, Speech enhancement, 030507 speech-language pathology & audiology, 03 medical and health sciences, Noise, feature attribution, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Robustness (computer science), [INFO.INFO-SD]Computer Science [cs]/Sound [cs.SD], 0202 electrical engineering, electronic engineering, information engineering, Feature (machine learning), speech enhancement, Artificial intelligence, 0305 other medical science, business
Abstract: International audience; We consider the problem of explaining the robustness of neural networks used to compute time-frequency masks for speech enhancement to mismatched noise conditions. We employ the Deep SHapley Additive exPlanations (DeepSHAP) feature attribution method to quantify the contribution of every timefrequency bin in the input noisy speech signal to every timefrequency bin in the output time-frequency mask. We define an objective metric-referred to as the speech relevance scorethat summarizes the obtained SHAP values and show that it correlates with the enhancement performance, as measured by the word error rate on the CHiME-4 real evaluation dataset. We use the speech relevance score to explain the generalization ability of three speech enhancement models trained using synthetically generated speech-shaped noise, noise from a professional sound effects library, or real CHiME-4 noise. To the best of our knowledge, this is the first study on neural network explainability in the context of speech enhancement.
Published: 2021

17. Modeling and training strategies for language recognition systems

Author: Raphaël Duroselle, Denis Jouvet, Md. Sahidullah, Irina Illina, Speech Modeling for Facilitating Oral-Based Communication (MULTISPEECH), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), 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)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Experiments presented in this paper were carried out using the Grid5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr). This work has been partly funded by the French Direction Générale de l’Armement., Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)
Subjects: business.industry, Computer science, multi-task training, 020206 networking & telecommunications, 02 engineering and technology, computer.software_genre, endto-end speech recognition, Training (civil), language recognition, 030507 speech-language pathology & audiology, 03 medical and health sciences, bottleneck features, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Artificial intelligence, 0305 other medical science, business, computer, Natural language processing, Language recognition
Abstract: International audience; Automatic speech recognition is complementary to language recognition. The language recognition systems exploit this complementarity by using frame-level bottleneck features extracted from neural networks trained with a phone recognition task. Recent methods apply frame-level bottleneck features extracted from an end-to-end sequence-to-sequence speech recognition model. In this work, we study an integrated approach of the training of the speech recognition feature extractor and language recognition modules. We show that for both classical phone recognition and end-to-end sequence-to-sequence features, sequential training of the two modules is not the optimal strategy. The feature extractor can be improved by supervision with the language identification loss, either in a fine-tuning step or in a multi-task training framework. Besides, we notice that end-to-end sequence-to-sequence bottleneck features are on par with classical phone recognition bottleneck features without requiring a forced alignment of the signal with target tokens. However, for sequence-to-sequence, the architecture of the model seems to play an important role; the Conformer architectures leads to much better results than the conventional stacked DNNs approach; and can even be trained directly with the LID module in an end-to-end approach.
Published: 2021

18. Sustaining Performance While Reducing Energy Consumption: A Control Theory Approach

Author: Raphaël Bleuse, Eric Rutten, Valentin Reis, Sophie Cerf, Swann Perarnau, Control for Autonomic computing systems (CTRL-A ), 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), Argonne National Laboratory [Lemont] (ANL), Experiments presented in this paper were carried out using the Grid'5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr)., Argonne National Laboratory's work was supported by the U.S. Department of Energy, Office of Science, Advanced Scientific Computer Research, under Contract DE-AC02-06CH11357. This research was supported by the Exascale Computing Project (17-SC-20-SC), a collaborative effort of the U.S. Department of Energy Office of Science and the National Nuclear Security Administration., This research is partially supported by the NCSA-Inria-ANL-BSC-JSC-Riken-UTK Joint-Laboratory for Extreme Scale Computing (JLESC, https://jlesc.github.io/)., Grid'5000, GRID5000, JLESC - Joint Laboratory for Extreme Scale Computing, and JLESC
Subjects: FOS: Computer and information sciences, 010302 applied physics, Computer science, Node (networking), Power regulation, 02 engineering and technology, Energy consumption, 01 natural sciences, 020202 computer hardware & architecture, Resource (project management), Computer Science - Distributed, Parallel, and Cluster Computing, Control theory, 0103 physical sciences, Dynamic demand, HPC, 0202 electrical engineering, electronic engineering, information engineering, Benchmark (computing), [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], Resource management, Distributed, Parallel, and Cluster Computing (cs.DC), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Performance per watt
Abstract: Production high-performance computing systems continue to grow in complexity and size. As applications struggle to make use of increasingly heterogeneous compute nodes, maintaining high efficiency (performance per watt) for the whole platform becomes a challenge. Alongside the growing complexity of scientific workloads, this extreme heterogeneity is also an opportunity: as applications dynamically undergo variations in workload, due to phases or data/compute movement between devices, one can dynamically adjust power across compute elements to save energy without impacting performance. With an aim toward an autonomous and dynamic power management strategy for current and future HPC architectures, this paper explores the use of control theory for the design of a dynamic power regulation method. Structured as a feedback loop, our approach-which is novel in computing resource management-consists of periodically monitoring application progress and choosing at runtime a suitable power cap for processors. Thanks to a preliminary offline identification process, we derive a model of the dynamics of the system and a proportional-integral (PI) controller. We evaluate our approach on top of an existing resource management framework, the Argo Node Resource Manager, deployed on several clusters of Grid'5000, using a standard memory-bound HPC benchmark., The datasets and code generated and analyzed during the current studyare available in the Figshare repository: https://doi.org/10.6084/m9.figshare.14754468[5]
Published: 2021

19. Language recognition on unknown conditions: the LORIA-Inria-MULTISPEECH system for AP20-OLR Challenge

Author: Irina Illina, Raphaël Duroselle, Sahidullah, Denis Jouvet, Speech Modeling for Facilitating Oral-Based Communication (MULTISPEECH), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Experiments presented in this paper were carried out using the Grid5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr). This work has been partly funded by the French Direction Genérale de l’Armement., Grid'5000, 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), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Channel (digital image), Computer science, Generalization, Speech recognition, 020206 networking & telecommunications, 02 engineering and technology, Regularization (mathematics), Bottleneck, Domain (software engineering), Task (project management), 030507 speech-language pathology & audiology, 03 medical and health sciences, Robustness (computer science), Language recognition, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], domain generalization, 0305 other medical science, Selection (genetic algorithm), channel mismatch
Abstract: International audience; We describe the LORIA-Inria-MULTISPEECH system submitted to the Oriental Language Recognition AP20-OLR Challenge. This system has been specifically designed to be robust to unknown conditions: channel mismatch (task 1) and noisy conditions (task 3). Three sets of studies have been carried out for elaborating the system: design of multilingual bottleneck features, selection of robust features by evaluating language recognition performance on an unobserved channel, and design of the final models with different loss functions which exploit channel diversity within the training set. Key factors for robustness to unknown conditions are data augmentation techniques, stochastic weight averaging, and regularization of TDNNs with domain robustness loss functions. The final system is the combination of four TDNNs using bottleneck features and one GMM using SDC-MFCC features. Within the AP20-OLR Challenge, it achieves the top performance for tasks 1 and 3 with a $C_{avg}$ of respectively 0.0239 and 0.0374. This validates the approach for generalization to unknown conditions.
Published: 2021

20. HInT: Hybrid and Incremental Type Discovery for Large RDF Data Sources

Author: Georgia Troullinou, Kenza Kellou-Menouer, Zoubida Kedad, Dimitris Plexousakis, Nikolaos Kardoulakis, Haridimos Kondylakis, Données et algorithmes pour une ville intelligente et durable - DAVID (DAVID), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), Hellenic Foundation for Research and Innovation, ΕΛ.ΙΔ.Ε.Κ: 1147, and Work reported in this paper has been partially supported by the Hellenic Foundation for Research and Innovation (H.F.R.I.) under the '2nd Call for H.F.R.I. Research Projects to support Post-Doctoral Researchers' (iQARuS Project No 1147)
Subjects: Exploit, LSH, Process (engineering), Computer science, media_common.quotation_subject, 02 engineering and technology, Machine learning, computer.software_genre, RDF, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Quality (business), [INFO]Computer Science [cs], media_common, Complement (set theory), business.industry, Hybrid type discovery, Linked data, computer.file_format, Automatic summarization, Schema (genetic algorithms), 020201 artificial intelligence & image processing, Incrementality, Artificial intelligence, business, computer
Abstract: International audience; The rapid explosion of linked data has resulted into many weakly structured and incomplete data sources, where typing information might be missing. On the other hand, type information is essential for a number of tasks such as query answering, integration, summarization and partitioning. Existing approaches for type discovery, either completely ignore type declarations available in the dataset (implicit type discovery approaches), or rely only on existing types, in order to complement them (explicit type enrichment approaches). Implicit type discovery approaches are based on instance grouping, which requires an exhaustive comparison between the instances. This process is expensive and not incremental. Explicit type enrichment approaches on the other hand, are not able to identify new types and they can not process data sources that have little or no schema information. In this paper, we present HInT, the first incremental and hybrid type discovery system for RDF datasets, enabling type discovery in datasets where type declarations are missing. To achieve this goal, we incrementally identify the patterns of the various instances, we index and then group them to identify the types. During the processing of an instance, our approach exploits its type information, if available, to improve the quality of the discovered types by guiding the classification of the new instance in the correct group and by refining the groups already built. We analytically and experimentally show that our approach dominates in terms of efficiency, competitors from both worlds, implicit type discovery and explicit type enrichment while outperforming them in most of the cases in terms of quality.
Published: 2021

21. Different photocatalytic levels of organics in papermaking wastewater by flocculation-photocatalysis and SBR-photocatalysis: Degradation and GC–MS experiments, adsorption and photocatalysis simulations

Author: Xiaoquan Chen, Zhifeng Lin, Jiao Li, Hongxia Xi, Wenhao Shen, Jean-Pierre Corriou, Laboratoire Réactions et Génie des Procédés (LRGP), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), South China University of Technology [Guangzhou] (SCUT), State Key Laboratory of Pulp and Paper Engineering, and School of Chemistry and Chemical Engineering [Guangzhou]
Subjects: Flocculation, General Chemical Engineering, 02 engineering and technology, 010402 general chemistry, 01 natural sciences, Industrial and Manufacturing Engineering, Industrial wastewater treatment, chemistry.chemical_compound, Adsorption, [CHIM.GENI]Chemical Sciences/Chemical engineering, Glycerol monostearate, Environmental Chemistry, [SPI.GPROC]Engineering Sciences [physics]/Chemical and Process Engineering, Effluent, ComputingMilieux_MISCELLANEOUS, Pollutant, Chemistry, General Chemistry, 021001 nanoscience & nanotechnology, 6. Clean water, 0104 chemical sciences, Wastewater, Chemical engineering, 13. Climate action, Photocatalysis, 0210 nano-technology
Abstract: Refractory pollutants often exist in wastewater after photocatalysis. Here, experiments, gas chromatography-mass spectrometry (GC–MS) analysis and density functional theory (DFT) simulations were used to explain the different levels of photocatalytic degradation of organics in papermaking wastewater associated with two photocatalytic processes with the goal of improving environmental sustainability. The photocatalytic experiments of flocculation and SBR effluents of papermaking wastewater were studied in a reactor with nano-TiO2 colloid, followed by GC–MS analysis, and the different degradation levels of organics were explained based on DFT adsorption and photocatalysis simulations. The experimental results show that the total COD removal rates were 65.8% and 90.8% for the flocculation-photocatalysis and SBR-photocatalysis processes, and the resin acids and fatty acids in wastewater were classified as easily degradable pollutants and esters as refractory pollutants. The adsorption and photocatalysis simulations show that compared with dehydroabietic acid and pentadecanoic acid, the adsorption of glycerol monostearate by nano-TiO2 colloid is difficult, the reaction pathways for photocatalysis are complex and the band gap of TiO2 photocatalyst after adsorption is wide. The experimental and simulation results indicate that the different degradation levels are attributed to the difficulty of the adsorption and photocatalytic reactions of glycerol monostearate compared with the reactions of the other two easily degradable pollutants. Thus, the different photocatalytic degradation levels of organic pollutants in the two photocatalytic processes of papermaking wastewater indicate that sustainable photocatalytic technology could be applied to different types of industrial wastewater.
Published: 2021

22. Solving Bin Packing Problems Using VRPSolver Models

Author: Ruslan Sadykov, Eduardo Uchoa, Artur Alves Pessoa, Universidade Federal Fluminense [Rio de Janeiro] (UFF), 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), Experiments presented in this paper were carried out using the PlaFRIM (Federative Platform for Research in Computer Science and Mathematics), created under the Inria PlaFRIM development action with support from Bordeaux INP, LABRI and IMB and other entities: Conseil Régional d’Aquitaine, Université de Bordeaux, CNRS and ANR in accordance to the 'Programme d’Investissements d’Avenir'. The research was partially supported by the following grants: CNPq 313601/2018-6, Faperj E-26/202.887/2017, and CAPES PrInt UFF n° 88881., Plafrim, 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), 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)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest
Subjects: Mathematical optimization, 021103 operations research, Bin packing problem, Computer science, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Solver, 01 natural sciences, Variable (computer science), 010201 computation theory & mathematics, Vehicle routing problem, Column generation, Heuristics, Integer programming, Smoothing
Abstract: International audience; We propose branch-cut-and-price algorithms for the classic bin packing problem and also for the following related problems: vector packing, variable sized bin packing and variable sized bin packing with optional items. The algorithms are defined as models for VRPSolver, a generic solver for vehicle routing problems. In that way, a simple parameterization enables the use of several branch-cut-and-price advanced elements: automatic stabilization by smoothing, limited-memory rank-1 cuts, enumeration, hierarchical strong branching and limited discrepancy search diving heuristics. As an original theoretical contribution, we prove that the branching over accumulated resource consumption (Gélinas et al. 1995), that does not increase the difficulty of the pricing subproblem, is sufficient for those bin packing models. Extensive computational results on instances from the literature show that the VRPSolver models have a performance that is very robust over all those problems, being often superior to the existing exact algorithms on the hardest instances. Several instances could be solved to optimality for the first time.
Published: 2021

23. Optimizing Motor Intention Detection With Deep Learning: Towards Management of Intraoperative Awareness

Author: Laurent Bougrain, Oleksii Avilov, Anton Popov, Sébastien Rimbert, National Technical University of Ukraine 'Kyiv Polytechnic Institute' [Kiev], Analysis and modeling of neural systems by a system neuroscience approach (NEUROSYS), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Complex Systems, Artificial Intelligence & Robotics (LORIA - AIS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Oleksii Avilov was supported by scholarship from the French Embassy to Ukraine while working on this topic at the NEUROSYS team at LORIA (Université de Lorraine/CNRS/Inria), Nancy, France. Experiments presented in this paper were carried out using the Grid’5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (https://www.grid5000.fr)., 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), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)
Subjects: 0209 industrial biotechnology, Computer science, Biomedical Engineering, motor imagery AAGA: accidental awareness during general anesthesia, 02 engineering and technology, Intention, Electroencephalography, [INFO.INFO-NE]Computer Science [cs]/Neural and Evolutionary Computing [cs.NE], Intraoperative Awareness, 020901 industrial engineering & automation, Motor imagery, median nerve stimulation, Deep Learning, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], intraoperative awareness during general anesthesia, 0202 electrical engineering, electronic engineering, information engineering, medicine, [INFO.INFO-IM]Computer Science [cs]/Medical Imaging, Functional electrical stimulation, Humans, Brain-computer interface (BCI), Artificial neural network, medicine.diagnostic_test, Median nerve stimulation, business.industry, electroencephalogram (EEG), Deep learning, [SCCO.NEUR]Cognitive science/Neuroscience, Pattern recognition, Linear discriminant analysis, Median nerve, medicine.anatomical_structure, machine learning, Frontal lobe, Brain-Computer Interfaces, Imagination, 020201 artificial intelligence & image processing, Artificial intelligence, business, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Algorithms, Motor cortex
Abstract: International audience; Objective: This article shows the interest in deep learning techniques to detect motor imagery (MI) from raw electroencephalographic (EEG) signals when a functional electrical stimulation is added or not. Impacts of electrode montages and bandwidth are also reported. The perspective of this work is to improve the detection of intraoperative awareness during general anesthesia. Methods: Various architectures of EEGNet were investigated to optimize MI detection. They have been compared to the state-of-the-art classifiers in Brain-Computer Interfaces (based on Riemannian geometry, linear discriminant analysis), and other deep learning architectures (deep convolution network, shallow convolutional network). EEG data were measured from 22 participants performing motor imagery with and without median nerve stimulation. Results: The proposed architecture of EEGNet reaches the best classification accuracy (83.2%) and false-positive rate (FPR 19.0%) for a setup with only six electrodes over the motor cortex and frontal lobe and for an extended 4-38 Hz EEG frequency range while the subject is being stimulated via a median nerve. Configurations with a larger number of electrodes result in higher accuracy (94.5%) and FPR (6.1%) for 128 electrodes (and respectively 88.0% and 12.9% for 13 electrodes).Conclusion: The present work demonstrates that using an extended EEG frequency band and a modified EEGNet deep neural network increases the accuracy of MI detection when used with as few as 6 electrodes which include frontal channels. Significance: The proposed method contributes to the development of Brain-Computer Interface systems based on MI detection from EEG.
Published: 2021

24. Binary level toolchain provenance identification with graph neural networks

Author: Tristan Benoit, Jean-Yves Marion, Sébastien Bardin, Carbone (CARBONE), Department of Formal Methods (LORIA - FM), 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), CEA- Saclay (CEA), Commissariat à l'énergie atomique et aux énergies alternatives (CEA), This work is supported by (i) a public grant overseen by the French National Research Agency (ANR) as part of the 'Investissements d'Avenir' French PIA project 'Lorraine Université d'Excellence', reference ANR-15-IDEX-04-LUE, and (ii) has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 830927 (Concordia). Experiments presented in this paper were carried out using the Grid’5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr)., GRID5000, IMPACT-DIGITRUST, ANR-15-IDEX-0004,LUE,Isite LUE(2015), European Project: 830927,CONCORDIA(2019), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Theoretical computer science, Artificial neural network, Computer science, Binary number, graph neural networks, 020207 software engineering, 02 engineering and technology, computer.software_genre, toolchain provenance, Toolchain, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Scalability, 0202 electrical engineering, electronic engineering, information engineering, Graph reduction, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.7: Distribution, Maintenance, and Enhancement/D.2.7.5: Restructuring, reverse engineering, and reengineering, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.5: Testing and Debugging/D.2.5.2: Diagnostics, Control flow graph, binary code analysis, 020201 artificial intelligence & image processing, Binary code, Compiler, computer, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.6: Learning
Abstract: International audience; We consider the problem of recovering the compiling chain used to generate a given stripped binary code. We present a Graph Neural Network framework at the binary level to solve this problem, with the idea to take into account the shallow semantics provided by the binary code's structured control flow graph (CFG).We introduce a Graph Neural Network, called Site Neural Network (SNN), dedicated to this problem. To attain scalability at the binary level, feature extraction is simplified by forgetting almost everything in a CFG except transfer control instructions and performing a parametric graph reduction. Our experiments show that our method recovers the compiler family with a very high F1-Score of 0.9950 while the optimization level is recovered with a moderately high F1-Score of 0.7517. On the compiler version prediction task, the F1-Score is about 0.8167 excluding the clang family. A comparison with a previous work demonstrates the accuracy and performance of this framework.
Published: 2021

25. Sliding Mode Control with Application to Fault-Tolerant Control: Assessment and Open Problems

Author: Jérôme Cieslak, Jorge Davila, Jazmìn Zenteno Torres, David Henry, Laboratoire de l'intégration, du matériau au système (IMS), Centre National de la Recherche Scientifique (CNRS)-Institut Polytechnique de Bordeaux-Université Sciences et Technologies - Bordeaux 1, Instituto Politecnico Nacional [Mexico] (IPN), and This paper was prepared within a collaboration between IPN (Mexico) and IMS Lab. (France) with financial support from CONACyT, under grant 440473 (CVU 594664).
Subjects: 0209 industrial biotechnology, Computer science, 020208 electrical & electronic engineering, Control (management), Fault tolerance, 02 engineering and technology, Fault (power engineering), Sliding mode control, Industrial engineering, Sliding mode controller, 020901 industrial engineering & automation, General Energy, Robustness (computer science), Control theory, Fault tolerant control, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, 0202 electrical engineering, electronic engineering, information engineering
Abstract: International audience; This paper is prepared within a collaboration between the Instituto Politécnico Nacional, which is a Mexican research institute that manages research on sliding-mode control theory, and the ARIA research team of the Intégration du Matériau au Système Lab., a French research groupthat engages research on model-based fault diagnosis and fault-tolerant control theories. The paper reviews the application of sliding mode control techniques to fault tolerant control and provides perspectives leading to posing some open problems. Operating principles, definitions of the basic concepts are recalled along with the control objectives and design procedures. The evolution of the sliding mode control technique through five generations (as classified by Fridman, Moreno and coworkers) is reviewed. Their respective design procedures, limitations, and robustness properties are also highlighted. The application of the five generations of sliding-mode controllers to fault-tolerant control is discussed. The focus is on some open problems that are judged to commonly be overlooked. Some applications in real-world systems are also presented.
Published: 2021

26. Calibration Done Right: Noiseless Flush+Flush Attacks

Author: Clementine Maurice, Guillaume Didier, Délégation générale de l'armement (DGA), Ministère de la Défense, 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), Embedded Security and Cryptography / Sécurité cryptographie embarquée (EMSEC), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), 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 Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Self-adaptation for distributed services and large software systems (SPIRALS), 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), This work has been partly funded by the French Direction G´en´erale de l’Armement, and by the ANR-19-CE39-0007 MIAOUS. Some experiments presented in this paper were carried out using the Grid’5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr)., Grid'5000, ANR-19-CE39-0007,MIAOUS,Attaques sur la micro-architecture des systèmes ubiquitaires(2019), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Security & PrIvaCY (SPICY), 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 Université de Lille-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)-Université de Lille-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)
Subjects: 0303 health sciences, Interconnection, Leak, Hardware_MEMORYSTRUCTURES, Computer science, business.industry, Word error rate, 020207 software engineering, 02 engineering and technology, ComputerSystemsOrganization_PROCESSORARCHITECTURES, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 03 medical and health sciences, 0202 electrical engineering, electronic engineering, information engineering, Calibration, Central processing unit, Cache, Line (text file), business, Computer hardware, 030304 developmental biology
Abstract: International audience; Caches leak information through timing measurements and side-channel attacks. Several attack primitives exist with different requirements and trade-offs. Flush+Flush is a stealthy and fast one that uses the timing of the clflush instruction depending on whether a line is cached. We show that the CPU interconnect plays a bigger role than previously thought in these timings and in Flush+Flush error rate. In this paper, we show that a naive implementation that does not account for the topology of the interconnect yields very high error rates, especially on modern CPUs as the number of cores increases. We therefore reverse-engineer this topology and revisit the calibration phase of Flush+ Flush for different attacker models to determine the correct threshold for clflush hits and misses. We show that our method yields closeto-noiseless side-channel attacks by attacking the AES T-tables implementation of OpenSSL, and by building a covert channel. We obtain a maximal capacity of 5.8 Mbit/s with our method, compared to 1.9 Mbit/s with a naive Flush+Flush implementation on an Intel Core i9-9900 CPU.
Published: 2021

27. Sustainable roll-to-roll manufactured multi-layer smart label

Author: Victor Thenot, Gael Depres, Romain Futsch, Aline Rougier, Elina Jansson, Maria Smolander, Liisa Hakola, Tuomas Happonen, VTT Technical Research Centre of Finland (VTT), 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), ArjoWiggins France, and Research leading to this paper was carried out in Supersmart research project [52] that has received funding from the European Institute of Innovation and Technology (EIT), a body of the European Union, under the Horizon 2020, the EU Framework Programme for Research and Innovation. The project demonstrators were awarded the ‘Best Publicly Funded Project Demonstrator’ at OE-A Competition 2021.
Subjects: Computer science, 02 engineering and technology, Substrate (printing), 010402 general chemistry, 01 natural sciences, 7. Clean energy, Industrial and Manufacturing Engineering, Near field communication, Roll-to-roll processing, Switching time, Rectification, [SPI.GPROC]Engineering Sciences [physics]/Chemical and Process Engineering, Electronics, Electrochromic display, business.industry, Anti-counterfeiting, Mechanical Engineering, Electrical engineering, Printed electronics, [CHIM.MATE]Chemical Sciences/Material chemistry, 021001 nanoscience & nanotechnology, 0104 chemical sciences, Computer Science Applications, [SPI.TRON]Engineering Sciences [physics]/Electronics, Sustainability, Control and Systems Engineering, Mobile phone, Electrochromism, 0210 nano-technology, business, Software
Abstract: Sustainability in electronics has a growing importance due to, e.g. increasing electronic waste, and global and European sustainability goals. Printing technologies and use of paper as a substrate enable manufacturing of sustainable electronic devices for emerging applications, such as the multi-layer anti-counterfeit label presented in this paper. This device consisted of electrochromic display (ECD) element, NFC (near field communication) tag and circuitry, all fully roll-to-roll (R2R) printed and assembled on plastic-free paper substrate, thus leading to a sustainable and recyclable device. Our setup uses harvested energy from HF field of a smartphone or reader, to switch an electrochromic display after rectification to prove authenticity of a product. Our novelty is in upscaling the manufacturing process to be fully printable and R2R processable in high-throughput conditions simulating industrial environment, i.e. in pilot scale. The printing workflow consisted of 11 R2R printed layers, all done in sufficient quality and registration. The printed antennas showed sheet resistance values of 32.9±1.9 mΩ/sq. The final yield was almost 1500 fully printed devices, and in R2R assembly over 1400 labels were integrated with 96.5% yield. All the assembled tags were readable with mobile phone NFC reader. The optical contrast (ΔE*) measured for the ECDs was over 15 for all the printed displays, a progressive switching time with a colour change visible in less than 5 s. The smart tag is ITO-free, plastic-free, fully printed in R2R and has a good stability over 50 cycles and reversible colour change from light to dark blue.
Published: 2021

28. A graph cellular automaton with relation-based neighbourhood describing the impact of peer influence on the consumption of marijuana among college-aged youths

Author: Muhammad Zaid Dauhoo, Laurent Dumas, Yusra Bibi Ruhomally, Université de Maurice, Laboratoire de Mathématiques de Versailles (LMV), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), University of Mauritius, UoM, and We would like to acknowledge the assistance of Mr Maheshsingh Mungur from the University of Mauritius in the preparation of this work. This work has been conducted under the HEC (Higher Education Commission Mauritius) MPhil/PhD scholarship. The authors would also like to thank the reviewers for their constructive and valuable comments, which led to the improvement of the paper.
Subjects: Statistics and Probability, 050402 sociology, Relation (database), media_common.quotation_subject, targeted campaigns of prevention, [SDV]Life Sciences [q-bio], Population, 02 engineering and technology, relation-based, 0504 sociology, 0202 electrical engineering, electronic engineering, information engineering, Set (psychology), education, Recreation, Neighbourhood (mathematics), media_common, Consumption (economics), education.field_of_study, peer influence, Applied Mathematics, Addiction, 05 social sciences, Marijuana, Modeling and Simulation, graph cellular automaton, Graph (abstract data type), 020201 artificial intelligence & image processing, Psychology, Social psychology
Abstract: International audience; A novel approach depicting the dynamics of marijuana usage to gauge the effects of peer influence in a school population, is the site of investigation. Consumption of drug is considered as a contagious social epidemic which is spread mainly by peer influences. A relation-based graph-CA (r-GCA) model consisting of 4 states namely, Nonusers (N), Experimental users (E), Recreational users (R) and Addicts (A), is formulated in order to represent the prevalence of the epidemic on a campus. The r-GCA model is set up by local transition rules which delineates the proliferation of marijuana use. Data available in [4] is opted to verify and validate the r-GCA. Simulations of the r-GCA system are presented and discussed. The numerical results agree quite accurately with the observed data. Using the model, the enactment of campaigns of prevention targeting N, E and R states respectively were conducted and analysed. The results indicate a significant decline in marijuana consumption on the campus when a campaign of prevention targeting the latter three states simultaneously, is enacted.
Published: 2021

29. Towards a semantic indoor trajectory model: application to museum visits

Author: Claudia Marinica, Karine Zeitouni, Dimitris Kotzinos, Dan Vodislav, Alexandros Kontarinis, Données et algorithmes pour une ville intelligente et durable - DAVID (DAVID), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), Equipes Traitement de l'Information et Systèmes (ETIS - UMR 8051), Ecole Nationale Supérieure de l'Electronique et de ses Applications (ENSEA)-Centre National de la Recherche Scientifique (CNRS)-CY Cergy Paris Université (CY), Horizon 2020 Framework Programme, H2020: 777695, This work was supported by the TRAJECTOIRES project funded by the Paris Seine Graduate School Humanities, Creation, Heritage, Investissement d’Avenir ANR-17-EURE-0021 – Foundation for Cultural Heritage Science., and Karine Zeitouni’s work in this paper was supported by the MASTER project that has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie-Slodowska Curie grant agreement N. 777695.
Subjects: Computer science, media_common.quotation_subject, Geography, Planning and Development, Big data, Museum visitor study, 02 engineering and technology, Space (commercial competition), Article, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Sequential Pattern Mining, Representation (mathematics), media_common, Information retrieval, business.industry, Semantic trajectory, Indoor trajectory, Analytics, Model application, Trajectory pattern mining, Trajectory, Conceptual model, 020201 artificial intelligence & image processing, Trajectory modeling, Louvre museum, business, Information Systems
Abstract: International audience; In this paper we present a new conceptual model of trajectories, which accounts for semantic and indoor space information and supports the design and implementation of context-aware mobility data mining and statistical analytics methods. Motivated by a compelling museum case study, and by what we perceive as a lack in indoor trajectory research, we combine aspects of state-of-the-art semantic outdoor trajectory models, with a semantically-enabled hierarchical symbolic representation of the indoor space, which abides by OGC’s IndoorGML standard. We drive the discussion on modeling issues that have been overlooked so far and illustrate them with a real-world case study concerning the Louvre Museum, in an effort to provide a pragmatic view of what the proposed model represents and how. We also present experimental results based on Louvre’s visiting data showcasing how state-of-the-art mining algorithms can be applied on trajectory data represented according to the proposed model, and outline their advantages and limitations. Finally, we provide a formal outline of a new sequential pattern mining algorithm and how it can be used for extracting interesting trajectory patterns.
Published: 2021

30. Dragonblood is Still Leaking: Practical Cache-based Side-Channel in the Wild

Author: Mohamed Sabt, Pierre-Alain Fouque, Daniel De Almeida Braga, Embedded Security and Cryptography / Sécurité cryptographie embarquée (EMSEC), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), 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 Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Daniel De Almeida Braga is funded by the Direction Générale de l’Armement (Pôle de Recherche CYBER). We would like to thank the anonymous paper and artifact reviewers for their time and constructive feedbacks., 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), and 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)
Subjects: FOS: Computer and information sciences, Dragonfly, Computer Science - Cryptography and Security, computer.internet_protocol, Computer science, 0211 other engineering and technologies, 02 engineering and technology, Computer security, computer.software_genre, WPA3, Supplicant, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Password authentication protocol, Side channel attack, Wi-Fi, Key exchange, Password, 021110 strategic, defence & security studies, Authentication, PAKE, Elliptic curve, cache attack, computer, hostapd, Cryptography and Security (cs.CR)
Abstract: Recently, the Dragonblood attacks have attracted new interests on the security of WPA-3 implementation and in particular on the Dragonfly code deployed on many open-source libraries. One attack concerns the protection of users passwords during authentication. In the Password Authentication Key Exchange (PAKE) protocol called Dragonfly, the secret, namely the password, is mapped to an elliptic curve point. This operation is sensitive, as it involves the secret password, and therefore its resistance against side-channel attacks is of utmost importance. Following the initial disclosure of Dragonblood, we notice that this particular attack has been partially patched by only a few implementations. In this work, we show that the patches implemented after the disclosure of Dragonblood are insufficient. We took advantage of state-of-the-art techniques to extend the original attack, demonstrating that we are able to recover the password with only a third of the measurements needed in Dragonblood attack. We mainly apply our attack on two open-source projects: iwd (iNet Wireless Daemon) and FreeRADIUS, in order underline the practicability of our attack. Indeed, the iwd package, written by Intel, is already deployed in the Arch Linux distribution, which is well-known among security experts, and aims to offer an alternative to wpa\_supplicant. As for FreeRADIUS, it is widely deployed and well-maintained upstream open-source project. We publish a full Proof of Concept of our attack, and actively participated in the process of patching the vulnerable code. Here, in a backward compatibility perspective, we advise the use of a branch-free implementation as a mitigation technique, as what was used in hostapd, due to its quite simplicity and its negligible incurred overhead., Accepted at Annual Computer Security Applications Conference (ACSAC 2020), December 7-11, 2020, Austin, USA. ACM, New York, NY, USA, 13 pages, ACM ISBN 978-1-4503-8858-0/20/12 Artifact available: https://gitlab.inria.fr/ddealmei/poc-iwd-acsac2020/-/tree/master/
Published: 2020

31. Evolution Control for parallel ANN-assisted simulation-based optimization application to Tuberculosis Transmission Control

Author: Mohand-Said Mezmaz, Nouredine Melab, Romain Ragonnet, Guillaume Briffoteaux, Daniel Tuyttens, 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), University of Mons [Belgium] (UMONS), Monash University [Melbourne], Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), and Experiments presented in this paper were carried out using the Grid’5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr).
Subjects: Artificial Neural Network, Computer Networks and Communications, Computer science, Monte Carlo method, Context (language use), 02 engineering and technology, [INFO.INFO-NE]Computer Science [cs]/Neural and Evolutionary Computing [cs.NE], Simulation-based optimization, Surrogate-assisted Optimization, 0202 electrical engineering, electronic engineering, information engineering, Massively parallel, Dropout (neural networks), Artificial neural network, Evolution Control, business.industry, Deep learning, 020206 networking & telecommunications, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Supercomputer, Computer engineering, Hardware and Architecture, 020201 artificial intelligence & image processing, Artificial intelligence, Massively Parallel Computing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, Software, Simulation
Abstract: International audience; In many optimal design searches, the function to optimise is a simulator that is computationally expensive. While current High Performance Computing (HPC) methods are not able to solve such problems efficiently, parallelism can be coupled with approximate models (surrogates or meta-models) that imitate the simulator in timely fashion to achieve better results. This combined approach reduces the number of simulations thanks to surrogate use whereas the remaining evaluations are handled by supercomputers. While the surrogates' ability to limit computational times is very attractive, integrating them into the over-arching optimization process can be challenging. Indeed, it is critical to address the major trade-off between the quality (precision) and the efficiency (execution time) of the resolution. In this article, we investigate Evolution Controls (ECs) which are strategies that define the alternation between the simulator and the surrogate within the optimization process. We propose a new EC based on the prediction uncertainty obtained from Monte Carlo Dropout (MCDropout), a technique originally dedicated to quantifying uncertainty in deep learning. Investigations of such uncertainty-aware ECs remain uncommon in surrogate-assisted evolutionary optimization. In addition, we use parallel computing in a complementary way to address the high computational burden. Our new strategy is implemented in the context of a pioneering application to Tuberculosis Transmission Control. The reported results show that the MCDropout-based EC coupled with massively parallel computing outperforms strategies previously proposed in the field of surrogate-assisted optimization.
Published: 2020

32. Projecting Exposure to Extreme Climate Impact Events Across Six Event Categories and Three Spatial Scales

Author: Yoshihide Wada, Fang Zhao, Yasushi Honda, Thomas Hickler, Jörg Steinkamp, Nikolay Khabarov, Tobias Stacke, Lila Warszawski, David N. Bresch, Tobias Geiger, Wim Thiery, Kazuya Nishina, Jonas Jägermeyr, Sebastian Ostberg, Hannes Müller Schmied, Manolis Grillakis, Iliusi Vega, Kerry Emanuel, Akihiko Ito, Philippe Ciais, Sonia I. Seneviratne, Stefan Lange, Naota Hanasaki, Jinfeng Chang, Jan Volkholz, Aristeidis Koutroulis, Christian Folberth, Matthias Büchner, Christopher P. O. Reyer, Minoru Yoshikawa, Sven Willner, Christoph Müller, Katja Frieler, Hong Yang, Jacob Schewe, Simon N. Gosling, Alexandra Henrot, Dieter Gerten, Marie Dury, Veronika Huber, Chao Yue, Wenfeng Liu, Ted Veldkamp, Hydrology and Hydraulic Engineering, Laboratoire des Sciences du Climat et de l'Environnement [Gif-sur-Yvette] (LSCE), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Environmental Restoration and Conservation Agency, ERCA 821010 641816 SAW‐2016‐PIK‐1, 603864 Bundesministerium für Bildung und Forschung, BMBF: 01LA1829A, 01LS1201A2, 01LS1711F Ministry of Economy, Trade and Industry, METI Eidgenössische Technische Hochschule Zürich, ETH: Fel‐45 15‐1 Ministerio de Economía y Competitividad, MINECO: PCIN‐2017‐046, We thank the editor and two anonymous reviewers for constructive feedback. We thank three other anonymous reviewers for helpful comments on an earlier version of this paper submitted to a different journal. This research was supported in part by the German Federal Ministry of Education and Research (BMBF, grant numbers 01LS1201A2, 01LS1711F, and 01LA1829A) and the EU FP7 HELIX project (grant number 603864). Some authors acknowledge support from the Leibniz Competition projects SAW‐2013‐PIK‐5 (EXPACT) and SAW‐2016‐PIK‐1 (ENGAGE). Some authors acknowledge funding from the European Union's Horizon 2020 research and innovation program under grant agreement number 821010 (CASCADES). N. H., K. N., and Y. H. acknowledge support from the ERTD Funds 2RF‐1802 and S‐14 of the Environmental Restoration and Conservation Agency of Japan. W. T. was supported by an ETH Zurich postdoctoral fellowship (Fel‐45 15‐1). V. H. was supported by the Spanish Ministry of Economy, Industry and Competitiveness (MINECO, grant number PCIN‐2017‐046). P. C. acknowledges support from the CLAND ANR Convergence Institute. S. L. acknowledges funding from the European Union's Horizon 2020 research and innovation program under grant agreement number 641816 (CRESCENDO). Open access funding enabled and organized by Projekt DEAL., Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), and Water and Climate Risk
Subjects: 010504 meteorology & atmospheric sciences, HYDROLOGICAL MODELS, Population, 0207 environmental engineering, FLOOD RISK, Environmental Sciences & Ecology, 02 engineering and technology, Subtropics, [SDU.STU.ME]Sciences of the Universe [physics]/Earth Sciences/Meteorology, 01 natural sciences, Population density, Latitude, Climate-related extreme events, Earth and Planetary Sciences (miscellaneous), SDG 13 - Climate Action, Meteorology & Atmospheric Sciences, BURNED AREA, GLOBAL CROP PRODUCTION, Geosciences, Multidisciplinary, 020701 environmental engineering, education, 0105 earth and related environmental sciences, General Environmental Science, Event (probability theory), education.field_of_study, Science & Technology, Land use, Global warming, VEGETATION MODEL ORCHIDEE, Geology, 15. Life on land, TERRESTRIAL CARBON BALANCE, 13. Climate action, Climatology, Physical Sciences, TROPICAL CYCLONE ACTIVITY, HURRICANE INTENSITY, Environmental science, Tropical cyclone, INTERANNUAL VARIABILITY, Life Sciences & Biomedicine, Environmental Sciences, INCORPORATING SPITFIRE
Abstract: Summarization: The extent and impact of climate‐related extreme events depend on the underlying meteorological, hydrological, or climatological drivers as well as on human factors such as land use or population density. Here we quantify the pure effect of historical and future climate change on the exposure of land and population to extreme climate impact events using an unprecedentedly large ensemble of harmonized climate impact simulations from the Inter‐Sectoral Impact Model Intercomparison Project phase 2b. Our results indicate that global warming has already more than doubled both the global land area and the global population annually exposed to all six categories of extreme events considered: river floods, tropical cyclones, crop failure, wildfires, droughts, and heatwaves. Global warming of 2°C relative to preindustrial conditions is projected to lead to a more than fivefold increase in cross‐category aggregate exposure globally. Changes in exposure are unevenly distributed, with tropical and subtropical regions facing larger increases than higher latitudes. The largest increases in overall exposure are projected for the population of South Asia. Presented on: Earth's Future
Published: 2020

33. Instability in Geo-Distributed Kubernetes Federation: Causes and Mitigation

Author: Guillaume Pierre, Mulugeta Ayalew Tamiru, Erik Elmroth, Johan Tordsson, Elastisys AB, Design and Implementation of Autonomous Distributed Systems (MYRIADS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), 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), 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), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), This work is part of a project that has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 765452. The information and views set out in this publication are those of the author(s) and do not necessarilyreflect the official opinion of the European Union. Neither the European Union institutions and bodies nor any person acting on their behalf maybe held responsible for the use which may be made of the information contained therein. Experiments presented in this paper were carried out using the Grid’5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr), European Project: 765452,h2020,H2020-MSCA-ITN-2017,FogGuru(2017), 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), and 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)
Subjects: Computer science, Distributed computing, System stability, 020207 software engineering, Automatic configuration tuning, 02 engineering and technology, Fog Computing, Network connectivity, Instability, Self adaptation, Self-configuration, Fog computing, 020204 information systems, Kubernetes Federation, 0202 electrical engineering, electronic engineering, information engineering, Feedback controller, [INFO.INFO-OS]Computer Science [cs]/Operating Systems [cs.OS], Latency (engineering), Self-adaptation, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract: International audience; As resources in geo-distributed environments are typically located in remote sites characterized by high latency and intermittent network connectivity, delays and transient network failures are common between the management layer and the remote resources. In this paper, we show that delays and transient network failures coupled with static configuration, including the default configuration parameter values, can lead to instability of application deployments in Kubernetes Federation, making applications unavailable for long periods of time. Leveraging on the benefits of configuration tuning, we propose a feedback controller to dynamically adjust the concerned configuration parameter to improve the stability of application deployments without slowing down the detection of hard failures. We show the effectiveness of our approach in a geo-distributed setup across five sites of Grid'5000, bringing system stability from 83-92% with no controller to 99.5-100% using the controller.
Published: 2020

34. Secrecy in Open Innovation and Open Innovation in Secrecy

Author: Jonathan Langlois, Romaric Servajean-Hilst, Sihem Ben Mahmoud-Jouini, Ecole des Hautes Etudes Commerciales (HEC Paris), HEC Paris Research Paper Series, Kedge Business School (Kedge BS), and Haldemann, Antoine
Subjects: 021110 strategic, defence & security studies, Research program, Knowledge management, business.industry, media_common.quotation_subject, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology, 16. Peace & justice, Discretion, 0506 political science, Knowledge sharing, open innovation, [SHS]Humanities and Social Sciences, secrecy, Order (exchange), Secrecy, 050602 political science & public administration, Openness to experience, [SHS.GESTION]Humanities and Social Sciences/Business administration, Inclusion–exclusion principle, business, [SHS.GESTION] Humanities and Social Sciences/Business administration, media_common, Open innovation
Abstract: Previous research have opposed secrecy and openness as mutually exclusive processes. In this paper, we suggest a more nuanced approach to secrecy in open innovation, drawing from Philosophy and Sociology. We have conducted a two-year research program in the defense industry, collecting data on the practices of concealment in open innovation activities. We found that focal actors utilize distinct cognitive techniques to decontextualize knowledge in the course of open innovation projects in order to safeguard secrecy while preserving mutual learning. Further, focal actors design contrasted relational approaches to secrecy with their open innovation partners. Such approaches are based on the positions of secrecy boundaries, which are internal or external to the relationship. In fact, actors intentionally make use of the reversible nature of secrecy, balancing inclusion and exclusion of knowledge in partnerships, to meet objectives that sometimes go beyond knowledge protection. Finally, we build on our findings to introduce a capability-based framework of secrecy management in openness processes. This framework, which we call Knowledge Discretion, suggests that actors overcome tensions stemming from secrecy and openness playing on the contextual depth and relational breadth of external knowledge sharing.
Published: 2020

35. Method and Framework for Security Risks Analysis Guided by Safety Criteria

Author: Guillaume Mockly, Gabriel Pedroza, Laboratoire d'Intégration des Systèmes et des Technologies (LIST), 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), Université Paris-Saclay, Trialog [Paris], Part of the work presented in this paper was conducted in the scope of the project ModSécAéro partially funded by thre French RAPID programme. RAPID (régime d’appui à l’innovation duale). https://www.defense.gouv.fr/aid/deposez-vos-projets/subventions/rapid, and Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA))
Subjects: 021103 operations research, Computer science, [INFO.INFO-CE]Computer Science [cs]/Computational Engineering, Finance, and Science [cs.CE], 0211 other engineering and technologies, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-IA]Computer Science [cs]/Computer Aided Engineering, Reuse, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, 01 natural sciences, Risk analysis (engineering), 010201 computation theory & mathematics, Control system, Path (graph theory), Safety criteria, State (computer science), Model-driven architecture, Architecture, computer, ComputingMilieux_MISCELLANEOUS, computer.programming_language, Unified Process, Security, Risks, methodology, safety
Abstract: As previously discussed [13], the challenges to achieve a consistent intertwining between safety and security are rather diverse and complex. Recent advances in safety and security suggest that risks analyses provide guidance for achieving a comprehensive alignment. However, for many domains, like in aeronautics, security is rather a recent concern whereas aircraft development has been mostly guided by safety criteria for several decades. The referred disparity along with the fact that security is, in many respects, a discipline still in evolution, imposes restrictions for specifying and applying methods to conduct safety and security co-engineering as a unified process. In this paper, we present the progress in the development of a model-based method, a framework and a tool useful to conduct a security risks analysis guided by safety criteria and goals. Among others, the approach relies on know-how found in the state of the art, in standards like ED202, ED203 (EUROCAE)1, as well as in open knowledge bases like CAPEC and CWE (MITRE)2. These sources are integrated which allows the instantiation of patterns of attacks, vulnerabilities, and architectures, which are crucial elements to semi-automate the analysis. A rule-based algorithm for exploring potential attack paths across an architecture is proposed and implemented. The approach is finally demonstrated by analyzing a combined attack-failure path in a Flight Control System which can undermine the safety of a modern aircraft. The framework and tool support seek safety-security by design and aim to facilitate the reuse of case studies and to settle a basis for repeatability and results comparison.
Published: 2020

36. Metric learning loss functions to reduce domain mismatch in the x-vector space for language recognition

Author: Raphaël Duroselle, Denis Jouvet, Irina Illina, Speech Modeling for Facilitating Oral-Based Communication (MULTISPEECH), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), 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)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Experiments presented in this paper were carried out using the Grid’5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr). This work has been partly funded bythe French Direction Générale de l'Armement., and Grid'5000
Subjects: Computer science, domain adaptation, Speech recognition, metric learning, 020206 networking & telecommunications, 02 engineering and technology, 01 natural sciences, domain mismatch, language recognition, embedding, x-vector, Robustness (computer science), 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, Maximum mean discrepancy, Embedding, [INFO]Computer Science [cs], 010301 acoustics, Language recognition, Vector space
Abstract: International audience; State-of-the-art language recognition systems are based on dis-criminative embeddings called x-vectors. Channel and gender distortions produce mismatch in such x-vector space where em-beddings corresponding to the same language are not grouped in an unique cluster. To control this mismatch, we propose to train the x-vector DNN with metric learning objective functions. Combining a classification loss with the metric learning n-pair loss allows to improve the language recognition performance. Such a system achieves a robustness comparable to a system trained with a domain adaptation loss function but without using the domain information. We also analyze the mismatch due to channel and gender, in comparison to language proximity, in the x-vector space. This is achieved using the Maximum Mean Discrepancy divergence measure between groups of x-vectors. Our analysis shows that using the metric learning loss function reduces gender and channel mismatch in the x-vector space, even for languages only observed on one channel in the train set.
Published: 2020

37. Programming Strategies for Irregular Algorithms on the Emu Chick

Author: Jiajia Li, Ümit V. Çatalyürek, Rich Vuduc, Jeffrey Young, Bora Uçar, Eric R. Hein, Abdurrahman Yasar, Srinivas Eswar, Jason Riedy, Thomas M. Conte, Emu Technology, Georgia Institute of Technology [Atlanta], Pacific Northwest National Laboratory (PNNL), Optimisation des ressources : modèles, algorithmes et ordonnancement (ROMA), 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), Laboratoire de l'Informatique du Parallélisme (LIP), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), This work partially was supported by NSF Grant ACI-1339745 (XScala), an IARPA contract, and the Defense Advanced Research Projects Agency (DARPA) under agreement #HR0011-13-2-0001. Any opinions, findings, conclusions, or recommendations in this paper are solely those of the authors and do not necessarily reflect the position or the policy of the sponsors. Thanks also to the Emu Technology team for support and debugging assistance with the Emu Chick prototype, and to the reviewers for their thoughtful comments., École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), and 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)
Subjects: FOS: Computer and information sciences, 0301 basic medicine, Computer science, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Memory bandwidth, 02 engineering and technology, Thread (computing), 020202 computer hardware & architecture, Computer Science Applications, 03 medical and health sciences, 030104 developmental biology, Computational Theory and Mathematics, Application-specific integrated circuit, Computer Science - Distributed, Parallel, and Cluster Computing, Hardware and Architecture, Modeling and Simulation, 0202 electrical engineering, electronic engineering, information engineering, Graph alignment, Bandwidth (computing), Distributed, Parallel, and Cluster Computing (cs.DC), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Field-programmable gate array, Algorithm, Software, Analysis of algorithms
Abstract: The Emu Chick prototype implements migratory memory-side processing in a novel hardware system. Rather than transferring large amounts of data across the system interconnect, the Emu Chick moves lightweight thread contexts to near-memory cores before the beginning of each remote memory read. Previous work has characterized the performance of the Chick prototype in terms of memory bandwidth and programming differences from more typical, non-migratory platforms, but there has not yet been an analysis of algorithms on this system. This work evaluates irregular algorithms that could benefit from the lightweight, memory-side processing of the Chick and demonstrates techniques and optimization strategies for achieving performance in sparse matrix-vector multiply operation (SpMV), breadth-first search (BFS), and graph alignment across up to eight distributed nodes encompassing 64 nodelets in the Chick system. We also define and justify relative metrics to compare prototype FPGA-based hardware with established ASIC architectures. The Chick currently supports up to 68x scaling for graph alignment, 80 MTEPS for BFS on balanced graphs, and 50% of measured STREAM bandwidth for SpMV.
Published: 2020

38. Privacy-Preserving Personalized Revenue Management

Author: Yanzhe Lei, Ruslan Momot, Sentao Miao, Ecole des Hautes Etudes Commerciales (HEC Paris), HEC Research Paper Series, and Haldemann, Antoine
Subjects: History, Polymers and Plastics, Operations research, Computer science, revenue management, JEL: M - Business Administration and Business Economics • Marketing • Accounting • Personnel Economics/M.M2 - Business Economics/M.M2.M20 - General, Industry standard, 0211 other engineering and technologies, 02 engineering and technology, privacy, Industrial and Manufacturing Engineering, JEL: M - Business Administration and Business Economics • Marketing • Accounting • Personnel Economics/M.M3 - Marketing and Advertising/M.M3.M31 - Marketing, personalized pricing, Order (exchange), 0502 economics and business, Revenue, Differential privacy, 050207 economics, Business and International Management, Set (psychology), JEL: C - Mathematical and Quantitative Methods/C.C0 - General/C.C0.C02 - Mathematical Methods, 021103 operations research, Revenue management, JEL: L - Industrial Organization/L.L5 - Regulation and Industrial Policy/L.L5.L51 - Economics of Regulation, 05 social sciences, JEL: C - Mathematical and Quantitative Methods/C.C1 - Econometric and Statistical Methods and Methodology: General/C.C1.C13 - Estimation: General, JEL: M - Business Administration and Business Economics • Marketing • Accounting • Personnel Economics/M.M3 - Marketing and Advertising/M.M3.M37 - Advertising, JEL: C - Mathematical and Quantitative Methods/C.C4 - Econometric and Statistical Methods: Special Topics/C.C4.C44 - Operations Research • Statistical Decision Theory, JEL: A - General Economics and Teaching/A.A1 - General Economics/A.A1.A10 - General, Privacy preserving, data-driven decision making, JEL: D - Microeconomics/D.D2 - Production and Organizations/D.D2.D21 - Firm Behavior: Theory, JEL: D - Microeconomics/D.D1 - Household Behavior and Family Economics/D.D1.D18 - Consumer Protection, Consumer privacy, JEL: A - General Economics and Teaching/A.A1 - General Economics/A.A1.A12 - Relation of Economics to Other Disciplines, [SHS.GESTION]Humanities and Social Sciences/Business administration, JEL: C - Mathematical and Quantitative Methods/C.C1 - Econometric and Statistical Methods and Methodology: General/C.C1.C18 - Methodological Issues: General, [SHS.GESTION] Humanities and Social Sciences/Business administration, JEL: M - Business Administration and Business Economics • Marketing • Accounting • Personnel Economics/M.M1 - Business Administration/M.M1.M15 - IT Management, JEL: D - Microeconomics/D.D1 - Household Behavior and Family Economics/D.D1.D11 - Consumer Economics: Theory
Abstract: This paper examines how data-driven personalized decisions can be made while preserving consumer privacy. Our setting is one in which the firm chooses a personalized price based on each new customer's vector of individual features; the true set of individual demand-generating parameters is unknown to the firm and so must be estimated from historical data. We extend this classical framework of personalized pricing by requiring also that the firm's pricing policy preserve consumer privacy, or (formally) that it be differentially private -- an industry standard for privacy preservation. The two settings we consider are theoretically and practically relevant: central and local models of differential privacy, which differ in the strength of the privacy guarantees they provide. For both models, we develop privacy-preserving personalized pricing algorithms and derive the theoretical bounds on their performance as measured by the firm's revenue. Our analyses suggest that, if the firm possesses a sufficient amount of historical data, then it can achieve central differential privacy at a cost of the same order as the "classical" loss in revenue due to estimation error. Comparing the two models, we conclude that local differentially private personalized pricing yields better privacy guarantees but leads to much greater revenue loss by the firm. We confirm our theoretical findings in a series of numerical experiments based on synthetically generated and real-world On-line Auto Lending (CPRM-12-001) data sets. Finally, we also apply our theoretical framework to the setting of personalized assortment optimization.
Published: 2020

39. Adaptive Grids for the Estimation of Dynamic Models

Author: Ole Wilms, Gregor Reich, Ecole des Hautes Etudes Commerciales (HEC Paris), HEC Paris Research Paper Series, Research Group: Finance, and Department of Finance
Subjects: History, Mathematical optimization, Polymers and Plastics, Computer science, Economics, Econometrics and Finance (miscellaneous), 0211 other engineering and technologies, Structure (category theory), mathematical programming with equilibrium constraints, Equioscillation, 02 engineering and technology, Industrial and Manufacturing Engineering, JEL: C - Mathematical and Quantitative Methods/C.C6 - Mathematical Methods • Programming Models • Mathematical and Simulation Modeling/C.C6.C63 - Computational Techniques • Simulation Modeling, Dynamic discrete choice models, Bellman equation, 0502 economics and business, 050207 economics, Business and International Management, r-adaptive grid refinement, Balanced Errors, computer.programming_language, Marketing, 021103 operations research, equi-oscillation, 05 social sciences, Grid, Adaptive Grids, Dynamic models, numerical dynamic programming, Feature (computer vision), [SHS.GESTION]Humanities and Social Sciences/Business administration, Node (circuits), computer, JEL: C - Mathematical and Quantitative Methods/C.C2 - Single Equation Models • Single Variables/C.C2.C25 - Discrete Regression and Qualitative Choice Models • Discrete Regressors • Proportions • Probabilities, Interpolation, Rust (programming language)
Abstract: This paper develops a method to flexibly adapt interpolation grids of value function approximations in the estimation of dynamic models using either NFXP (Rust, Econometrica: Journal of the Econom etric Society, 55, 999– 1 033, 1987) or MPEC (Su & Judd, Econometrica: Journal of the Econometric Society, 80, 2213–2230, 2012). Since MPEC requires the grid structure for the value function approximation to be hard-coded into the constraints, one cannot apply iterative node insertion for grid refinement; for NFXP, grid adaption by (iteratively) inserting new grid nodes will generally lead to discontinuous likelihood functions. Therefore, we show how to continuously adapt the grid by moving the nodes, a technique referred to as r-adaption. We demonstrate how to obtain optimal grids based on the balanced error principle, and implement this approach by including additional constraints to the likelihood maximization problem. The method is applied to two models: (i) the bus engine replacement model (Rust, 1987), modified to feature a continuous mileage state, and (ii) to a dynamic model of content consumption using original data from one of the world’s leading user-generated content networks in the domain of music.
Published: 2020

40. On the complexity of computing integral bases of function fields

Author: Simon Abelard, Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), David R. Cheriton School of Computer Science, University of Waterloo [Waterloo], This paper is a part of a project that has received funding by the French Agence de l'Innovation de Défense (DGA)., Boulier F., England M., Sadykov T.M., and Vorozhtsov E.V.
Subjects: Algebraic function field, Computer Science - Symbolic Computation, FOS: Computer and information sciences, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], 050101 languages & linguistics, Plane curve, [MATH.MATH-AC]Mathematics [math]/Commutative Algebra [math.AC], 02 engineering and technology, Symbolic Computation (cs.SC), Commutative Algebra (math.AC), Puiseux series, Mathematics - Algebraic Geometry, ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, Polynomial matrices, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, 0501 psychology and cognitive sciences, Linear algebra, Algebraic Geometry (math.AG), Mathematics, Discrete mathematics, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], Irreducible polynomial, 05 social sciences, Basis (universal algebra), Function (mathematics), Mathematics - Commutative Algebra, 020201 artificial intelligence & image processing, [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG], Monic polynomial
Abstract: Let $\mathcal{C}$ be a plane curve given by an equation $f(x,y)=0$ with $f\in K[x][y]$ a monic squarefree polynomial. We study the problem of computing an integral basis of the algebraic function field $K(\mathcal{C})$ and give new complexity bounds for three known algorithms dealing with this problem. For each algorithm, we study its subroutines and, when it is possible, we modify or replace them so as to take advantage of faster primitives. Then, we combine complexity results to derive an overall complexity estimate for each algorithm. In particular, we modify an algorithm due to B\"ohm et al. and achieve a quasi-optimal runtime., Comment: Preliminary version
Published: 2020

41. Fully integrated multi-scale modelling of damage and time-dependency in thermoplastic-based woven composites

Author: Fodil Meraghni, George Chatzigeorgiou, Francis Praud, Laboratoire d'Etude des Microstructures et de Mécanique des Matériaux (LEM3), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM), and This paper is part of the COPERSIM project managed by IRT Jules Verne (French Institute in Research and Technology in Advanced Manufacturing Technologies for Composite, Metallic and Hybrid Structures). The authors wish to associate the industrial and academic partners of this project, respectively, Arts et Metiers Institute of Technology, Solvay, Plastic Omnium, PSA and Renault.
Subjects: Materials science, Thermoplastic, Computational Mechanics, 02 engineering and technology, [SPI.MECA.SOLID]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Solid mechanics [physics.class-ph], Homogenization (chemistry), 0203 mechanical engineering, [SPI.MECA.MEMA]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Mechanics of materials [physics.class-ph], General Materials Science, Time dependency, Composite material, Mécanique: Mécanique des matériaux [Sciences de l'ingénieur], multi-scale modelling, periodic homogenization, chemistry.chemical_classification, Mechanical Engineering, Mécanique: Mécanique des solides [Sciences de l'ingénieur], time-dependent behaviour, 021001 nanoscience & nanotechnology, Woven composites, 020303 mechanical engineering & transports, chemistry, Mechanics of Materials, thermoplastic matrices, 0210 nano-technology, damage
Abstract: In this work, a multi-scale model established from the concept of periodic homogenization is utilized to predict the cyclic and time-dependent response of thermoplastic-based woven composites. The macroscopic behaviour of the composite is determined from finite element simulations of the representative unit cell of the periodic microstructure, where the local non-linear constitutive laws of the components are directly integrated, namely, the matrix and the yarns. The thermoplastic matrix is described by a phenomenological multi-mechanisms constitutive model accounting for viscoelasticity, viscoplasticity and ductile damage. For the yarns, a hybrid micromechanical–phenomenological constitutive model accounting for anisotropic damage and anelasticity induced by the presence of a diffuse micro-crack network is utilized. The capabilities of the overall multi-scale model are validated by comparing the numerical predictions with experimental data. Further illustrative examples are also provided, where the composite undergoes time-dependent deformations under uni-axial and non-proportional multi-axial loading paths. The multi-scale model is also employed to analyze the influence of the local deformation processes on the macroscopic response of the composite. This paper is part of the COPERSIM project managed by IRT Jules Verne (French Institute in Research and Technology in Advanced Manufacturing Technologies for Composite, Metallic and Hybrid Structures). The authors wish to associate the industrial and academic partners of this project, respectively, Arts et Metiers Institute of Technology, Solvay, Plastic Omnium, PSA and Renault.
Published: 2020

42. A Three-Tier Architecture of Large-Scale Wireless Sensor Networks for Big Data Collection

Author: Ousmane Thiare, Asside Christian Djedouboum, Abdelhak Mourad Gueroui, Alidou Mohamadou, Ado Adamou Abba Ari, Zibouda Aliouat, Laboratoire d'Informatique Parallélisme Réseaux Algorithmes Distribués (LI-PaRAD), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), University of Maroua (UMa), Université Gaston Berger de Saint-Louis Sénégal (UGB), University of Ferhat Abbes Setif 1 Department of Computer Science, 18MDU114, and This research was funded in part by the PHC-Tassili grant number 18MDU114. We like to thank the editor and the anonymous reviewers for their valuable remarks that helped us in better improving the content and presentation of the paper.
Subjects: data collection, architecture, Computer science, Big data, Context (language use), 02 engineering and technology, 7. Clean energy, 01 natural sciences, lcsh:Technology, lcsh:Chemistry, [SPI]Engineering Sciences [physics], 0202 electrical engineering, electronic engineering, information engineering, General Materials Science, Instrumentation, lcsh:QH301-705.5, Fluid Flow and Transfer Processes, business.industry, lcsh:T, Process Chemistry and Technology, Node (networking), Multitier architecture, 010401 analytical chemistry, General Engineering, 020206 networking & telecommunications, Energy consumption, lcsh:QC1-999, 0104 chemical sciences, Computer Science Applications, Large-Scale Wireless Sensor Networks, lcsh:Biology (General), lcsh:QD1-999, lcsh:TA1-2040, Models of communication, Sink (computing), business, lcsh:Engineering (General). Civil engineering (General), Wireless sensor network, lcsh:Physics, Computer network, clustering
Abstract: International audience; In recent years, technological advances and the ever-increasing power of embedded systems have seen the emergence of so-called smart cities. In these cities, application needs are increasingly calling for Large-Scale Wireless Sensor Networks (LS-WSN). However, the design and implementation of such networks pose several important and interesting challenges. These low-cost, low-power devices are characterized by limited computing, memory storage, communication, and battery power capabilities. Moreover, sensors are often required to cooperate in order to route the collected data to a single central node (or sink). The many-to-one communication model that governs dense and widely deployed Wireless Sensor Networks (WSNs) most often leads to problems of network overload and congestion. Indeed, it is easy to show that the closer a node is geographical to the sink, the more data sources it has to relay. This leads to several problems including overloading of nodes close to the sink, high loss rate in the area close to the sink, and poor distribution of power consumption that directly affects the lives of these networks. In this context, we propose a contribution to the problem of LS-WSN energy consumption. We designed a hierarchical 3-tier architecture of LS-WSNs coupled with a modeling of the activities of the different sensors in the network. This architecture that is based on clustering also includes a redeployment function to maintain the topology in case of coverage gaps. The results of the performed simulations show that our architecture maximizes the lifetime than compared solutions.
Published: 2020

43. Measuring Regulatory Complexity

Author: Co-Pierre Georg, Jean-Edouard Colliard, Paris School of Economics (PSE), École des Ponts ParisTech (ENPC)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS)-École des hautes études en sciences sociales (EHESS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), and HEC Paris Research Paper Series
Subjects: History, Financial Regulation, Polymers and Plastics, Computer science, 020209 energy, ComputingMilieux_LEGALASPECTSOFCOMPUTING, 02 engineering and technology, Basel Accords, Measure (mathematics), Industrial and Manufacturing Engineering, JEL: G - Financial Economics, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, Capital requirement, Capital Regulation, Balance sheet, JEL: G - Financial Economics/G.G2 - Financial Institutions and Services/G.G2.G28 - Government Policy and Regulation, 050207 economics, Business and International Management, Set (psychology), Protocol (object-oriented programming), Basel I, 05 social sciences, Regulatory Complexity, JEL: G - Financial Economics/G.G1 - General Financial Markets/G.G1.G18 - Government Policy and Regulation, Financial regulation, Risk analysis (engineering), [SHS.GESTION]Humanities and Social Sciences/Business administration
Abstract: Despite a heated debate on the perceived increasing complexity of financial regulation, there is no available measure of regulatory complexity other than the mere length of regulatory documents. To fill this gap, we propose to apply simple measures from the computer science literature by treating regulation like an algorithm - a fixed set of rules that determine how an input (e.g., a bank balance sheet) leads to an output (a regulatory decision). We apply our measures to the regulation of a bank in a theoretical model, to an algorithm computing capital requirements based on Basel I, and to actual regulatory texts. Our measures capture dimensions of complexity beyond the mere length of a regulation. In particular, shorter regulations are not necessarily less complex, as they can also use more "high-level" language and concepts. Finally, we propose an experimental protocol to validate measures of regulatory complexity.
Published: 2020

44. Multi-fidelity modeling with different input domain definitions using Deep Gaussian Processes

Author: Nouredine Melab, El-Ghazali Talbi, Ali Hebbal, Mathieu Balesdent, Loïc Brevault, DTIS, ONERA, Université Paris Saclay [Palaiseau], ONERA-Université Paris-Saclay, 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), and The work of Ali Hebbal is a funded by ONERA - The French Aerospace Lab and the University of Lille through a PhD thesis. This work is also part of two projects (HERACLES and MUFIN) funded by ONERA. The Experiments presented in this paper were carried out using the Grid’5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr).
Subjects: FOS: Computer and information sciences, Domain of a function, Computer Science - Machine Learning, Control and Optimization, Computer science, media_common.quotation_subject, 0211 other engineering and technologies, Fidelity, Machine Learning (stat.ML), 02 engineering and technology, Machine Learning (cs.LG), Domain (software engineering), symbols.namesake, 0203 mechanical engineering, [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], Statistics - Machine Learning, multifidélité, modélisation bayésienne, Gaussian process, 021106 design practice & management, media_common, business.industry, Quantum Physics, Computer Graphics and Computer-Aided Design, Computer Science Applications, 020303 mechanical engineering & transports, Test case, Control and Systems Engineering, espace entree dimension variée, symbols, Global Positioning System, Engineering design process, business, Parametrization, Algorithm, Software, processus gaussien
Abstract: International audience; Multi-fidelity approaches combine different models built on a scarce but accurate data-set (high-fidelity data-set), and a large but approximate one (low-fidelity data-set) in order to improve the prediction accuracy. Gaussian Processes (GPs) are one of the popular approaches to exhibit the correlations between these different fidelity levels. Deep Gaussian Processes (DGPs) that are functional compositions of GPs have also been adapted to multi-fidelity using the Multi-Fidelity Deep Gaussian process model (MF-DGP). This model increases the expressive power compared to GPs by considering non-linear correlations between fidelities within a Bayesian framework. However, these multi-fidelity methods consider only the case where the inputs of the different fidelity models are defined over the same domain of definition (e.g., same variables, same dimensions). However, due to simplification in the modeling of the low-fidelity, some variables may be omitted or a different parametrization may be used compared to the high-fidelity model. In this paper, Deep Gaussian Processes for multi-fidelity (MF-DGP) are extended to the case where a different parametrization is used for each fidelity. The performance of the proposed multifidelity modeling technique is assessed on analytical test cases and on structural and aerodynamic real physical problems.
Published: 2020

45. A comparative study of high-productivity high-performance programming languages for parallel metaheuristics

Author: Jan Gmys, Nouredine Melab, Daniel Tuyttens, El-Ghazali Talbi, Tiago Carneiro, University of Mons [Belgium] (UMONS), Faculté polytechnique de Mons, Université de Mons (UMons), 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), Université de Lille, and The experiments presented in this paper were carried out on the Grid’5000 testbed, hosted by INRIA and including several other organizations. Wethank Bradford Chamberlain, Elliot Ronaghan (Cray inc.) and Louis Jenkins (University of Rochester) for their support on Chapel’s Gitter platform.
Subjects: Parallel computing, General Computer Science, Quadratic assignment problem, Computer science, General Mathematics, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 02 engineering and technology, Thread (computing), Metaheuristics, computer.software_genre, High productivity, Chapel, 0202 electrical engineering, electronic engineering, information engineering, Metaheuristic, computer.programming_language, Programming language, 05 social sciences, 050301 education, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Python (programming language), High-productivity languages, Parallel metaheuristics, Scalability, 020201 artificial intelligence & image processing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0503 education, computer
Abstract: International audience; Parallel metaheuristics require programming languages that provide both, high performance and a high level of programmability. This paper aims at providing a useful data point to help practitioners gauge the difficult question of whether to invest time and effort into learning and using a new programming language. To accomplish this objective, three productivity-aware languages (Chapel, Julia, and Python) are compared in terms of performance, scalability and productivity. To the best of our knowledge, this is the first time such a comparison is performed in the context of parallel metaheuristics. As a test-case, we implement two parallel metaheuristics in three languages for solving the 3D Quadratic Assignment Problem (Q3AP), using thread-based parallelism on a multi-core shared-memory computer. We also evaluate and compare the performance of the three languages for a parallel fitness evaluation loop, using four different test-functions with different computational characteristics. Besides providing a comparative study, we give feedback on the implementation and parallelization process in each language.
Published: 2020

46. Parallel Surrogate-assisted Optimization: Batched Bayesian Neural Network-assisted GA versus q-EGO

Author: Guillaume Briffoteaux, Romain Ragonnet, Jan Gmys, Nouredine Melab, Mohand Mezmaz, Maxime Gobert, Daniel Tuyttens, 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), University of Mons [Belgium] (UMONS), Monash University [Melbourne], 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), Institut de Mathématiques [Mons], Université de Mons (UMons), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), and Experiments presented in this paper were carried out using the Grid’5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr).
Subjects: General Computer Science, Computer science, General Mathematics, Evolutionary algorithm, 02 engineering and technology, [INFO.INFO-NE]Computer Science [cs]/Neural and Evolutionary Computing [cs.NE], Machine learning, computer.software_genre, Surrogate model, Genetic algorithm, Surrogate-assisted Optimization, 0202 electrical engineering, electronic engineering, information engineering, Massively parallel, Global optimization, Artificial neural network, Bayesian Optimization, business.industry, 05 social sciences, Bayesian optimization, Evolutionary Algorithm, 050301 education, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Efficient Global Optimization, Benchmark (computing), 020201 artificial intelligence & image processing, Artificial intelligence, Massively Parallel Computing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, 0503 education, computer, Simulation
Abstract: International audience; Surrogate-based optimization is widely used to deal with long-running black-box simulation-based objective functions. Actually, the use of a surrogate model such as Kriging or Artificial Neural Network allows to reduce the number of calls to the CPU time-intensive simulator. Bayesian optimization uses the ability of surrogates to provide useful information to help guiding effectively the optimization process. In this paper, the Efficient Global Optimization (EGO) reference framework is challenged by a Bayesian Neural Network-assisted Genetic Algorithm, namely BNN-GA. The Bayesian Neural Network (BNN) surrogate is chosen for its ability to provide an uncertainty measure of the prediction that allows to compute the Expected Improvement of a candidate solution in order to improve the exploration of the objective space. BNN is also more reliable than Kriging models for high-dimensional problems and faster to set up thanks to its incremental training. In addition, we propose a batch-based approach for the parallelization of BNN-GA that is challenged by a parallel version of EGO, called q-EGO. Parallel computing is a highly important complementary way (to surrogates) to deal with the computational burden of simulation-based optimization. The comparison of the two parallel approaches is experimentally performed through several benchmark functions and two real-world problems within the scope of Tuberculosis Transmission Control (TBTC). The study presented in this paper proves that parallel batched BNN-GA is a viable alternative to q-EGO approaches being more suitable for high-dimensional problems, parallelization impact, bigger databases and moderate search budgets. Moreover, a significant improvement of the solutions is obtained for the two TBTC problems tackled.
Published: 2020

47. Evolution in Dynamic Software Product Lines

Author: Luciano Baresi, Clément Quinton, Michael Vierhauser, Rick Rabiser, Christian Schuhmayer, Paul Grünbacher, Université de Lille, Self-adaptation for distributed services and large software systems (SPIRALS), 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 (CRIStAL) - UMR 9189 (CRIStAL), Centre National de la Recherche Scientifique (CNRS)-Université de Lille-Ecole Centrale de Lille-Centre National de la Recherche Scientifique (CNRS)-Université de Lille-Ecole Centrale de Lille, Johannes Kepler University Linz [linz] (JKU), Politecnico di Milano [Milan] (POLIMI), 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), Johannes Kepler Universität Linz - Johannes Kepler University Linz [Autriche] (JKU), The work by the Italian authors (when the work described in this paper started, the first author was still working at Politecnico di Milano) has beensupported by project EEB – Edifici A Zero Consumo Energetico In Distretti Urbani Intelligenti (Italian Technology Cluster For Smart Communities)– CTN01_00034_594053. Regarding the work by the Austrian authors the financial support by the Austrian Federal Ministry for Digital and Economic Affairs, the National Foundation for Research, Technology and Development, and Primetals Technologies is gratefully acknowledged.MichaelVierhauser’s work has also been supported by the Austrian Science Fund (FWF) under Grant No. J3998- N31., and Johannes Kepler University Linz [Linz] (JKU)
Subjects: Flexibility (engineering), Computer science, business.industry, Evolution, Control reconfiguration, 020207 software engineering, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Automation, Home automation, Dynamic Software Product Lines, 020204 information systems, Adaptive system, 0202 electrical engineering, electronic engineering, information engineering, Reference architecture, Software system, Consistency, Adaptation (computer science), business, Software engineering, Software
Abstract: International audience; Many software systems today provide support for adaptation and reconfiguration at runtime, in response to changes in their environment. Such adaptive systems are designed to run continuously and may not be shut down for reconfiguration or maintenance tasks. The variability of such systems has to be explicitly managed, together with mechanisms that control their runtime adaptation and reconfiguration. Dynamic software product lines (DSPLs) can help to achieve this. However, dealing with evolution is particularly challenging in a DSPL, as changes made at run-time can easily lead to inconsistencies. This paper describes the challenges of evolving DSPLs using an example cyber-physical system for home automation. We discuss the shortcomings of existing work and present a reference architecture to support DSPL evolution. To demonstrate its feasibility and flexibility, we implemented the proposed reference architecture for two different DSPLs: the aforementioned cyber-physical system, which uses feature models to describe its variability, and a runtime monitoring infrastructure, which is based on decision models. To assess the industrial applicability of our approach, we also implemented the reference architecture for a real-world DSPL, an automation software system for injection molding machines. Our results provide evidence on the flexibility, performance and industrial applicability of our approach.
Published: 2020

48. Foreground-Background Ambient Sound Scene Separation

Author: Michel Olvera, Romain Serizel, Emmanuel Vincent, Gilles Gasso, Speech Modeling for Facilitating Oral-Based Communication (MULTISPEECH), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), 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)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes (LITIS), Université Le Havre Normandie (ULH), Normandie Université (NU)-Normandie Université (NU)-Université de Rouen Normandie (UNIROUEN), Normandie Université (NU)-Institut national des sciences appliquées Rouen Normandie (INSA Rouen Normandie), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA), This work was made with the support of the French National Research Agency, in the framework of the project LEAUDS 'Learning to understandaudio scenes' (ANR-18-CE23-0020). Experiments presented in this paper were carried out using the Grid’5000 testbed, supported by a scientificinterest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr)., GRID5000, ANR-18-CE23-0020,LEAUDS,Apprentissage statistique pour la compréhension de scènes audio(2018), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Institut national des sciences appliquées Rouen Normandie (INSA Rouen Normandie), Normandie Université (NU)-Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA)-Université de Rouen Normandie (UNIROUEN), Normandie Université (NU)-Université Le Havre Normandie (ULH), Normandie Université (NU), and ANR-18-CE23-0020,LEAUDS,LEARNING TO UNDERSTAND AUDIO SCENES(2018)
Subjects: Normalization (statistics), Signal Processing (eess.SP), FOS: Computer and information sciences, Sound (cs.SD), Computer Science - Machine Learning, Computer science, Generalization, Ambient noise level, 02 engineering and technology, Computer Science - Sound, Machine Learning (cs.LG), Signal-to-noise ratio, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, Audio and Speech Processing (eess.AS), 0202 electrical engineering, electronic engineering, information engineering, ambient sound scenes, FOS: Electrical engineering, electronic engineering, information engineering, Foreground-background, Computer vision, generalization ability, Electrical Engineering and Systems Science - Signal Processing, Sound (geography), Signal processing, geography, geography.geographical_feature_category, business.industry, Deep learning, deep learning, audio source separation, 020206 networking & telecommunications, Feature (computer vision), [INFO.INFO-SD]Computer Science [cs]/Sound [cs.SD], 020201 artificial intelligence & image processing, Artificial intelligence, business, Electrical Engineering and Systems Science - Audio and Speech Processing
Abstract: International audience; Ambient sound scenes typically comprise multiple short events occurring on top of a somewhat stationary background. We consider the task of separating these events from the background, which we call foreground-background ambient sound scene separation. We propose a deep learning-based separation framework with a suitable feature normaliza-tion scheme and an optional auxiliary network capturing the background statistics, and we investigate its ability to handle the great variety of sound classes encountered in ambient sound scenes, which have often not been seen in training. To do so, we create single-channel foreground-background mixtures using isolated sounds from the DESED and Audioset datasets, and we conduct extensive experiments with mixtures of seen or unseen sound classes at various signal-to-noise ratios. Our experimental findings demonstrate the generalization ability of the proposed approach.
Published: 2020

49. Data-Driven Approach to Grade Change Scheduling Optimization in a Paper Machine

Author: Tewodros Deneke, Teemu J. Ikonen, Hossein Mostafaei, Jason Kramb, Iiro Harjunkoski, Keijo Heljanko, Department of Chemical and Metallurgical Engineering, Process Control and Automation, UPM Communication Papers, University of Helsinki, Aalto-yliopisto, Aalto University, Department of Computer Science, and Helsinki Institute for Information Technology
Subjects: Decision support system, business.product_category, Computer science, CONTINUOUS-TIME, General Chemical Engineering, MODELS, Scheduling (production processes), 215 Chemical engineering, 02 engineering and technology, General Chemistry, 021001 nanoscience & nanotechnology, FRAMEWORK, Industrial engineering, Industrial and Manufacturing Engineering, Scheduling (computing), Data-driven, Paper machine, 020401 chemical engineering, SCOPE, 0204 chemical engineering, 0210 nano-technology, business, Computer Science::Operating Systems
Abstract: This paper proposes an efficient decision support tool for the optimal production scheduling of a variety of paper grades in a paper machine. The tool is based on a continuous-time scheduling model and generalized disjunctive programming. As the full-space scheduling model corresponds to a large-scale mixed integer linear programming model, we apply data analytics techniques to reduce the size of the decision space, which has a profound impact on the computational efficiency of the model and enables us to support the solution of large-scale problems. The data-driven model is based on an automated method of identifying the forbidden and recommended paper grade sequences, as well as the changeover durations between two paper grades. The results from a real industrial case study show that the data-driven model leads to good results in terms of both solution quality and CPU time in comparison to the full-space model.
Published: 2020

50. Autonomous hydrogen production for proton exchange membrane fuel cells PEMFC

Author: Manuel Legree, Jean-Louis Bobet, Fabrice Mauvy, F. Bos, Matthieu Faessel, Jocelyn Sabatier, Abdel Salam Awad, 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), Laboratoire de Chimie Physique des Matériaux (LCPM), Université Libanaise, Laboratoire de l'intégration, du matériau au système (IMS), Université Sciences et Technologies - Bordeaux 1-Institut Polytechnique de Bordeaux-Centre National de la Recherche Scientifique (CNRS), Université de Bordeaux (UB), and The authors acknowledge the AST society, the Aquitaine SATT, for the funding of the prototype presented in this paper in the form of the HELP maturation project.
Subjects: command law, Materials science, Hydrogen, Magnesium, 020209 energy, Proton exchange membrane fuel cell, chemistry.chemical_element, 02 engineering and technology, [CHIM.MATE]Chemical Sciences/Material chemistry, 021001 nanoscience & nanotechnology, Hydrogen generation, 7. Clean energy, hydrolysis reaction, Hydrolysis, chemistry, Chemical engineering, Transition metal, Yield (chemistry), 0202 electrical engineering, electronic engineering, information engineering, Graphite, Mg-based materials, PEMFC, 0210 nano-technology, green mobility applications, Hydrogen production
Abstract: International audience; This paper focuses on hydrogen production for green mobility applications (other applications are currently under investigation). Firstly, a brief state of the art of hydrogen generation by hydrolysis with magnesium is shown. The hydrolysis performance of Magnesium powder ball–milled along with different additives (graphite and transition metals TM = Ni, Fe, and Al) is taken for comparison. The best performance was observed with Mg–10 wt.% g mixtures (95% of theoretical hydrogen generation yield in about 3 min). An efficient solution to control this hydrolysis reaction is proposed to produce hydrogen on demand and to feed a PEM fuel cell. Tests on a bench fitted with a 100 W Proton Exchange Membrane (PEM) fuel cell have demonstrated the technological potential of this solution for electric assistance applications in the field of light mobility.
Published: 2020

Searchworks

Select search scope, currently: Articles Catalog books, media & more in Jio Institute collections Articles journal articles & other e-resources

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Journal

Database

Publisher

176 results

Search Results

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources