Author: "École normale supérieure - Cachan (ENS Cachan)" / Topic: computer science - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"École normale supérieure - Cachan (ENS Cachan)"' showing total 1,455 results

Start Over Author "École normale supérieure - Cachan (ENS Cachan)" Topic computer science

1,455 results on '"École normale supérieure - Cachan (ENS Cachan)"'

1. No coordination required for resources allocation during colony fission in a social insect? An individual-based model reproduces empirical patterns

Author: Thibaud Monnin, François Lavallée, Guillaume Chérel, Institut des Systèmes Complexes - Paris Ile-de-France (ISC-PIF), Université Paris 1 Panthéon-Sorbonne (UP1)-Sorbonne Université (SU)-Institut Curie [Paris]-École polytechnique (X)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Université Clermont Auvergne, INRAe, UR LISC, Centre de Clermont-Ferrand, 63178 Aubière, France, École normale supérieure - Cachan (ENS Cachan)-Université Paris 1 Panthéon-Sorbonne (UP1)-Université Paris-Sud - Paris 11 (UP11)-Université Pierre et Marie Curie - Paris 6 (UPMC)-École polytechnique (X)-Institut Curie [Paris]-Centre National de la Recherche Scientifique (CNRS), Institut d'écologie et des sciences de l'environnement de Paris (iEES Paris), Institut National de la Recherche Agronomique (INRA)-Sorbonne Université (SU)-Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Cachan (ENS Cachan)-Université Paris 1 Panthéon-Sorbonne (UP1)-École polytechnique (X)-Institut Curie [Paris]-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'ingénierie pour les systèmes complexes (UR LISC), Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Centre National de la Recherche Scientifique (CNRS)-Institut Curie [Paris]-Sorbonne Université (SU)-École polytechnique (X)-École normale supérieure - Cachan (ENS Cachan)-Université Paris 1 Panthéon-Sorbonne (UP1), École normale supérieure - Cachan (ENS Cachan)-Université Paris 1 Panthéon-Sorbonne (UP1)-Université Paris-Sud - Paris 11 (UP11)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Institut Curie [Paris]-École polytechnique (X), Institut d'écologie et des sciences de l'environnement de Paris (iEES Paris ), and Institut de Recherche pour le Développement (IRD)-Sorbonne Université (SU)-Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)
Subjects: 0106 biological sciences, Insecta, Computer science, NetLogo, Process (engineering), Behavioural sciences, Experimental and Cognitive Psychology, ants, 010603 evolutionary biology, 01 natural sciences, decision making, Resource Allocation, Task (project management), Microeconomics, 03 medical and health sciences, Animals, OpenMole, Social Behavior, Ecology, Evolution, Behavior and Systematics, 030304 developmental biology, computer.programming_language, 0303 health sciences, model calibration, Ant colony, Cataglyphis piliscapa, Resource allocation, Nesting (computing), [SDE.BE]Environmental Sciences/Biodiversity and Ecology, Relocation, computer
Abstract: International audience; Social insects are classic examples of cooperation and coordination. For instance, laboratory studies of colony relocation, or house-hunting, have investigated how workers coordinate their efforts to swiftly move the colony to the best nesting site available while preserving colony integrity, i.e. avoiding a split. However, several studies have shown that, in some other contexts, individuals may use private rather than social information and may act solitarily rather than in a coordinated way. Here, we study resource allocation by a mature ant colony when it reproduces by fissioning into several colonies. This is a very different task than house-hunting in that colony fission seeks the split of the colony. We develop a simple individual-based model to test if colony fission and resource allocation may be carried out by workers acting solitarily with no coordination. Our model reproduces well the pattern of allocation observed in nature (number and size of new colonies). This does not show that workers do not communicate nor coordinate. Rather, it suggests that independent decision making may be an important component of the process of resource allocation.
Published: 2021

2. Beyond 2014

Author: Sophie Pinchinat, Wojciech Wideł, Barbara Fila, Maxime Audinot, Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA), Logic and Applications (LogicA), École normale supérieure - Cachan (ENS Cachan)-Université de Rennes (UR)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), 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)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-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)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-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)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-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)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), EMbedded SEcurity and Cryptography (EMSEC), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES), École normale supérieure - Cachan (ENS Cachan)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)
Subjects: Model checking, Structure (mathematical logic), Focus (computing), Interpretation (logic), General Computer Science, Computer science, Process (engineering), Attack tree, 0102 computer and information sciences, 02 engineering and technology, Formal methods, 01 natural sciences, Data science, Theoretical Computer Science, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Quantitative analysis (finance), 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, ComputingMilieux_MISCELLANEOUS
Abstract: Attack trees are a well established and commonly used framework for security modeling. They provide a readable and structured representation of possible attacks against a system to protect. Their hierarchical structure reveals common features of the attacks and enables quantitative evaluation of security, thus highlighting the most severe vulnerabilities to focus on while implementing countermeasures. Since in real-life studies attack trees have a large number of nodes, their manual creation is a tedious and error-prone process, and their analysis is a computationally challenging task. During the last half decade, the attack tree community witnessed a growing interest in employing formal methods to deal with the aforementioned difficulties. We survey recent advances in graphical security modeling with focus on the application of formal methods to the interpretation, (semi-)automated creation, and quantitative analysis of attack trees and their extensions. We provide a unified description of existing frameworks, compare their features, and outline interesting open questions.
Published: 2019

3. A computational framework for brittle crack-propagation based on efficient virtual element method

Author: Olivier Allix, Pierre-Alain Guidault, Blaž Hudobivnik, Fadi Aldakheel, Peter Wriggers, Ali Hussein, Institute of Continuum Mechanics, Leibniz Universität Hannover [Hannover] (LUH), Laboratoire de Mécanique et Technologie (LMT), École normale supérieure - Cachan (ENS Cachan)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), and École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Work (thermodynamics), Discretization, Computer science, Applied Mathematics, General Engineering, Fracture mechanics, 02 engineering and technology, 01 natural sciences, Computer Graphics and Computer-Aided Design, Finite element method, Expression (mathematics), Computational science, 010101 applied mathematics, [SPI]Engineering Sciences [physics], 020303 mechanical engineering & transports, 0203 mechanical engineering, Polygon mesh, Minification, [MATH]Mathematics [math], 0101 mathematics, ComputingMilieux_MISCELLANEOUS, Analysis, Energy (signal processing)
Abstract: An efficient low order virtual element method (VEM) for crack-propagation in elastic solids at small strains is outlined within this work. The recently developed VEM is a competitive discretization scheme for meshes with highly irregular shaped elements and arbitrary number of nodes. The formulation in this contribution is based on minimization of an energy expression with stabilization techniques for brittle fracture in 2D problems. Novel aspect here is the development of robust cutting techniques through elements for crack propagation in two-dimensional solids using VEM. The performance of the formulation is underlined by means of representative examples.
Published: 2019

4. Wide baseline pose estimation from video with a density-based uncertainty model

Author: Nicola Pellicanò, Emanuel Aldea, Sylvie Le Hégarat-Mascle, Méthodes et Outils pour les Signaux et Systèmes (SATIE-MOSS), Systèmes d'Information et d'Analyse Multi-Echelles (SIAME), Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS), and Université Paris-Sud - Paris 11 (UP11)
Subjects: Mean squared error, Computer science, business.industry, Mode (statistics), [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], 020206 networking & telecommunications, 02 engineering and technology, Computer Science Applications, Hardware and Architecture, Approximation error, Pattern recognition (psychology), Convergence (routing), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Computer vision, Computer Vision and Pattern Recognition, Artificial intelligence, Smart camera, Baseline (configuration management), business, Pose, Software
Abstract: International audience; Robust wide baseline pose estimation is an essential step in the deployment of smart camera networks. In this work, we highlight some current limitations of conventional strategies for relative pose estimation in difficult urban scenes. Then, we propose a solution which relies on an adaptive search of corresponding interest points in synchronized video streams which allows us to converge robustly toward a high-quality solution. The core idea of our algorithm is to build across the image space a nonstationary mapping of the local pose estimation uncertainty, based on the spatial distribution of interest points. Subsequently, the mapping guides the selection of new observations from the video stream in order to prioritize the coverage of areas of high uncertainty. With an additional step in the initial stage, the proposed algorithm may also be used for refining an existing pose estimation based on the video data; this mode allows for performing a data-driven self-calibration task for stereo rigs for which accuracy is critical, such as onboard medical or vehicular systems. We validate our method on three different datasets which cover typical scenarios in pose estimation. The results show a fast and robust convergence of the solution, with a significant improvement, compared to single image-based alternatives, of the RMSE of ground-truth matches, and of the maximum absolute error.
Published: 2019

5. A parallel non-invasive mixed domain decomposition - Implementation and applications to mechanical assemblies

Author: Paul Oumaziz, Pierre Gosselet, Stéphane Guinard, Pierre-Alain Boucard, Laboratoire de Mécanique et Technologie (LMT), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Cachan (ENS Cachan)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Airbus Group Innovations, and Airbus Groups Innovations
Subjects: Finite element software, Computer science, Applied Mathematics, Computation, Non invasive, General Engineering, Domain decomposition methods, 010103 numerical & computational mathematics, 01 natural sciences, Computer Graphics and Computer-Aided Design, Finite element method, Computational science, 010101 applied mathematics, [SPI.MECA.STRU]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Structural mechanics [physics.class-ph], 0101 mathematics, Analysis
Abstract: International audience; This paper proposes to confront a mixed domain decomposition method with industrial computations, in particular the simulation of quasi-static assemblies with frictional contact between the parts. The method is implemented in a non-invasive manner around an industrial finite element software. The performance of the algorithm is studied on industrial assemblies.
Published: 2019

6. Inertial Alternating Generalized Forward–Backward Splitting for Image Colorization

Author: Fabien Pierre, Mila Nikolova, Pauline Tan, Centre de Mathématiques et de Leurs Applications (CMLA), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), 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), Augmentation visuelle d'environnements complexes (MAGRIT-POST), 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), 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), Projet soutenu par l'attribution d'une allocation de recherche Région Ile-de-France (DIM Math Innov), MAGRIT, ANR-14-CE27-0019,MIRIAM,Restauration Multi-Images: des Mathématiques Appliqueés à l'Industrie de l'Imagerie.(2014), Centre de Mathématiques et de Leurs Applications ( CMLA ), École normale supérieure - Cachan ( ENS Cachan ) -Centre National de la Recherche Scientifique ( CNRS ), Laboratoire Lorrain de Recherche en Informatique et ses Applications ( LORIA ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Université de Lorraine ( UL ) -Centre National de la Recherche Scientifique ( CNRS ), Visual Augmentation of Complex Environments ( MAGRIT ), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Laboratoire Lorrain de Recherche en Informatique et ses Applications ( LORIA ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Université Henri Poincaré - Nancy 1 ( UHP ) -Université Nancy 2-Institut National Polytechnique de Lorraine ( INPL ) -Centre National de la Recherche Scientifique ( CNRS ) -Université Henri Poincaré - Nancy 1 ( UHP ) -Université Nancy 2-Institut National Polytechnique de Lorraine ( INPL ) -Centre National de la Recherche Scientifique ( CNRS ), ANR-14-CE27-0019,MIRIAM,Restauration Multi-Images: des Mathématiques Appliqueés à l'Industrie de l'Imagerie. ( 2014 ), 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)-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: [ MATH.MATH-OC ] Mathematics [math]/Optimization and Control [math.OC], Statistics and Probability, Inertial frame of reference, Accelerated methods, Computer science, Generalization, 02 engineering and technology, Bregman divergence, Separable space, Acceleration, [ INFO.INFO-TI ] Computer Science [cs]/Image Processing, Convergence (routing), Biconvex nonsmooth optimization, 0202 electrical engineering, electronic engineering, information engineering, Block (data storage), Coupling, Alternating minimizations, Image colorization, Applied Mathematics, Condensed Matter Physics, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], Modeling and Simulation, 020201 artificial intelligence & image processing, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Geometry and Topology, Computer Vision and Pattern Recognition, Algorithm
Abstract: International audience; In this paper, we propose a novel accelerated alternating optimization scheme to solve block-biconvex nonsmooth problems whose objectives can be split into smooth (separable) regularizers and simple coupling terms. The proposed method performs a Bregman distance based generalization of the well-known forward-backward splitting for each block, along with an inertial strategy which aims at getting empirical acceleration. We discuss the theoretical convergence of the proposed scheme and provide numerical experiments on image colorization.
Published: 2019

7. Integrated training in using different Coordinate Measuring Systems to support Digital Manufacturing

Author: Enrico Savio, Nabil Anwer, Michael Marxer, Marco Menoncin, Universita degli Studi di Padova, Interstate University of Applied Sciences Buchs NTB, Laboratoire Universitaire de Recherche en Production Automatisée (LURPA), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11), and Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Cachan (ENS Cachan)
Subjects: Reverse engineering, 0209 industrial biotechnology, Training in industry, Coordinate Metrology, Blended Learning, Computer science, Supply chain, Automotive industry, 02 engineering and technology, computer.software_genre, Industrial and Manufacturing Engineering, [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, 0203 mechanical engineering, Artificial Intelligence, [INFO]Computer Science [cs], [MATH]Mathematics [math], Competence (human resources), ComputingMilieux_MISCELLANEOUS, Digitization, business.industry, System of measurement, Manufacturing engineering, Blended learning, 020303 mechanical engineering & transports, Digital manufacturing, business, computer
Abstract: Highly qualified labour force is a key resource for growth. In modern manufacturing, the competent use of advanced measuring equipment for inspection and digitization of parts is an essential competence that is needed for both advanced product/process engineering and quality control. Coordinate Metrology (including 3D digital measuring technologies) is by far the most important tool for these specialized activities. As widely reported, the individuals operating the measuring systems - with their decisions - are frequently one of the most relevant error sources in Coordinate Metrology operations, especially when dealing with new measuring technologies supporting Digital Manufacturing (e.g. Computed Tomography, Fringe-projection, Reverse Engineering). The paper reports the intermediate results of an initiative aiming at innovating training in Coordinate Metrology, focused on supporting the needs of SMEs in the supply chain of the automotive industry. The main target group are industry employees operating in SMEs that are newcomers on 3D measuring technologies. An integrated concept for training in Coordinate Metrology has been developed using a blended learning approach, based on a 10-steps structure and incorporating the learning outcomes required to operate different measuring systems in a consistent way.
Published: 2019

8. Geometric deviation modeling with Statistical Shape Analysis in Design for Additive Manufacturing

Author: Nabil Anwer, Zuowei Zhu, Luc Mathieu, Laboratoire Universitaire de Recherche en Production Automatisée (LURPA), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11), and Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Cachan (ENS Cachan)
Subjects: 0209 industrial biotechnology, Computer science, Statistical shape analysis, Design for additive manufacturing, Process (computing), 02 engineering and technology, 010501 environmental sciences, Geometric consistency, 01 natural sciences, Compensation (engineering), [SPI]Engineering Sciences [physics], symbols.namesake, 020901 industrial engineering & automation, Geometric design, symbols, General Earth and Planetary Sciences, [INFO]Computer Science [cs], [MATH]Mathematics [math], Surface deformation, Gaussian process, Algorithm, ComputingMilieux_MISCELLANEOUS, ComputingMethodologies_COMPUTERGRAPHICS, 0105 earth and related environmental sciences, General Environmental Science
Abstract: Effective modeling of geometric deviations is an important issue in Design for Additive Manufacturing (DfAM), since it enables the evaluation of geometric consistency and the optimization of geometric design. Motivated by the awareness that process-related factors have non-trivial effects on geometric deviations, a new method is proposed in this paper which combines Statistical Shape Analysis with Gaussian Process to enable the modeling of deviations with consideration of process parameters. By learning from a number of simulated samples, the method could achieve effective prediction of deviations for new parts. Its applications in surface deformation evaluation and geometric compensation are also discussed, which will bring substantial benefits to DfAM.
Published: 2019

9. Design of an ultra-high precision machine for form measurement

Author: Mohamed Damak, Saint-Clair Toguem, Hichem Nouira, Alain Vissiere, Nabil Anwer, Charyar Mehdi-Souzani, Laboratoire Universitaire de Recherche en Production Automatisée (LURPA), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11), Laboratoire commun de métrologie LNE-CNAM (LCM), Laboratoire National de Métrologie et d'Essais [Trappes] (LNE )-Conservatoire National des Arts et Métiers [CNAM] (CNAM), Chercheur indépendant, and Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Cachan (ENS Cachan)
Subjects: 0209 industrial biotechnology, Similarity (geometry), Computer science, Assembly, 02 engineering and technology, 010501 environmental sciences, 01 natural sciences, Personalization, [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, Family identification, Production (economics), [INFO]Computer Science [cs], Product (category theory), [MATH]Mathematics [math], Architecture, 0105 earth and related environmental sciences, General Environmental Science, business.industry, Industrial engineering, Design method, Variety (cybernetics), General Earth and Planetary Sciences, Graph (abstract data type), business, Agile software development
Abstract: International audience; In today's business environment, the trend towards more product variety and customization is unbroken. Due to this development, the need of agile and reconfigurable production systems emerged to cope with various products and product families. To design and optimize production systems as well as to choose the optimal product matches, product analysis methods are needed. Indeed, most of the known methods aim to analyze a product or one product family on the physical level. Different product families, however, may differ largely in terms of the number and nature of components. This fact impedes an efficient comparison and choice of appropriate product family combinations for the production system. A new methodology is proposed to analyze existing products in view of their functional and physical architecture. The aim is to cluster these products in new assembly oriented product families for the optimization of existing assembly lines and the creation of future reconfigurable assembly systems. Based on Datum Flow Chain, the physical structure of the products is analyzed. Functional subassemblies are identified, and a functional analysis is performed. Moreover, a hybrid functional and physical architecture graph (HyFPAG) is the output which depicts the similarity between product families by providing design support to both, production system planners and product designers. An illustrative example of a nail-clipper is used to explain the proposed methodology. An industrial case study on two product families of steering columns of thyssenkrupp Presta France is then carried out to give a first industrial evaluation of the proposed approach.
Published: 2019

10. Anti-alignments—Measuring the precision of process models and event logs

Author: Mathilde Boltenhagen, Josep Carmona, Thomas Chatain, Modeling and Exploitation of Interaction and Concurrency (MEXICO), 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), Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), 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), Centre National de la Recherche Scientifique (CNRS), Universitat Politècnica de Catalunya [Barcelona] (UPC), Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Universitat Politècnica de Catalunya. Departament de Ciències de la Computació, and Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
Subjects: FOS: Computer and information sciences, Process modeling, Relation (database), Computer Science - Artificial Intelligence, Anti-alignments, Formal Languages and Automata Theory (cs.FL), Computer science, Process (engineering), Conformance checking, Computer Science - Formal Languages and Automata Theory, 02 engineering and technology, computer.software_genre, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Negocis -- Informàtica -- Models matemàtics, Data mining, ComputingMilieux_MISCELLANEOUS, Event (computing), Contrast (statistics), Business -- Data processing -- Mathematical models, Precision, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Artificial Intelligence (cs.AI), Informàtica::Informàtica teòrica [Àrees temàtiques de la UPC], Hardware and Architecture, Metric (mathematics), 020201 artificial intelligence & image processing, Mineria de dades, computer, Software, Information Systems
Abstract: Processes are a crucial artifact in organizations, since they coordinate the execution of activities so that products and services are provided. The use of models to analyze the underlying processes is a well-known practice. However, due to the complexity and continuous evolution of their processes, organizations need an effective way of analyzing the relation between processes and models. Conformance checking techniques assess the suitability of a process model in representing an underlying process, observed through a collection of real executions. One important metric in conformance checking is to assess the precision of the model with respect to the observed executions, i.e., characterize the ability of the model to produce behavior unrelated to the one observed. In this paper we present the notion of anti-alignment as a concept to help unveiling runs in the model that may deviate significantly from the observed behavior. Using anti-alignments, a new metric for precision is proposed. The proposed anti-alignment based precision metric satisfies most of the required axioms highlighted in a recent publication. Moreover, a complexity analysis of the problem of computing anti-alignments is provided, which sheds light into the practicability of using anti-alignment to estimate precision. Experiments are provided that witness the validity of the concepts introduced in this paper. This work has been partially supported by funds from ENS Paris-Saclay, Spain (project ProMAut of the Farman institute), the Spanish Ministry for Economy and Competitiveness (MINECO) and the European Union (FEDER funds) under grant GRAMM (TIN2017-86727-C2-1-R).
Published: 2021

11. Polynomial interrupt timed automata: Verification and expressiveness

Author: Mathieu Sassolas, Claudine Picaronny, Serge Haddad, M. Safey El Din, Béatrice Bérard, Modélisation et Vérification (MoVe), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Spécification et Vérification (LSV), Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Modeling and Exploitation of Interaction and Concurrency (MEXICO), Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Polynomial Systems (PolSys), Laboratoire d'Algorithmique Complexité et Logique (LACL), and Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12)
Subjects: Model checking, Polynomial, Computer science, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, law.invention, Reachability, law, 0202 electrical engineering, electronic engineering, information engineering, Stopwatch, Discrete mathematics, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], Verification Cylindrical decomposition, Computer Science Applications, Decidability, Automaton, CTL, Computational Theory and Mathematics, 010201 computation theory & mathematics, Timed systems, 020201 artificial intelligence & image processing, Interrupt, Computer Science::Formal Languages and Automata Theory, Information Systems
Abstract: Interrupt Timed Automata ( ITA ) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parameters. They are well suited to model and analyze real-time operating systems. Here we extend ITA with polynomial guards and updates, leading to the class of polynomial ITA ( PolITA ). We prove that reachability is decidable in 2EXPTIME on PolITA , using an adaptation of the cylindrical algebraic decomposition algorithm for the first-order theory of reals. We also obtain decidability for the model checking of a timed version of CTL and for reachability in several extensions of PolITA . In particular, compared to previous approaches, our procedure handles parameters and clocks in a unified way. We also study expressiveness questions for PolITA and show that PolITA are incomparable with stopwatch automata.
Published: 2021

12. Assume-guarantee contracts for continuous-time systems

Author: Antoine Girard, Laurent Fribourg, Adnane Saoud, Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Laboratoire des signaux et systèmes (L2S), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Modeling and Exploitation of Interaction and Concurrency (MEXICO), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), European Project: 725144,H2020 Pilier ERC,PROCSYS(2017), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Laboratoire Spécification et Vérification (LSV), Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), 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), and 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)
Subjects: 030213 general clinical medicine, 0209 industrial biotechnology, Mathematical optimization, Property (philosophy), Semantics (computer science), Computer science, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], small-gain theorem, 02 engineering and technology, Directed acyclic graph, prefix-closed properties, [SPI.AUTO]Engineering Sciences [physics]/Automatic, 03 medical and health sciences, Small-gain theorem, 020901 industrial engineering & automation, 0302 clinical medicine, Differential inclusion, Control and Systems Engineering, Simple (abstract algebra), Component (UML), Component-based software engineering, Electrical and Electronic Engineering, component-based design, assume-guarantee contracts
Abstract: International audience; Many techniques for verifying properties of continuous-time systems are limited to systems of moderate size. In this paper, we propose an approach based on assume-guarantee contracts and compositional reasoning for verifying properties of a broad class of continuous-time systems consisting of interconnected components. The notion of assume-guarantee contracts makes it possible to divide responsibilities among the system components: a contract specifies the property that a component must fulfill under some assumptions on the behavior of its environment (i.e. of the other components). We define weak and strong semantics of assume-guarantee contracts. We then establish a certain number of results for compositional reasoning, which allow us to show that a global assume-guarantee contract of the whole system is satisfied when all components satisfy their own contracts. We show that the weak satisfaction of the contract is sufficient to deal with interconnections described by a directed acyclic graph, while strong satisfaction is needed to reason about general interconnections containing cycles. Specific results for systems described by differential inclusions and invariance assume-guarantee contracts are then developed. Finally, we show how the proposed assume-guarantee framework can recast different versions of the small-gain theorem as a particular case. Throughout the paper, the main results are illustrated using simple examples.
Published: 2021

13. Contract-based Design of Symbolic Controllers for Safety in Distributed Multiperiodic Sampled-Data Systems

Author: Antoine Girard, Laurent Fribourg, Adnane Saoud, Laboratoire Spécification et Vérification (LSV), Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Laboratoire des signaux et systèmes (L2S), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Modeling and Exploitation of Interaction and Concurrency (MEXICO), 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 Spécification et Vérification (LSV), Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), European Project: 725144,H2020 Pilier ERC,PROCSYS(2017), Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Sud - Paris 11 (UP11), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Distributed control, 0209 industrial biotechnology, Class (computer programming), Safety specifications, Computer science, business.industry, Component-based design, Control engineering, 02 engineering and technology, Computer Science Applications, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Nonlinear system, 020901 industrial engineering & automation, Control and Systems Engineering, Control theory, Component (UML), Multiperiodic sampling, Assume-guarantee contracts, Component-based software engineering, State (computer science), Electrical and Electronic Engineering, Symbolic control, business, Abstraction, Building automation
Abstract: International audience; This paper presents a symbolic control approach to the design of distributed safety controllers for a class of continuous-time nonlinear systems. More precisely, we consider systems made of components where each component is equipped with a sampled-data controller with its own sampling period, resulting globally in a distributed multiperiodic sampled-data system. Moreover, controllers receive partial information on the state of the other components. We propose a component-based approach to controller synthesis, which relies on the use of abstractions and continuous-time assume-guarantee contracts. The abstractions describe the dynamics of the system from the point of view of each component based on the information structure, while assume-guarantee contracts specify guarantees that a component must satisfy if assumptions on the other components are met. We show that our approach makes it possible to decompose a global safety control problem into local ones that can be solved independently. We then show how symbolic control techniques can be used to synthesize controllers that enforce the local control objectives. Illustrative applications in building automation and vehicle platooning are shown.
Published: 2021

14. Efficient Estimation of Kronecker Product of Linear Structured Scatter Matrices under t-distribution

Author: Mohammed Nabil El Korso, Arnaud Breloy, Bruno Meriaux, Chengfang Ren, Philippe Forster, Sondra, CentraleSupélec, Université Paris-Saclay (SONDRA), ONERA-CentraleSupélec-Université Paris-Saclay, Laboratoire Energétique Mécanique Electromagnétisme (LEME), Université Paris Nanterre (UPN), Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY), ANR-17-ASTR-0015,MARGARITA,Nouvelles Techniques Robustes et d'Inférences pour le Radar Adaptatif Moderne(2017), and École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY)
Subjects: Kronecker product, Signal processing, Computer science, Structure (category theory), Convex set, t-distribution, Estimator, 020206 networking & telecommunications, Context (language use), 02 engineering and technology, M-estimators, Matrix (mathematics), symbols.namesake, Scatter matrix, 0202 electrical engineering, electronic engineering, information engineering, symbols, 020201 artificial intelligence & image processing, Structured scatter matrix, Algorithm, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
Abstract: International audience; This paper addresses structured scatter matrix estimation within the non convex set of Kronecker product structure. The latter model usually involves two matrices , which can be themselves linearly constrained, and arises in many applications, such as MIMO communication , MEG/EEG data analysis. Taking this prior knowledge into account generally improves estimation accuracy. In the framework of robust estimation, the t-distribution is particularly suited to model heavy-tailed data. In this context, we introduce an estimator of the scatter matrix, having a Kronecker product structure and potential linear structured factors. In addition, we show that the proposed method yields a consistent and efficient estimate.
Published: 2021

15. Goal-oriented error estimation and adaptivity in MsFEM computations

Author: Ludovic Chamoin, Frédéric Legoll, École normale supérieure - Cachan (ENS Cachan), MATHematics for MatERIALS (MATHERIALS), Centre d'Enseignement et de Recherche en Mathématiques et Calcul Scientifique (CERMICS), École des Ponts ParisTech (ENPC)-École des Ponts ParisTech (ENPC)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Modélisation et expérimentation multi-échelle pour les solides hétérogènes (Multi-échelle), Laboratoire Navier (NAVIER UMR 8205), École des Ponts ParisTech (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-École des Ponts ParisTech (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, The work of Frédéric Legoll is partially supported by ONR under grant N00014-15-1-2777 and by EOARD under grant FA9550-17-1-0294., Laboratoire de Mécanique et Technologie (LMT), École normale supérieure - Cachan (ENS Cachan)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre d'Enseignement et de Recherche en Mathématiques et Calcul Scientifique (CERMICS), and École des Ponts ParisTech (ENPC)-École des Ponts ParisTech (ENPC)
Subjects: Computer science, Computation, Reliability (computer networking), Constitutive equation, Computational Mechanics, Ocean Engineering, Context (language use), 02 engineering and technology, Goal-oriented, MsFEM approach, 01 natural sciences, Multiscale problems, [SPI]Engineering Sciences [physics], 0203 mechanical engineering, FOS: Mathematics, Mathematics - Numerical Analysis, 0101 mathematics, ComputingMilieux_MISCELLANEOUS, 2010 MSC: 35Q74, 65N15, 74S05, Applied Mathematics, Mechanical Engineering, Numerical Analysis (math.NA), Finite element method, 010101 applied mathematics, Computational Mathematics, Adaptivity, 020303 mechanical engineering & transports, A posteriori error estimation, Computational Theory and Mathematics, Norm (mathematics), A priori and a posteriori, Algorithm, Energy (signal processing), [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
Abstract: International audience; We introduce a goal-oriented strategy for multiscale computations performed using the Multiscale Finite Element Method (MsFEM). In a previous work, we have shown how to use, in the MsFEM framework, the concept of Constitutive Relation Error (CRE) to obtain a guaranteed and fully computable a posteriori error estimate in the energy norm (as well as error indicators on various error sources). Here, the CRE concept is coupled with the solution of an adjoint problem to control the error and drive an adaptive procedure with respect to a given output of interest. Furthermore, a local and non-intrusive enrichment technique is proposed to enhance the accuracy of error bounds. The overall strategy, which is fully automatic and robust, enables to reach an appropriate trade-off between certified reliability and computational cost in the MsFEM context. The performances of the proposed method are investigated on several illustrative numerical test cases. In particular, the error estimation is observed to be very accurate, yielding a very efficient adaptive procedure.
Published: 2021

16. Non-linear switched model for accurate voltage estimation and power flow analysis of DC railway systems

Author: Bassam Mohamed, Islam El-Sayed, Alain Bouscayrol, Pablo Arboleya, Clement Mayet, Philippe Delarue, Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-Université Gustave Eiffel-CY Cergy Paris Université (CY), Universidad de Oviedo [Oviedo], Laboratoire d’Électrotechnique et d’Électronique de Puissance - ULR 2697 (L2EP), Centrale Lille-Haute Etude d'Ingénieurs-Université de Lille-Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM), École normale supérieure - Cachan (ENS Cachan)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel (UNIV GUSTAVE EIFFEL)-CY Cergy Paris Université (CY), Conservatoire National des Arts et Métiers [CNAM] (CNAM), University of Oviedo, Ecole Centrale de Lille-Haute Etude d'Ingénieurs-Université de Lille-Arts et Métiers Sciences et Technologies, University of Lille, École normale supérieure - Cachan (ENS Cachan)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY), École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-Université Gustave Eiffel-CY Cergy Paris Université (CY), Centrale Lille-Université de Lille-Arts et Métiers Sciences et Technologies, HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-JUNIA (JUNIA), and Université catholique de Lille (UCL)-Université catholique de Lille (UCL)
Subjects: Estimation, Computer science, 020209 energy, Voltage control, 020208 electrical & electronic engineering, [SPI.NRJ]Engineering Sciences [physics]/Electric power, 02 engineering and technology, Modified nodal analysis, Energy conservation, Nonlinear system, [SPI]Engineering Sciences [physics], Control theory, 0202 electrical engineering, electronic engineering, information engineering, Power-flow study, Electrical and Electronic Engineering, ComputingMilieux_MISCELLANEOUS, Voltage
Abstract: International audience
Published: 2020

17. Fast and Efficient Reconstruction of Digitized Frescoes

Author: Emanuel Aldea, Nicolas Lermé, Sylvie Le Hégarat-Mascle, Boyang Zhang, Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY), Méthodes et Outils pour les Signaux et Systèmes (SATIE-MOSS), Systèmes d'Information et d'Analyse Multi-Echelles (SIAME), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY)-École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY)-Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY)-École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY), and Université Paris-Saclay
Subjects: Pixel, Computer science, Orientation (computer vision), Fragment (computer graphics), [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], 02 engineering and technology, 01 natural sciences, Image (mathematics), Set (abstract data type), Artificial Intelligence, 0103 physical sciences, Signal Processing, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Computer Vision and Pattern Recognition, Pattern matching, 010306 general physics, Algorithm, Software, ComputingMilieux_MISCELLANEOUS
Abstract: Virtually recomposing destroyed frescoes is of great importance for heritage conservation. Given a digitized fresco image and a digitized set of fragments, such a problem is challenging due to the potentially large number of fragments, their irregular shape, uniqueness and non-overlapping constraints, the possible absence of fragments and the possible presence of small, homogeneous, eroded and/or spurious fragments. To cope with these specific features, we propose in this paper a fast and efficient non-dense approach benefiting from previous developments in pattern matching. Preliminary experiments led on simulations exhibit a mean accuracy above 90% with a mean translation error of less than 4 pixels and a mean orientation error of about 1 degree. An analysis of fresco and fragment features impacting the algorithm is also provided. Compared to a dense approach and the recent DeepMatch approach, the proposed one remains competitive both in running time and accuracy.
Published: 2020

18. A calculus of expandable stores

Author: Étienne Miquey, Hugo Herbelin, Design, study and implementation of languages for proofs and programs (PI.R2), Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Paris (UP)-Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP), Centre National de la Recherche Scientifique (CNRS), Laboratoire Spécification et Vérification (LSV), Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Deduction modulo, interopérabilité et démonstration automatique (DEDUCTEAM), 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 Spécification et Vérification (LSV), Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), The second author was supported by the Paris Ile-de-France Region, Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Global environment, 050101 languages & linguistics, Evaluation strategy, Computer science, System F, 05 social sciences, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 02 engineering and technology, Data type, Abstract machine, de Bruijn indices, Continuation, Control flow, If and only if, CPS translations, 0202 electrical engineering, electronic engineering, information engineering, Calculus, Lazy evaluation, 020201 artificial intelligence & image processing, 0501 psychology and cognitive sciences, CPS trans- lations, Kripke forcing, Abstract machines
Abstract: LICS 2020 will be held online; International audience; The call-by-need evaluation strategy for the λ-calculus is an evaluation strategy that lazily evaluates arguments only if needed, and if so, shares computations across all places where it is needed. To implement this evaluation strategy, abstract machines require some form of global environment. While abstract machines usually lead to a better understanding of the flow of control during the execution, facilitating in particular the definition of continuation-passing style translations , the case of machines with global environments turns out to be much more subtle. The main purpose of this paper is to understand how to type a continuation-and-environment-passing style translation , that is to say how to soundly translate in continuation-passing style a calculus with global environment. To this end, we introduce Fϒ , a generic calculus to define the target of such translations. In particular, Fϒ features a data type for typed stores and a mechanism of explicit coercions witnessing store extensions along environment-passing style translations. On the logical side, this broadly amounts to a Kripke forcing-like translation mixed with a negative translation (for the continuation-passing part). Since Fϒ allows for the definition of such translations for different source calculi (call-by-need, call-by-name, call-by-value) with different type systems (simple types, system F), we claim that it precisely captures the computational content of continuation-and-environment-passing style translations.
Published: 2020

19. Dynamic Recursive Petri Nets

Author: Serge Haddad, Igor Khmelnitsky, Modeling and Exploitation of Interaction and Concurrency (MEXICO), Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Université Paris-Saclay, 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 Spécification et Vérification (LSV), and Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)
Subjects: 050101 languages & linguistics, Current (mathematics), Theoretical computer science, Computer science, 05 social sciences, Expressiveness, Decidability, 02 engineering and technology, Petri net, Expressive power, Article, Coverability problem, Coverability, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, 0501 psychology and cognitive sciences, [INFO]Computer Science [cs], Recursive Petri nets, Reset (computing)
Abstract: International audience; In the early two-thousands, Recursive Petri nets (RPN) have been introduced in order to model distributed planning of multi-agent systems for which counters and recursivity were necessary. While having a great expressive power, RPN suffer two limitations: (1) they do not include more general features for transitions like reset arcs, transfer arcs, etc. (2) the initial marking associated the recursive "call" only depends on the calling transition and not on the current marking of the caller. Here we introduce Dynamic Recursive Petri nets (DRPN) which address these issues. We show that the standard extensions of Petri nets for which decidability of the coverability problem is preserved are particular cases of DPRN. Then we establish that w.r.t. coverability languages, DRPN are strictly more expressive than RPN. Finally we prove that the coverability problem is still decidable for DRPN.
Published: 2020

20. Linking Focusing and Resolution with Selection

Author: Guillaume Burel, Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE), Deduction modulo, interopérabilité et démonstration automatique (DEDUCTEAM), 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 Spécification et Vérification (LSV), Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Igor Potapov, Paul Spirakis, and James Worrell
Subjects: General Computer Science, Logic, Computer science, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, Modulo, 02 engineering and technology, proof theory, Mathematical proof, 01 natural sciences, refinements of resolution, Theoretical Computer Science, Computer Science::Logic in Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Calculus, Sequent, 0101 mathematics, automated deduction, 060201 languages & linguistics, polarization, 000 Computer science, knowledge, general works, 010102 general mathematics, Sequent calculus, Atomic formula, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, 06 humanities and the arts, 16. Peace & justice, deduction modulo theory, Computational Mathematics, Automated theorem proving, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, sequent calculus, Proof theory, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, 0602 languages and literature, Computer Science, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.4: Mechanical theorem proving, 020201 artificial intelligence & image processing, Rewriting
Abstract: Focusing and selection are techniques that shrink the proof-search space for respectively sequent calculi and resolution. To bring out a link between them, we generalize them both: we introduce a sequent calculus where each occurrence of an atomic formula can have a positive or a negative polarity; and a resolution method where each literal, whatever its sign, can be selected in input clauses. We prove the equivalence between cut-free proofs in this sequent calculus and derivations of the empty clause in that resolution method. Such a generalization is not semi-complete in general, which allows us to consider complete instances that correspond to theories of any logical strength. We present three complete instances: first, our framework allows us to show that ordinary focusing corresponds to hyperresolution and semantic resolution; the second instance is deduction modulo theory and the related framework called superdeduction; and a new setting, not captured by any existing framework, extends deduction modulo theory with rewriting rules having several left-hand sides, which restricts even more the proof-search space.
Published: 2020

21. Multi-robot Path Planning with Boolean Specifications and Collision Avoidance

Author: Cristian Mahulea, Marius Kloetzer, Jean-Jacques Lesage, Aragón Institute of Engineering Research [Zaragoza] (I3A), University of Zaragoza - Universidad de Zaragoza [Zaragoza], 'Gheorghe Asachi' Technical University of Iasi (TUIASI), Laboratoire Universitaire de Recherche en Production Automatisée (LURPA), Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Cachan (ENS Cachan), Lesage, Jean-Jacques, and École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)
Subjects: 0209 industrial biotechnology, Mathematical optimization, multi-robot systems, Computer science, True quantified Boolean formula, 020208 electrical & electronic engineering, Mobile robot, 02 engineering and technology, Petri net, [SPI.AUTO]Engineering Sciences [physics]/Automatic, [SPI.AUTO] Engineering Sciences [physics]/Automatic, 020901 industrial engineering & automation, Control and Systems Engineering, Synchronization (computer science), 0202 electrical engineering, electronic engineering, information engineering, Robot, State (computer science), Motion planning, discrete event systems, Integer programming, path planning
Abstract: International audience; In this paper we consider the path planning problem for a team of identical mobile robots that should fulfill a given global specification. This specification is given as a Boolean formula over some regions of interest and should be satisfied on the final state (when the robots stop) and on the trajectories. The main novelty of this paper is the automatic computation of collision-free trajectories. The approach is based on a Petri net model and on solving two Mixed Integer Linear Programming problems. Based on the solutions of these problems, intermediate synchronization points are introduced in order to avoid possible collisions. Additionally, the algorithm in this paper is implemented in an open-source Matlab toolbox, called RMTool.
Published: 2020

22. Bayesian data assimilation with Transport Map sampling and PGD model order reduction

Author: P-B. Rubio, François Louf, Ludovic Chamoin, Laboratoire de Mécanique et Technologie (LMT), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), and École normale supérieure - Cachan (ENS Cachan)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Model order reduction, History, Computer science, Bayesian probability, Sampling (statistics), 010103 numerical & computational mathematics, 01 natural sciences, Computer Science Applications, Education, 010101 applied mathematics, [SPI]Engineering Sciences [physics], Data assimilation, Statistics, 0101 mathematics, ComputingMilieux_MISCELLANEOUS
Abstract: The motivation of this work is to address real-time sequential inference of parameters with a full Bayesian formulation. The Transport Maps method allows to determine a coupling between a reference density and the posterior density. Here, the contribution is to use the Proper Generalized Decomposition method (PGD) to reduce the evaluation cost of the multi-parametric numerical model and to speed up the minimization algorithm in the Transport Map method by calculating the models derivatives with reference to the parameters in a straightforward manner with non-analytical models. A numerical example highlights the performance of the method.
Published: 2020

23. Co-simulation of an electrical distribution network and its supervision communication network

Author: Benjamin Camus, Anne-Cécile Orgerie, Jean-Baptiste Blanc-Rouchosse, Anne Blavette, Design and Implementation of Autonomous Distributed Systems (MYRIADS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de 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 Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-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), Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY), Systèmes Multi-Agents Coopératifs (IRIT-SMAC), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-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)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), and Université de Toulouse (UT)
Subjects: Interconnection, Distribution networks, Computer science, 020209 energy, Distributed computing, [SPI.NRJ]Engineering Sciences [physics]/Electric power, 020207 software engineering, 02 engineering and technology, Co-simulation, Telecommunications network, Line (electrical engineering), Electric power system, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Smart grid, Software deployment, communication network, 0202 electrical engineering, electronic engineering, information engineering, smart grids, co-simulation, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], ComputingMilieux_MISCELLANEOUS
Abstract: Smart grids require the large-scale deployment of communication means to interconnect the electrical devices and to autonomously pilot their management. Hence, interconnected tools from both the communication and the power system communities are required in order to adequately simulate the mutual dependencies between these two infrastructures. In this paper, we propose an open-source co-simulation framework for evaluating the mutual impacts between an electrical distribution network and its supervision communication network. A case study dealing with line congestion mitigation is presented to illustrate the versatility of our tool.
Published: 2020

24. TRADI: Tracking deep neural network weight distributions

Author: Séverine Dubuisson, Gianni Franchi, Andrei Bursuc, Isabelle Bloch, Emanuel Aldea, Franchi, Gianni, Université Paris-Sud - Paris 11 (UP11), Valeo.ai, VALEO, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Image, Modélisation, Analyse, GEométrie, Synthèse (IMAGES), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Aix Marseille Université (AMU), Département Images, Données, Signal (IDS), Télécom ParisTech, Telecom Paristech, LTCI - Laboratoire Traitement et Communication de l'Information [Paris], Unité d'Informatique et d'Ingénierie des Systèmes (U2IS), École Nationale Supérieure de Techniques Avancées (ENSTA Paris), Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY), Méthodes et Outils pour les Signaux et Systèmes (SATIE-MOSS), Systèmes d'Information et d'Analyse Multi-Echelles (SIAME), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY)-École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY)-Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY)-École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY), Systèmes d'Information et d'Analyse Multi-Echelles (SATIE-SIAME), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY)-École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-CY Cergy Paris Université (CY)-Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), Images et Modèles (I&M), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-Université Gustave Eiffel-CY Cergy Paris Université (CY), and Bloch, Isabelle
Subjects: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Computer science, Initialization, ensembles, 02 engineering and technology, weight distribution, [INFO] Computer Science [cs], 030218 nuclear medicine & medical imaging, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], 03 medical and health sciences, 0302 clinical medicine, [INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Deep neural networks, 0202 electrical engineering, electronic engineering, information engineering, Leverage (statistics), [INFO]Computer Science [cs], uncertainty, ComputingMilieux_MISCELLANEOUS, Artificial neural network, business.industry, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], Pattern recognition, [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], [STAT.ML] Statistics [stat]/Machine Learning [stat.ML], 020201 artificial intelligence & image processing, Artificial intelligence, business, out-of-distribution detection
Abstract: International audience; During training, the weights of a Deep Neural Network (DNN) are optimized from a random initialization towards a nearly optimum value minimizing a loss function. Only this final state of the weights is typically kept for testing, while the wealth of information on the geometry of the weight space, accumulated over the descent towards the minimum is discarded. In this work we propose to make use of this knowledge and leverage it for computing the distributions of the weights of the DNN. This can be further used for estimating the epistemic uncertainty of the DNN by aggregating predictions from an ensemble of networks sampled from these distributions. To this end we introduce a method for tracking the trajectory of the weights during optimization, that does neither require any change in the architecture, nor in the training procedure. We evaluate our method, TRADI, on standard classification and regression benchmarks, and on out-of-distribution detection for classification and semantic segmentation. We achieve competitive results, while preserving computational efficiency in comparison to ensemble approaches.
Published: 2020

25. Nonlinear Current Sheet Model of Electrical Machines

Author: Loic Queval, Li Liu, Jiling Guo, Lionel Vido, Frederic Trillaud, Christophe Berriaud, Bastien Roucaries, Southwest Jiaotong University (SWJTU), Laboratoire Génie électrique et électronique de Paris (GeePs), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU), Instrumentation et Imagerie (SATIE-II), Systèmes d'Information et d'Analyse Multi-Echelles (SIAME), Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS), GIPSA - Cognitive Robotics, Interactive Systems, & Speech Processing (GIPSA-CRISSP), GIPSA Pôle Parole et Cognition (GIPSA-PPC), Grenoble Images Parole Signal Automatique (GIPSA-lab), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Grenoble Alpes (UGA), Universidad Nacional Autónoma de México (UNAM), Institut de Recherches sur les lois Fondamentales de l'Univers (IRFU), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Systèmes d'Information et d'Analyse Multi-Echelles (SATIE-SIAME), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Centre National de la Recherche Scientifique (CNRS)-Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Centre National de la Recherche Scientifique (CNRS), and Universidad Nacional Autónoma de México = National Autonomous University of Mexico (UNAM)
Subjects: 010302 applied physics, Computer science, Stator, Iron, [SPI.NRJ]Engineering Sciences [physics]/Electric power, Computational modeling, 01 natural sciences, Field coil, Wound rotor motor, Electronic, Optical and Magnetic Materials, law.invention, Windings, Nonlinear system, Current sheet, Atmospheric modeling, Mathematical model, law, Electromagnetic coil, Control theory, Harmonics, Rotors, 0103 physical sciences, Magnetomechanical effects, Electrical and Electronic Engineering, Armature (electrical engineering)
Abstract: International audience; An incremental improvement of the classical semi-analytical current sheet model of electrical machines is proposed. First, it provides a better description of the current sheets that allows to consider, at the same time, the rotation of the rotor field winding and the time-dependent stator armature windings currents. This derivation is kept generic and the system to be solved is explicitly written in order to facilitate the implementation. Second, a refined iterative scheme that permits to account effectively for the nonlinearity of iron cores is introduced. It is demonstrated that the nonlinear current sheet model is particularly suitable for slotless wound rotor machines, being able to represent both the space harmonics and the saturation of the machine with a fair accuracy and computing speed compared to the nonlinear finite element model. Index Terms-Electrical machine modeling and simulation, semi-analytical model, subdomain model, current sheet model, nonlinear material, slotless machine, air cored machine.
Published: 2020

26. On-the-fly Bayesian data assimilation using Transport Map sampling and PGD reduced models

Author: Ludovic Chamoin, François Louf, Paul-Baptiste Rubio, Laboratoire de Mécanique et Technologie (LMT), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), and École normale supérieure - Cachan (ENS Cachan)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Markov chain, Computer science, Bayesian probability, Posterior probability, Sampling (statistics), Inference, 010103 numerical & computational mathematics, Bayesian inference, 01 natural sciences, 010101 applied mathematics, [SPI]Engineering Sciences [physics], Data assimilation, 0101 mathematics, Uncertainty quantification, Algorithm, ComputingMilieux_MISCELLANEOUS
Abstract: The motivation of this research work is to address real-time sequential data assimilation and inference of model parameters within a full Bayesian formulation. For that purpose, we couple two advanced numerical approaches. First, the Transport Map sampling is used as an alternative to classical Markov Chain approaches in order to facilitate the sampling of posterior densities resulting from Bayesian inference. It builds a deterministic mapping, obtained from a minimization problem, between the posterior probability measure of interest and a simple reference measure. Second, the Proper Generalized Decomposition (PGD) is implemented in order to reduce the computational effort for the evaluation of the multi-parametric numerical model in the online phase, and therefore for uncertainty quantification on outputs of interest of the model. The PGD also speeds up the minimization algorithm of the Transport Map method, as derivatives with respect to model parameters can then be computed in a straightforward manner. The performance of the approach is illustrated on a fusion welding application.
Published: 2020

27. An Optimization-Based Approach to Discover the Unobservable Behavior of a Discrete-Event System through Interpreted Petri Nets

Author: Gregory Faraut, Jean-Jacques Lesage, Luigi Ferrara, Francesco Basile, Università degli Studi di Salerno (UNISA), Laboratoire Universitaire de Recherche en Production Automatisée (LURPA), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11), Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), and Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Cachan (ENS Cachan)
Subjects: 0209 industrial biotechnology, Computer science, Discrete event systems (DESs), 02 engineering and technology, Unobservable, [SPI.AUTO]Engineering Sciences [physics]/Automatic, 020901 industrial engineering & automation, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], identification, model discovery, Petri nets (PNs), Electrical and Electronic Engineering, Petri Nets, Sequence, Process (computing), Observable, Petri net, Systems modeling, Net (mathematics), Identification (information), Control and Systems Engineering, Discrete Event Systems, Algorithm
Abstract: International audience; This paper deals with the problem of discovering a Petri Net model of a discrete event system, starting from the observation of long event sequences. Precisely, given an Interpreted Petri Net (IPN) system modelling the relations between input and output events of the system (i.e. the reactive/observable behaviour), the internal state evolutions of the system (i.e. the unobservable behaviour) are firstly discovered and then modelled. The proposed unobservable discovery takes advantage of the novel concept of interpreted sequences, which better characterize the system and model the behaviour by considering both observable markings (outputs) and transition firings (in-puts). The unobservable modelling is approached as a net synthesis problem. It relies on an optimization-based procedure that identifies the complementary structure; in particular, places only are added to the original model. Note to Practitioners. Black-box identification procedures process an input/output sequence recorded for a long period of time during the functioning of a closed-loop controlled system, and then return a model of the system. However, even if these models simulate well the recorded sequence, they are not very accurate. Indeed, they simulate also other sequences, that in general are not admitted by the real system. The method proposed here aims to make more accurate these models by discovering the unobservable behaviour of a controlled system, related to evolutions of the internal state (and variables) of the system without changing the capability of simulating the observed behaviour.
Published: 2020

28. A Faithful Binary Circuit Model with Adversarial Noise

Author: Jürgen Maier, Matthias Függer, Ulrich Schmid, Robert Najvirt, Thomas Nowak, Centre National de la Recherche Scientifique (CNRS), Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Modeling and Exploitation of Interaction and Concurrency (MEXICO), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Institute of Computer Engineering [Vienna], Vienna University of Technology (TU Wien), Systèmes parallèles (LRI) (ParSys - LRI), Laboratoire de Recherche en Informatique (LRI), and Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)
Subjects: FOS: Computer and information sciences, B.8.2, B.8.1, Computer science, Generalization, Other Computer Science (cs.OH), [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], 02 engineering and technology, 01 natural sciences, Computer Science - Other Computer Science, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, Involution (philosophy), Formal verification, ModelSim, Digital electronics, 010308 nuclear & particles physics, business.industry, Static timing analysis, Function (mathematics), 020202 computer hardware & architecture, Glitch, Logic gate, business, Algorithm
Abstract: Accurate delay models are important for static and dynamic timing analysis of digital circuits, and mandatory for formal verification. However, F\"ugger et al. [IEEE TC 2016] proved that pure and inertial delays, which are employed for dynamic timing analysis in state-of-the-art tools like ModelSim, NC-Sim and VCS, do not yield faithful digital circuit models. Involution delays, which are based on delay functions that are mathematical involutions depending on the previous-output-to-input time offset, were introduced by F\"ugger et al. [DATE'15] as a faithful alternative (that can easily be used with existing tools). Although involution delays were shown to predict real signal traces reasonably accurately, any model with a deterministic delay function is naturally limited in its modeling power. In this paper, we thus extend the involution model, by adding non-deterministic delay variations (random or even adversarial), and prove analytically that faithfulness is not impaired by this generalization. Albeit the amount of non-determinism must be considerably restricted to ensure this property, the result is surprising: the involution model differs from non-faithful models mainly in handling fast glitch trains, where small delay shifts have large effects. This originally suggested that adding even small variations should break the faithfulness of the model, which turned out not to be the case. Moreover, the results of our simulations also confirm that this generalized involution model has larger modeling power and, hence, applicability., Comment: 9 pages, 9 figures, extended version of a paper which was accepted at DATE'18
Published: 2020
Full Text: View/download PDF

29. Multi-Layer Joint Segmentation Using MRF and Graph Cuts

Author: François Malgouyres, Sylvie Le Hégarat-Mascle, Nicolas Lermé, Marie Lachaize, Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-Université Gustave Eiffel-CY Cergy Paris Université (CY), Institut de Mathématiques de Toulouse UMR5219 (IMT), Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS), Veolia Environnement Research and Innovation, ANR-19-P3IA-0004,ANITI,Artificial and Natural Intelligence Toulouse Institute(2019), École normale supérieure - Rennes (ENS Rennes)-Université Paris-Sud - Paris 11 (UP11)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Université Gustave Eiffel (UNIV GUSTAVE EIFFEL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Rennes (ENS Rennes)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-Université Gustave Eiffel-CY Cergy Paris Université (CY), 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), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR), Centre National de la Recherche Scientifique (CNRS)-PRES Université de Toulouse-Université Toulouse III - Paul Sabatier (UPS), and Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1)
Subjects: Statistics and Probability, Markov random field, business.industry, Computer science, Applied Mathematics, Pattern recognition, 02 engineering and technology, Function (mathematics), Condensed Matter Physics, Real image, Naive Bayes classifier, Cardinality, Robustness (computer science), Modeling and Simulation, Cut, Computer Science::Computer Vision and Pattern Recognition, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Segmentation, Geometry and Topology, Computer Vision and Pattern Recognition, Artificial intelligence, business
Abstract: The problem of jointly segmenting objects, according to a set of labels (of cardinality L), from a set of images (of cardinality K) to produce K individual segmentations plus one joint segmentation, can be cast as a Markov random field model. Coupling terms in the considered energy function enforce the consistency between the individual segmentations and the joint segmentation. However, neither optimality on the minimizer (at least for particular cases), nor the sensitivity of the parameters, nor the robustness of this approach against standard ones has been clearly discussed before. This paper focuses on the case where $$L>1$$ , $$K>1$$ and the segmentation problem is handled using graph cuts. Noticeably, some properties of the considered energy function are demonstrated, such as global optimality when $$L=2$$ and $$K>1$$ , the link with majority voting and the link with naive Bayes segmentation. Experiments on synthetic and real images depict superior segmentation performance and better robustness against noisy observations.
Published: 2020

30. Youla-Kucera adaptive feedback disturbance rejection in the presence of plant uncertainties

Author: Ioan Doré Landau, Bernard Vau, Instrumentation et Imagerie (SATIE-II), Systèmes d'Information et d'Analyse Multi-Echelles (SIAME), Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS), GIPSA - Systèmes linéaires et robustesse (GIPSA-SLR), Département Automatique (GIPSA-DA), Grenoble Images Parole Signal Automatique (GIPSA-lab ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Grenoble Images Parole Signal Automatique (GIPSA-lab ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), and Landau, Ioan
Subjects: 0209 industrial biotechnology, Disturbance (geology), Computer science, Internal model, 02 engineering and technology, Filter (signal processing), 01 natural sciences, Stability (probability), 020901 industrial engineering & automation, Computer Science::Systems and Control, Control theory, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, 0103 physical sciences, [INFO.INFO-AU] Computer Science [cs]/Automatic Control Engineering, 010301 acoustics, ComputingMilieux_MISCELLANEOUS
Abstract: The stability of an adaptive disturbance rejection scheme based on the Youla-Kucera parameterization is investigated, in case of an uncertain plant model is used in the synthesis of the central controller. It is shown that stability is guaranteed provided that two conditions are satisfied at the same time: the first one is linked to the internal model principle, and the second one depends on the closed-loop poles location. For some uncertainties, these constraints cannot be met simultaneously with the minimal Q-filter. That leads to propose an over-parametrized Youla-Kucera filter, in order to relax the said conditions. Simulations on relevant examples illustrate the procedure for stabilizing the Youla-Kucera adaptive rejection scheme, in the presence of plant model uncertainties.
Published: 2019

31. Parameter Space Abstraction and Unfolding Semantics of Discrete Regulatory Networks

Author: David Šafránek, Loïc Paulevé, Juraj Kolčák, Stefan Haar, Faculty of Informatics [Brno] (FI / MUNI), Masaryk University [Brno] (MUNI), Modeling and Exploitation of Interaction and Concurrency (MEXICO), Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Bioinformatique (LRI) (BioInfo - LRI), Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), ANR-16-CE12-0034,AlgoReCell,Modèles informatiques et algorithmes pour la prédiction de cibles de reprogrammation cellulaire avec haute fidélité et haute efficacité(2016), and ANR-11-LABX-0045,DIGICOSME,Mondes numériques: Données, programmes et architectures distribués(2011)
Subjects: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theoretical computer science, General Computer Science, Discrete Mathematics (cs.DM), Computer science, Concurrency, 0102 computer and information sciences, 02 engineering and technology, Parameter space, 01 natural sciences, Theoretical Computer Science, Boolean algebra, Boolean networks, symbols.namesake, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Reachability, 0202 electrical engineering, electronic engineering, information engineering, State space, concurrency, Observability, Abstraction, Parametric statistics, Thomas networks, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], systems biology, 16. Peace & justice, Infimum and supremum, Graph, Logic in Computer Science (cs.LO), 010201 computation theory & mathematics, 92C42, symbols, Graph (abstract data type), asynchronous systems, 020201 artificial intelligence & image processing, parametrised discrete dynamics, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Parametrization, Computer Science - Discrete Mathematics
Abstract: The modelling of discrete regulatory networks combines a graph specifying the pairwise influences between the variables of the system, and a parametrisation from which can be derived a discrete transition system. Given the influence graph only, the exploration of admissible parametrisations and the behaviours they enable is computationally demanding due to the combinatorial explosions of both parametrisation and reachable state space. This article introduces an abstraction of the parametrisation space and its refinement to account for the existence of given transitions, and for constraints on the sign and observability of influences. The abstraction uses a convex sublattice containing the concrete parametrisation space specified by its infimum and supremum parametrisations. It is shown that the computed abstractions are optimal, i.e., no smaller convex sublattice exists. Although the abstraction may introduce over-approximation, it has been proven to be conservative with respect to reachability of states. Then, an unfolding semantics for Parametric Regulatory Networks is defined, taking advantage of concurrency between transitions to provide a compact representation of reachable transitions. A prototype implementation is provided: it has been applied to several examples of Boolean and multi-valued networks, showing its tractability for networks with numerous components., Comment: preprint
Published: 2019

32. Discovering of the unobservable behaviour of an Interpreted Petri Net model

Author: Luigi Ferrara, Gregory Faraut, Francesco Basile, Jean-Jaques Lesage, Università degli Studi di Salerno (UNISA), Laboratoire Universitaire de Recherche en Production Automatisée (LURPA), Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Cachan (ENS Cachan), Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), and École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)
Subjects: Structure (mathematical logic), Identification, 0209 industrial biotechnology, Theoretical computer science, Computer science, Observable, 02 engineering and technology, Petri net, 16. Peace & justice, Net (mathematics), Unobservable, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Set (abstract data type), Identification (information), 020901 industrial engineering & automation, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], Petri Nets, Discrete Event Systems, Model discovery, Event (probability theory)
Abstract: International audience; This paper focuses on the problem of discovering a Petri Net model from long event sequences generated by a discrete event system. Precisely, it is assumed that the relations between input and output events (i.e. the observable behaviour of the system) are already modelled by a set of Interpreted Petri Net fragments while the behaviour of the internal state evolutions (i.e. the unobservable behaviour) must be discovered. An approach inspired to net synthesis is proposed. It relies on an optimization-based procedure for the identification of the unobservable net structure and marking.
Published: 2019

33. A Tale of Two Diagnoses in Probabilistic Systems

Author: Nathalie Bertrand, Engel Lefaucheux, Serge Haddad, SUpervision of large MOdular and distributed systems (SUMO), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), 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), Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Modeling and Exploitation of Interaction and Concurrency (MEXICO), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de 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 Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-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 Bretagne-Pays de la Loire (IMT Atlantique)
Subjects: Computer science, 0102 computer and information sciences, 02 engineering and technology, Probabilistic transition systems, Fault (power engineering), 01 natural sciences, Theoretical Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Almost surely, [INFO]Computer Science [cs], Medical diagnosis, ComputingMilieux_MISCELLANEOUS, Fault diagnosis, Markov chain, Markov chains, Probabilistic logic, Observable, Construct (python library), 16. Peace & justice, Computer Science Applications, Computational Theory and Mathematics, 010201 computation theory & mathematics, Partial observation, 020201 artificial intelligence & image processing, Algorithm, Information Systems
Abstract: Diagnosis of partially observable stochastic systems prone to faults was introduced in the late nineties. Diagnosability, i.e. the existence of a diagnoser, may be specified in different ways: exact diagnosability requires that almost surely a fault is detected and that no fault is erroneously claimed; approximate diagnosability tolerates a small error probability when claiming a fault; last, accurate approximate diagnosability guarantees that the error probability can be chosen arbitrarily small. In this article, we first refine the specification of diagnosability by identifying three criteria: (1) detecting faulty runs or providing information for all runs (2) considering finite or infinite runs, and (3) requiring or not a uniform detection delay. We then give a complete picture of relations between the different diagnosability specifications for probabilistic systems and establish characterisations for most of them in the finite-state case. Based on these characterisations, we develop decision procedures, study their complexity and prove their optimality. We also design synthesis algorithms to construct diagnosers and we analyse their memory requirements. Finally we establish undecidability of the diagnosability problems for which we provided no characterisation.
Published: 2019

34. Sharing a Library between Proof Assistants: Reaching out to the HOL Family

Author: François Thiré, Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Deduction modulo, interopérabilité et démonstration automatique (DEDUCTEAM), 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 Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer science, Interoperability, HOL, 0102 computer and information sciences, 02 engineering and technology, computer.software_genre, 01 natural sciences, lcsh:QA75.5-76.95, Simple type theory, 0202 electrical engineering, electronic engineering, information engineering, Fermat's Last Theorem, Class (computer programming), Programming language, lcsh:Mathematics, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, Extension (predicate logic), lcsh:QA1-939, Logic in Computer Science (cs.LO), Theorem provers, Logical framework, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 010201 computation theory & mathematics, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, lcsh:Electronic computers. Computer science, computer
Abstract: We observe today a large diversity of proof systems. This diversity has the negative consequence that a lot of theorems are proved many times. Unlike programming languages, it is difficult for these systems to co-operate because they do not implement the same logic. Logical frameworks are a class of theorem provers that overcome this issue by their capacity of implementing various logics. In this work, we study the STTforall logic, an extension of Simple Type Theory that has been encoded in the logical framework Dedukti. We present a translation from this logic to OpenTheory, a proof system and interoperability tool between provers of the HOL family. We have used this translation to export an arithmetic library containing Fermat's little theorem to OpenTheory and to two other proof systems that are Coq and Matita., Comment: In Proceedings LFMTP 2018, arXiv:1807.01352
Published: 2018

35. Generalized convergence conditions of the parameter adaptation algorithm in discrete-time recursive identification and adaptive control

Author: Bernard Vau, Henri Bourlès, Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS), Instrumentation et Imagerie (SATIE-II), Systèmes d'Information et d'Analyse Multi-Echelles (SIAME), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), and Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE)
Subjects: 0209 industrial biotechnology, Forgetting, Adaptive control, Degree (graph theory), Computer science, Stability (learning theory), 02 engineering and technology, adaptive control, Transfer function, [SPI.AUTO]Engineering Sciences [physics]/Automatic, [SPI]Engineering Sciences [physics], Identification (information), 020901 industrial engineering & automation, Discrete time and continuous time, Control and Systems Engineering, parameters estimation, Convergence (routing), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, Algorithm, Discrete-time recursive identification, ComputingMilieux_MISCELLANEOUS
Abstract: International audience; In this paper, we extend convergence conditions for the parameter adaptation algorithm, used in discrete-time recursive identification schemes, or in adaptive control. Whereas the classical stability analysis of this algorithm consists in checking the strictly real positiveness of an associated transfer function, we demonstrate that convergence can be obtained even when this condition is not fulfilled, under some assumptions on the algorithm forgetting factors. These results regarding both deterministic and stochastic contexts are obtained by analyzing convergence with a prescribed degree of stability.
Published: 2018

36. New Low-Rank Filters for MIMO-STAP Based on an Orthogonal Tensorial Decomposition

Author: Guillaume Ginolhac, Frederic Brigui, Maxime Boizard, Frédéric Pascal, Temasek life sciences laboratory [Singapore], National University of Singapore ( NUS ), Systèmes et Applications des Technologies de l'Information et de l'Energie ( SATIE ), Centre National de la Recherche Scientifique ( CNRS ) -Conservatoire National des Arts et Métiers [CNAM] ( CNAM ) -Université de Cergy Pontoise ( UCP ), Université Paris-Seine-Université Paris-Seine-École normale supérieure - Rennes ( ENS Rennes ) -Université Paris-Sud - Paris 11 ( UP11 ) -École normale supérieure - Cachan ( ENS Cachan ) -Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux ( IFSTTAR ), Laboratoire d'Informatique, Systèmes, Traitement de l'Information et de la Connaissance ( LISTIC ), Université Savoie Mont Blanc ( USMB [Université de Savoie] [Université de Chambéry] ), Laboratoire franco-singapourien de recherche en électromagnétisme et radars ( SONDRA ), ONERA-SUPELEC-National University of Singapore ( NUS ) -DSO National Laboratories-CentraleSupélec, National University of Singapore (NUS), DEMR, ONERA, Université Paris Saclay (COmUE) [Palaiseau], ONERA-Université Paris Saclay (COmUE), Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique, Systèmes, Traitement de l'Information et de la Connaissance (LISTIC), Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry]), Laboratoire des signaux et systèmes (L2S), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), and DGA (2013.60.0011.00.470.75.01)
Subjects: STAP, Radar, Rank (linear algebra), Computer science, Heuristic, MIMO, Low Rank Clutter, Aerospace Engineering, 020206 networking & telecommunications, [ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processing, 02 engineering and technology, Filter (signal processing), Higher-order singular value decomposition, Orthogonal Tensor Decomposition, Tensor (intrinsic definition), Singular value decomposition, 0202 electrical engineering, electronic engineering, information engineering, Clutter, 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Algorithm
Abstract: We develop in this paper a new adaptive low-rank (LR) filter for MIMO-space time adaptive processing (STAP) application based on a tensorial modeling of the data. This filter is based on an extension of the higher order singular value decomposition (HOSVD) (which is also one possible extension of singular value decomposition to the tensor case), called alternative unfolding HOSVD (AU-HOSVD), which allows us to consider the combinations of dimensions. This property is necessary to keep the advantages of the STAP and the MIMO characteristics of the data. We show that the choice of a good partition (as well as the tensorial modeling) is not heuristic but have to follow several features. Thanks to the derivation of the theoretical formulation of multimode ranks for all partitions, the tensorial LR filters are easy to compute. Results on simulated data show the good performance of the AU-HOSVD LR filters in terms of secondary data and clutter notch.
Published: 2018

37. An enrichment-based approach for the simulation of fretting problems

Author: Sylvie Pommier, David Néron, RA Cardoso, José Alexander Araújo, Laboratoire de Mécanique et Technologie (LMT), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Universidade de Brasilia [Brasília] (UnB), Université Paris-Saclay, and École normale supérieure - Cachan (ENS Cachan)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Work (thermodynamics), Similarity (geometry), Computer science, Computational Mechanics, Mechanical engineering, Ocean Engineering, Fretting, 02 engineering and technology, [SPI.MECA.SOLID]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Solid mechanics [physics.class-ph], X-FEM, 0203 mechanical engineering, Computational Science and Engineering, Polygon mesh, Model Reduction, Linear elastic fracture mechanics, ComputingMilieux_MISCELLANEOUS, Applied Mathematics, Mechanical Engineering, 021001 nanoscience & nanotechnology, Finite element method, Computational Mathematics, 020303 mechanical engineering & transports, Computational Theory and Mathematics, [SPI.MECA.STRU]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Structural mechanics [physics.class-ph], 0210 nano-technology
Abstract: The aim of this work is to improve the performance of fretting simulations making use of an enrichment approach. The idea is to take advantage of the fact that the mechanical fields around the contact edges in cylindrical contact configurations under fretting conditions are similar to the ones found close to the crack tip in linear elastic fracture mechanics problems. This similarity makes attractive the idea of enriching finite element fretting simulations through the X-FEM framework, which enables us to work with coarser meshes while keeping a good accuracy. As it will be shown in this work, it is possible to work with meshes up to 10 times coarser than it should be if a conventional FE method was used allowing a strong improvement of the computational performances.
Published: 2018

38. Fast model updating coupling Bayesian inference and PGD model reduction

Author: Ludovic Chamoin, François Louf, Paul-Baptiste Rubio, Laboratoire de Mécanique et Technologie (LMT), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), and École normale supérieure - Cachan (ENS Cachan)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Computer science, Bayesian inference, Computational Mechanics, Ocean Engineering, Probability density function, 02 engineering and technology, 01 natural sciences, Reduction (complexity), Model updating, 0203 mechanical engineering, Decomposition (computer science), 0101 mathematics, PGD, Coupling, Reduced order model, Applied Mathematics, Mechanical Engineering, Sampling (statistics), [SPI.MECA]Engineering Sciences [physics]/Mechanics [physics.med-ph], Inverse problem, 010101 applied mathematics, Computational Mathematics, Identification (information), 020303 mechanical engineering & transports, Computational Theory and Mathematics, [SPI.MECA.STRU]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Structural mechanics [physics.class-ph], Algorithm
Abstract: International audience; The paper focuses on a coupled Bayesian-Proper Generalized Decomposition (PGD) approach for the real-time identification and updating of numerical models. The purpose is to use the most general case of Bayesian inference theory in order to address inverse problems and to deal with different sources of uncertainties (measurement and model errors, stochastic parameters). In order to do so with a reasonable CPU cost, the idea is to replace the direct model called for Monte-Carlo sampling by a PGD reduced model, and in some cases directly compute the probability density functions from the obtained analytical formulation. This procedure is first applied to a welding control example with the updating of a deterministic parameter. In the second application, the identification of a stochastic parameter is studied through a glued assembly example.
Published: 2018

39. Automated Partitioning of Concurrent Discrete-Event Systems for Distributed Behavioral Identification

Author: Jean-Jacques Lesage, Gregory Faraut, Jeremie Saives, Laboratoire Universitaire de Recherche en Production Automatisée (LURPA), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11), and Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Cachan (ENS Cachan)
Subjects: Reverse engineering, Petri-nets, Identification, Distributed models, 0209 industrial biotechnology, Optimization problem, Theoretical computer science, Computer science, Event (computing), 02 engineering and technology, Petri net, computer.software_genre, Partition (database), Unobservable, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Identification (information), 020901 industrial engineering & automation, Discrete-event systems, Control and Systems Engineering, 0202 electrical engineering, electronic engineering, information engineering, Benchmark (computing), 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, computer
Abstract: The aim of behavioral identification of discrete-event systems is to build, from a sequence of observed inputs/outputs events, an understandable model that exhibits both the direct relations between inputs and outputs events (i.e., the observable behavior of the system) and the internal state evolutions (i.e., the unobservable behavior). Since parallelism hinders the construction of monolithic models, distributed identification builds instead the models of subsystems. This paper proposes an automated partitioning of the system and optimal regarding the readability of the identified distributed models, thus fitting reverse-engineering purposes. To solve the optimization problem, a first solution is extracted from the observable behavior; then additional solutions are computed by agglomerative clustering. The approach is applied to a benchmark, resulting in an adequate functional partition. Note to Practitioners —Identification is an approach to obtain the models of an existing closed-loop discrete-event system from an observed I/O sequence, discovering both sequential and concurrent processes within the same system. The result is an understandable and compact model that approximates the observed behavior and can be used for reverse engineering. To get better insight on the behavior of the system, splitting it into subsystems and studying distributed models might be easier. Besides, identifying smaller subsystems reduces the computational cost. The main contribution of this paper is therefore a partitioning approach for distributed DES identification. Only the knowledge of the I/Os and the observed I/O sequence are required to provide a partitioning adapted to reverse engineering and compact distributed models, in reasonable computation times.
Published: 2018

40. Tolerancing: Managing uncertainty from conceptual design to final product

Author: Luc Mathieu, Nabil Anwer, Rikard Söderberg, Xiangqian Jiang, Ahmed Jawad Qureshi, Giovanni Moroni, Jean-Yves Dantan, Edward P. Morse, University of North Carolina [Charlotte] (UNC), University of North Carolina System (UNC), Laboratoire de Conception Fabrication Commande (LCFC), Université de Lorraine (UL)-Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM), Laboratoire Universitaire de Recherche en Production Automatisée (LURPA), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11), École normale supérieure - Cachan (ENS Cachan), Chalmers University of Technology [Göteborg], Politecnico di Milano [Milan] (POLIMI), University of Alberta, and University of Huddersfield
Subjects: 0209 industrial biotechnology, Design, Ideal (set theory), Computer science, Mechanical Engineering, Final product, Uncertainty, 0211 other engineering and technologies, 02 engineering and technology, Sciences de l'ingénieur, Product function, Industrial and Manufacturing Engineering, Field (computer science), [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, Risk analysis (engineering), Conceptual design, Order (exchange), Tolerancing, Design, Tolerancing, Uncertainty, 021106 design practice & management
Abstract: International audience; Variability is unavoidable in the realization of products. While design must specify ideal geometry, it shall also describe limits of variability (tolerances) that must be met in order to maintain proper product function. Although tolerancing is a mature field, new manufacturing processes and design methodologies are creating new avenues of research, and modelling standards must also evolve to support these processes. In addition, the study of uncertainty has produced widely-accepted methods of quantifying variability, and modern tolerancing tools should support these methods. The challenges introduced by new processes and design methodologies continue to make tolerancing research a fertile and productive area.
Published: 2018

41. Freeform Machining Features: New Concepts and Classification

Author: Soumiya Bendjebla, Na Cai, Nabil Anwer, Charyar Mehdi-Souzani, Sylvain Lavernhe, Laboratoire Universitaire de Recherche en Production Automatisée (LURPA), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11), and Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Cachan (ENS Cachan)
Subjects: 0209 industrial biotechnology, Engineering drawing, Feature classification, Computer science, Process (computing), Machining Feature, 020207 software engineering, Graph theory, 02 engineering and technology, [SPI.MECA]Engineering Sciences [physics]/Mechanics [physics.med-ph], [SPI.MECA.GEME]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Mechanical engineering [physics.class-ph], Domain (software engineering), [SPI]Engineering Sciences [physics], STEP-NC, 020901 industrial engineering & automation, Machining, 0202 electrical engineering, electronic engineering, information engineering, Numerical control, Feature (machine learning), General Earth and Planetary Sciences, Freeform, Representation (mathematics), General Environmental Science
Abstract: International audience; During the last decades, many researches and applications have been conducted on machining features modeling and classification. Althoughseveral approaches have been used in the domain of Computer-Aided Process Planning (CAPP), the consideration of freeform shapes has notbeen well explored at present. This paper aims to provide an up-to-date review of machining features and its conformance with STEP-NC (STEPcompliant Numerical Control). A new method based on discrete shape representation, differential geometry and graph theory is developed forfreeform machining feature characterization and classification. The effectiveness of the proposed method is demonstrated through an example ofa blade part.
Published: 2018

42. Enhanced discrete event model for system identification with the aim of fault detection

Author: Marcos Vincente Moreira, Jean-Jacques Lesage, Universitade federal do Rio de Janeiro, Laboratoire Universitaire de Recherche en Production Automatisée (LURPA), Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Cachan (ENS Cachan), and École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)
Subjects: 0209 industrial biotechnology, Finite-state machine, Computer science, 020208 electrical & electronic engineering, System identification, 02 engineering and technology, Fault detection and isolation, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Automaton, Event model, 020901 industrial engineering & automation, Discrete-event systems, Control and Systems Engineering, Deterministic automaton, Black-box identification, 0202 electrical engineering, electronic engineering, information engineering, Order (group theory), Fault detection, Finite automata, Algorithm
Abstract: International audience; In this paper, we present a new model for discrete-event system identification that is suitable for fault detection, called Deterministic Automaton with Outputs and Conditional Transitions (DAOCT). The model is computed from observed fault-free paths, and represents the fault-free system behavior. In practice, a trade-off between size and accuracy of the identified automaton has to be found. In order to obtain compact models, loops are introduced in the model, which implies that sequences that are not observed can be generated by the model leading to an exceeding language. This exceeding language is associated with possible non-detectable faults, and must be reduced in order to use the model for fault detection. We show, in this paper, that the exceeding language generated by the DAOCT is smaller than the exceeding language generated by other models proposed in the literature, reducing, therefore, the number of possible non-detectable faults. We also show that if the identified DAOCT does not have cyclic paths, then the exceeding language is empty, and the model represents all and only all observed fault-free sequences generated by the system. A practical example is used to illustrate the results of the paper.
Published: 2018

43. Path Planning of a Laser-scanner with the Control of Overlap for 3d Part Inspection

Author: Nguyen Duy Minh Phan, Sylvain Lavernhe, Yann Quinsat, Claire Lartigue, Laboratoire Universitaire de Recherche en Production Automatisée (LURPA), Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Cachan (ENS Cachan), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11), and Quinsat, Yann
Subjects: Overlap, 0209 industrial biotechnology, Scanner, Laser scanning, Robot, Computer science, Conformal map, 02 engineering and technology, law.invention, Industrial robot, 020901 industrial engineering & automation, law, 0202 electrical engineering, electronic engineering, information engineering, Equidistant, Computer vision, Motion planning, [SPI.MECA.GEME] Engineering Sciences [physics]/Mechanics [physics.med-ph]/Mechanical engineering [physics.class-ph], General Environmental Science, Least squares conformal maps, Plane (geometry), business.industry, Inspection, 020208 electrical & electronic engineering, [SPI.MECA.GEME]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Mechanical engineering [physics.class-ph], General Earth and Planetary Sciences, Artificial intelligence, business, Scan path
Abstract: International audience; This paper proposes a new approach to scan path planning for automated inspection of manufactured parts with an industrial robot based on the control of the overlap between 2 successive scanning paths. The novelty lies in the use of the least-squares conformal map, which stretches a 3D surface on a 2D plane. Equidistant paths calculated in the 2D space are transformed into equidistant paths in the 3D space. Controlling the overlap can maximize the coverage region on the scanned part. On the other hand, digitizing quality is ensured by managing the sensor configuration relatively to the part with respect to quality criteria. The approach is implemented with success for a laser-plane scanner mounted on an industrial robot.
Published: 2018

44. Formal Verification of Safety Analysis Models of Repairable and Reconfigurable Systems

Author: Pierre-Yves Piriou, Jean-Marc Faure, Elodie Kobeissi, Laboratoire Universitaire de Recherche en Production Automatisée (LURPA), Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Cachan (ENS Cachan), Simulation et Traitement de l'information pour l'Exploitation des systèmes de Production (EDF R&D STEP), EDF R&D (EDF R&D), EDF (EDF)-EDF (EDF), IFAC, Faure, Jean-Marc, and École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)
Subjects: Computation tree logic, [SPI] Engineering Sciences [physics], Computer science, Semantics (computer science), Dynamic properties, Stability (learning theory), Model Based Safety Analysis/Assessment, Markov process, Analysis models, 0102 computer and information sciences, 02 engineering and technology, Semantics, Translation (geometry), 01 natural sciences, [SPI]Engineering Sciences [physics], symbols.namesake, Simple (abstract algebra), 0202 electrical engineering, electronic engineering, information engineering, Formal verification, Computation Tree Logic, Generalized BDMP, 020207 software engineering, Reliability engineering, 010201 computation theory & mathematics, Control and Systems Engineering, symbols, Stability
Abstract: International audience; This paper proposes a method to formally check whether formal properties hold on a dynamic model which has been designed by experts for Model Based Safety Analysis/Assessment. As repairable and reconfigurable systems are considered, this model is assumed to be described in the Generalized Boolean-logic Driven Markov Processes (GBDMP) modelling framework. Translation rules are given to obtain a formal model that describes correctly the evolution of the initial model with the semantics of the verification tool. The approach is exemplified on a simple case of standby redundancy.
Published: 2017

45. Efros and Freeman Image Quilting Algorithm for Texture Synthesis

Author: Lara Raad, Bruno Galerne, Centre de Mathématiques et de Leurs Applications ( CMLA ), École normale supérieure - Cachan ( ENS Cachan ) -Centre National de la Recherche Scientifique ( CNRS ), Mathématiques Appliquées à Paris 5 ( MAP5 - UMR 8145 ), Université Paris Descartes - Paris 5 ( UPD5 ) -Institut National des Sciences Mathématiques et de leurs Interactions-Centre National de la Recherche Scientifique ( CNRS ), Centre de Mathématiques et de Leurs Applications (CMLA), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Mathématiques Appliquées Paris 5 (MAP5 - UMR 8145), and Université Paris Descartes - Paris 5 (UPD5)-Institut National des Sciences Mathématiques et de leurs Interactions (INSMI)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Linear programming, Computer science, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, 02 engineering and technology, Texture (music), lcsh:QA75.5-76.95, Image (mathematics), Image stitching, 0202 electrical engineering, electronic engineering, information engineering, Computer vision, ComputingMethodologies_COMPUTERGRAPHICS, business.industry, Process (computing), 020207 software engineering, [ INFO.INFO-GR ] Computer Science [cs]/Graphics [cs.GR], Sample (graphics), [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], Signal Processing, 020201 artificial intelligence & image processing, lcsh:Electronic computers. Computer science, Artificial intelligence, business, Algorithm, Software, Quilting, Texture synthesis
Abstract: International audience; Exemplar-based texture synthesis is defined as the process of generating, from an input texture sample, new texture images that are perceptually equivalent to the input. Efros and Freeman's method is a non-parametric patch-based method which computes an output texture image by quilting together patches taken from the input sample. The main innovation of their work relies in the stitching technique which significantly reduces the transition effect between patches. In this paper, we propose a detailed analysis and implementation of their work. We provide a complete mathematical description of the linear programing problem used for the quilting step as well as implementation details. Additionally we propose a partially parallel version of the quilting technique.https://doi.org/10.5201/ipol.2017.171
Published: 2017

46. Regularized Least Squares for the Building of a Sizing Criterion Based on Damage Mechanics

Author: Emmanuel Baranger, Orestis Friderikos, Damien Guillon, Laboratoire de Mécanique et Technologie (LMT), École normale supérieure - Cachan (ENS Cachan)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), and CEntre Technique des Industries Mécaniques - Cetim (FRANCE)
Subjects: Mathematical optimization, Computer science, Multi-Stage Least Squares, Design of experiments, 02 engineering and technology, Virtual Testing Analysis, Overfitting, 021001 nanoscience & nanotechnology, Finite element method, Tikhonov regularization, [PHYS.MECA.MEMA]Physics [physics]/Mechanics [physics]/Mechanics of materials [physics.class-ph], 020303 mechanical engineering & transports, 0203 mechanical engineering, Surrogate analysis, Norm (mathematics), Singular value decomposition, Regularization, Ceramics and Composites, Penalty method, Virtual charts, 0210 nano-technology, Cohesive zone modeling, Linear least squares, ComputingMilieux_MISCELLANEOUS, Civil and Structural Engineering
Abstract: Utilization of the building-block approach for the design of composite parts emerged from the need to develop a true understanding of the complex composite structural response through experimentation and analysis. The present work aims to provide a numerical counterpart to the expensive experimental testing of advanced composite laminate structures. This detailed analysis can be fully integrated into the building-block approach to enhance its capability to examine the full-scale structural behavior and improve its reliability. To this end, a Virtual Testing Analysis (VTA) based on the structural decomposition into a number of complicated laminates is introduced for determining premature damage evolution. VTA augment FEM with a hierarchical procedure which goes down to the meso-scale where a detailed modeling of each component is examined using non-linear FEM. Design of Experiments is utilized for an optimal sampling of the design space related to the laminate subcomponents. Linear least squares regression using Tikhonov regularization ( L 2 -norm penalty function) and Truncated Singular Value Decomposition (TSVD) are used to combat overfitting and stabilize possible ill-conditioned matrix inverse problems. Furthermore, a Multi-Stage Least Squares methodology is implemented as an alternative approximation which utilizes a separation of the design variables into sets. This method yields optimal solutions in each subspace in a hope to obtain the final global optimal solution from the composition of locally optimal solutions. Performance and efficiency is evaluated both for training and validation data using error measures based on the residuals. Preliminary results showed acceptable accuracy for the linear least squares and Multi-Stage Least Squares methods. An important key aspect of VTA is that off-line computations for the advanced laminates can be stored and used for different full-scale structures as a simple failure criterion.
Published: 2019

47. Statistical Modal Analysis for Out-of-Plane Deviation Prediction in Additive Manufacturing Based on Finite Element Simulation

Author: Luc Mathieu, Zuowei Zhu, Nabil Anwer, Laboratoire Universitaire de Recherche en Production Automatisée (LURPA), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11), and Université Paris-Sud - Paris 11 (UP11)-École normale supérieure - Cachan (ENS Cachan)
Subjects: 0209 industrial biotechnology, Computer science, Mechanical Engineering, Modal analysis, Mathematical analysis, 02 engineering and technology, 01 natural sciences, Industrial and Manufacturing Engineering, Finite element method, 0104 chemical sciences, Computer Science Applications, Finite element simulation, Out of plane, 010404 medicinal & biomolecular chemistry, [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, Control and Systems Engineering, [INFO]Computer Science [cs], [MATH]Mathematics [math], ComputingMilieux_MISCELLANEOUS
Abstract: Despite the rapid growth and widespread recognition of additive manufacturing (AM) technologies, the geometrical inaccuracy of the manufactured products remains a challenging issue and effective prediction of the geometric deviations in AM is critical for the solution of this issue. The layerwise characteristic of the AM process has motivated the investigation of deviation from in-plane and out-of-plane perspectives, the latter has been seldom studied and will be the focus of this paper. In this paper, an out-of-plane deviation modeling method will be proposed based on statistical modal analysis. Owing to the inconvenience in data acquisition, AM simulation is conducted to obtain the layer-level out-of-plane deviation on parts manufactured by the selective laser melting process. Discrete cosine transform is adopted to identify the major deviation modes from the data. The statistical relationship between mode coefficients and related part and process parameters is studied based on the Gaussian process model. To gain data for model training, experimental design is conducted to sample parameter combinations as simulation input. A case study is presented to demonstrate the proposed method and the effectiveness is validated on test data. The method can be applied in multiple domains of AM, such as quality control and tolerancing, to provide high-fidelity prediction of geometric deviations.
Published: 2019

48. Towards a Reference Data Generation Framework for Performance Assessment of Perception Systems

Author: Marie-Anne Mittet, A F Sergio Rodriguez, Remi Defraiteur, Roger Reynaud, Nicole El Zoghby, Méthodes et Outils pour les Signaux et Systèmes (SATIE-MOSS), Systèmes d'Information et d'Analyse Multi-Echelles (SIAME), Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS), Technocentre Renault [Guyancourt], and RENAULT
Subjects: 050210 logistics & transportation, data fusion, LiDAR, Computer science, 05 social sciences, 02 engineering and technology, perception, Sensor fusion, computer.software_genre, Consistency (database systems), Reference data, Lidar, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, Range (statistics), [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], 020201 artificial intelligence & image processing, Data mining, Precision and recall, computer, Reliability (statistics)
Abstract: International audience; Sensors and their associated data fusion techniques, play a crucial role in Autonomous Vehicle (AV) decision-making applications. Accurately evaluate performance and reliability of the perception sources is an important task to be able to know the consistency of this data fusion. In this paper, a reference data generation framework for assessing perception sensors performances is proposed. Our approach relies on the complementary use of three data sources: a highly precise 3D map with semantic information, a High Density range finder sensor and a GNSS-RTK/INS localization unit. 3D map provides semantic knowledge of the environment and HD range finder precisely senses ego-vehicle surroundings. Finally, 3D map and HD scans are geometrically associated using positioning information in order to combine them and to infer reference data. Thorough experiments were conducted to evaluate and validate the proposed approach. As a proof of concept, performances of a LiDAR-based road plane detection method were evaluated, quantified and reported in terms of precision and recall.
Published: 2019

49. Enhanced Initialization for Track-before-Detection based Multibody Motion Segmentation from a Moving Camera

Author: Hernan Gonzalez, Abdelhafid Elouardi, Arjun Balakrishnan, A F Sergio Rodriguez, Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS), Méthodes et Outils pour les Signaux et Systèmes (SATIE-MOSS), Systèmes d'Information et d'Analyse Multi-Echelles (SIAME), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), and Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE)
Subjects: 0209 industrial biotechnology, Computer science, business.industry, Epipolar geometry, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, Initialization, Motion (geometry), 02 engineering and technology, RANSAC, 020901 industrial engineering & automation, Motion estimation, 0202 electrical engineering, electronic engineering, information engineering, Key (cryptography), Structure from motion, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], 020201 artificial intelligence & image processing, Segmentation, Computer vision, Artificial intelligence, Motion segmentation, business, ComputingMethodologies_COMPUTERGRAPHICS
Abstract: International audience; Vision-based motion segmentation provides key information for dynamic scene understanding and decision making in autonomous navigation. In this paper, we propose an enhanced initialization strategy which is tightly coupled to a multibody Structure from Motion (SfM) segmentation employing a monocular camera. The method relies on epipolar geometry, RANSAC formulation and motion estimation for segmenting ego-motion and eoru-motions. The proposed strategy is intended to enhance the initialization procedure employed in [1] obtaining a 50 times speed-up factor. This result is used as input for the Track before Detection (TbD) methodology which efficiently simplifies the existing multibody Structure from Motion implementation approaches. An evaluation using images from a publicly available dataset with dynamic traffic scenarios and large camera motions confirms the effectiveness of the method.
Published: 2019

50. An Integrity Assessment Framework for Multi-modal Vehicle Localization

Author: Arjun Balakrishnan, A F Sergio Rodriguez, Roger Reynaud, Méthodes et Outils pour les Signaux et Systèmes (SATIE-MOSS), Systèmes d'Information et d'Analyse Multi-Echelles (SIAME), Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)-Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), and Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)
Subjects: 050210 logistics & transportation, 0209 industrial biotechnology, Process (engineering), Computer science, Generalization, 05 social sciences, Intelligent vehicles, 02 engineering and technology, Integrity assessment, computer.software_genre, 020901 industrial engineering & automation, Modal, Localization, 0502 economics and business, Scalability, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], Data mining, Focus (optics), Spatial analysis, computer
Abstract: International audience; Integrity monitoring of sources and process associated with localization systems used in autonomous navigation applications is of paramount importance. In this work, we present a novel source-level integrity monitoring method with a focus on generalization, scalability and versatility. A cross-consistency assessment based framework is developed to monitor the integrity of different spatial data sources. The proposed method is applied to several datasets, which demonstrates promising behavior of our integrity markers in identifying and quantifying unreliable data from sources. Several scenarios, which are normal occurrences in challenging driving conditions, are considered in the experiments and the advantages of the proposed integrity monitoring process are highlighted.
Published: 2019

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

Journal

Database

Publisher

1,455 results on '"École normale supérieure - Cachan (ENS Cachan)"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources