Author: "Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)" - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)"' showing total 23,919 results

Start Over Author "Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)"

23,919 results on '"Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)"'

1. A Boundary Computation Algorithm for the Workspace Evaluation of Continuum Parallel Robots

Author: Zaccaria, Federico, Idá, Edoardo, Briot, Sébastien, Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ), Dipartimento di Scienze dell'Informazione [Bologna] (DISI), Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO), Centre National de la Recherche Scientifique (CNRS), Autonomie des Robots et Maîtrise des interactions avec l’ENvironnement (LS2N - équipe ARMEN), and Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique)
Subjects: Mechanical Engineering, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO]
Abstract: In this paper, a new algorithm for the computation of workspace boundaries of continuum parallel robots (CPRs) is proposed. State-of-the-art techniques are mainly based on time-consuming joint-space discretization approaches or task-space discretization algorithms, and only a few approaches are dedicated to the computation of workspace boundaries. The proposed approach for the computation of the workspace boundaries is based on i) a free-space exploration strategy and ii) a boundary reconstruction algorithm. The former is exploited to identify an initial workspace boundary location (exterior, interior boundaries, and holes), while the latter is used to reconstruct the complete boundary surface. Moreover, the algorithm is designed to be employed with CPRs modelling strategies based on general discretization assumptions, in order to increase its applicability for various scopes. Our method is compared with two state-of-the-art algorithms in four case studies to validate the results and to establish its merits and limitations.
Published: 2023

2. Floating-point arithmetic

Author: Sylvie Boldo, Claude-Pierre Jeannerod, Guillaume Melquiond, Jean-Michel Muller, Formally Verified Programs, Certified Tools and Numerical Computations (TOCCATA), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Arithmétiques des ordinateurs, méthodes formelles, génération de code (ARIC), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), ANR-20-CE48-0014,NuSCAP,Sûreté numérique pour les preuves assistées par ordinateur(2020), and European Project: 810367,EMC2(2019)
Subjects: computer arithmetic, Numerical Analysis, [INFO.INFO-AO]Computer Science [cs]/Computer Arithmetic, General Mathematics, Floating-point arithmetic, numerical computing
Abstract: Floating-point numbers have an intuitive meaning when it comes to physics-based numerical computations, and they have thus become the most common way of approximating real numbers in computers. The IEEE-754 Standard has played a large part in making floating-point arithmetic ubiquitous today, by specifying its semantics in a strict yet useful way as early as 1985. In particular, floating-point operations should be performed as if their results were first computed with an infinite precision and then rounded to the target format. A consequence is that floating-point arithmetic satisfies the ‘standard model’ that is often used for analysing the accuracy of floating-point algorithms. But that is only scraping the surface, and floating-point arithmetic offers much more.In this survey we recall the history of floating-point arithmetic as well as its specification mandated by the IEEE-754 Standard. We also recall what properties it entails and what every programmer should know when designing a floating-point algorithm. We provide various basic blocks that can be implemented with floating-point arithmetic. In particular, one can actually compute the rounding error caused by some floating-point operations, which paves the way to designing more accurate algorithms. More generally, properties of floating-point arithmetic make it possible to extend the accuracy of computations beyond working precision.
Published: 2023

3. Real-time motion planning for an autonomous mobile robot with wheel-ground adhesion constraint

Author: Gao, Jiuchun, Claveau, Fabien, Pashkevich, Anatol, Chevrel, Philippe, Abdessamed, Ramdane, Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Robotique Et Vivant (LS2N - équipe ReV), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Commande, Observation, Diagnostic et Expérimentation (LS2N - équipe CODEx), Chassis Brakes International (Chassis Brakes International), Hitachi Astemo, and Chassis Brake International Funding
Subjects: autonomous mobile robot, dynamic programming, Human-Computer Interaction, wheel-ground adhesion, Hardware and Architecture, Control and Systems Engineering, time-optimal trajectory, real-time motion planning, Software, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Computer Science Applications
Abstract: International audience; The paper proposes a new real-time motion planning technique for an autonomous mobile robot that is able to find a collision-free path and a corresponding time-optimal trajectory while taking into account limits on the actuator capacities and constraints from the wheel-ground adhesion. The proposed technique includes two sub-modules. The first one, an optimal path planner, is based on the discretization of the robot workspace and dynamic programming principle. It allows finding the shortest path in the robot environment to avoid obstacles and reach the robot target. The second one, an optimal trajectory generator, operates with the discretized robot state-space and also employs dynamic programming techniques. It produces a time-optimal motion along the obtained path, which may include numerous regular and singular trajectory sections caused by the simultaneous application of actuator and wheel-ground adhesion constraints. To adapt this technique to real-time implementation, a moving window strategy is presented that allows regularly updating the robot motion profile in a dynamic environment. The advantages of the developed technique and its suitability for real-time control are illustrated by experimental studies implemented on a car-like mobile robot.
Published: 2023

4. Total Least Squares in-field Identification for MEMS-based Triaxial Accelerometers

Author: Ducchi, Massimo, Zaccaria, Federico, Briot, Sébastien, Idá, Edoardo, Dipartimento di Scienze dell'Informazione [Bologna] (DISI), Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ), Centre National de la Recherche Scientifique (CNRS), Autonomie des Robots et Maîtrise des interactions avec l’ENvironnement (LS2N - équipe ARMEN), and Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique)
Subjects: [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO]
Abstract: International audience
Published: 2023

5. Singularity Conditions of Concentric Tube Robots

Author: Zaccaria, Federico, Idá, Edoardo, Briot, Sébastien, Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ), Centre National de la Recherche Scientifique (CNRS), Autonomie des Robots et Maîtrise des interactions avec l’ENvironnement (LS2N - équipe ARMEN), and Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique)
Subjects: [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO]
Abstract: International audience
Published: 2023

6. Vision-based interface for grasping intention detection and grip selection : towards intuitive upper-limb assistive devices

Author: Moullet, Etienne, Bailly, François, Carpentier, Justin, Coste, Christine Azevedo, Contrôle Artificiel de Mouvements et de Neuroprothèses Intuitives (CAMIN), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Models of visual object recognition and scene understanding (WILLOW), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), and 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)
Subjects: Grasping, Assistive devices, FOS: Biological sciences, Intuitive assistance, Computer vision, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Quantitative Biology - Quantitative Methods, Quantitative Methods (q-bio.QM)
Abstract: International audience; Assistive devices for indivuals with upper-limb movement often lack controllability and intuitiveness, in particular for grasping function. In this work, we introduce a novel user interface for grasping movement control in which the user delegates the grasping task decisions to the device, only moving their (potentially prosthetic) hand toward the targeted object.
Published: 2023

7. Evaluating Reification with Multi-valued Properties in a Knowledge Graph of Licensed Educational Resources

Author: Kieffer, Manoé, Fakih, Ginwa, Serrano-Alvarado, Patricia, Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ), Gestion de Données Distribuées (LS2N - équipe GDD), Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), LABEX Cominlabs - ANR-10-LABX-07-01, and Projet Cominlabs CLARA
Subjects: Knowledge graph, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], RDF reification, [INFO.INFO-WB]Computer Science [cs]/Web, multi-valued properties, query evaluation, educational resources, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract: International audience; This paper presents the construction of a Knowledge Graph (KG) of Educational Resources (ER), where RDF reification is essential. The ERs are described based on the subjects they cover considering their relevance. RDF reification is used to incorporate this subject’s relevance. Multiple reification models with distinct syntax and performance implications for storage and query processing exist. This study aims to experimentally compare four statement-based reification models with four triplestores to determine the most pertinent choice for our KG. We built four versions of the KG. Each version has a distinct reification model, namely standard reification, singleton properties, named graphs, and RDF-star, which were obtained using RML mappings. Each of the four triplestores (Virtuoso, Jena, Oxigraph, and GraphDB) was setup four times (except for Virtuoso, which does not support RDF-star), and seven different SPARQL queries were experimentally evaluated. This study shows that standard reification and named graphs lead to good performance. It also shows that, in the particular context of the used KG, Virtuoso outperforms Jena, GraphDB, and Oxigraph in most queries. The recent specification of RDF-star and SPARQL-star sheds light on statement-level annotations. The empirical study reported in this paper contributes to the efforts towards the efficient usage of RDF reification. In addition, this paper shares the pipeline of the KG con- struction using standard semantic web technologies.
Published: 2023

8. Suspending OpenMP Tasks on Asynchronous Events: Extending the Taskwait Construct

Author: Pereira, Romain, Martin, Maël, Roussel, Adrien, Gautier, Thierry, Carribault, Patrick, DAM Île-de-France (DAM/DIF), Direction des Applications Militaires (DAM), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Algorithms and Software Architectures for Distributed and HPC Platforms (AVALON), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire en Informatique Haute Performance pour le Calcul et la simulation (LIHPC), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction des Applications Militaires (DAM), and Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay
Subjects: [INFO]Computer Science [cs], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract: International audience; Many-core and heterogeneous architectures now require programmers to compose multiple asynchronous programming model to fully exploit hardware capabilities. As a shared-memory parallel programming model, OpenMP has the responsibility of orchestrating the suspension and progression of asynchronous operations occurring on a compute node, such as MPI communications or CUDA/HIP streams. Yet, specifications only come with the task detach(event) API to suspend tasks until an asynchronous operation is completed, which presents a few drawbacks. In this paper, we introduce the design and implementation of an extension on the taskwait construct to suspend a task until an asynchronous event completion. It aims to reduce runtime costs induced by the current solution, and to provide a standard API to automate portable task suspension solutions. The results show twice less overheads compared to the existing task detach clause.
Published: 2023

9. Condition for periodic attractor in 4-dimensional repressilators

Author: Sun, Honglu, Folschette, Maxime, Magnin, Morgan, Méthodes Formelles pour la Bioinformatique (LS2N - équipe MéForBio), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), BioComputing, Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), and Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)
Subjects: Decision tree, Discrete dynamical system, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Periodic attractor, Repressilator, Gene regulatory networks
Abstract: One of the key questions about gene regulatory networks is how to predict complex dynamical properties based on the influence graph's topology. Earlier theoretical studies have identified conditions for complex dynamical properties, like multistability or oscillations, based on topological features, like the presence of a positive (negative) feedback loop. This work follows this path and aims to find a sufficient and necessary condition for the existence of a periodic attractor in 4-dimensional (4 genes) repressilators based on a discrete modeling framework under some dynamical assumptions. These networks are extensions of the widely studied 3-dimensional repressilator, which has been used in synthetic biology to produce synthetic oscillations. While other researchers have explored specific extensions of the 3-dimensional repressilator to improve synthetic oscillation control, our work investigates all 4-dimensional networks with only inhibitions. By uncovering new insights about periodic attractors in these small networks, our findings could aid the design of new synthetic oscillations. We search for condition for period attractor in an exhaustive manner with the guide of a decision tree model. Our major contributions include: 1) discovering that, with one exception, the relations between gene regulation thresholds do not impact the existence of periodic attractors in any of the influence graphs considered in this study; 2) identifying a sufficient and necessary condition of simple form for the existence of a periodic attractor when the exception is ignored; 3) identifying new topological features of influence graphs that are necessary for predicting the existence of periodic attractor in 4-dimensional repressilators.
Published: 2023

10. Testing The Sharpness of Known Error Bounds on The Fast Fourier Transform

Author: Brisebarre, Nicolas, Muller, Jean-Michel, Picot, Joris, Arithmétiques des ordinateurs, méthodes formelles, génération de code (ARIC), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), École normale supérieure de Lyon (ENS de Lyon), and ANR-20-CE48-0014,NuSCAP,Sûreté numérique pour les preuves assistées par ordinateur(2020)
Subjects: Fast Fourier Transform (FFT), Error analysis, [INFO.INFO-AO]Computer Science [cs]/Computer Arithmetic, Floating-Point arithmetic, [INFO.INFO-MS]Computer Science [cs]/Mathematical Software [cs.MS]
Abstract: International audience; The computation of Fast Fourier Transforms (FFTs) in floating-point arithmetic is inexact due to roundings, and for some applications it can prove very useful to know a tight bound on the final error. Although it can be almost attained by specifically built input values, the best known error bound for the Cooley-Tukey FFT seems to be much larger than most actually obtained errors. Also, interval arithmetic can be used to compute a bound on the error committed with a given set of input values, but it is in general considered hampered with large overestimation. We report results of intensive computations to test the two approaches, in order to estimate the numerical performance of state-of-the-art bounds. Surprisingly enough, we observe that while interval arithmetic-based bounds are overestimated, they remain, in our computations, tighter than general known bounds.
Published: 2023

11. Combining multi-spectral data with statistical and deep-learning models for improved exoplanet detection in direct imaging at high contrast

Author: Flasseur, Olivier, Bodrito, Théo, Mairal, Julien, Ponce, Jean, Langlois, Maud, Lagrange, Anne-Marie, Centre de Recherche Astrophysique de Lyon (CRAL), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS), Models of visual object recognition and scene understanding (WILLOW), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Apprentissage de modèles à partir de données massives (Thoth), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Kuntzmann (LJK), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), 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), Center for Data Science, New York University [New York] (NYU), NYU System (NYU)-NYU System (NYU), Laboratoire d'études spatiales et d'instrumentation en astrophysique = Laboratory of Space Studies and Instrumentation in Astrophysics (LESIA), Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Institut de Planétologie et d'Astrophysique de Grenoble (IPAG), Centre National d'Études Spatiales [Toulouse] (CNES)-Observatoire des Sciences de l'Univers de Grenoble (OSUG ), Institut national des sciences de l'Univers (INSU - CNRS)-Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry])-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Université Grenoble Alpes (UGA)-Météo-France -Institut national des sciences de l'Univers (INSU - CNRS)-Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry])-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Université Grenoble Alpes (UGA)-Météo-France, The work of OF, ML, and AML was supported in part by the EuropeanResearch Council (ERC) under the European Union’s Horizon 2020 researchand innovation program (COBREX, n° 885593). The work of TB and JP wassupported in part by the Inria/NYU collaboration, the Louis Vuitton/ENS chair on artificial intelligence and the French Agence Nationale de la Recherche (ANR) as part of the Investissements d’avenir program (PRAIRIE 3IAInstitute, n° 19-P3IA-0001). The work of JM was supported in part by theERC (SOLARIS, n° 714381) and by the ANR (3IA MIAI, n° 19-P3IA-0003)., ANR-19-P3IA-0001,PRAIRIE,PaRis Artificial Intelligence Research InstitutE(2019), ANR-19-P3IA-0003,MIAI,MIAI @ Grenoble Alpes(2019), European Project: 885593,COBREX, and European Project: 714381,H2020,SOLARIS(2017)
Subjects: Earth and Planetary Astrophysics (astro-ph.EP), FOS: Computer and information sciences, [PHYS]Physics [physics], Computer Science - Machine Learning, [STAT.AP]Statistics [stat]/Applications [stat.AP], Multi-variate data, [PHYS.ASTR.EP]Physics [physics]/Astrophysics [astro-ph]/Earth and Planetary Astrophysics [astro-ph.EP], Matched filter, FOS: Physical sciences, Correlated data, [INFO.INFO-NE]Computer Science [cs]/Neural and Evolutionary Computing [cs.NE], Machine Learning (cs.LG), [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [STAT]Statistics [stat], Detection, [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], Supervised deep learning, Astrophysics - Instrumentation and Methods for Astrophysics, [PHYS.ASTR]Physics [physics]/Astrophysics [astro-ph], Instrumentation and Methods for Astrophysics (astro-ph.IM), [STAT.ME]Statistics [stat]/Methodology [stat.ME], [PHYS.PHYS.PHYS-DATA-AN]Physics [physics]/Physics [physics]/Data Analysis, Statistics and Probability [physics.data-an], Astrophysics - Earth and Planetary Astrophysics
Abstract: Exoplanet detection by direct imaging is a difficult task: the faint signals from the objects of interest are buried under a spatially structured nuisance component induced by the host star. The exoplanet signals can only be identified when combining several observations with dedicated detection algorithms. In contrast to most of existing methods, we propose to learn a model of the spatial, temporal and spectral characteristics of the nuisance, directly from the observations. In a pre-processing step, a statistical model of their correlations is built locally, and the data are centered and whitened to improve both their stationarity and signal-to-noise ratio (SNR). A convolutional neural network (CNN) is then trained in a supervised fashion to detect the residual signature of synthetic sources in the pre-processed images. Our method leads to a better trade-off between precision and recall than standard approaches in the field. It also outperforms a state-of-the-art algorithm based solely on a statistical framework. Besides, the exploitation of the spectral diversity improves the performance compared to a similar model built solely from spatio-temporal data., accepted to EUSIPCO 2023
Published: 2023

12. Bit-Stealing Made Legal

Author: Baudon, Thaïs, Radanne, Gabriel, Gonnord, Laure, École normale supérieure de Lyon (ENS de Lyon), Université de Lyon, Université Claude Bernard Lyon 1 (UCBL), Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Inria Lyon, Compilation et Analyse, Logiciel et Matériel (CASH), 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), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Lyon, Université Grenoble Alpes (UGA), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Laboratoire de Conception et d'Intégration des Systèmes (LCIS), Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), and Université Grenoble Alpes (UGA)-Université Grenoble Alpes (UGA)
Subjects: Pattern Matching, [INFO]Computer Science [cs], Algebraic Data Types, Compilation, Data Layouts
Abstract: International audience; Initially present only in functional languages such as OCaml and Haskell, Algebraic Data Types (ADTs) have now become pervasive in mainstream languages, providing nice data abstractions and an elegant way to express functions through pattern matching. Unfortunately, ADTs remain seldom used in low-level programming. One reason is that their increased convenience comes at the cost of abstracting away the exact memory layout of values. Even Rust, which tries to optimize data layout, severely limits control over memory representation. In this article, we present a new approach to specify the data layout of rich data types based on a dual view: a source type, providing a high-level description available in the rest of the code, along with a memory type, providing full control over the memory layout. This dual view allows for better reasoning about memory layout, both for correctness, with dedicated validity criteria linking the two views, and for optimizations that manipulate the memory view. We then provide algorithms to compile constructors and destructors, including pattern matching, to their low-level memory representation. We prove our compilation algorithms correct, implement them in a tool called ribbit that compiles to LLVM IR, and show some early experimental results.
Published: 2023

13. HATS : Un jeu de données intégrant la perception humaine appliquée à l'évaluation des métriques de transcription de la parole

Author: Bañeras-Roux, Thibault, Wottawa, Jane, Rouvier, Mickael, Merlin, Teva, Dufour, Richard, Traitement Automatique du Langage Naturel (LS2N - équipe TALN ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Laboratoire d'Informatique de l'Université du Mans (LIUM), Le Mans Université (UM), Laboratoire Informatique d'Avignon (LIA), Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI, Faculty of Applied Sciences University of West Bohemia Plzeň (Pilsen), NTIS P2 Research Center University of West Bohemia Plzeň (Pilsen), Faculty of Informatics Masaryk University Brno, and ANR-20-CE23-0005,DIETS,Diagnostic automatique des erreurs des systèmes de transcription de parole end-to-end à partir de leur réception par les utilisateurs(2020)
Subjects: evaluation metrics, automatic speech recognition, human perception, [INFO]Computer Science [cs], manual annotation, [INFO.INFO-NE]Computer Science [cs]/Neural and Evolutionary Computing [cs.NE], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract: International audience; Conventionally, Automatic Speech Recognition (ASR) systems are evaluated on their ability to correctly recognize each word contained in a speech signal. In this context, the word error rate (WER) metric is the reference for evaluating speech transcripts. Several studies have shown that this measure is too limited to correctly evaluate an ASR system, which has led to the proposal of other variants of metrics (weighted WER, BERTscore, semantic distance, etc.). However, they remain system-oriented, even when transcripts are intended for humans. In this paper, we firstly present Human Assessed Transcription Side-by-side (HATS), an original French manually annotated data set in terms of human perception of transcription errors produced by various ASR systems. 143 humans were asked to choose the best automatic transcription out of two hypotheses. We investigated the relationship between human preferences and various ASR evaluation metrics, including lexical and embedding-based ones, the latter being those that correlate supposedly the most with human perception.; Traditionnellement, les systèmes de reconnaissance automatique de la parole (RAP) sont évalués sur leur capacité à reconnaître correctement chaque mot contenu dans un signal vocal. Dans ce contexte, la mesure du taux d'erreur-mot est la référence pour évaluer les transcriptions vocales. Plusieurs études ont montré que cette mesure est trop limitée pour évaluer correctement un système de RAP, ce qui a conduit à la proposition d'autres variantes et d'autres métriques. Cependant, toutes ces métriques restent orientées "système'' alors même que les transcriptions sont destinées à des humains. Dans cet article, nous proposons un jeu de données original annoté manuellement en termes de perception humaine des erreurs de transcription produites par divers systèmes de RAP. 143 humains ont été invités à choisir la meilleure transcription automatique entre deux hypothèses. Nous étudions la relation entre les préférences humaines et diverses mesures d'évaluation pour les systèmes de RAP, y compris les mesures lexicales et celles fondées sur les plongements de mots.
Published: 2023

14. A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows

Author: Dorian Dumez, Christian Tilk, Stefan Irnich, Fabien Lehuédé, Katharina Olkis, Olivier Péton, Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Modélisation, Optimisation et DEcision pour la Logistique, l'Industrie et les Services (LS2N - équipe MODELIS), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg - Universität Mainz = Johannes Gutenberg University (JGU), This research was supported by the Agence Nationale de la Recherche (ANR) under grant ANR-17-CE22-0015 and Deutsche Forschungsgemeinschaft (DFG) under grant IR 122/8-1., and ANR-17-CE22-0015,OPUSS,Optimisation de systèmes synchromodaux urbains(2017)
Subjects: Information Systems and Management, General Computer Science, Modeling and Simulation, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Management Science and Operations Research, Industrial and Manufacturing Engineering
Abstract: International audience; Last-mile collection and delivery services often rely on multi-echelon logistic systems with many types of practical spatial, temporal, and resource constraints. We consider three extensions of the basic 2-echelon vehicle routing problem that are of practical interest: First, second-echelon vehicles need to simultaneously deliver and collect goods at customers within their specified time window. Second, first-echelon vehicles are allowed to perform multiple trips during the planning horizon. Third, the intermediate facilities, called satellites, allow temporary storage of goods, but the quantity that can be stored at a time is limited. This paper integrates these complicating features in a single mathematical model. To solve the problem, we design a decomposition-based matheuristic. It employs a reduced and refined mixed-integer programming formulation and two echelon-specific large neighborhood searches (LNS) to produce improving routes for the respective echelon. The most important algorithmic component is the feasibility check of LNS that relies on a sequence of constant-time and low-complexity tests. The final test allows rescheduling of the operations taking place at a satellite. It adapts the double-justification algorithm known from the scheduling literature. Extensive computational experiments systematically evaluate the new components of the matheuristic and benchmark it against a recent exact method for a related problem. Moreover, the impact of the main problem features such as the number of satellites and their capacity as well as the integration of forward and reverse flows is analyzed.
Published: 2023

15. Evaluating the scalability of reconfigurable manufacturing systems at the design phase

Author: Audrey Cerqueus, Xavier Delorme, Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Modélisation, Optimisation et DEcision pour la Logistique, l'Industrie et les Services (LS2N - équipe MODELIS), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), Département Génie mathématique et industriel (FAYOL-ENSMSE), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Institut Henri Fayol, Institut Henri Fayol (FAYOL-ENSMSE), École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT), and ANR-21-CE10-0019,RECONFIDURABLE,Conception et pilotage de systèmes de production reconfigurables et durables(2021)
Subjects: Combinatorial analysis, Strategy and Management, Scalability, Line Balancing, [INFO]Computer Science [cs], Multi-objective indicator, Management Science and Operations Research, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Industrial and Manufacturing Engineering, Reconfigurable manufacturing systems
Abstract: International audience; To face market volatility, reconfigurable manufacturing systems (RMS) aim to efficiently and cost-effectively react to changes. We focus on one characteristic of RMS: the scalability (ability to adapt the volume of throughput). In the literature, the only few indicators for scalability are not always formally defined and usually only consider a partial view of scalability. Moreover, most of them are actually more suited for the configuration planning rather than for the design. However, the design of the RMS has a high impact on its scalability. We propose the first combinatorial definition of this problem and a new measure to fully assess the scalability of a system at the design phase. This measure, based on a multi-objective approach, can assess the scalability of single-product manufacturing systems, analysing all configurations that it can implement. We present numerical experiments to compare this indicator with a state-of-the-art scalability indicator and with some classical production line design indicators, and we show that future research should focus on scalability as a specific criterion to optimise during the design of an RMS. In addition, the results obtained allow us to infer some managerial insights on the best levers to use when performing a reconfiguration for scalability purpose.
Published: 2023

16. Differentiated Consistency for Worldwide Gossips

Author: Davide Frey, Achour Mostefaoui, Matthieu Perrin, Pierre-Louis Roman, Francois Taiani, the World Is Distributed Exploring the tension between scale and coordination (WIDE), 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), Gestion de Données Distribuées (LS2N - équipe GDD), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Ecole Polytechnique Fédérale de Lausanne (EPFL), ANR-16-CE25-0005,OBrowser,Applications décentralisées sur navigateurs(2016), and ANR-20-CE25-0002,ByBloS,Au-delà des Blockchains : Modules de construction pour les applications à grande échelle zero-confiance multi-utilisateurs(2020)
Subjects: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Blockchain, Computational Theory and Mathematics, Hardware and Architecture, Signal Processing, Distributed system, Epidemic protocol, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Eventual consistency
Abstract: International audience; Eventual consistency is a consistency model that favors liveness over safety. It is often used in large-scale distributed systems where models ensuring a stronger safety incur performance that are too low to be deemed practical. Eventual consistency tends to be uniformly applied within a system, but we argue a demand exists for differentiated eventual consistency, e.g. in blockchain systems.We propose UPS to address this demand. UPS is a novel consistency mechanism that works in pair with our novel two-phase epidemic broadcast protocol GPS to offer differentiated eventual consistency and delivery speed. We propose two complementary analyses of the broadcast protocol: a continuous analysis and a discrete analysis based on compartmental models used in epidemiology. Additionally, we propose the formal definition of a scalable consistency metric to measure the consistency trade-off at runtime. We evaluate UPS in two simulated worldwide settings: a one-million-node network and a network emulating that of the Ethereum blockchain. In both settings, UPS reduces inconsistencies experienced by a majority of the nodes and reduces the average message latency for the remaining nodes.
Published: 2023

17. A feature-based survey of Fog modeling languages

Author: Abdelghani Alidra, Hugo Bruneliere, Thomas Ledoux, Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Software Stack for Massively Geo-Distributed Infrastructures (STACK), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), NaoMod - Nantes Software Modeling Group (LS2N - équipe NaoMod), Laboratoire des Sciences du Numérique de Nantes (LS2N), Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and ANR-20-CE25-0017,SeMaFoR,Gestion autonome des ressources dans le Fog computing(2020)
Subjects: Computer Networks and Communications, Hardware and Architecture, Internet of Things, Modeling language, Fog Computing, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Cloud Computing, Survey, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Software
Abstract: International audience; Fog Computing is a new paradigm aiming at decentralizing the Cloud by geographically distributing away computation, storage and network resources as well as related services. In order to design, develop, deploy, maintain and evolve Fog systems, languages are required for properly modeling both their entities (e.g., infrastructures, topologies, resources configurations) and their specific features such as the locality concept, QoS constraints applied on resources (e.g., energy, data privacy, latency) and their dependencies, the dynamicity of considered workloads, the heterogeneity of both applications and devices, etc. This paper provides a detailed overview of the current state-of-the-art in terms of Fog modeling languages. We relied on our long-term experience in Cloud Computing and Cloud Modeling to contribute a feature model describing what we believe to be the most important characteristics of Fog modeling languages. We also performed a systematic scientific literature search and selection process to obtain a list of already existing Fog modeling languages. Then, we evaluated and compared these Fog modeling languages according to the characteristics expressed in our feature model. As a result, we discuss in this paper the main capabilities of these Fog modeling languages and propose a corresponding set of open research challenges in this area. We expect the presented work to be helpful to both current and future researchers or engineers working on/with Fog systems, as well as to anybody genuinely interested in Fog Computing or more generally in distributed systems.
Published: 2023

18. Cosserat Rod Modeling of Continuum Robots from Newtonian and Lagrangian Perspectives

Author: Matthias Tummers, Vincent Lebastard, Frédéric Boyer, Jocelyne Troccaz, Benoît Rosa, M. Taha Chikhaoui, Gestes Medico-chirurgicaux Assistés par Ordinateur (TIMC-GMCAO), Translational Innovation in Medicine and Complexity / Recherche Translationnelle et Innovation en Médecine et Complexité - UMR 5525 (TIMC ), VetAgro Sup - Institut national d'enseignement supérieur et de recherche en alimentation, santé animale, sciences agronomiques et de l'environnement (VAS)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-VetAgro Sup - Institut national d'enseignement supérieur et de recherche en alimentation, santé animale, sciences agronomiques et de l'environnement (VAS)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Robotique Et Vivant (LS2N - équipe ReV), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS), ANR-11-LABX-0004,CAMI,Gestes Médico-Chirurgicaux Assistés par Ordinateur(2011), ANR-19-P3IA-0003,MIAI,MIAI @ Grenoble Alpes(2019), ANR-20-CE33-0001,COSSEROOTS,Théorie Cosserat pour les robots élancés contrôlés en déformation(2020), ANR-10-IAHU-0002,MIX-Surg,Institut de Chirurgie Mini-Invasive guidée par l'Image(2010), and ANR-18-CE19-0012,MACROS,Robots continus multi-actionnés pour la chirugie mini-invasive(2018)
Subjects: Cosserat Beams, Flexible Robots, Control and Systems Engineering, Control, Tendon/Wire Mechanism, Modeling, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], Electrical and Electronic Engineering, Learning for Soft Robots, Computer Science Applications
Abstract: International audience; Cosserat rod theory proved efficient modeling performances in robotics, especially in the context of continuum robots, in the past decade. The implementation of such theory is far from being unique and straightforward. We consider the illustrative example of multi-segment, general routing tendon actuated continuum robots in their nominal static operating regime. This paper details two main approaches based on Cosserat rod modeling, namely the Newtonian and Lagrangian approaches. We provide a walk-through guide regarding theoretical derivations and numerical implementation of both approaches, together with a proof of equivalence. This comparative study is supplemented with novel contributions and extensions of each approach and in-depth discussion of their performances and applicability, as well as highlighting their special features.
Published: 2023

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

Author: Laurent Lefèvre, Alexandre da Silva Veith, Marcos Dias De Assuncao, Department of Computer Science [University of Toronto] (DCS), University of Toronto, Ecole de Technologie Supérieure [Montréal] (ETS), Algorithms and Software Architectures for Distributed and HPC Platforms (AVALON), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Laboratoire de l'Informatique du Parallélisme (LIP), and Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Computer Networks and Communications, business.industry, Data stream mining, Computer science, 020206 networking & telecommunications, Cloud computing, 02 engineering and technology, Computer Science Applications, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Hardware and Architecture, Scalability, 0202 electrical engineering, electronic engineering, information engineering, Overhead (computing), 020201 artificial intelligence & image processing, The Internet, Enhanced Data Rates for GSM Evolution, Latency (engineering), business, Software, Edge computing, Information Systems, Computer network
Abstract: International audience; Internet of Things (IoT) applications often require the processing of data streams generated by devices dispersed over a large geographical area. Traditionally, these data streams are forwarded to a distant cloud for processing, thus resulting in high application end-to-end latency. Recent work explores the combination of resources located in clouds and at the edges of the Internet, called cloud-edge infrastructure, for deploying Data Stream Processing (DSP) applications. Most previous work, however, fails to scale to very large IoT settings. This paper introduces deployment strategies for the placement of DSP applications on to cloud-edge infrastructure. The strategies split an application graph into regions and consider regions with stringent time requirements for edge placement. The proposed Aggregate End-to-End Latency Strategy with Region Patterns and Latency Awareness (AELS+RP+LA) decreases the number of evaluated resources when computing an operator’s placement by considering the communication overhead across computing resources. Simulation results show that, unlike the state-of-the-art, AELS+RP+LA scales to environments with more than 100k resources with negligible impact on the application end-to-end latency.
Published: 2023

20. The Dial-a-Ride Problem with School Bell Time Adjustment

Author: Samuel Vercraene, Fabien Lehuédé, Thibaud Monteiro, Olivier Péton, Décision et Information pour les Systèmes de Production (DISP), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université Lumière - Lyon 2 (UL2), Institut National des Sciences Appliquées (INSA)-Université de Lyon, Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Systèmes Logistiques et de Production (SLP ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université Lumière - Lyon 2 (UL2)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), Modélisation, Optimisation et DEcision pour la Logistique, l'Industrie et les Services (LS2N - équipe MODELIS), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), IMT Atlantique (IMT Atlantique), and Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)
Subjects: healthcare logistics, large neighborhood search, paratransit, matheuristic, [INFO]Computer Science [cs], Transportation, school bell time adjustment, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], vehicle routing, dial-a-ride problem, Civil and Structural Engineering
Abstract: In this paper, we study a paratransit application in which children are transported every day from their homes to their special schools or medical-social establishments. To optimize this transportation system, the establishments collaborate to propose a joint transportation plan. We propose a new algorithm to jointly build vehicle routes that visit several establishments and simultaneously set the establishments’ opening hours. This algorithm combines a large neighborhood search, the resolution of a route-based model, and the progressive shrinkage of the planning window. It is applied to a real case from the area of Lyon in France, including 34 schools and 575 heterogeneous users served by a heterogeneous fleet of reconfigurable vehicles. On average, we show that in addition to the 10% of saving that can be expected by sharing vehicle routes between schools, 7% of additional savings can be achieved by school bell adjustment. This cost saving also decreases average user ride times and the number of vehicles required, creating longer routes that are more attractive for driver services. Funding: This work was supported by the European Union through the European Regional Development Fund [Grant RA0012500] and by the French Région Auvergne-Rhône-Alpes through the NOMAd project. Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2022.1160 .
Published: 2023

21. Talking about moving machines

Author: Pieters, Céline, Damblon, Emmanuelle, Souères, Philippe, Laumond, Jean-Paul, Souères, Philippe, Université libre de Bruxelles (ULB), Équipe Mouvement des Systèmes Anthropomorphes (LAAS-GEPETTO), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Models of visual object recognition and scene understanding (WILLOW), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, and Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Ethics, Linguistics and Language, Rhetoric, Robot autonomy, Communication, Intelligent robots, Language and Linguistics, [SPI.AUTO]Engineering Sciences [physics]/Automatic, [SHS]Humanities and Social Sciences, Human-Computer Interaction, [SPI.AUTO] Engineering Sciences [physics]/Automatic, Animal Science and Zoology, [SHS] Humanities and Social Sciences, Robot motion
Abstract: Globally, robots can be described as some sets of moving parts that are dedicated to a task while using their own energy. Yet, humans commonly qualify those machines as being intelligent, autonomous or being able to learn, know, feel, make decisions, etc. Is it merely a way of talking or does it mean that robots could eventually be more than a complex set of moving parts? On the one hand, the language of robotics allows multiple interpretations (leading sometimes to misreading or confusion in various contexts). On the other hand, the status of robots is challenged more and more by technical achievements and humans’ own empirical beliefs. In this paper, we follow a linguistic approach in order to explore the relevance of these words when talking about robots. Since we note that the words impose themselves (even if opposed), we discuss the efficiency of a rhetorical strategy in order to work with such a lexicon in robotics. More precisely, we explore the argumentative technique of the dissociation of notions through the study of a practical case: the case of robot lawn mowers versus hedgehogs.
Published: 2022

22. Editorial Board contributions celebrating the 60th Anniversary of IJPR: Part 3

Author: Dolgui, Alexandre, Modélisation, Optimisation et DEcision pour la Logistique, l'Industrie et les Services (LS2N - équipe MODELIS), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)
Subjects: [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, Strategy and Management, [INFO]Computer Science [cs], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Management Science and Operations Research, Industrial and Manufacturing Engineering
Abstract: International audience
Published: 2022

23. Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty

Author: Simon Thevenin, Oussama Ben-Ammar, Nadjib Brahimi, Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Modélisation, Optimisation et DEcision pour la Logistique, l'Industrie et les Services (LS2N - équipe MODELIS), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), EuroMov - Digital Health in Motion (Euromov DHM), IMT - MINES ALES (IMT - MINES ALES), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Montpellier (UM), ESC Rennes School of Business, and ESC Rennes School of Business (ESC [Rennes])
Subjects: Information Systems and Management, General Computer Science, Modeling and Simulation, Lot-sizing, Production, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Management Science and Operations Research, Robust optimization, Supplier selection, Purchasing, Lead time Uncertainty, Industrial and Manufacturing Engineering
Abstract: International audience; Supplier reliability is a critical issue for manufacturing companies. Delivery delays from suppliers create backlog and firefighting on the shop floors. To avoid disruption and hedge against supplier lead time uncertainty, companies rely on diversification, multi-sourcing, and safety lead times. In multi-sourcing, the buyer might order the same product (raw material) from different suppliers. The design of a robust and cost-efficient purchasing/ordering plan in multi-sourcing is a complex task which has a strong impact on the performance of the company. In this study, we investigate the use of robust optimization for the integrated lot-sizing and supplier selection problem under lead time uncertainty. More specifically, we use polyhedral budgeted uncertainty sets. The resulting model determines the ideal lot sizes to minimize the total costs taking into consideration suppliers’ reliability and prices. To solve this problem, a row and column generation approach is proposed. To alleviate scalability issues, we enhance the row and column generation through a robust counterpart formulation, and we propose an efficient fix-and-optimize approach. Our extensive computational experiments show that the fix-and-optimize approach yields good quality solutions within a reasonable amount of computational time. We provide insights into supplier diversification based on the risk profile of the decision-maker. One of the conclusions is that an extremely risk-averse decision-maker selects a single supplier, namely the most reliable one even if it does not offer the lowest price.
Published: 2022

24. Ensemble-Based Deep Learning Model for Network Traffic Classification

Author: Ons Aouedi, Kandaraj Piamrat, Benoit Parrein, Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ), Software Stack for Massively Geo-Distributed Infrastructures (STACK), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire des Sciences du Numérique de Nantes (LS2N), Nantes Université (Nantes Univ)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), STR (LS2N - équipe STR ), and Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique)
Subjects: machine learning, Computer Networks and Communications, decision tree, ensemble learning, deep learning, [INFO]Computer Science [cs], Electrical and Electronic Engineering, Blending, traffic classification
Abstract: International audience; Network Traffic Classification enables a number of practical applications ranging from network monitoring to resource management, with security implications as well. Nowadays, traffic classification has become a challenging task in order to distinguish among a variety of applications due to the huge amount of generated traffic. Therefore, developing Machine Learning (ML) models, which can successfully identify network applications, is one of the most important tasks. However, among the ML models applied to network traffic classification so far, no model outperforms all the others. To solve these issues, this paper proposes a novel Deep Learning (DL)-based approach that incorporates multiple Decision Tree based models. This approach employs a non-linear blending ensemble method by combining tree-based classifiers through DL in order to maximize generalization accuracy. This ensemble consists of two levels called base classifiers and meta-classifiers. In the first level, Decision Tree-based models are used as the base classifiers while in the second level, DL is used as a meta-model to combine the outputs of the base classifiers. Using two publicly available datasets, we show that our proposed ensemble is suitable for network traffic classification and outperforms the linear blending (using logistic regression as meta-model) as well as several well-known ML models, which are Support Vector Machine (SVM), Decision Tree (DT), Random Forest (RF), Multi-Layer Perceptron (MLP), AdaBoost, K-Nearest Neighbors (KNN), LightGBM, Catboost, and XGBoost.
Published: 2022

25. A self‐stabilised walking gait for humanoid robots based on the essential model with internal states

Author: Qiuyue Luo, Christine Chevallereau, Yongsheng Ou, Jianxin Pang, Victor De‐León‐Gómez, Yannick Aoustin, Shenzhen Institute of Advanced Technology [Shenzhen] (SIAT), Chinese Academy of Sciences [Beijing] (CAS), Research institute of UBTech Robotics, Shenzhen, Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ), Robotique Et Vivant (LS2N - équipe ReV), Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Research Institute of UBTech Robotics, Shenzen, Universidad Autónoma de Coahuila (UAdeC), Nantes Université - Institut d'Administration des Entreprises - Nantes (Nantes Univ - IAE Nantes), Nantes Université - pôle Sociétés, and Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)
Subjects: Human-Computer Interaction, humanoid and bipedal locomotion, Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Hardware and Architecture, dynamic stability, passive walking, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Information Systems
Abstract: International audience; Walking stability is one of the key issues for humanoid robots. A self-stabilised walking gait for a full dynamic model of humanoid robots is proposed. For simplified models, that is, the linear inverted pendulum model and variable-length inverted pendulum model, self-stabilisation of walking gait can be obtained if virtual constraints are properly defined. This result is extended to the full dynamic model of humanoid robots by using an essential dynamic model, which is developed based on the zero dynamics concept. With the proposed method, a robust stable walking for a humanoid robot is achieved by adjusting the step timing and landing position of the swing foot automatically, following its intrinsic dynamic characteristics. This exempts the robot from the time-consuming high-level control approaches, especially when a full dynamic model is applied. How different walking patterns/features (i.e., the swing foot motion, the vertical centre of mass motion, the switching manifold configuration, etc.) affect the stability of the walking gait is analysed. Simulations are conducted on robots Romeo and TALOS to support the results.
Published: 2022

26. Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution

Author: Simon Thevenin, Yossiri Adulyasak, Jean-François Cordeau, Modélisation, Optimisation et DEcision pour la Logistique, l'Industrie et les Services (LS2N - équipe MODELIS), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), HEC Montréal (HEC Montréal), Groupe d’études et de recherche en analyse des décisions (GERAD), and École Polytechnique de Montréal (EPM)-McGill University = Université McGill [Montréal, Canada]-HEC Montréal (HEC Montréal)-Université du Québec à Montréal = University of Québec in Montréal (UQAM)
Subjects: stochastic dual dynamic programming, Lot sizing, General Engineering, stochastic demand, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], stochastic optimization
Abstract: This work investigates lot sizing with component substitution under demand uncertainty. The integration of component substitution with lot sizing in an uncertain demand context is important because the consolidation of the demand for components naturally allows risk-pooling and reduces operating costs. The considered problem is relevant not only in a production context, but also in the context of distribution planning. We propose a stochastic programming formulation for the static–dynamic type of uncertainty, in which the setup decisions are frozen but the production and consumption quantities are decided dynamically. To tackle the scalability issues commonly encountered in multistage stochastic optimization, this paper investigates the use of stochastic dual dynamic programming (SDDP). In addition, we consider various improvements of SDDP, including the use of strong cuts, the fast generation of cuts by solving the linear relaxation of the problem, and retaining the average demand scenarios. Finally, we propose two heuristics, namely, a hybrid of progressive hedging with SDDP and a heuristic version of SDDP. Computational experiments conducted on well-known instances from the literature show that the heuristic version of SDDP outperforms other methods. The proposed method can plan with up to 10 decision stages and 20 scenarios per stage, which results in 2010 scenario paths in total. Moreover, as the heuristic version of SDDP can replan to account for new information in less than a second, it is convenient in a dynamic context. Summary of Contribution: We believe our paper is suitable for the mission and scope of IJOC because we design efficient algorithms to solve an operations research problem. More precisely, we investigate the use of stochastic dual dynamic programming (SDDP) for lot sizing with component substitution under demand uncertainty. In this work, we consider the static–dynamic decision framework, and a good approximation of the expected costs in this context requires us to solve the problem with a large number of scenarios of future demand. As solving the considered problem is computationally intensive, we investigate the use of SDDP, which decomposes the problem per decision stage. We study several enhancements of SDDP, such as the use of strong cuts, the incorporation of a lower bound computed with the average demand scenario, the multicut version of SDDP, and scenario sampling with randomized quasi–Monte Carlo. Despite these improvements, the convergence of SDDP remains slow. Consequently, we propose a heuristic version of SDDP and a hybrid of progressive hedging and SDDP. We present the results of an extensive computational study performed on well-known instances from the literature. The results show that the heuristic SDDP outperforms the hybrid of progressive hedging with SDDP and state-of-the-art methods from the literature. Besides, our analysis shows that component substitution can pool the risk, and it allows maintaining the same service level with less inventory. The presented methodology can be used by practitioners to size their production lots, and subsequent researchers can build upon our results to consider uncertainty in other parameters, such as lead times, yields, and production capacities. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms – Discrete. Funding: This work was supported by Mitacs and the Institut de Valorisation des Données (IVADO). Supplemental Material: The online supplement is available at https://doi.org/10.1287/ijoc.2022.1215 .
Published: 2022

27. Small perturbations in the type of boundary conditions for an elliptic operator

Author: Bonnetier, Eric, Dapogny, Charles, Vogelius, Michael, Institut Fourier (IF), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), Equations aux Dérivées Partielles (EDP), Laboratoire Jean Kuntzmann (LJK), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Department of Mathematics - Rutgers School of Arts and Sciences, Rutgers, The State University of New Jersey [New Brunswick] (RU), Rutgers University System (Rutgers)-Rutgers University System (Rutgers), ANR-18-CE40-0013,SHAPO,Optimisation de forme(2018), and ANR-17-CE40-0029,MultiOnde,Problèmes Inverses Multi-Onde(2017)
Subjects: Mathematics - Analysis of PDEs, Optimization and Control (math.OC), Applied Mathematics, General Mathematics, FOS: Mathematics, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Mathematics - Optimization and Control, Analysis of PDEs (math.AP)
Abstract: In this article, we study the impact of a change in the type of boundary conditions of an elliptic boundary value problem. In the context of the conductivity equation we consider a reference problem with mixed homogeneous Dirichlet and Neumann boundary conditions. Two different perturbed versions of this ``background'' situation are investigated, when (i) The homogeneous Neumann boundary condition is replaced by a homogeneous Dirichlet boundary condition on a ``small'' subset $\omega_\varepsilon$ of the Neumann boundary; and when (ii) The homogeneous Dirichlet boundary condition is replaced by a homogeneous Neumann boundary condition on a ``small'' subset $\omega_\varepsilon $ of the Dirichlet boundary. The relevant quantity that measures the ``smallness'' of the subset $\omega_\varepsilon $ differs in the two cases: while it is the harmonic capacity of $\omega_\varepsilon $ in the former case, we introduce a notion of ``Neumann capacity'' to handle the latter. In the first part of this work we derive representation formulas that catch the structure of the first non trivial term in the asymptotic expansion of the voltage potential, for a general $\omega_\varepsilon $, under the sole assumption that it is ``small'' in the appropriate sense. In the second part, we explicitly calculate the first non trivial term in the asymptotic expansion of the voltage potential, in the particular geometric situation where the subset $\omega_\varepsilon $ is a vanishing surfacic ball.
Published: 2022

28. Mechatronic design of dynamically decoupled manipulators based on the control performance improvement

Author: Yaodong Lu, Yannick Aoustin, Vigen Arakelian, Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ), Robots and Machines for Manufacturing, Society and Services (LS2N - équipe RoMas), Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and Robotique Et Vivant (LS2N - équipe ReV)
Subjects: Control and Optimization, Control and Systems Engineering, General Mathematics, Mechanical Engineering, Modeling and Simulation, Software, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Computer Science Applications
Abstract: The control of industrial robot manipulators presents a difficult problem for control engineers due to the complexity of their nonlinear dynamics models. Nonlinear controls based on feedback linearization are developed to meet control requirements. Model-based nonlinear control is highly sensitive to parameter errors and leads to problems of robustness for tracking trajectories at high speeds, and there is the additional problem of a heavy computational burden to consider in the design of nonlinear controllers. In this paper, a mechatronic design approach is proposed, which aims to facilitate controller design by redesigning the mechanical structure. The problem is approached in two steps: first, the dynamic decoupling conditions of manipulators are described and discussed, involving redistribution of the moving mass, which leads to the decoupling of motion equations. A classical linear control law is then used to track the desired efficient bang-bang profile trajectory. Then, in the presence of parameter uncertainty and external disturbances, the nonlinear controls with simple structures are adopted to stabilize the decoupled system asymptotically. An analysis of the results from a simulation of this approach demonstrates its effectiveness in controller design. The proposed improvement in control performance is illustrated via two spatial manipulators.
Published: 2022

29. A Model-Driven Methodology to Accelerate Software Engineering in the Internet of Things

Author: Imad Berrouyne, Mehdi Adda, Jean-Marie Mottu, Massimo Tisi, Interdisciplinary Centre for Security, Reliability and Trust [Luxembourg] (SnT), Université du Luxembourg (Uni.lu), Université du Québec à Rimouski (UQAR), Institut Universitaire de Technologie - Nantes (Nantes Univ - IUT Nantes), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), NaoMod - Nantes Software Modeling Group (LS2N - équipe NaoMod), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and Nantes Université (Nantes Univ)
Subjects: Policy Enforcement, Model Transformation, Computer Networks and Communications, Internet of Things, Software Engineering, Model-Driven Engineering, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Code Generation, Computer Science Applications, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Hardware and Architecture, Signal Processing, Information Systems
Abstract: International audience; The Internet of Things (IoT) aims for connecting Anything, Anywhere, Anytime (AAA). This assumption brings about several software engineering challenges that constitute a serious obstacle to its wider adoption. The main feature of the Internet of Things (IoT) is genericity w.r.t the variability of software and hardware technologies. Model-Driven Engineering (MDE) is a paradigm that advocates using models to address software engineering problems. It can help to meet the genericity of the IoT from a software engineering perspective. Existing MDE approaches for the IoT focus only on modeling the internal behavior of things but lack a comprehensive approach dedicated to network modeling. In the present paper, we introduce a network-oriented methodology based on MDE to unify the IoT's heterogeneous concepts. Fundamentally, we avoid the intrinsic heterogeneity of the IoT by separating the network's specification (i.e., the things, the communication scheme, and its constraints) from its concrete implementation (i.e., the low-level artifacts such as source code and documentation). Technically, the methodology relies on a model-based Domain-Specific Language (DSL) and a code generator. The former enables the modeling of the network's specification, and the latter provides a procedure to generate the low-level artifacts from this specification. Our results show that this methodology makes IoT's software engineering more rigorous, helps prevent bugs earlier, and saves time.
Published: 2022

30. The impacts of digital technologies on coping with the COVID-19 pandemic in the manufacturing industry: a systematic literature review

Author: Marco Ardolino, Andrea Bacchetti, Alexandre Dolgui, Guglielmo Franchini, Dmitry Ivanov, Anand Nair, Università degli Studi di Brescia = University of Brescia (UniBs), University of Brescia, Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Modélisation, Optimisation et DEcision pour la Logistique, l'Industrie et les Services (LS2N - équipe MODELIS), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Berlin School of Economics and Law, Michigan State University [East Lansing], and Michigan State University System
Subjects: [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, Strategy and Management, [INFO]Computer Science [cs], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Management Science and Operations Research, Industrial and Manufacturing Engineering
Abstract: International audience; The COVID-19 pandemic’s impacts have been devastating for the global economy, and particularly for manufacturing companies. Many firms were unprepared for a crisis of this magnitude and adapted their operations in an ad-hoc manner. Some of these adaptations were facilitated by digital technologies (DTs). This article examines extant literature using a systematic review methodology in order to extend our understanding of what DTs have been used in manufacturing companies during the pandemic, how DTs have helped manufacturing companies cope with the pandemic, and how these innovations can be used in the post-pandemic world. The major outcome of our study is a novel classification of DT applications in the pandemic setting in the manufacturing industry. In addition, we propose an agenda for future research.
Published: 2022

31. Analysis of Human Whole-Body Joint Torques During Overhead Work With a Passive Exoskeleton

Author: Claudia Latella, Yeshasvi Tirupachuri, Luca Tagliapietra, Lorenzo Rapetti, Benjamin Schirrmeister, Jonas Bornmann, Dasa Gorjan, Jernej Camernik, Pauline Maurice, Lars Fritzsche, Jose Gonzalez-Vargas, Serena Ivaldi, Jan Babic, Francesco Nori, Daniele Pucci, Istituto Italiano di Tecnologia (IIT), Ottobock SE & Co. KGaA, JSI (JSI Ljubljana), Lifelong Autonomy and interaction skills for Robots in a Sensing ENvironment (LARSEN), 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), imk automotive GmbH, European Project: 731540,H2020,An.Dy(2017), 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: Computer Networks and Communications, Human Factors and Ergonomics, Computer Science Applications, body regions, Human-Computer Interaction, upper-limb exoskeleton, floating-base estimation, Artificial Intelligence, Control and Systems Engineering, overhead work analysis, Signal Processing, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], Human whole-body joint torque, human activities
Abstract: International audience; Overhead work is classified as one of the major risk factors for the onset of shoulder work-related musculoskeletal disorders (WMSDs) and muscle fatigue. Upper-limb exoskeletons can be used to assist workers during the execution of industrial overhead tasks to prevent such disorders. Twelve novice participants have been equipped with inertial and force/torque sensors to simultaneously estimate the whole-body kinematics and the joint torques (i.e., internal articular stress) by means of a probabilistic estimator while performing an overhead taskwith a pointing tool. An evaluation has been performed to analyze the effect at the whole-body level by considering the conditions of wearing and not-wearing PAEXO, a passive exoskeleton for upper-limb support during overhead work. Results point out that PAEXO provides a reduction of the whole-body joint effort across the experimental task blocks (from 66% to 86%). Moreover, the analysis along with 5 different body areas shows that i) the exoskeleton provides support at the human shoulders by reducing the joint effort at the targeted limbs and ii) that part of theinternal wrenches is intuitively transferred from the upper body to the thighs and legs, which is shown with an increment of the torques at the legs joints. The promising outcomes show that the probabilistic estimation algorithm can be used as a validation metric to quantitatively assess PAEXO performances, paving thus the way for the next challenging milestone, such as the optimization of the human joint torques via adaptive exoskeleton control.
Published: 2022

32. Transparency Analysis of a Passive Heavy Load Comanipulation Arm

Author: Thomas Muller, Kevin Subrin, Denis Joncheray, Alain Billon, Sebastien Garnier, NEODITECH, Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ), Robots and Machines for Manufacturing, Society and Services (LS2N - équipe RoMas), Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and École Centrale de Nantes (Nantes Univ - ECN)
Subjects: Human-Computer Interaction, [SPI]Engineering Sciences [physics], Artificial Intelligence, Computer Networks and Communications, Control and Systems Engineering, Signal Processing, Human Factors and Ergonomics, Computer Science Applications
Abstract: International audience
Published: 2022

33. Classifying and explaining defects with small data for the semiconductor industry

Author: Boulanger, Jean-François, Corset, Franck, Iutzeler, Franck, Lelong, Jérôme, Unity SC, Applied Statistics And Reliability - ASAR (ASAR), Laboratoire Jean Kuntzmann (LJK), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), and Données, Apprentissage et Optimisation (DAO)
Subjects: [STAT.AP]Statistics [stat]/Applications [stat.AP], [STAT.ML]Statistics [stat]/Machine Learning [stat.ML]
Abstract: International audience; In this work, we present an automatic classifier of wafer defects for the semiconductor industry. Hopefully defects are rare, but this puts the classifying problem in a small data context. We propose a fast and fully reproducible approach based on decision trees. The main interest of using decision trees lies in obtaining a highly explicable classifier, which makes the origin of the defect easy to identify.
Published: 2022

34. A skill- and feature-based approach to planning process monitoring in assembly planning

Author: Clemens Gonnermann, S. Ehsan Hashemi-Petroodi, Simon Thevenin, Alexandre Dolgui, Rüdiger Daub, Technische Universität Munchen - Université Technique de Munich [Munich, Allemagne] (TUM), Modélisation, Optimisation et DEcision pour la Logistique, l'Industrie et les Services (LS2N - équipe MODELIS), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)
Subjects: assembly, [SPI.OTHER]Engineering Sciences [physics]/Other, skill-based approach, Mechanical Engineering, reconfigurable manufacturing system, Industrial and Manufacturing Engineering, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Computer Science Applications, feature recognition, Control and Systems Engineering, CAD analysis, optimization, Decision support system, Software
Abstract: Frequent changes in customer needs and large product variety are forcing manufacturing companies to move from mass production to mass customization. Customized production can be achieved by introducing reconfigurable production systems (RMS). The customized flexibility and several characteristics of RMSs provide many opportunities in terms of process and production planning. However, those characteristics greatly increase the complexity of the design and planning of production systems. This paper presents a decision support system relying on a skill-based approach to design a reconfigurable assembly line considering the planning of assembly processes and monitoring. The proposed decision aid system is modular in design and is composed of four modules. The main input data is a CAD model of a new product variant for the identification of the assembly and monitoring requirements. Besides, a current assembly system layout with its resource descriptions exists. In the first developed module, assembly-by-disassembly and a skill-based approach are used to generate different assembly plans. In the second module, feature recognition and skill-based approaches generate process monitoring alternatives. The third module uses a linear program (LP) that aims to minimize the total cost of workstation activation and reconfiguration, as well as cycle time, and to maximize the process quality of the assembly tasks. A user-based generative model design approach is applied to optimize the values of three objective functions. In the fourth and final module, a simulation of the optimized assembly plan allows either the validation of the assembly plan and process monitoring plan or initiates a new iteration due to their infeasibility. To further demonstrate how the proposed methodology works, some computational experiments are provided for two use cases.
Published: 2022

35. Stability factor for robust balancing of simple assembly lines under uncertainty

Author: Evgeny Gurevsky, Andry Rasamimanana, Aleksandr Pirogov, Alexandre Dolgui, André Rossi, Modélisation, Optimisation et DEcision pour la Logistique, l'Industrie et les Services (LS2N - équipe MODELIS), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Applied Mathematics, Discrete Mathematics and Combinatorics, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], ComputingMilieux_MISCELLANEOUS
Abstract: International audience; This paper deals with an optimization problem, which arises when a new simple assembly line has to be designed subject to a fixed number of available workstations, cycle time constraint, and precedence relations between necessary assembly tasks. The studied problem consists in assigning a given set of tasks to workstations so as to find the most robust line configuration, which can withstand processing time uncertainty as much as possible. The line robustness is measured by a new indicator, called stability factor. In this work, the studied problem is proven to be strongly NP-hard, upper bounds are proposed, and the relation of the stability factor with another robustness indicator, known as stability radius, is investigated. A mixed-integer linear program (MILP) is proposed for maximizing the stability factor in the general case, and an alternative formulation is also derived when uncertainty originates in workstations only. Computational results are reported on a collection of instances derived from classic benchmark data used in the literature for the Simple Assembly Line Balancing Problem (SALBP).
Published: 2022

36. A Review of Core Operational Business-IT Alignment

Author: Andre, Pascal, Tamzalit, Dalila, Benjilany, Ali, Bruneliere, Hugo, Vérification pour l'Environnement et le LOgiciel (LS2N - équipe VELO), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), NaoMod - Nantes Software Modeling Group (LS2N - équipe NaoMod), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)
Subjects: Business Process Modelling, [INFO]Computer Science [cs], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Software Application Modelling, Enterprise Architecture, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Information Systems, Core Operational Business-IT Alignment
Abstract: International audience; In terms of competitiveness, Business-IT Alignment (BITA) is still a crucial challenge for business leaders and CIOs, especially in the context of Digital Transformation and time-to-market challenges. Core Operational BITA can be seen as a projection of BITA to the Enterprise Information System perimeter, i.e., the operational alignment between the business processes and supporting IT. It is a major source of issues (e.g., strong couplings, maintenance costs, technical debt, slow adaptation). These cause a misalignment and thus contribute to the well-known Business-IT Gap. In this paper, we review the current state of this operational alignment in the context of Enterprise Architecture (EA) i.e. between the Business Process layer and the Application layer. Our analysis focuses on the models used at the Business Process and Application layers, the existing or potential links between these layers, and the use of these links to carry out a core operational alignment and facilitate the detection of potential divergence points. As a result, we notably outline some current limitations, such as modelling disparities, misuse of links between the two layers and an under-coverage of real alignment processes. We also discuss some lessons learned and future challenges, mainly around modelling needs and consistency management between the two considered layers.
Published: 2023

37. Confidential Truth Finding with Multi-Party Computation

Author: Saadeh, Angelo, Senellart, Pierre, Bressan, Stéphane, Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, CNRS@CREATE Ltd., Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Value from Data (VALDA ), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), 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.), Image & Pervasive Access Lab (IPAL), National University of Singapore (NUS)-Agency for science, technology and research [Singapore] (A*STAR)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Institute for Infocomm Research - I²R [Singapore], School of computing [Singapore] (NUS), and National University of Singapore (NUS)
Subjects: Secret-sharing, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Uncertain data, Privacy, Truth finding, Secure multi-party computation
Abstract: International audience; Federated knowledge discovery and data mining are challenged to assess the trustworthiness of data originating from autonomous sources while protecting confidentiality and privacy. Truth-finding algorithms help corroborate data from disagreeing sources. For each query it receives, a truth-finding algorithm predicts a truth value of the answer, possibly updating the trustworthiness factor of each source. Few works, however, address the issues of confidentiality and privacy. We devise and present a secure secret-sharing-based multi-party computation protocol for pseudo-equality tests that are used in truth-finding algorithms to compute additions depending on a condition. The protocol guarantees confidentiality of the data and privacy of the sources. We also present a variants of a truth-finding algorithm that would make the computation faster when executed using secure multi-party computation. We empirically evaluate the performance of the proposed protocol on a state-of-the-art truth-finding algorithm, 3-Estimates, and compare it with that of the baseline plain algorithm. The results confirm that the secret-sharing-based secure multi-party algorithms are as accurate as the corresponding baselines but for proposed numerical approximations that significantly reduce the efficiency loss incurred.
Published: 2023

38. Implicit Differentiation for Hyperparameter Tuning the Weighted Graphical Lasso

Author: Pouliquen, Can, Gonçalves, Paulo, Massias, Mathurin, Vayer, Titouan, Optimisation, Connaissances pHysiques, Algorithmes et Modèles (OCKHAM), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut Rhône-Alpin des systèmes complexes (IXXI), École normale supérieure de Lyon (ENS de Lyon)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire de Droit des Affaires et Nouvelles Technologies (DANTE), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), ANR-19-CHIA-0009,AllegroAssai,Algorithmes, Approximations, Parcimonie et Plongements pour l'IA(2019), Dynamic Networks : Temporal and Structural Capture Approach (DANTE), 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), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Institut Rhône-Alpin des systèmes complexes (IXXI), and Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)
Subjects: FOS: Computer and information sciences, Optimization, Computer Science - Machine Learning, Implicit differentiation, Machine Learning (stat.ML), Hyperparameter Selection, Machine Learning (cs.LG), Graphical Lasso, Optimization and Control (math.OC), Statistics - Machine Learning, FOS: Mathematics, [INFO]Computer Science [cs], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Mathematics - Optimization and Control
Abstract: International audience; We provide a framework and algorithm for tuning the hyperparameters of the Graphical Lasso via a bilevel optimizationproblem solved with a first-order method. In particular, we derive the Jacobian of the Graphical Lasso solution with respect to itsregularization hyperparameters.
Published: 2023

39. Learning a Riemannian manifold for the analysis-synthesis of nonstationary sounds

Author: Han, Han, Lostanlen, Vincent, Lagrange, Mathieu, Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ), Signal, IMage et Son (LS2N - équipe SIMS ), and Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique)
Subjects: [SPI.ACOU]Engineering Sciences [physics]/Acoustics [physics.class-ph], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-SD]Computer Science [cs]/Sound [cs.SD]
Abstract: International audience; Computer sound matching poses an inverse problem, namely, the identification of resynthesis parameters. Borrowing from the differentiable digital signal processing (DDSP) framework, we propose to automate its resolution by training a deep neural network. In this context, we aim to reach a compromise between the computational efficiency of parametric loss (P-loss) versus the psychoacoustical fidelity of spectral loss. Our approach, named ``perceptual--neural--physical'' (PNP), estimates the Riemannian metric which is associated to the composition between parametric synthesis and time--frequency scattering. By doing so, we locally linearize spectral loss and accelerate convergence. Furthermore, resorting to Tikhonov regularization improves the conditioning of the inverse problem. On an analysis--synthesis task for musical arpeggios, PNP training outperforms state-of-the-art methods P-loss (wav2shape) and STFT-based DDSP, as measured in terms of JTFS-based similarity between reference signal and reconstructed signal.; La transformation de sons par ordinateur pose un problème inverse d'identification des paramètres de resynthèse adéquats. Empruntant au formalisme du traitement du signal différentiable (DDSP), nous proposons d'automatiser sa résolution par entrainement d'un réseau de neurones profond. Dans ce contexte, nous visons un compromis entre l'efficacité computationnelle de la perte paramétrique et la fidélité psychoacoustique de la perte spectrale. Notre approche, baptisée perceptuelle-neuronalephysique (PNP), consiste à estimer la métrique riemannienne associée à la composition entre synthèse paramétrique et diffusion temps-fréquence (JTFS). Ce faisant, nous linéarisons localement la perte spectrale et accélérons la convergence. De plus, le recours à une régularisation de Tikhonov améliore le conditionnement du problème inverse. Par rapport à l'état de l'art (wav2shape et DDSP), et pour une tâche difficile d'analyse-synthèse d'arpège musical, l'entrainement via PNP rapproche le signal reconstruit du signal de référence, d'après une mesure de similarité de timbre fondée sur la JTFS.
Published: 2023

40. Incremental Constrained Clustering by Minimal Weighted Modification

Author: Beauchamp, Aymeric, Dao, Thi-Bich-Hanh, Loudni, Samir, Vrain, Christel, Laboratoire d'Informatique Fondamentale d'Orléans (LIFO), Université d'Orléans (UO)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), Théorie, Algorithmes et Systèmes en Contraintes (LS2N - équipe TASC ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Groupe de Recherche en Informatique, Image et Instrumentation de Caen (GREYC), Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Normandie Université (NU)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS), Andre Augusto Cire, and Roland H. C. Yap
Subjects: Constrained clustering, Constraint programming, Incremental Clustering, Semi-supervised Clustering, User feedback, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract: International audience; Clustering is a well-known task in Machine Learning that aims at grouping instances according to their similarity. It is unsupervised and therefore difficult to tune without human input. In constrained clustering, subject matter experts (SME) can incorporate knowledge through constraints in the clustering algorithm. Involving an expert results in an incremental process where expert constraints are added on the fly, iteratively.Although satisfying the constraints is crucial, successive partitions should look alike to avoid disturbing the expert. In this paper, we present an incremental constrained clustering framework integrating active query strategies and a constraint programming model to fit the expert's expectations while preserving cluster structure, so that the user can understand the process and apprehend its impact. Our model supports instance and group-level constraints, which can be relaxed. Experiments on reference datasets and a case study related to the analysis of satellite image time series show the relevance of our framework.
Published: 2023

41. Automatically Inferring the Document Class of a Scientific Article

Author: Gauquier, Antoine, Senellart, Pierre, Value from Data (VALDA ), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Ecole nationale supérieure Mines-Télécom Lille Douai (IMT Nord Europe), Institut Mines-Télécom [Paris] (IMT), Télécom Paris, 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.), and ANR-19-P3IA-0001,PRAIRIE,PaRis Artificial Intelligence Research InstitutE(2019)
Subjects: Document class, Information extraction, Image classification, [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], Information systems, Scholarly articles, PDF
Abstract: International audience; We consider the problem of automatically inferring the (LaTeX) document class used to write a scientific article from its PDF representation. Applications include improving the performance of information extraction techniques that rely on the style used in each document class, or determining the publisher of a given scientific article. We introduce two approaches: a simple classifier based on hand-coded document style features, as well as a CNN-based classifier taking as input the bitmap representation of the first page of the PDF article. We experiment on a dataset of around 100k articles from arXiv, where labels come from the source LaTeX document associated to each article. Results show the CNN approach significantly outperforms that based on simple document style features, reaching over 90% average F1-score on a task to distinguish among several dozens of the most common document classes.
Published: 2023

42. Hector: A Framework to Design and Evaluate Scheduling Strategies in Persistent Key-Value Stores

Author: Canon, Louis-Claude, Dugois, Anthony, Marchal, Loris, Rivière, Etienne, Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC), Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC), École normale supérieure de Lyon (ENS de Lyon), Optimisation des ressources : modèles, algorithmes et ordonnancement (ROMA), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Institute of Information and Communication Technologies, Electronics and Applied Mathematics (ICTEAM), and Université Catholique de Louvain = Catholic University of Louvain (UCL)
Subjects: [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Scheduling, Performance, Key-Value Stores, Replica, Modularity, [INFO]Computer Science [cs]
Abstract: International audience; Key-value stores distribute data across several storage nodes to handle large amounts of parallel requests. Proper scheduling of these requests impacts the quality of service, as measured by achievable throughput and (tail) latencies. In addition to scheduling, performance heavily depends on the nature of the workload and the deployment environment. It is, unfortunately, difficult to evaluate different scheduling strategies consistently under the same operational conditions. Moreover, such strategies are often hard-coded in the system, limiting flexibility. We present Hector, a modular framework for implementing and evaluating scheduling policies in Apache Cassandra. Hector enables users to select among several options for key components of the scheduling workflow, from the request propagation via replica selection to the local ordering of incoming requests at a storage node. We demonstrate the capabilities of Hector by comparing strategies in various settings. For example, we find that leveraging cache locality effects may be of particular interest: we propose a new replica selection strategy, called Popularity-Aware, that can support 6 times the maximum throughput of the default algorithm under specific key access patterns. We also show that local scheduling policies have a significant effect when parallelism at each storage node is limited.
Published: 2023

43. Investigating Dependency Graph Discovery Impact on Task-based MPI+OpenMP Applications Performances

Author: Pereira, Romain, Roussel, Adrien, Carribault, Patrick, Gautier, Thierry, DAM Île-de-France (DAM/DIF), Direction des Applications Militaires (DAM), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Algorithms and Software Architectures for Distributed and HPC Platforms (AVALON), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire en Informatique Haute Performance pour le Calcul et la simulation (LIHPC), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction des Applications Militaires (DAM), and Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay
Subjects: HPC, Task, Dependency, OpenMP, MPI, [INFO]Computer Science [cs], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Graph
Abstract: International audience; The architecture of supercomputers is evolving to expose massive parallelism. MPI and OpenMP are widely used in application codes on the largest supercomputers in the world. The community primarily focused on composing MPI with OpenMP before its version 3.0 introduced task-based programming. Recent advances in OpenMP task model and its interoperability with MPI enabled fine model composition and seamless support for asynchrony. Yet, OpenMP tasking overheads limit the gain of task-based applications over their historical loop parallelization (parallel for construct).This paper identifies the OpenMP task dependency graph discovery speed as a limiting factor in the performance of task-based applications.We study its impact on intra and inter-node performances over two benchmarks (Cholesky, HPCG) and a proxy-application (LULESH). We evaluate the performance impacts of several discovery optimizations, and introduce a persistent task dependency graph reducing overheads by a factor upto 15 at run-time. We measure 2x speedup over parallel for versions weak scaled to 16K cores, due to improved cache memory use and communication overlap, enabled by task refinement and depth-first scheduling.
Published: 2023

44. A review of reference architectures for digital manufacturing: Classification, applicability and open issues

Author: Jan Kaiser, Duncan McFarlane, Gregory Hawkridge, Pascal André, Paulo Leitão, Institute for Manufacturing Cambridge University Engineering Department, Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ), Vérification pour l'Environnement et le LOgiciel (LS2N - équipe VELO), Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Polytechnic Institute of Bragança (IPB), Kaiser, J [0000-0002-7264-5065], and Apollo - University of Cambridge Repository
Subjects: Applicability, Internet of things, General Computer Science, Industry 4, Cyber–physical systems, Digital manufacturing, Cyber-physical systems, General Engineering, Reference architecture, [INFO]Computer Science [cs], Industry 4.0, [SPI.AUTO]Engineering Sciences [physics]/Automatic
Abstract: The industrial application of digital technologies in manufacturing can result in an increased efficiency of processes and an opportunity to integrate production, logistics and maintenance functions. However, increasingly interconnected manufacturing information means progressively more complex systems. Therefore, there is an ever growing need to provide structure in the design and development of such information systems which is the role of a system architecture. So called ‘reference architectures’ guide the design of system architectures used in particular applications. Reference architectures are models of information functions and their connections that provide a structured template with common terminology. Over the last decades, various reference architectures relevant to digital systems in manufacturing have been proposed. However, industrial applications of these reference architectures are scarce and it is difficult to compare and analyse them due to their various levels of application and different uses. In this study, we review and classify reference architectures used to support digital systems in manufacturing. Contributions of the paper include proposing criteria for a model to be referred to as a ‘reference architecture’, an overview and classification of the different perspectives on reference architectures in the literature, and a guideline to support practitioners, developers and academics in selecting a reference architecture.
Published: 2023

45. Optimization of Preventive Replacements Dates and Covariate Inspections for Repairable Systems in Varying Environments

Author: Léa Brenière, Laurent Doyen, Christophe Bérenguer, Applied Statistics And Reliability - ASAR (ASAR), Laboratoire Jean Kuntzmann (LJK), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), GIPSA - Safe, Controlled and Monitored Systems (GIPSA-SAFE), GIPSA Pôle Automatique et Diagnostic (GIPSA-PAD), Grenoble Images Parole Signal Automatique (GIPSA-lab), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Grenoble Images Parole Signal Automatique (GIPSA-lab), ANR-11-LABX-0025,PERSYVAL-lab,Systemes et Algorithmes Pervasifs au confluent des mondes physique et numérique(2011), ANR-10-EQPX-0029,EQUIP@MESO,Equipement d'excellence de calcul intensif de Mesocentres coordonnés - Tremplin vers le calcul petaflopique et l'exascale(2010), and ANR-15-IDEX-0002,UGA,IDEX UGA(2015)
Subjects: [STAT.AP]Statistics [stat]/Applications [stat.AP], Information Systems and Management, General Computer Science, Imperfect maintenance, Modeling and Simulation, Virtual age model, Dynamic covariate, Condition-based maintenance, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Management Science and Operations Research, Reliability, Industrial and Manufacturing Engineering, [SPI.AUTO]Engineering Sciences [physics]/Automatic
Abstract: International audience; This study investigates the issue of optimal preventive replacement scheduling for a repairable system, considering its failure/repair history and its environment or degradation, as characterised by covariates. The proposed approach is developed within a recurrent event modelling framework, in which the failure behaviour of the system is defined by its failure intensity, and perfect preventive replacements and imperfect corrective repairs are integrated following a virtual age assumption. The observed heterogeneity between systems is integrated through covariates by following a proportional hazard assumption. These covariates are assumed to be either fixed and represent, for example, the manufacturer origin, or to be dynamic and represent the monitored degradation process. The contributions of this study are twofold. First, a dynamic condition-based preventive replacement policy is developed. The maintenance decision rule integrates the available information on both the corrective repair history and covariate behaviour to determine the optimal preventive replacement time. This policy extends the state-of-the-art model of Gilardoni et al. (2016), which considers only the corrective repair history without integrating covariates. Second, the results of this study demonstrate how different levels of knowledge and information regarding the covariates can be integrated into the maintenance decision and lead to different optimal replacement times that are associated with different cost performances of the preventive replacement policy. This performance evaluation enables the optimisation of the monitoring policy and inspection frequency of the covariates. The proposed approach, which follows steps of increasing complexity, is developed and investigated first on static and then on dynamic covariates, considering minimal and imperfect repairs.
Published: 2023

46. An EWMA sign chart for dispersion with exact run length properties

Author: Theodoros Perdikis, Stelios Psarakis, Philippe Castagliola, Vicent Giner-Bosch, Petros E. Maravelakis, Athanasios C. Rakitzis, Department of statistics, AUEB, Athens University of Economics and Business (AUEB), Conception, Pilotage, Surveillance et Supervision des systèmes (LS2N - équipe CPS3), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), Universitat Politècnica de València (UPV), and University of Piraeus
Subjects: Statistics and Probability, [STAT]Statistics [stat], Sign statistic, variability, Applied Mathematics, Modeling and Simulation, Markov chain, distribution-free Sign statistic Markov chain EWMA control chart variability, EWMA control chart, Statistics, Probability and Uncertainty, distribution-free
Abstract: The EWMA Sign control chart is a distribution-free scheme used for monitoring shifts in the location parameter during process monitoring. In this work, we propose a modified Phase II EWMA chart based on a general Sign statistic, capable of monitoring shifts in the process variability. Regarding the determination of the proposed chart's in-and out-of-control Run Length properties, Markov chain methods are used in combination with a continuous transformation of the suggested general Sign statistic. Our results show the power of the proposed method regarding the proposed chart's exact Run Length properties and its efficiency in detecting shifts in the process variability.
Published: 2023

47. Towards a correctly-rounded and fast power function in binary64 arithmetic

Author: Hubrecht, Tom, Jeannerod, Claude-Pierre, Zimmermann, Paul, Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Arithmétiques des ordinateurs, méthodes formelles, génération de code (ARIC), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), 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), 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: efficiency, IEEE 754, IEEE 754 double precision binary64 format power function correct rounding efficiency, double precision, power function, [INFO]Computer Science [cs], correct rounding, binary64 format
Abstract: This is the extended version of an article published in the proceedings of ARITH 2023.; We design algorithms for the correct rounding of the power function x y in the binary64 IEEE 754 format, for all rounding modes, modulo the knowledge of hardest-to-round cases. Our implementation of these algorithms largely outperforms previous correctly-rounded implementations and is not far from the efficiency of current mathematical libraries, which are not correctly-rounded. Still, we expect our algorithms can be further improved for speed. The proofs of correctness are fully detailed, with the goal to enable a formal proof of these algorithms. We hope this work will motivate the next IEEE 754 revision committee to require correct rounding for mathematical functions.
Published: 2023

48. Algebraic Recognition of Regular Functions

Author: Bojańczyk, Mikołaj, Nguyễn, Lê Thành Dũng (Tito), Faculty of Mathematics, Informatics, and Mechanics [Warsaw] (MIMUW), University of Warsaw (UW), Preuves et Langages (PLUME), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Kousha Etessami, Uriel Feige, Gabriele Puppis, and ANR-10-LABX-0070,MILYON,Community of mathematics and fundamental computer science in Lyon(2010)
Subjects: category theory, [INFO]Computer Science [cs], Theory of computation → Transducers, string transducers, semigroups
Abstract: We consider regular string-to-string functions, i.e. functions that are recognized by copyless streaming string transducers, or any of their equivalent models, such as deterministic two-way automata. We give yet another characterization, which is very succinct: finiteness-preserving functors from the category of semigroups to itself, together with a certain output function that is a natural transformation., LIPIcs, Vol. 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), pages 117:1-117:19
Published: 2023

49. The Role of Global and Local Context in Named Entity Recognition

Author: Amalvy, Arthur, Labatut, Vincent, Dufour, Richard, Laboratoire Informatique d'Avignon (LIA), Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI, Traitement Automatique du Langage Naturel (LS2N - équipe TALN ), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), and Association for Computational Linguistics
Subjects: FOS: Computer and information sciences, Computer Science - Computation and Language, Computation and Language (cs.CL), [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract: Pre-trained transformer-based models have recently shown great performance when applied to Named Entity Recognition (NER). As the complexity of their self-attention mechanism prevents them from processing long documents at once, these models are usually applied in a sequential fashion. Such an approach unfortunately only incorporates local context and prevents leveraging global document context in long documents such as novels, which might hinder performance. In this article, we explore the impact of global document context, and its relationships with local context. We find that correctly retrieving global document context has a greater impact on performance than only leveraging local context, prompting for further research on how to better retrieve that context., Accepted to ACL2023
Published: 2023

50. Mail sorting optimization: a case study of the French postal company La Poste

Author: Amann, Emmanuelle, Gurevsky, Evgeny, Laurent, Arnaud, Mebarki, Nasser, Conception, Pilotage, Surveillance et Supervision des systèmes (LS2N - équipe CPS3), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-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)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), and Modélisation, Optimisation et DEcision pour la Logistique, l'Industrie et les Services (LS2N - équipe MODELIS)
Subjects: [INFO]Computer Science [cs]
Abstract: International audience
Published: 2023

Catalog

Books, media, physical & digital resources

See catalog results

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

Publication Type

Journal

Database

Publisher

23,919 results on '"Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources