Author: "Inria Nancy - Grand Est" / Publisher: springer science and business media llc - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Inria Nancy - Grand Est"' showing total 80 results

Start Over Author "Inria Nancy - Grand Est" Publisher springer science and business media llc

80 results on '"Inria Nancy - Grand Est"'

1. Polite Combination of Algebraic Datatypes

Author: Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark Barrett, Computer Science Department [Stanford], Stanford University, Department of Computer Science at Bar Ilan University, Bar-Ilan University [Israël], Proof techniques for security protocols (PESTO), 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 Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Massachusetts Institute of Technology, Computer Science and Artificial Intelligence Laboratory, Université de Liège, Modeling and Verification of Distributed Algorithms and Systems (VERIDIS), Max-Planck-Institut für Informatik (MPII), and Max-Planck-Gesellschaft-Max-Planck-Gesellschaft-Inria Nancy - Grand Est
Subjects: Algebraic datatypes, Satisfiability Modulo Theories, Polite combination, Computational Theory and Mathematics, Artificial Intelligence, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Automated reasoning, Theory combination, Software
Abstract: International audience; Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its latest stable version, the SMT-LIB standard defines a theory of algebraic datatypes, which is currently supported by several mainstream SMT solvers. In this paper, we study this particular theory of datatypes and prove that it is strongly polite, showing how it can be combined with other arbitrary disjoint theories using polite combination. The combination method uses a new, simple, and natural notion of additivity that enables deducing strong politeness from (weak) politeness.
Published: 2022
Full Text: View/download PDF

2. A Posthumous Contribution by Larry Wos: Excerpts from an Unpublished Column

Author: Sophie Tourret, Christoph Weidenbach, Modeling and Verification of Distributed Algorithms and Systems (VERIDIS), Max-Planck-Institut für Informatik (MPII), Max-Planck-Gesellschaft-Max-Planck-Gesellschaft-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 Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria), and Max Planck Institute for Informatics [Saarbrücken]
Subjects: History of automated reasoning, Reasoning by instantiation, Puzzle, Computational Theory and Mathematics, Artificial Intelligence, First-order logic modulo arithmetic, Set of support, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Software
Abstract: Shortly before Larry Wos passed away, he sent a manuscript for discussion to Sophie Tourret, the editor of the AAR newsletter. We present excerpts from this final manuscript, put it in its historic context and explain its relevance for today’s research in automated reasoning.
Published: 2022
Full Text: View/download PDF

3. A Formal Proof of the Expressiveness of Deep Learning

Author: Dietrich Klakow, Jasmin Christian Blanchette, Alexander Bentkamp, Theoretical Computer Science, Network Institute, Vrije Universiteit Amsterdam [Amsterdam] (VU), Max-Planck-Institut für Informatik (MPII), Max-Planck-Gesellschaft, Modeling and Verification of Distributed Algorithms and Systems (VERIDIS), Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Max-Planck-Institut für Informatik (MPII), Max-Planck-Gesellschaft-Max-Planck-Gesellschaft, Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Universität des Saarlandes [Saarbrücken], Max-Planck-Gesellschaft-Max-Planck-Gesellschaft-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 Formal Methods (LORIA - FM), 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), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)
Subjects: Formalization, Theoretical computer science, Computer science, HOL, Tensors, 02 engineering and technology, Type (model theory), Mathematical proof, 01 natural sciences, Formal proof, Development (topology), Artificial Intelligence, Computer Science::Logic in Computer Science, 020204 information systems, Machine learning, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, Borel measure, business.industry, Deep learning, 010102 general mathematics, 05 social sciences, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, Multivariate polynomials, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computational Theory and Mathematics, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Computer Science::Mathematical Software, Convolutional arithmetic circuits, 050211 marketing, Isabelle, Artificial intelligence, business, SDG 4 - Quality Education, Software
Abstract: Deep learning has had a profound impact on computer science in recentyears, with applications to image recognition, language processing, bioinformatics,and more. Recently, Cohen et al. provided theoretical evidence for the superiorityof deep learning over shallow learning. We formalized their mathematicalproof using Isabelle/HOL. The Isabelle development simplifies and generalizesthe original proof, while working around the limitations of the HOL type system.To support the formalization, we developed reusable libraries of formalizedmathematics, including results about the matrix rank, the Borel measure, andmultivariate polynomials as well as a library for tensor analysis.
Published: 2018
Full Text: View/download PDF

4. Flocking control of a fleet of unmanned aerial vehicles

Author: Zhixiang Liu, Adel Belkadi, Laurent Ciarletta, Youmin Zhang, Didier Theilliol, Centre de Recherche en Automatique de Nancy (CRAN), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Concordia University [Montreal], Management of dynamic networks and services (MADYNES), 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 Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), SIMulating and Building IOT (SIMBIOT), Department of Networks, Systems and Services (LORIA - NSS), 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)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), 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), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: 0209 industrial biotechnology, Control and Optimization, flocking, Computer science, Flocking (behavior), Aerospace Engineering, 020207 software engineering, Motion controller, Computational intelligence, unmanned quadrotor helicopters, 02 engineering and technology, Kinematics, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Cucker and Smale formation control, Nonlinear system, Double integrator, 020901 industrial engineering & automation, Control and Systems Engineering, Control theory, 0202 electrical engineering, electronic engineering, information engineering, Systems design, unmanned aerial vehicles, Actuator
Abstract: International audience; Current applications using single unmanned vehicle have been gradually extended to multiple ones due to their increased efficiency in mission accomplishment, expanded coverage areas and ranges, as well as enhanced system reliability. This paper presents a flocking control method with application to a fleet of unmanned quadrotor helicopters (UQHs). Three critical characteristics of formation keeping, collision avoidance, and velocity matching have been taken into account in the algorithm development to make it capable of accomplishing the desired objectives (like forest/pipeline surveillance) by safely and efficiently operating a group of UQHs. To achieve these, three layered system design philosophy is considered in this study. The first layer is the flocking controller which is designed based on the kinematics of UQH. The modified Cucker and Smale model is used for guaranteeing the convergence of UQHs to flocking, while a repelling force between each two UQHs is also added for ensuring a specified safety distance. The second layer is the motion controller which is devised based on the kinetics of UQH by employing the augmented state-feedback control approach to greatly minimize the steady-state error. The last layer is the UQH system along with its actuators. Two primary contributions have been made in this work: first, different from most of the existing works conducted on agents with double integrator dynamics, a new flocking control algorithm has been designed and implemented on a group of UQHs with nonlinear dynamics. Furthermore, the constraint of fixed neighbouring distance in formation has been relaxed expecting to significantly reduce the complexity caused by the increase of agents number and provide more flexibility to the formation control. Extensive numerical simulations on a group of UQH nonlinear models have been carried out to verify the effectiveness of the proposed method.
Published: 2018
Full Text: View/download PDF

5. Soundness and Completeness Proofs by Coinductive Methods

Author: Jasmin Christian Blanchette, Dmitriy Traytel, Andrei Popescu, Vrije Universiteit Amsterdam [Amsterdam] (VU), Max-Planck-Institut für Informatik (MPII), Max-Planck-Gesellschaft, Modeling and Verification of Distributed Algorithms and Systems (VERIDIS), Max-Planck-Gesellschaft-Max-Planck-Gesellschaft-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 Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Middlesex University, Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology [Zürich] (ETH Zürich), 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), Department of Formal Methods (LORIA - FM), 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)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Max-Planck-Institut für Informatik (MPII), Max-Planck-Gesellschaft-Max-Planck-Gesellschaft, Theoretical Computer Science, and Network Institute
Subjects: Completeness, HOL, 02 engineering and technology, Isabelle/HOL, Mathematical proof, 01 natural sciences, Artificial Intelligence, Computer Science::Logic in Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Calculus, Lazy evaluation, Gentian systems, 0101 mathematics, Mathematics, Soundness, Discrete mathematics, 010102 general mathematics, Coinduction, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, Predicate (mathematical logic), Specification language, Corecursion, First-order logic, Codatatypes, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computational Theory and Mathematics, Proof assistants, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Computer Science::Programming Languages, Software
Abstract: International audience; We show how codatatypes can be employed to produce compact, high-level proofs of key results in logic: the soundness and completeness of proof systems for variations of first-order logic. For the classical completeness result, we first establish an abstract property of possibly infinite derivation trees. The abstract proof can be instantiated for a wide range of Gentzen and tableau systems for various flavors of first-order logic. Soundness becomes interesting as soon as one allows infinite proofs of first-order formulas. This forms the subject of several cyclic proof systems for first-order logic augmented with inductive predicate definitions studied in the literature. All the discussed results are formalized using Isa-belle/HOL's recently introduced support for codatatypes and corecursion. The development illustrates some unique features of Isabelle/HOL's new coinductive specification language such as nesting through non-free types and mixed recursion–corecursion.
Published: 2016
Full Text: View/download PDF

6. A Quadratically Convergent Algorithm for Structured Low-Rank Approximation

Author: Pierre-Jean Spaenlehauer, Éric Schost, Ontario Research Center for Computer Algebra (ORCCA), University of Waterloo [Waterloo]-University of Western Ontario (UWO), Computer Science Department, University of Western Ontario (UWO), Cryptology, arithmetic : algebraic methods for better algorithms (CARAMBA), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), 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), 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)-Inria Nancy - Grand Est, and Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Computer Science - Symbolic Computation, FOS: Computer and information sciences, Transversality, Rank (linear algebra), MathematicsofComputing_NUMERICALANALYSIS, Low-rank approximation, 010103 numerical & computational mathematics, 0102 computer and information sciences, Symbolic Computation (cs.SC), 01 natural sciences, Matrix (mathematics), ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, FOS: Mathematics, Mathematics - Numerical Analysis, 0101 mathematics, Mathematics, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], Discrete mathematics, Quadratic growth, Matrix completion, Applied Mathematics, Computer Science - Numerical Analysis, Numerical Analysis (math.NA), [INFO.INFO-NA]Computer Science [cs]/Numerical Analysis [cs.NA], Computational Mathematics, Computational Theory and Mathematics, Rate of convergence, 010201 computation theory & mathematics, Affine space, Algorithm, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA], Analysis
Abstract: Structured Low-Rank Approximation is a problem arising in a wide range of applications in Numerical Analysis and Engineering Sciences. Given an input matrix $M$, the goal is to compute a matrix $M'$ of given rank $r$ in a linear or affine subspace $E$ of matrices (usually encoding a specific structure) such that the Frobenius distance $\lVert M-M'\rVert$ is small. We propose a Newton-like iteration for solving this problem, whose main feature is that it converges locally quadratically to such a matrix under mild transversality assumptions between the manifold of matrices of rank $r$ and the linear/affine subspace $E$. We also show that the distance between the limit of the iteration and the optimal solution of the problem is quadratic in the distance between the input matrix and the manifold of rank $r$ matrices in $E$. To illustrate the applicability of this algorithm, we propose a Maple implementation and give experimental results for several applicative problems that can be modeled by Structured Low-Rank Approximation: univariate approximate GCDs (Sylvester matrices), low-rank Matrix completion (coordinate spaces) and denoising procedures (Hankel matrices). Experimental results give evidence that this all-purpose algorithm is competitive with state-of-the-art numerical methods dedicated to these problems., Comment: 37 pages, Maple package available at http://www.pjspaenlehauer.net/data/software/NewtonSLRA_notes.html
Published: 2015
Full Text: View/download PDF

7. Stability regions of systems with compatibilities and ubiquitous measures on graphs

Author: Jocelyn Begeot, Irène Marcovici, Pascal Moyal, Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Processus aléatoires spatio-temporels et leurs applications (PASTA), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), and Moyal, Pascal
Subjects: 60J10, 05C90, 60K25, Computational Theory and Mathematics, Probability (math.PR), FOS: Mathematics, [MATH] Mathematics [math], [MATH]Mathematics [math], Management Science and Operations Research, Mathematics - Probability, Computer Science Applications
Abstract: This paper addresses the ubiquity of remarkable measures on graphs, and their applications. In many queueing systems, it is necessary to take into account the compatibility constraints between users, or between supply and demands, and so on. The stability region of such systems can then be seen as a set of measures on graphs, where the measures under consideration represent the arrival flows to the various classes of users, supply, demands, etc., and the graph represents the compatibilities between those classes. In this paper, we show that these 'stabilizing' measures can always be easily constructed as a simple function of a family of weights on the edges of the graph. Second, we show that the latter measures always coincide with invariant measures of random walks on the graph under consideration.
Published: 2023
Full Text: View/download PDF

8. From exact observability to identification of singular sources

Author: George Weiss, Marius Tucsnak, Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Tel Aviv University [Tel Aviv], Robust control of infinite dimensional systems and applications (CORIDA), Institut Élie Cartan de Nancy (IECN), Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de Mathématiques et Applications de Metz (LMAM), Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria), 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)-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)-Laboratoire de Mathématiques et Applications de Metz (LMAM), Tel Aviv University (TAU), and Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Inria Nancy - Grand Est
Subjects: Sequence, Control and Optimization, Applied Mathematics, Mathematical analysis, Linear system, Observable, Function (mathematics), Domain (mathematical analysis), Control and Systems Engineering, Bounded function, Signal Processing, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Identifiability, Applied mathematics, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Observability, [MATH]Mathematics [math], Mathematics
Abstract: We give general results about the identifiability of source terms for infinite-dimensional linear systems that are exactly observable. We allow the source term to be unbounded, i.e., not contained in the state space, but in one of a sequence of extended spaces. We show that the operator from the source term to the output function is bounded from below, in suitable norms. We apply the main result to a system described by the wave equation in a bounded $$n$$ -dimensional domain. We derive results of independent interest concerning the range of the input map of an exactly controllable system, when restricted to various spaces of smooth input functions.
Published: 2014
Full Text: View/download PDF

9. The Motion of a Fluid-Rigid Ball System at the Zero Limit of the Rigid Ball Radius

Author: Takéo Takahashi, Ana L. Silvestre, Center for Computacional and Stochastic Mathematics (CEMAT), Instituto Superior Técnico, Universidade Técnica de Lisboa (IST), Robust control of infinite dimensional systems and applications (CORIDA), Institut Élie Cartan de Nancy (IECN), Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de Mathématiques et Applications de Metz (LMAM), Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria), Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), CORIDA, Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est, and 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)-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)-Laboratoire de Mathématiques et Applications de Metz (LMAM)
Subjects: Mechanical Engineering, Rotation, Rigid body, Physics::Fluid Dynamics, Fluid particle, symbols.namesake, Mathematics (miscellaneous), Classical mechanics, Flow velocity, symbols, Fluid dynamics, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Ball (mathematics), Arch, Analysis, Lagrangian, Mathematics
Abstract: We study the limiting motion of a system of rigid ball moving in a Navier–Stokes fluid in ${\mathbb{R}^3}$ as the radius of the ball goes to zero. Recently, Dashti and Robinson solved this problem in the two-dimensional case, in the absence of rotation of the ball (Dashti and Robinson in Arch Rational Mech Anal 200:285–312, 2011). This restriction was caused by the difficulty in obtaining appropriate uniform bounds on the second order derivatives of the fluid velocity when the rigid body can rotate. In this paper, we show how to obtain the required uniform bounds on the velocity fields in the three- dimensional case. These estimates then allow us to pass to the zero limit of the ball radius and show that the solution of the coupled system converges to the solution of the Navier–Stokes equations describing the motion of only fluid in the whole space. The trajectory of the centre of the ball converges to a fluid particle trajectory, which justifies the use of rigid tracers for finding Lagrangian paths of fluid flow.
Published: 2013
Full Text: View/download PDF

10. Numerical observers with vanishing viscosity for the 1d wave equation

Author: Takéo Takahashi, Galina C. García, Departamento de Matemática y Ciencia de la Computación [Santiago de Chile] (DMCC), Robust control of infinite dimensional systems and applications (CORIDA), Institut Élie Cartan de Nancy (IECN), 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)-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)-Laboratoire de Mathématiques et Applications de Metz (LMAM), Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria), Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), CORIDA, Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de Mathématiques et Applications de Metz (LMAM), and Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Inria Nancy - Grand Est
Subjects: 35R30, 35L05, 65M06, Reconstruction algorithm, Discretization, Iterative method, Generalization, Applied Mathematics, Numerical observers, Mathematical analysis, Inverse problem, Wave equation, Space (mathematics), Computational Mathematics, Viscosity (programming), [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA], Mathematics
Abstract: We consider a numerical scheme associated with the iterative method developed in Ramdani et al. (ESAIM Control Optim. Calc. Var. 13(3):503---527, 2007) to recover initial conditions of conservative systems. In this method, the initial conditions are reconstructed by using observers. Here we use a finite-difference discretization in space of these observers and our aim is to prove estimates of the errors with respect to the mesh size and to the number of steps in the iterative method. This is done in the particular example of the 1d wave equation. In order to avoid restrictions of the number of steps with respect to the mesh size, we add a numerical viscosity in the numerical observers. A generalization for other equations is also given.
Published: 2013
Full Text: View/download PDF

11. Controllability and Time Optimal Control for Low Reynolds Numbers Swimmers

Author: Marius Tucsnak, Jean-François Scheid, Jérôme Lohéac, Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Robust control of infinite dimensional systems and applications (CORIDA), Institut Élie Cartan de Nancy (IECN), Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de Mathématiques et Applications de Metz (LMAM), Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria), CORIDA, 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)-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)-Laboratoire de Mathématiques et Applications de Metz (LMAM), and Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est
Subjects: 0209 industrial biotechnology, Computation, fluid-structure interaction, Perturbation (astronomy), 02 engineering and technology, controllability, 01 natural sciences, Three-dimensional space, symbols.namesake, 020901 industrial engineering & automation, Fluid–structure interaction, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], 0101 mathematics, Mathematics, Partial differential equation, Applied Mathematics, Mathematical analysis, Stokes equations, Reynolds number, 93C10, 93C20, 93C15, 93C73, 93C95, 76D07, 010101 applied mathematics, Controllability, time optimal control, Control system, symbols, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], low Reynolds number swimming
Abstract: International audience; The aim of this paper is to tackle the self-propelling at low Reynolds number by using tools coming from control theory. More precisely we first address the controllability problem: "Given two arbitrary positions, does it exist "controls" such that the body can swim from one position to another, with null initial and final deformations?". We consider a spherical object surrounded by a viscous incompressible fluid filling the remaining part of the three dimensional space. The object is undergoing radial and axi-symmetric deformations in order to propel itself in the fluid. Since we assume that the motion takes place at low Reynolds number, the fluid is governed by the Stokes equations. In this case, the governing equations can be reduced to a finite dimensional control system. By combining perturbation arguments and Lie brackets computations, we establish the controllability property. Finally we study the time optimal control problem for a simplified system. We derive the necessary optimality conditions by using the Pontryagin maximum principle. In several particular cases we are able to compute the explicit form of the time optimal control and to investigate the variation of optimal solutions with respect to the number of inputs.
Published: 2012
Full Text: View/download PDF

12. On the Stock Estimation for a Harvested Fish Population

Author: Diène Ngom, Aboudramane Guiro, Abderrahman Iggidr, Laboratoire d'Analyse Mathématique des Equations (LAME), Université Joseph Ki-Zerbo [Ouagadougou] (UJZK), Tools and models of nonlinear control theory for epidemiology and immunology (MASAIE), Laboratoire de Mathématiques et Applications de Metz (LMAM), Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM), Laboratoire d'Analyse Numérique et Informatique [Sénégal] (LANI), Université Gaston Berger de Saint-Louis Sénégal (UGB), Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est, and Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)
Subjects: 0209 industrial biotechnology, General Mathematics, Population Dynamics, Immunology, Population, Fisheries, 02 engineering and technology, Models, Biological, 01 natural sciences, General Biochemistry, Genetics and Molecular Biology, Observers, [SDV.EE.ECO]Life Sciences [q-bio]/Ecology, environment/Ecosystems, 020901 industrial engineering & automation, Control theory, Econometrics, Animals, 14. Life underwater, 0101 mathematics, education, Population dynamics of fisheries, Stock (geology), General Environmental Science, Mathematics, Pharmacology, education.field_of_study, Harvested Fish Population, Discrete time system, General Neuroscience, Fishes, 010101 applied mathematics, Nonlinear system, Computational Theory and Mathematics, Discrete-time systems, Stage structured population models, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], General Agricultural and Biological Sciences, Estimation
Abstract: We consider a stage-structured model of a harvested fish population and we are interested in the problem of estimating the unknown stock state for each class. The model used in this work to describe the dynamical evolution of the population is a discrete time system including a nonlinear recruitment relationship. To estimate the stock state, we build an observer for the considered fish model. This observer is an auxiliary dynamical system that uses the catch data over each time interval and gives a dynamical estimate of the stock state for each stage class. The observer works well even if the recruitment function in the considered model is not well known. The same problem for an age-structured model has been addressed in a previous work (Ngom et al., Math. Biosci. Eng. 5(2):337–354, 2008).
Published: 2011
Full Text: View/download PDF

13. Strong Solutions for a Phase Field Navier–Stokes Vesicle–Fluid Interaction Model

Author: Takéo Takahashi, Yuning Liu, Marius Tucsnak, Robust control of infinite dimensional systems and applications (CORIDA), Institut Élie Cartan de Nancy (IECN), 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)-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)-Laboratoire de Mathématiques et Applications de Metz (LMAM), Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria), 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), CORIDA, and Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Inria Nancy - Grand Est
Subjects: Field (physics), Navier-Stokes, Vesicle membrane, Navier–Stokes existence and smoothness, 01 natural sciences, 010305 fluids & plasmas, External flow, Physics::Fluid Dynamics, symbols.namesake, Phase field, Phase (matter), 0103 physical sciences, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Uniqueness, 0101 mathematics, Fluid vesicle interaction, Mathematical Physics, Mathematics, Applied Mathematics, 010102 general mathematics, Mathematical analysis, Eulerian path, Non-dimensionalization and scaling of the Navier–Stokes equations, Condensed Matter Physics, Computational Mathematics, Classical mechanics, symbols, Compressibility, 35Q30, 35Q35, 35D35, 76D03, 76D05, 76T10
Abstract: International audience; In this paper we study a mathematical model for the dynamics of vesicle membranes in a 3D incompressible viscous fluid. The system is in the Eulerian formulation, involving the coupling of the incompressible Navier-Stokes system with a phase field equation. This equation models the vesicle deformations under external flow fields. We prove the local in time existence and uniqueness of strong solutions. Moreover, we show that, given T > 0, for initial data which are small (in terms of T), these solutions are defined on [0, T] (almost global existence).
Published: 2011
Full Text: View/download PDF

14. Scenario-based testing from UML/OCL behavioral models

Author: Frédéric Dadeau, Kalou Cabrera Castillos, Jacques Julliand, Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC), Combination of approaches to the security of infinite states systems (CASSIS), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-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 Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est, Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)
Subjects: File system, Model-based testing, Java, Programming language, Computer science, 020207 software engineering, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], 02 engineering and technology, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.5: Testing and Debugging/D.2.5.7: Symbolic execution, computer.software_genre, Behavioral modeling, Unified Modeling Language, POSIX, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Regular expression, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.5: Testing and Debugging/D.2.5.8: Testing tools (e.g., data generators, coverage testing), Scenario testing, computer, Software, Information Systems, computer.programming_language
Abstract: International audience; We present in this article a way to produce test suites applied to the POSIX mini-challenge based on a behavioral model of a file system manager written in UML/OCL. We illustrate the limitations of a fully automated test generation approach, which justifies the use of test scenarios as a complement to a functional testing approach. Scenarios are expressed through regular expressions describing sequences of operations, possibly punctuated by intermediate states that have to be reached by the execution of the model. Scenarios are unfolded into extended sequences of operations that are played on the model using symbolic animation techniques. We experimented our approach by testing the conformance of two different file systems w.r.t. the POSIX standard: a recent Linux distribution and a customized Java implementation of POSIX used to evaluate the relevance of our approach and its complementarity with a structural test generation approach.
Published: 2011
Full Text: View/download PDF

15. Benchmarking of lightweight cryptographic algorithms for wireless IoT networks

Author: Soline Blanc, Abdelkader Lahmadi, Kévin Le Gouguec, Marine Minier, Lama Sleem, Resilience and Elasticity for Security and ScalabiliTy of dynamic networked systems (RESIST), 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 Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Airbus CyberSecurity SAS [Élancourt], Cryptology, arithmetic : algebraic methods for better algorithms (CARAMBA), and 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)
Subjects: Benchmarking, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Computer Networks and Communications, Internet of Things, Lightweight cryptography, Felics-AE, Electrical and Electronic Engineering, IoT-LAB, NIST LWC round 2 candidates, Information Systems
Abstract: International audience; Cryptographic algorithms that can provide both encryption and authentication are increasingly required in modern security architectures and protocols (e.g. TLS v1.3). Many authenticated encryption systems have been proposed in the past few years, which has resulted in several cryptanalysis research work. In this same direction, the National Institute of Standards and Technology (NIST) is coordinating a large effort to find a new standard authenticated encryption algorithm to be used by resource-constrained and limited devices. In this paper, 12 algorithms of the 33 candidates of the Round 2 phase from NIST competition are being benchmarked on a real IoT test-bed. These 33 ciphers implement authenticated encryption with associated data which aims at preserving integrity, privacy and authenticity at the same time. In this work, we ported the 12 algorithms to different hardware platforms (an x86_64 PC, an AVR ATmega128, an MSP430F1611 and the IoT-LAB platform) and make a fair comparison between their performance. We adapted these algorithms to the Contiki operating system to evaluate the latency and efficiency of each algorithm on IoT applications deployed on a national experimental platform which is IoT-LAB. In addition, we used the FELICS-AE benchmark to quantify locally the RAM, execution time and code size of each algorithm. In fact, this work provides practical results of their performance in an IoT scenario which pave the way for further research on other algorithms, platforms or OS.
Published: 2022
Full Text: View/download PDF

16. Reducing Equational Theories for the Decision of Static Equivalence

Author: Antoine Mercier, Steve Kremer, Ralf Treinen, Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Preuves, Programmes et Systèmes (PPS), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Anupam Datta, Combination of approaches to the security of infinite states systems (CASSIS), Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-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 Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-Université Paris Diderot - Paris 7 (UPD7), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), and Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est
Subjects: Theoretical computer science, Logical equivalence, Modulo, Bilinear interpolation, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Artificial Intelligence, ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, 0202 electrical engineering, electronic engineering, information engineering, Equivalence (formal languages), Axiom, Mathematics, Cryptographic primitive, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Bilinear pairing, 020206 networking & telecommunications, Cryptographic protocol, 16. Peace & justice, Formal methods, Algebra, Computational Theory and Mathematics, 010201 computation theory & mathematics, Algorithm, Software
Abstract: International audience; Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static equivalence modulo equational theories allows for a more accurate representation of cryptographic primitives by modelling properties of operators by equational axioms. We develop a method that allows us in some cases to simplify the task of deciding static equivalence in a multi-sorted setting, by removing a symbol from the term signature and reducing the problem to several simpler equational theories. We illustrate our technique at hand of bilinear pairings.
Published: 2010
Full Text: View/download PDF

17. Computing Knowledge in Security Protocols Under Convergent Equational Theories

Author: Ştefan Ciobâcă, Stéphanie Delaune, Steve Kremer, Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Security of information systems (SECSI), É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), Combination of approaches to the security of infinite states systems (CASSIS), Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)-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 Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), and Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Inria Nancy - Grand Est
Subjects: Cryptographic primitive, Theoretical computer science, business.industry, 0102 computer and information sciences, 02 engineering and technology, Decision problem, Cryptographic protocol, Formal methods, Encryption, 01 natural sciences, Term algebra, Undecidable problem, Decidability, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Computational Theory and Mathematics, 010201 computation theory & mathematics, Artificial Intelligence, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, business, Software, Computer Science::Cryptography and Security, Mathematics
Abstract: International audience; The analysis of security protocols requires reasoning about the knowledge an attacker acquires by eavesdropping on network traffic. In formal approaches, the messages exchanged over the network are modeled by a term algebra equipped with an equational theory axiomatizing the properties of the cryptographic primitives (e.g. encryption, signature). In this context, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems.\par We propose a procedure for both problems under arbitrary convergent equational theories. Since the underlying problems are undecidable we cannot guarantee termination. Nevertheless, our procedure terminates on a wide range of equational theories. In particular, we obtain a new decidability result for a theory we encountered when studying electronic voting protocols. We also provide a prototype implementation.
Published: 2010
Full Text: View/download PDF

18. A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems

Author: Véronique Cortier, Bogdan Warinschi, Steve Kremer, Combination of approaches to the security of infinite states systems (CASSIS), Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-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 Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-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), Computer Science Department [Bristol], University of Bristol [Bristol], ANR-07-SESU-0002,AVOTE,Analyse formelle de protocoles de vote électronique(2007), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est, Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)
Subjects: Theoretical computer science, Computer science, 0211 other engineering and technologies, Context (language use), Cryptography, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computational hardness assumption, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Artificial Intelligence, symbolic methods, Soundness, 021110 strategic, defence & security studies, Computational model, cryptography, Cryptographic primitive, business.industry, Probabilistic logic, security protocol, Cryptographic protocol, 16. Peace & justice, Computational Theory and Mathematics, 010201 computation theory & mathematics, computational analysis, Artificial intelligence, business, Software
Abstract: International audience; Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and probability. This approach captures a strong notion of security, guaranteed against all probabilistic polynomial-time attacks. The other approach relies on a symbolic model of protocol executions in which cryptographic primitives are treated as black boxes. Since the seminal work of Dolev and Yao, it has been realized that this latter approach enables significantly simpler and often automated proofs. However, the guarantees that it offers with respect to the more detailed computational models have been quite unclear. For more than twenty years the two approaches have coexisted but evolved mostly independently. Recently, significant research efforts attempt to develop paradigms for cryptographic systems analysis that combines the best of both worlds. There are two broad directions that have been followed. Computational soundness aims to establish sufficient conditions under which results obtained using symbolic models imply security under computational models. The direct approach aims to apply the principles and the techniques developed in the context of symbolic models directly to computational ones. In this paper we survey existing results along both of these directions. Our goal is to provide a rather complete summary that could act as a quick reference for researchers who want to contribute to the field, want to make use of existing results, or just want to get a better picture of what results already exist.
Published: 2010
Full Text: View/download PDF

19. Local exact controllability for Berger plate equation

Author: Marius Tucsnak, Nicolae Cîndea, Institut Élie Cartan de Nancy (IECN), 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), Robust control of infinite dimensional systems and applications (CORIDA), 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)-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)-Laboratoire de Mathématiques et Applications de Metz (LMAM), Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria), and Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est
Subjects: Berger equation, Control and Optimization, Controllability Gramian, Applied Mathematics, 010102 general mathematics, Mathematical analysis, 01 natural sciences, 010101 applied mathematics, Controllability, Nonlinear system, Control and Systems Engineering, Spectral criterium, Signal Processing, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Local exact controllability, 0101 mathematics, Plate equation, Nonlinear plate equation, Mathematics
Abstract: International audience; We study the exact controllability of a nonlinear plate equation by the means of a control which acts on an internal region of the plate. The main result asserts that this system is locally exactly controllable if the associated linear Euler-Bernoulli system is exactly controllable. In particular, for rectangular domains, we obtain that the Berger system is locally exactly controllable in arbitrarily small time and for every open and nonempty control region.
Published: 2009
Full Text: View/download PDF

20. What is the Optimal Shape of a Pipe?

Author: Antoine Henrot, Yannick Privat, Institut Élie Cartan de Nancy (IECN), 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), Robust control of infinite dimensional systems and applications (CORIDA), 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)-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)-Laboratoire de Mathématiques et Applications de Metz (LMAM), Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria), and Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Université Paul Verlaine - Metz (UPVM)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est
Subjects: Existential quantification, Navier-Stokes, Class (philosophy), 01 natural sciences, Domain (mathematical analysis), Physics::Fluid Dynamics, Mathematics - Analysis of PDEs, Mathematics (miscellaneous), primary: 49Q10, secondary: 49J20, 49K20, 35Q30, 76D05, 76D55, FOS: Mathematics, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Cylinder, Applied mathematics, Boundary value problem, 0101 mathematics, symmetry, Mathematics, Mechanical Engineering, 010102 general mathematics, State (functional analysis), 010101 applied mathematics, shape optimization, Compressibility, 49Q10 (Primary) 49J20, 49K20, 35Q30, 76D05, 76D55 (Secondary), Analysis, Energy (signal processing), Analysis of PDEs (math.AP)
Abstract: International audience; We consider an incompressible fluid in a three-dimensional pipe, following the Navier-Stokes system with classical boundary conditions. We are interested in the following question: is there any optimal shape for the criterion "energy dissipated by the fluid"? Moreover, is the cylinder the optimal shape? We prove that there exists an optimal shape in a reasonable class of admissible domains, but the cylinder is not optimal. For that purpose, we explicit the first order optimality condition, thanks to adjoint state and we prove that it is impossible that the adjoint state be a solution of this over-determined system when the domain is the cylinder. At last, we show some numerical simulations for that problem.
Published: 2009
Full Text: View/download PDF

21. Shape Sensitivity Analysis of a 2D Fluid–Structure Interaction Problem

Author: Valentin Calisti, Ilaria Lucardesi, Jean-François Scheid, Institute of Mathematics of the Czech Academy of Science (IM / CAS), Czech Academy of Sciences [Prague] (CAS), Dipartimento di Matematica e Informatica [Firenze] (DiMal), Università degli Studi di Firenze = University of Florence (UniFI), Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Systems with physical heterogeneities : inverse problems, numerical simulation, control and stabilization (SPHINX), Inria Nancy - Grand Est, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Control and Optimization, Applied Mathematics, Shape optimisation, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Fluid-structure system, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Management Science and Operations Research, Stokes and elasticity equations, Shape sensitivity
Abstract: We study the shape differentiability of a general functional depending on the solution of a bidimensional stationary Stokes–elasticity system with small loads, with respect to the reference domain of the elastic structure immersed in a viscous fluid. The differentiability with respect to reference elastic domain variations is considered under shape perturbations with diffeomorphisms. The shape derivative is then calculated with the use of the velocity method. This derivative involves the material derivatives of the solution of this fluid–structure interaction problem. The adjoint method is then used to obtain a simplified expression for the shape derivative.
Published: 2023
Full Text: View/download PDF

22. Safely composing security protocols

Author: Stéphanie Delaune, Véronique Cortier, Combination of approaches to the security of infinite states systems (CASSIS), Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-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 Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-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), ANR-05-SSIA-0009,FORMACRYPT,Preuves formelles et sémantique probabiliste en cryptographie(2005), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est, Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)
Subjects: Computer science, 0102 computer and information sciences, 02 engineering and technology, Computer security, computer.software_genre, 01 natural sciences, Security testing, Theoretical Computer Science, Public-key cryptography, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Security association, Universal composability, Secrecy, 0202 electrical engineering, electronic engineering, information engineering, Authentication, business.industry, Verification, 020207 software engineering, Cryptographic protocol, Computer security model, Security protocols, Security service, Symmetric-key algorithm, 010201 computation theory & mathematics, Hardware and Architecture, Security through obscurity, business, computer, Software, Composition
Abstract: International audience; Security protocols are small programs that are executed in hostile environments. Many results and tools have been developed to formally analyze the security of a protocol in the presence of an active attacker that may block, intercept and send new messages. However even when a protocol has been proved secure, there is absolutely no guarantee if the protocol is executed in an environment where other protocols are executed, possibly sharing some common keys like public keys or long-term symmetric keys. In this paper, we show that security of protocols can be easily composed. More precisely, we show that whenever a protocol is secure, it remains secure even in an environment where arbitrary protocols satisfying a reasonable (syntactic) condition are executed. This result holds for a large class of security properties that encompasses secrecy and various formulations of authentication.
Published: 2008
Full Text: View/download PDF

23. Object-Based Visual Camera Pose Estimation From Ellipsoidal Model and 3D-Aware Ellipse Prediction

Author: Gilles Simon, Berger Marie-Odile, Matthieu Zins, Recalage visuel avec des modèles physiquement réalistes (TANGRAM), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)
Subjects: FOS: Computer and information sciences, Ellipse Prediction, Ellipsoidal Model, Artificial Intelligence, Computer Vision and Pattern Recognition (cs.CV), Visual Localization, Pose from Objects, Computer Science - Computer Vision and Pattern Recognition, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], [INFO]Computer Science [cs], Computer Vision and Pattern Recognition, Software
Abstract: In this paper, we propose a method for initial camera pose estimation from just a single image which is robust to viewing conditions and does not require a detailed model of the scene. This method meets the growing need of easy deployment of robotics or augmented reality applications in any environments, especially those for which no accurate 3D model nor huge amount of ground truth data are available. It exploits the ability of deep learning techniques to reliably detect objects regardless of viewing conditions. Previous works have also shown that abstracting the geometry of a scene of objects by an ellipsoid cloud allows to compute the camera pose accurately enough for various application needs. Though promising, these approaches use the ellipses fitted to the detection bounding boxes as an approximation of the imaged objects. In this paper, we go one step further and propose a learning-based method which detects improved elliptic approximations of objects which are coherent with the 3D ellipsoids in terms of perspective projection. Experiments prove that the accuracy of the computed pose significantly increases thanks to our method. This is achieved with very little effort in terms of training data acquisition - a few hundred calibrated images of which only three need manual object annotation. Code and models are released at https://gitlab.inria.fr/tangram/3d-aware-ellipses-for-visual-localization, Comment: International Journal of Computer Vision (IJCV)
Published: 2022
Full Text: View/download PDF

24. Strong Approximation of Bessel Processes

Author: Deaconu, Madalina, Herrmann, Samuel, Processus aléatoires spatio-temporels et leurs applications (PASTA), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Institut de Mathématiques de Bourgogne [Dijon] (IMB), Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université de Bourgogne (UB), ANR-19-CE40-0023,PERISTOCH,Phénomènes périodiques dans les systèmes stochastiques(2019), and Université de Bourgogne (UB)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)
Subjects: path simulation, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], Statistics and Probability, Bessel process, Brownian exit time, General Mathematics, Probability (math.PR), FOS: Mathematics, 2010 AMS subject classifications: primary 65C05, secondary 60J60, 60J25, 60G17, 60G50, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), Strong approximation, Mathematics - Probability
Abstract: We consider the path approximation of Bessel processes and develop a new and efficient algorithm. This study is based on a recent work by the authors, on the path approximation of the Brownian motion, and on the construction of specific own techniques. It is part of the family of the so-called $\varepsilon$-strong approximations. More precisely, our approach constructs jointly the sequences of exit times and corresponding exit positions of some well-chosen domains, the construction of these domains being an important step. Based on this procedure, we emphasize an algorithm which is easy to implement. Moreover, we can develop the method for any dimension. We treat separately the integer dimension case and the non integer framework, each situation requiring appropriate techniques. In particular, for both situations, we show the convergence of the scheme and provide the control of the efficiency with respect to the small parameter $\varepsilon$. We expand the theoretical part by a series of numerical developments.
Published: 2023
Full Text: View/download PDF

25. Covering families of triangles

Author: Otfried Cheong, Olivier Devillers, Marc Glisse, Ji-won Park, Department of Computer Science [KAIST] (CS), Korea Advanced Institute of Science and Technology (KAIST), Geometric Algorithms and Models Beyond the Linear and Euclidean realm (GAMBLE ), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Understanding the Shape of Data (DATASHAPE), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria), and ANR-17-CE40-0017,ASPAG,Analyse et Simulation Probabilistes des Algorithmes Géométriques(2017)
Subjects: General Mathematics, Computer Science::Computational Geometry, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Abstract: A cover for a family $${{\mathcal {F}}}$$ F of sets in the plane is a set into which every set in $${{\mathcal {F}}}$$ F can be isometrically moved. We are interested in the convex cover of smallest area for a given family of triangles. Park and Cheong conjectured that any family of triangles of bounded diameter has a smallest convex cover that is itself a triangle. The conjecture is equivalent to the claim that for every convex set $${{\mathcal {X}}}$$ X there is a triangle Z whose area is not larger than the area of $${{\mathcal {X}}}$$ X , such that Z covers the family of triangles contained in $${{\mathcal {X}}}$$ X . We prove this claim for the case where a diameter of $${{\mathcal {X}}}$$ X lies on its boundary. We also give a complete characterization of the smallest convex cover for the family of triangles contained in a half-disk, and for the family of triangles contained in a square. In both cases, this cover is a triangle.
Published: 2023
Full Text: View/download PDF

26. Invert emulsions alleviate biotic interactions in bacterial mixed culture

Author: Alexis Dijamentiuk, Cécile Mangavel, Annelore Elfassy, Florentin Michaux, Jennifer Burgain, Emmanuel Rondags, Stéphane Delaunay, Sandie Ferrigno, Anne-Marie Revol-Junelles, Frédéric Borges, Laboratoire d'Ingénierie des Biomolécules (LIBio), Université de Lorraine (UL), Laboratoire Réactions et Génie des Procédés (LRGP), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Biology, genetics and statistics (BIGS), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Institut Élie Cartan de Lorraine (IECL), and Carnot Institute Icéel
Subjects: Diversity, Competition, [SDV]Life Sciences [q-bio], Microbial community, Invert emulsion, Bioengineering, Co-culture system, Mixed culture, Applied Microbiology and Biotechnology, Biotechnology
Abstract: The large application potential of microbiomes has led to a great need for mixed culture methods. However, microbial interactions can compromise the maintenance of biodiversity during cultivation in a reactor. In particular, competition among species can lead to a strong disequilibrium in favor of the fittest microorganism. In this study, an invert emulsion system was designed by dispersing culture medium in a mixture of sunflower oil and the surfactant PGPR. Confocal laser scanning microscopy revealed that this system allowed to segregate microorganisms in independent droplets. Granulomorphometric analysis showed that the invert emulsion remains stable during at least 24 h, and that the introduction of bacteria did not have a significant impact on the structure of the invert emulsion. A two-strain antagonistic model demonstrated that this invert emulsion system allows the propagation of two strains without the exclusion of the less-fit bacterium. The monitoring of single-strain cultures of bacteria representative of a cheese microbiota revealed that all but Brevibacterium linens were able to grow. A consortium consisting of Lactococcus lactis subsp. lactis biovar diacetylactis, Streptococcus thermophilus, Leuconostoc mesenteroides, Staphylococcus xylosus, Lactiplantibacillus plantarum and Carnobacterium maltaromaticum was successfully cultivated without detectable biotic interactions. Metabarcoding analysis revealed that the system allowed a better maintenance of alpha diversity and produced a propagated bacterial consortium characterized by a structure closer to the initial state compared to non-emulsified medium. This culture system could be an important tool in the field of microbial community engineering.
Published: 2023
Full Text: View/download PDF

27. Improving automatic GO annotation with semantic similarity

Author: Bishnu Sarker, Navya Khare, Marie-Dominique Devignes, Sabeur Aridhi, School of Applied Computational Sciences, Meharry Medical College, Nashville, TN, USA, Computational Algorithms for Protein Structures and Interactions (CAPSID), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Complex Systems, Artificial Intelligence & Robotics (LORIA - AIS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), 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: GrAPFI, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], K‑nearest neighbor, Applied Mathematics, Computational Biology, Proteins, Molecular Sequence Annotation, Label propagation, Biochemistry, Semantics, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Computer Science Applications, Domain similarity network, Gene Ontology, Semantic similarity, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Structural Biology, Protein function annotation, Humans, Gene ontology annotation, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Databases, Protein, Molecular Biology
Abstract: BackgroundAutomatic functional annotation of proteins is an open research problem in bioinformatics. The growing number of protein entries in public databases, for example in UniProtKB, poses challenges in manual functional annotation. Manual annotation requires expert human curators to search and read related research articles, interpret the results, and assign the annotations to the proteins. Thus, it is a time-consuming and expensive process. Therefore, designing computational tools to perform automatic annotation leveraging the high quality manual annotations that already exist in UniProtKB/SwissProt is an important research problemResultsIn this paper, we extend and adapt the GrAPFI (graph-based automatic protein function inference) (Sarker et al. in BMC Bioinform 21, 2020; Sarker et al., in: Proceedings of 7th international conference on complex networks and their applications, Cambridge, 2018) method for automatic annotation of proteins with gene ontology (GO) terms renaming it as GrAPFI-GO. The original GrAPFI method uses label propagation in a similarity graph where proteins are linked through the domains, families, and superfamilies that they share. Here, we also explore various types of similarity measures based on common neighbors in the graph. Moreover, GO terms are arranged in a hierarchical manner according to semantic parent–child relations. Therefore, we propose an efficient pruning and post-processing technique that integrates both semantic similarity and hierarchical relations between the GO terms. We produce experimental results comparing the GrAPFI-GO method with and without considering common neighbors similarity. We also test the performance of GrAPFI-GO and other annotation tools for GO annotation on a benchmark of proteins with and without the proposed pruning and post-processing procedure.ConclusionOur results show that the proposed semantic hierarchical post-processing potentially improves the performance of GrAPFI-GO and of other annotation tools as well. Thus, GrAPFI-GO exposes an original efficient and reusable procedure, to exploit the semantic relations among the GO terms in order to improve the automatic annotation of protein functions
Published: 2022
Full Text: View/download PDF

28. Transcritical Bifurcation for the Conditional Distribution of a Diffusion Process

Author: Michel Benaïm, Nicolas Champagnat, William Oçafrain, Denis Villemonais, Institut de Mathematiques Universite de Neuchatel, Université de Neuchâtel (UNINE), Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Biology, genetics and statistics (BIGS), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Élie Cartan de Lorraine (IECL), and 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-PR]Mathematics [math]/Probability [math.PR], Statistics and Probability, General Mathematics, Probability (math.PR), FOS: Mathematics, Statistics, Probability and Uncertainty, Nonlinear Sciences::Pattern Formation and Solitons, Mathematics - Probability
Abstract: International audience; In this article, we describe a simple class of models of absorbed diffusion processes with parameter, whose conditional law exhibits a transcritical bifurcation. Our proofs are based on the description of the set of quasi-stationary distributions for general two-clusters reducible processes.
Published: 2022
Full Text: View/download PDF

29. Utterance partitioning for speaker recognition: an experimental review and analysis with new findings under GMM-SVM framework

Author: Hemant A. Patil, Nirmalya Sen, Krothapalli Sreenivasa Rao, T. K. Basu, Shyamal Kumar Das Mandal, Md. Sahidullah, R. H. Sapat College of Engineering Management Studies & Research, Speech Modeling for Facilitating Oral-Based Communication (MULTISPEECH), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Dhirubhai Ambani Institute of Information and Communication Technology (DA-IICT), Indian Institute of Technology Kharagpur (IIT Kharagpur), 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: Signal Processing (eess.SP), FOS: Computer and information sciences, Computer Science - Machine Learning, Linguistics and Language, Boosting (machine learning), Computer science, Speech recognition, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, 02 engineering and technology, Speaker Recognition, Language and Linguistics, Machine Learning (cs.LG), 030507 speech-language pathology & audiology, 03 medical and health sciences, GMM-UMB Classifier, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, Classifier (linguistics), FOS: Electrical engineering, electronic engineering, information engineering, 0202 electrical engineering, electronic engineering, information engineering, Electrical Engineering and Systems Science - Signal Processing, Duration (project management), Short Test Utterance, Perspective (graphical), 020206 networking & telecommunications, Speaker recognition, Mixture model, GMM-SVM Classifier, Human-Computer Interaction, Support vector machine, ComputingMethodologies_PATTERNRECOGNITION, Utterance Partitioning, Duration Variability, Computer Vision and Pattern Recognition, 0305 other medical science, Software, Utterance
Abstract: The performance of speaker recognition system is highly dependent on the amount of speech used in enrollment and test. This work presents a detailed experimental review and analysis of the GMM-SVM based speaker recognition system in presence of duration variability. This article also reports a comparison of the performance of GMM-SVM classifier with its precursor technique Gaussian mixture model-universal background model (GMM-UBM) classifier in presence of duration variability. The goal of this research work is not to propose a new algorithm for improving speaker recognition performance in presence of duration variability. However, the main focus of this work is on utterance partitioning (UP), a commonly used strategy to compensate the duration variability issue. We have analysed in detailed the impact of training utterance partitioning in speaker recognition performance under GMM-SVM framework. We further investigate the reason why the utterance partitioning is important for boosting speaker recognition performance. We have also shown in which case the utterance partitioning could be useful and where not. Our study has revealed that utterance partitioning does not reduce the data imbalance problem of the GMM-SVM classifier as claimed in earlier study. Apart from these, we also discuss issues related to the impact of parameters such as number of Gaussians, supervector length, amount of splitting required for obtaining better performance in short and long duration test conditions from speech duration perspective. We have performed the experiments with telephone speech from POLYCOST corpus consisting of 130 speakers., International Journal of Speech Technology, Springer Verlag, In press
Published: 2021
Full Text: View/download PDF

30. Optimal Immunity Control and Final Size Minimization by Social Distancing for the SIR Epidemic Model

Author: Nicolas Vauchelet, Michel Duprez, Yannick Privat, Pierre-Alexandre Bliman, Modelling and Analysis for Medical and Biological Applications (MAMBA), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jacques-Louis Lions (LJLL (UMR_7598)), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Computational Anatomy and Simulation for Medicine (MIMESIS), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)-École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS), Institut de Recherche Mathématique Avancée (IRMA), Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Analyse, Géométrie et Applications (LAGA), Université Paris 8 Vincennes-Saint-Denis (UP8)-Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)
Subjects: Mathematical optimization, Control and Optimization, 49K15, 49J15, SIR epidemic model, Interval (mathematics), Management Science and Operations Research, 93C15, 01 natural sciences, Article, 010104 statistics & probability, 03 medical and health sciences, 92D30, herd immunity, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Uniqueness, Limit (mathematics), 0101 mathematics, SIMPLE algorithm, 030304 developmental biology, Mathematics, 0303 health sciences, Applied Mathematics, Optimal control, epidemic final size, 34H05, lockdown policy, Theory of computation, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Minification, Epidemic model
Abstract: International audience; The aim of this article is to understand how to apply partial or total containment to SIR epidemic model during a given finite time interval in order to minimize the epidemic final size, that is the cumulative number of cases infected during the complete course of an epidemic. The existence and uniqueness of an optimal strategy is proved for this infinite-horizon problem and a full characterization of the solution is provided. The best policy consists in applying the maximal allowed social distancing effort until the end of the interval, starting at a date that is not always the closest date and may be found by a simple algorithm. Both theoretical results and numerical simulations demonstrate that it leads to a significant decrease of the epidemic final size. We show that in any case the optimal intervention has to begin before the number of susceptible cases has crossed the herd immunity level, and that its limit is always smaller than this threshold. This problem is also shown to be equivalent to the minimum containment time necessary to stop at a given distance after this threshold value.
Published: 2021
Full Text: View/download PDF

31. A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties

Author: Stéphanie Delaune, Véronique Cortier, Vaishnavi Sundararajan, Proof techniques for security protocols (PESTO), 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 Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), 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), Security & PrIvaCY (SPICY), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), 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)-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), The research leading to these results has received funding from the European Research Council under the European Union’s horizon 2020 research and innovation program (ERC grant agreement n◦ 714955-POPSTAR and ERC grant agreement n◦ 645865-SPOOC), as well as from the French National Research Agency (ANR) under the project TECAP., ANR-17-CE39-0004,TECAP,Analyse de protocoles - unir les outils existants(2017), European Project: 714955,H2020,ERC-2016-STG,ERC-POPSTAR(2017), European Project: 645865,H2020 ERC,ERC-2014-CoG,SPOOC(2015), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), and Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique)
Subjects: Theoretical computer science, Cryptographic primitive, Computer science, business.industry, Verification, Privacy properties, 020207 software engineering, 0102 computer and information sciences, 02 engineering and technology, Cryptographic protocol, Encryption, 01 natural sciences, Security protocols, Decidability, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Dependency graph, Computational Theory and Mathematics, 010201 computation theory & mathematics, Artificial Intelligence, Reachability, 0202 electrical engineering, electronic engineering, information engineering, Equivalence (formal languages), business, Software, Cryptographic nonce
Abstract: International audience; We identify a new decidable class of security protocols, both for reachability and equivalence properties. Our result holds for an unbounded number of sessions and for protocols with nonces. It covers all standard cryptographic primitives. Our class sets up three main assumptions. (i) Protocols need to be "simple", meaning that an attacker can precisely identify from which participant and which session a message originates from. We also consider protocols with no else branches (only positive test). (ii) Protocols should be type-compliant, which is intuitively guaranteed as soon as two encrypted messages of the protocol cannot be confused. (iii) Finally, we define the notion of a dependency graph, which, given a protocol, characterises how actions depend on the other ones (both sequential dependencies and data dependencies are taken into account). Whenever the graph is acyclic, then the protocol falls into our class. We show that many protocols of the literature belong to our decidable class, including for example some of the protocols embedded in the biometric passport.
Published: 2020
Full Text: View/download PDF

32. A recommendation system for car insurance

Author: Laurent Lesage, Jorge Augusto Meira, Antoine Lejay, Radu State, Geoffrey Nichil, Madalina Deaconu, Foyer Assurances [Leudelange], University of Luxembourg [Luxembourg], Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Interdisciplinary Centre for Security, Reliability and Trust [Luxembourg] (SnT), Université du Luxembourg (Uni.lu), Processus aléatoires spatio-temporels et leurs applications (PASTA), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Foyer Assurances, leader of individual and professional insurance in Luxembourg.Project number 13659700, Luxembourgish National Research Fund (FNR)., TO Simulate and CAlibrate stochastic models (TOSCA), and Inria Sophia Antipolis - Méditerranée (CRISAM)
Subjects: Statistics and Probability, Economics and Econometrics, Apriori algorithm, Cover (telecommunications), Computer science, media_common.quotation_subject, Up-selling, Context (language use), Recommender system, Machine learning, computer.software_genre, 01 natural sciences, 010104 statistics & probability, Recommendation system, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], Originality, 0502 economics and business, 0101 mathematics, Financial services, media_common, 050208 finance, business.industry, Mathematical finance, 05 social sciences, Construct (python library), [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], XGBoost algorithm, Artificial intelligence, Statistics, Probability and Uncertainty, Car insurance, business, computer
Abstract: International audience; We construct a recommendation system for car insurance, to allow agents to optimize up-selling performances, by selecting customers who are most likely to subscribe an additional cover. The originality of our recommendation system is to be suited for the insurance context. While traditional recommendation systems, designed for online platforms (e.g. e-commerce, videos), are constructed on huge datasets and aim to sug- gest the next best offer, insurance products have specific properties which imply that we must adopt a different approach. Our recommendation system combines the XGBoost algorithm and the Apriori algorithm to choose which customer should be recommended and which cover to rec- ommend, respectively. It has been tested in a pilot phase of around 150 recommendations, which shows that the approach outperforms standard results for similar up-selling campaigns.Recommendation system Up-selling Car insurance XGBoost algorithm Apriori algorithm
Published: 2020
Full Text: View/download PDF

33. Stabilization of a rigid body moving in a compressible viscous fluid

Author: Takéo Takahashi, Arnab Roy, Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Systems with physical heterogeneities : inverse problems, numerical simulation, control and stabilization (SPHINX), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and Takahashi, Takéo
Subjects: Viscous liquid, 01 natural sciences, Damper, Mathematics - Analysis of PDEs, Mathematics (miscellaneous), Position (vector), Fluid-structure interaction, Fluid–structure interaction, FOS: Mathematics, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Ball (mathematics), [MATH.MATH-AP] Mathematics [math]/Analysis of PDEs [math.AP], 0101 mathematics, Mathematics, 010102 general mathematics, Mathematical analysis, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], Rigid body, MSC : 35Q35, 35D30, 35D35, 35R37, 76N10, 93D15, 93D20, compressible Navier-Stokes system, stabilization, 010101 applied mathematics, Spring (device), Compressibility, global solutions, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Analysis of PDEs (math.AP)
Abstract: We consider the stabilizability of a fluid-structure interaction system where the fluid is viscous and compressible and the structure is a rigid ball. The feedback control of the system acts on the ball and corresponds to a force that would be produced by a spring and a damper connecting the center of the ball to a fixed point $$h_1$$ . We prove the global-in-time existence of strong solutions for the corresponding system under a smallness condition on the initial velocities and on the distance between the initial position of the center of the ball and $$h_1$$ . Then, we show with our feedback law, that the fluid and the structure velocities go to 0 and that the center of the ball goes to $$h_1$$ as $$t\rightarrow \infty $$ .
Published: 2020
Full Text: View/download PDF

34. A tutorial on elementary cellular automata with fully asynchronous updating

Author: Nazim Fatès, Designing the Future of Computational Models (MOCQUA), 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 Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Theoretical computer science, Markov chain, Computer science, Open problem, Complex system, 0102 computer and information sciences, 02 engineering and technology, Fixed point, 01 natural sciences, Computer Science Applications, Elementary cellular automaton, 010201 computation theory & mathematics, Asynchronous communication, Convergence (routing), Theory of computation, 0202 electrical engineering, electronic engineering, information engineering, [NLIN.NLIN-CG]Nonlinear Sciences [physics]/Cellular Automata and Lattice Gases [nlin.CG], 020201 artificial intelligence & image processing
Abstract: International audience; We present a picture of the convergence properties of the 256 Elementary Cellular Automata under the fully asynchronous updating , that is, when only one cell is updated at each time step. We regroup here the results which have been presented in different articles and expose a full analysis of the behaviour of finite systems with periodic boundary conditions. Our classification relies on the scaling properties of the average convergence time to a fixed point. We observe that different scaling laws can be found, which fall in one of the following classes: logarithmic, linear, quadratic, exponential and non-converging. The techniques for quantifying this behaviour rely mainly on Markov chain theory and martingales. Most behaviours can be studied analytically but there are still many rules for which obtaining a formal characterisation of their convergence properties is still an open problem.
Published: 2020
Full Text: View/download PDF

35. Towards Criteria Characterizing the Metrological Performance of Full-field Measurement Techniques

Author: Jan Neggers, Michel Grédiac, Frédéric Sur, Benoît Blaysat, Institut Pascal (IP), SIGMA Clermont (SIGMA Clermont)-Université Clermont Auvergne [2017-2020] (UCA [2017-2020])-Centre National de la Recherche Scientifique (CNRS), Laboratoire de mécanique et technologie (LMT), Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), 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), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Visual Augmentation of Complex Environments (MAGRIT), and ANR-18-CE08-0028,ICAReS,Corrélation d'image virtuelles pour la mesure précise des contraintes résiduelles(2018)
Subjects: Digital image correlation, Computer science, Mechanical Engineering, Aerospace Engineering, Metrological performance, 02 engineering and technology, Resolution (logic), 021001 nanoscience & nanotechnology, Finite element method, Global DIC, Metrology, 020303 mechanical engineering & transports, Quadratic equation, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, 0203 mechanical engineering, Mechanics of Materials, [SPI.MECA.MEMA]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Mechanics of materials [physics.class-ph], Local DIC, Metrological efficiency indicator, Invariant (mathematics), 0210 nano-technology, Image resolution, Algorithm, Level of detail
Abstract: International audience; Users of full-field measurement methods like Digital Image Correlation (DIC) often aim to perform measurements with the best trade-off between spatial resolution, bias and measurement resolution. Whenever two full-field methods are compared, it is essential that these criteria are taken into consideration. Recently a metrological efficiency indicator for full-field measurements has been proposed and discussed. This indicator combines measurement resolution and spatial resolution. It has been shown to be invariant to the subset size in the case of Local DIC. The goal of this article is to discuss a method, which determines both the spatial and the measurement resolutions for a given bias for two different DIC methods, in order to obtain the metrological efficiency indicator for each of these methods. The benefit of this indicator is that it does not depend on setting parameters such as the subset size, which are chosen by the user. As such, it can be considered as intrinsic to each technique, thus enabling fair comparison. Local DIC and triangular finite element based Global DIC will be the subject of this investigation. With this setting, their respective subset and triangular element sizes will be related to the spatial resolution of both methods for a given acceptable bias. By using the metrological efficiency indicator, the performance of the two methods will be compared and discussed to a new level of detail. Generally speaking, the indicator shows that the metrological performance of both methods is similar, confirming their popularity. However, it will be shown that, depending on the choice of what an acceptable bias is, one of the method may be preferred to another. The results show that for the specific DIC versions used in the study, for cases for which a significant bias is acceptable, Local DIC outperforms Global DIC, while the opposite is true in the case for which the bias requirements are more stringent. Finally, the quadratic versions of both DIC versions are shown to significantly outperform their respective linear versions.
Published: 2020
Full Text: View/download PDF

36. $$L^{p}$$ Theory for the Interaction Between the Incompressible Navier–Stokes System and a Damped Plate

Author: Takéo Takahashi, Debayan Maity, Center for Applicable Mathematics [Bangalore] (TIFR-CAM), Tata Institute for Fundamental Research (TIFR), Systems with physical heterogeneities : inverse problems, numerical simulation, control and stabilization (SPHINX), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Institut Élie Cartan de Lorraine (IECL), and Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Incompressible Navier-Stokes System, Physics, Change of variables, AMS subject classifications. 35Q35, 76D03, 76D05, 74F1, Applied Mathematics, Operator (physics), 010102 general mathematics, Linear system, Mathematical analysis, Boundary (topology), Fixed point, Condensed Matter Physics, 01 natural sciences, Action (physics), Physics::Fluid Dynamics, 010101 applied mathematics, Computational Mathematics, Fluid-structure interaction, Fluid–structure interaction, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Maximal Lp regularity, Uniqueness, 0101 mathematics, Strong solutions, Mathematical Physics
Abstract: International audience; We consider a viscous incompressible fluid governed by the Navier-Stokes system written in a domain where a part of the boundary is moving as a damped beam under the action of the fluid. We prove the existence and uniqueness of global strong solutions for the corresponding fluid-structure interaction system in an Lp-Lq setting. The main point in the proof consists in the study of a linear parabolic system coupling the non stationary Stokes system and a damped beam. We show that this linear system possesses the maximal regularity property by proving the R-sectoriality of the corresponding operator. The proof of the main results is then obtained by an appropriate change of variables to handle the free boundary and a fixed point argument to treat the nonlinearities of this system.
Published: 2021
Full Text: View/download PDF

37. Multimodal dataset of real-time 2D and static 3D MRI of healthy French speakers

Author: Ioannis Douros, Yves Laprie, Pierre-André Vuissoz, Jacques Felblinger, Karyna Isaieva, Justine Leclere, Imagerie Adaptative Diagnostique et Interventionnelle (IADI), Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lorraine (UL), Speech Modeling for Facilitating Oral-Based Communication (MULTISPEECH), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Centre Hospitalier Universitaire de Reims (CHU Reims), Centre d'Investigation Clinique - Innovation Technologique [Nancy] (CIC-IT), Centre d'investigation clinique [Nancy] (CIC), Centre Hospitalier Régional Universitaire de Nancy (CHRU Nancy)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lorraine (UL)-Centre Hospitalier Régional Universitaire de Nancy (CHRU Nancy)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lorraine (UL), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), and Isaieva, Karyna
Subjects: Adult, Male, Statistics and Probability, Data Descriptor, Oral anatomy, Speech production, Computer science, Science, Speech recognition, Context (language use), Library and Information Sciences, 01 natural sciences, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], 030218 nuclear medicine & medical imaging, Education, Young Adult, 03 medical and health sciences, Imaging, Three-Dimensional, 0302 clinical medicine, Vocal tract images, 0103 physical sciences, Humans, Speech, Segmentation, Articulatory gestures, 010301 acoustics, Language, [SDV.IB] Life Sciences [q-bio]/Bioengineering, Communication, Middle Aged, Magnetic Resonance Imaging, Computer Science Applications, Metadata, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], Female, [SDV.IB]Life Sciences [q-bio]/Bioengineering, France, Statistics, Probability and Uncertainty, Mr images, Articulation (phonetics), Vocal tract, Information Systems
Abstract: The study of articulatory gestures has a wide spectrum of applications, notably in speech production and recognition. Sets of phonemes, as well as their articulation, are language-specific; however, existing MRI databases mostly include English speakers. In our present work, we introduce a dataset acquired with MRI from 10 healthy native French speakers. A corpus consisting of synthetic sentences was used to ensure a good coverage of the French phonetic context. A real-time MRI technology with temporal resolution of 20 ms was used to acquire vocal tract images of the participants speaking. The sound was recorded simultaneously with MRI, denoised and temporally aligned with the images. The speech was transcribed to obtain phoneme-wise segmentation of sound. We also acquired static 3D MR images for a wide list of French phonemes. In addition, we include annotations of spontaneous swallowing., Measurement(s)Vocal tract images • SpeechTechnology Type(s)Magnetic Resonance Imaging • Microphone DeviceSample Characteristic - OrganismHomo sapiens Machine-accessible metadata file describing the reported data: 10.6084/m9.figshare.16404453
Published: 2021
Full Text: View/download PDF

38. View synthesis for pose computation

Author: Frédéric Sur, Marie-Odile Berger, Pierre Rolin, 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), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)
Subjects: feature matching, Computer science, Computation, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, 3d model, 02 engineering and technology, RANSAC, pose estimation, 0202 electrical engineering, electronic engineering, information engineering, Computer vision, Pose, business.industry, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], 020207 software engineering, Invariant (physics), Computer Science Applications, View synthesis, view synthesis, Hardware and Architecture, 020201 artificial intelligence & image processing, Computer Vision and Pattern Recognition, Artificial intelligence, business, Software, Feature matching
Abstract: International audience; Geometrical registration of a query image with respect to a 3D model, or pose estimation, is the cornerstone of many computer vision applications. It is often based on the matching of local photometric descriptors invariant to limited viewpoint changes. However, when the query image has been acquired from a camera position not covered by the model images, pose estimation is often not accurate and sometimes even fails, precisely because of the limited invariance of descriptors. In this paper, we propose to add descriptors to the model, obtained from synthesized views associated with virtual cameras completing the covering of the scene by the real cameras. We propose an efficient strategy to localize the virtual cameras in the scene and generate valuable descriptors from synthetic views. We also discuss a guided sampling strategy for registration in this context. Experiments show that the accuracy of pose estimation is dramatically improved when large viewpoint changes makes the matching of classic descriptors a challenging task.
Published: 2019
Full Text: View/download PDF

39. Slopes of Multidimensional Subshifts

Author: Etienne Moutot, Pascal Vanier, Emmanuel Jeandel, Designing the Future of Computational Models (MOCQUA), 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 Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Modèles de calcul, Complexité, Combinatoire (MC2), Laboratoire de l'Informatique du Parallélisme (LIP), Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon), University of Turku, Laboratoire d'Algorithmique Complexité et Logique (LACL), Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12), This work was supported by grants TARMAC ANR-12-BS02-007-01 and CoCoGro ANR-16-CE40-0005., ANR-16-CE40-0005,CoCoGro,Calculabilité et combinatoire en dynamique symbolique sur des groupes.(2016), ANR-12-BS02-0007,TARMAC,Théorie des algorithmes : machines, complétude, axiomatisation et contraintes physiques(2012), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), and Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL)
Subjects: computability, Physics, Pure mathematics, Mathematics::Dynamical Systems, SFTs, Mathematics::Operator Algebras, Computability, 010102 general mathematics, Sigma, 02 engineering and technology, slopes, periodicity, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Subshift of finite type, 01 natural sciences, Theoretical Computer Science, Computational Theory and Mathematics, Computer Science::Discrete Mathematics, Theory of computation, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, 0101 mathematics, Computer Science::Formal Languages and Automata Theory
Abstract: In this paper we study the directions of periodicity of multidimensional subshifts of finite type (SFTs) and of multidimensional effectively closed and sofic subshifts. A configuration of a subshift has a slope of periodicity if it is periodic in exactly one direction, the slope representing that direction. In this paper, we prove that ${{\Sigma }^{0}_{1}}$ sets of non-commensurable $\mathbb {Z}^{2}$ vectors are exactly the sets of slopes of 2D SFTs and that ${{\Sigma }^{0}_{2}}$ sets of non-commensurable vectors are exactly the sets of slopes of 3D SFTs, and exactly the sets of slopes of 2D and 3D sofic and effectively closed subshifts.
Published: 2019
Full Text: View/download PDF

40. Force classification during robotic interventions through simulation-trained neural networks

Author: Stéphane Cotin, Raphael Sznitman, Andrea Mendizabal, Computational Anatomy and Simulation for Medicine (MIMESIS), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)-École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS), Center for Biomedical Engineering Research (ARTORG), University of Bern, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: genetic structures, Swine, Computer science, Bayesian inference, 02 engineering and technology, Diagnostic Techniques, Ophthalmological, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], 030218 nuclear medicine & medical imaging, Machine Learning, 0302 clinical medicine, Robotic Surgical Procedures, Image Processing, Computer-Assisted, Computer vision, 610 Medicine & health, Artificial neural networks, medicine.diagnostic_test, Artificial neural network, General Medicine, Computer Graphics and Computer-Aided Design, Finite element method, Computer Science Applications, Sclera, medicine.anatomical_structure, Intravitreal Injections, Computer Vision and Pattern Recognition, Tomography, Optical Coherence, 0206 medical engineering, Biomedical Engineering, Health Informatics, 03 medical and health sciences, Optical coherence tomography, medicine, Animals, Humans, Computer Simulation, Radiology, Nuclear Medicine and imaging, Finite element modeling, Mechanical Phenomena, Computer simulation, business.industry, Reproducibility of Results, Bayes Theorem, Models, Theoretical, 620 Engineering, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, 020601 biomedical engineering, eye diseases, Range (mathematics), Force estimation in robotics, Control system, Surgery, Neural Networks, Computer, sense organs, Artificial intelligence, business
Abstract: International audience; Intravitreal injection is among the most frequent treatment strategies for chronic ophthalmic diseases. The last decade has seen a serious increase in the number of intravitreal injections, and with it, adverse effects and drawbacks. To tackle these problems, medical assistive devices for robotized injections have been suggested and are projected to enhance delivery mechanisms for a new generation of pharmacological solutions. In this paper, we present a method aimed at improving the safety characteristics of upcoming robotic systems. Our vision-based method uses a combination of 2D OCT data, numerical simulation and machine learning to classify the range of the force applied by an injection needle on the sclera. We design a Neural Network (NN) to classify force ranges from Optical Coherence Tomography (OCT) images of the sclera directly. To avoid the need for large real data sets, the network is trained on images of simulated deformed sclera. This simulation is based on a finite element method and the model is parameterized using a Bayesian filter applied to observations of the deformation in OCT images. We validate our approach on real OCT data collected on five ex vivo porcine eyes using a robotically-guided needle. The thorough parameterization of the simulations leads to a very good agreement between the virtually generated samples used to train the network and the real OCT acquisitions. Results show that the applied force range on real data can be predicted with 93% accuracy. Through a simulation-trained neural network, our approach estimates the force range applied by a robotically guided needle on the sclera based solely on a single OCT slice of the deformed sclera. Being real-time, this solution can be integrated in the control loop of the system, permitting the prompt withdrawal of the needle for safety reasons.
Published: 2019
Full Text: View/download PDF

41. 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
Full Text: View/download PDF

42. Using Information Centric Networking in Internet of Things: A Survey

Author: Abdelkader Lahmadi, Leila Azouz Saidane, Dorra Mars, Sonia Mettali Gammar, Centre de Recherche Réseau Image SysTème Architecture et MuLtimédia (CRISTAL), École Nationale des Sciences de l'Informatique [Manouba] (ENSI), Université de la Manouba [Tunisie] (UMA)-Université de la Manouba [Tunisie] (UMA), Université de la Manouba [Tunisie] (UMA), 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), Resilience and Elasticity for Security and ScalabiliTy of dynamic networked systems (RESIST), 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 Networks, Systems and Services (LORIA - NSS), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Computer science, business.industry, 020206 networking & telecommunications, Context (language use), 02 engineering and technology, Information Centric Networking (ICN), Internet of Things (IoT), Computer Science Applications, World Wide Web, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Information-centric networking, Applications, Scalability, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, Internet of Things, business, Dissemination
Abstract: International audience; Internet of Things (IoT) is increasingly deployed in different domains and environments including smart homes, smart cities, healthcare, industry 4.0, and smart agriculture, by connecting a large number of physical objects to deliver a new class of applications. The rising number of these connected objects and their heterogeneity have raised new research directions and challenges regarding their communications, scalability and the large amount of data that generate. As a result, new communication technologies have been proposed to be applied in these environments and applications, mainly to consider their main inherent properties which are the information that generate and handle, and the content that disseminate. Among the adopted techniques and recently integrated into the IoT is the ICN (Information Centric Networking) paradigm. The choice of integration of ICN in the context of IoT is mainly motivated by all the advantages it represents, in particular content caching and decoupling senders and receivers. In this paper, we provide a detailed analysis of the motivations behind using ICN in IoT environments and a survey of existing research work that have already applied ICN as a communication support for IoT applications.
Published: 2019
Full Text: View/download PDF

43. La relation entre codes k-circulaires et codes circulaires

Author: Elena Fimmel, Jean-Sébastien Sereni, François Pirot, Lutz Strüngmann, Martin Starman, Christian J. Michel, Universität Mannheim, Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS), Knowledge representation, reasonning (ORPAILLEUR), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), and Université de Strasbourg (UNISTRA)
Subjects: 0301 basic medicine, 2019-20 coronavirus outbreak, General Mathematics, Existential quantification, Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), Immunology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], General Biochemistry, Genetics and Molecular Biology, Combinatorics, 03 medical and health sciences, 0302 clinical medicine, code evolution, Code (cryptography), Partition (number theory), General Environmental Science, Mathematics, Pharmacology, Circular code, Models, Genetic, Nucleotides, General Neuroscience, k-circular code, Mathematical Concepts, Biological Evolution, [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], genetic code, 030104 developmental biology, Computational Theory and Mathematics, 030220 oncology & carcinogenesis, A priori and a posteriori, Original Article, Alphabet, General Agricultural and Biological Sciences
Abstract: A code X is k-circular if any concatenation of at most k words from X, when read on a circle, admits exactly one partition into words from X. It is circular if it is k-circular for every integer k. While it is not a priori clear from the definition, there exists, for every pair \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(n,\ell )$$\end{document}(n,ℓ), an integer k such that every k-circular \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell $$\end{document}ℓ-letter code over an alphabet of cardinality n is circular, and we determine the least such integer k for all values of n and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell $$\end{document}ℓ. The k-circular codes may represent an important evolutionary step between the circular codes, such as the comma-free codes, and the genetic code.
Published: 2020
Full Text: View/download PDF

44. PGxCorpus, a manually annotated corpus for pharmacogenomics

Author: Kevin Dalleau, Joël Legrand, Adrien Coulet, Nadine Petitpain, Malika Smaïl-Tabbone, Romain Gogdemir, Yannick Toussaint, William Digan, Cédric Bousquet, Marie-Dominique Devignes, Patrice Ringot, Ndeye-Coumba Ndiaye, Chia-Ju Lee, Natural Language Processing : representations, inference and semantics (SYNALP), Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Knowledge representation, reasonning (ORPAILLEUR), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique Médicale et Ingénierie des Connaissances en e-Santé (LIMICS), Institut National de la Santé et de la Recherche Médicale (INSERM)-Sorbonne Université (SU)-Université Sorbonne Paris Nord, Computational Algorithms for Protein Structures and Interactions (CAPSID), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Complex Systems, Artificial Intelligence & Robotics (LORIA - AIS), Hôpital Européen Georges Pompidou [APHP] (HEGP), Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-Hôpitaux Universitaires Paris Ouest - Hôpitaux Universitaires Île de France Ouest (HUPO), Department of Biomedical Informatics and Medical Education, University of Washington, University of Washington [Seattle], Nutrition-Génétique et Exposition aux Risques Environnementaux (NGERE), Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lorraine (UL), Centre Régional de PharmacoVigilance de Lorraine (CRPV Lorraine), Centre Hospitalier Régional Universitaire de Nancy (CHRU Nancy), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), ANR-15-CE23-0028, Agence Nationale de la Recherche, 15-IDEX-0004, Université de Lorraine, Snowball Inria Associate Team, GRID5000, ANR-15-CE23-0028,PractiKPharma,Confrontation entre connaissances de l'état de l'art et connaissances extraites de dossiers patients en pharmacogénomique(2015), Coulet, Adrien, Interactions humain-machine, objets connectés, contenus numériques, données massives et connaissance - Confrontation entre connaissances de l'état de l'art et connaissances extraites de dossiers patients en pharmacogénomique - - PractiKPharma2015 - ANR-15-CE23-0028 - AAPG2015 - VALID, CRHU Nancy, and Service Informatique de Soutien à la Recherche (SISR)
Subjects: Data Descriptor, Computer science, [INFO.INFO-TT] Computer Science [cs]/Document and Text Processing, computer.software_genre, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], 0302 clinical medicine, Resource (project management), Drug response, 030212 general & internal medicine, lcsh:Science, Data Curation, ComputingMilieux_MISCELLANEOUS, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM], 0303 health sciences, 3. Good health, Computer Science Applications, [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, [SDV.SP.PHARMA] Life Sciences [q-bio]/Pharmaceutical sciences/Pharmacology, Supervised Machine Learning, Statistics, Probability and Uncertainty, Natural language processing, Information Systems, [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Statistics and Probability, PubMed, [SDV.SP.MED] Life Sciences [q-bio]/Pharmaceutical sciences/Medication, [SDV.GEN.GH] Life Sciences [q-bio]/Genetics/Human genetics, Library and Information Sciences, Domain (software engineering), Education, 03 medical and health sciences, [SDV.SP.MED]Life Sciences [q-bio]/Pharmaceutical sciences/Medication, Component (UML), Genetics, Humans, 030304 developmental biology, business.industry, Health care, Significant part, Precision medicine, ComputingMethodologies_PATTERNRECOGNITION, [SDV.GEN.GH]Life Sciences [q-bio]/Genetics/Human genetics, Pharmacogenetics, Pharmacogenomics, [SDV.SP.PHARMA]Life Sciences [q-bio]/Pharmaceutical sciences/Pharmacology, lcsh:Q, Artificial intelligence, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], business, computer
Abstract: Pharmacogenomics (PGx) studies how individual gene variations impact drug response phenotypes, which makes PGx-related knowledge a key component towards precision medicine. A significant part of the state-of-the-art knowledge in PGx is accumulated in scientific publications, where it is hardly reusable by humans or software. Natural language processing techniques have been developed to guide experts who curate this amount of knowledge. But existing works are limited by the absence of a high quality annotated corpus focusing on PGx domain. In particular, this absence restricts the use of supervised machine learning. This article introduces PGxCorpus, a manually annotated corpus, designed to fill this gap and to enable the automatic extraction of PGx relationships from text. It comprises 945 sentences from 911 PubMed abstracts, annotated with PGx entities of interest (mainly gene variations, genes, drugs and phenotypes), and relationships between those. In this article, we present the corpus itself, its construction and a baseline experiment that illustrates how it may be leveraged to synthesize and summarize PGx knowledge., Measurement(s)gene_variant • response to drug • textual entity • chemical entity • haplotype • gene • Pharmacogenomics • Pharmacogenetics • abbreviation textual entity • Pharmacokinetics • Pharmacodynamics • phenotypeTechnology Type(s)digital curationSample Characteristic - OrganismHomo sapiens Machine-accessible metadata file describing the reported data: 10.6084/m9.figshare.11323724
Published: 2020
Full Text: View/download PDF

45. From sets of good redescriptions to good sets of redescriptions

Author: Esther Galbrun, Janis Kalofolias, Pauli Miettinen, Max Planck Institute for Informatics [Saarbrücken], Knowledge representation, reasonning (ORPAILLEUR), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)
Subjects: Theoretical computer science, Computer science, 02 engineering and technology, computer.software_genre, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Data modeling, Set (abstract data type), Artificial Intelligence, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Redundancy (engineering), Data mining, Pattern selection, Measure (data warehouse), Information retrieval, Subjective interestingness, Principle of maximum entropy, Redescription mining, Missing data, Variety (cybernetics), Human-Computer Interaction, Maximum entropy, Hardware and Architecture, Maximum-entropy, 020201 artificial intelligence & image processing, Conjunctive query, computer, Software, Information Systems
Abstract: International audience; Redescription mining aims at finding pairs of queries over data variables thatdescribe roughly the same set of observations. These redescriptions can be used to obtaindifferent views on the same set of entities. So far, redescriptionminingmethods have aimed atlisting all redescriptions supported by the data. Such an approach can result in many redundantredescriptions and hinder the user’s ability to understand the overall characteristics of the data.In this work, we present an approach to identify and remove the redundant redescriptions,that is, an approach to move from a set of good redescriptions to a good set of redescriptions.We measure the redundancy of a redescription using a framework inspired by the concept ofsubjective interestingness based on maximum entropy distributions as proposed by De Bie(Data Min Knowl Discov 23(3):407–446, 2011). Redescriptions, however, generate specificrequirements on the framework, and our solution differs significantly from the existing ones.Notably, our approach can handle disjunctions and conjunctions in the queries, whereas theexisting approaches are limited only to conjunctive queries. Our framework can also handledata with Boolean, nominal, or real-valued data, possibly containing missing values, makingit applicable to a wide variety of data sets. Our experiments show that our framework canefficiently reduce the redundancy even on large data sets.
Published: 2018
Full Text: View/download PDF

46. PDB-wide identification of biological assemblies from conserved quaternary structure geometry

Author: Sucharita Dey, Emmanuel D. Levy, David W. Ritchie, Weizmann Institute of Science [Rehovot, Israël], Computational Algorithms for Protein Structures and Interactions (CAPSID), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Complex Systems, Artificial Intelligence & Robotics (LORIA - AIS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), 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: Models, Molecular, 0301 basic medicine, Protein Data Bank (RCSB PDB), Crystallographic data, Computational biology, Biology, Bioinformatics, Biochemistry, Manual curation, 03 medical and health sciences, Protein structure, Humans, Databases, Protein, Protein Structure, Quaternary, Molecular Biology, Computational Biology, Proteins, Cell Biology, computer.file_format, Protein Data Bank, Protein multimerization, 030104 developmental biology, Protein quaternary structure, Identification (biology), Protein Multimerization, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], computer, Protein Binding, Biotechnology
Abstract: Protein structures are key to understanding biomolecular mechanisms and diseases, yet their interpretation is hampered by limited knowledge of their biologically relevant quaternary structure (QS). A critical challenge in inferring QS information from crystallographic data is distinguishing biological interfaces from fortuitous crystal-packing contacts. Here, we tackled this problem by developing strategies for aligning and comparing QS states across both homologs and data repositories. QS conservation across homologs proved remarkably strong at predicting biological relevance and is implemented in two methods, QSalign and anti-QSalign, for annotating homo-oligomers and monomers, respectively. QS conservation across repositories is implemented in QSbio (http://www.QSbio.org), which approaches the accuracy of manual curation and allowed us to predict >100,000 QS states across the Protein Data Bank. Based on this high-quality data set, we analyzed pairs of structurally conserved interfaces, and this analysis revealed a striking plasticity whereby evolutionary distant interfaces maintain similar interaction geometries through widely divergent chemical properties.
Published: 2017
Full Text: View/download PDF

47. Discovery of a big void in Khufu’s Pyramid by observation of cosmic-ray muons

Author: Nobuko Kitagawa, Emmanuel Guerriero, Nicolas Serikoff, Yoshikatsu Date, P. Magnier, Vincent Steiger, Yasser El-Shayeb, M. Riallot, H. Fujii, Simon Bouteille, Christopher Filosa, David Attié, Fumihiko Takasaki, Kohei Hayashi, Pierre Gable, Hany Helal, Mehdi Tayoubi, Kunihiro Morishima, Kotaro Satoh, D. Calvet, Makiko Sugiura, Shigeru Odaka, Mustapha Ezzy, Mitsuaki Kuno, Yuta Manabe, Tamer Elnady, S. Procureur, Jean-Baptiste Mouret, Akira Nishio, Hideyo Kodama, Bernard Charles, I. Mandjavidze, Benoit Marini, M. Moto, Department of Physics [Nagoya], Nagoya University, KEK (High energy accelerator research organization), Institut de Recherches sur les lois Fondamentales de l'Univers (IRFU), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Institut HIP (Héritage – Innovation – Préservation), Emissive, NEP [Tokyo], Suave images [Tokyo], Cairo University, Université Ain Shams, Lifelong Autonomy and interaction skills for Robots in a Sensing ENvironment (LARSEN), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Complex Systems, Artificial Intelligence & Robotics (LORIA - AIS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Dassault Systèmes, ANR-11-IDEX-0003,IPS,Idex Paris-Saclay(2011), 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: Physics, Void (astronomy), Physics - Instrumentation and Detectors, Multidisciplinary, Muon, Muon tomography, 010308 nuclear & particles physics, Cosmic ray muons, FOS: Physical sciences, Astronomy, Cosmic ray, Instrumentation and Detectors (physics.ins-det), 01 natural sciences, 0103 physical sciences, Muography, Archaeological heritage, Nuclear emulsion, [PHYS.PHYS.PHYS-INS-DET]Physics [physics]/Physics [physics]/Instrumentation and Detectors [physics.ins-det], 010306 general physics
Abstract: The Great Pyramid or Khufu's Pyramid was built on the Giza Plateau (Egypt) during the IVth dynasty by the pharaoh Khufu (Cheops), who reigned from 2509 to 2483 BC. Despite being one of the oldest and largest monuments on Earth, there is no consensus about how it was built. To better understand its internal structure, we imaged the pyramid using muons, which are by-products of cosmic rays that are only partially absorbed by stone. The resulting cosmic-ray muon radiography allows us to visualize the known and potentially unknown voids in the pyramid in a non-invasive way. Here we report the discovery of a large void (with a cross section similar to the Grand Gallery and a length of 30 m minimum) above the Grand Gallery, which constitutes the first major inner structure found in the Great Pyramid since the 19th century. This void, named ScanPyramids Big Void, was first observed with nuclear emulsion films installed in the Queen's chamber (University of Nagoya), then confirmed with scintillator hodoscopes set up in the same chamber (KEK) and re-confirmed with gas detectors outside of the pyramid (CEA). This large void has therefore been detected with a high confidence by three different muon detection technologies and three independent analyses. These results constitute a breakthrough for the understanding of Khufu's Pyramid and its internal structure. While there is currently no information about the role of this void, these findings show how modern particle physics can shed new light on the world's archaeological heritage., Comment: Nature (2017)
Published: 2017
Full Text: View/download PDF

48. Numerical Methods and Comparison for the Dirac Equation in the Nonrelativistic Limit Regime

Author: Weizhu Bao, Qinglin Tang, Yongyong Cai, Xiaowei Jia, Department of Mathematics [Singapore], National University of Singapore (NUS), Department of mathematics Purdue University, Purdue University [West Lafayette], Beijing Computational Science Research Center [Beijing] (CSRC), Laboratoire de Mathématiques Raphaël Salem (LMRS), Université de Rouen Normandie (UNIROUEN), Normandie Université (NU)-Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS), Systems with physical heterogeneities : inverse problems, numerical simulation, control and stabilization (SPHINX), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), and ANR-12-MONU-0007,BECASIM,Simulation numérique avancée pour les condensats de Bose-Einstein : Modèles numériques déterministes et stochastiques, Calcul haute performance, Simulation d'expériences physiques(2012)
Subjects: Discretization, exponential wave integrator spectral method, 010103 numerical & computational mathematics, nonrelativistic limit regime, 01 natural sciences, Theoretical Computer Science, symbols.namesake, [MATH.MATH-MP]Mathematics [math]/Mathematical Physics [math-ph], FOS: Mathematics, Mathematics - Numerical Analysis, Dirac equation, Limit (mathematics), 0101 mathematics, Mathematics, Numerical Analysis, Applied Mathematics, Numerical analysis, Mathematical analysis, General Engineering, Order (ring theory), Numerical Analysis (math.NA), 16. Peace & justice, finite difference time domain method, Exponential function, 010101 applied mathematics, Computational Mathematics, time splitting spectral method, Computational Theory and Mathematics, symbols, Spectral method, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA], Software, ε-scalability, Dimensionless quantity
Abstract: We analyze rigorously error estimates and compare numerically spatial/temporal resolution of various numerical methods for the discretization of the Dirac equation in the nonrelativistic limit regime, involving a small dimensionless parameter $0, Comment: 34 pages, 2 figures. arXiv admin note: substantial text overlap with arXiv:1511.01192
Published: 2017
Full Text: View/download PDF

49. Genericity of Weakly Computable Objects

Author: Mathieu Hoyrup, Theoretical adverse computations, and safety (CARTE), 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 Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), 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: Discrete mathematics, 010102 general mathematics, Structure (category theory), [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Priority method, 0102 computer and information sciences, Function (mathematics), Mathematical proof, Generic, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.2: Computability theory, 01 natural sciences, Computable analysis, Theoretical Computer Science, Computable model theory, Computable function, Computable Analysis, [MATH.MATH-GN]Mathematics [math]/General Topology [math.GN], Computational Theory and Mathematics, 010201 computation theory & mathematics, Computability theory, Irreversible function, Theory of computation, Calculus, 0101 mathematics, Mathematics
Abstract: International audience; In computability theory many results state the existence of objects that in many respects lack algorithmic structure but at the same time are effective in some sense. Friedberg and Muchnik's answer to Post problem is one of the most celebrated results in this form. The main goal of the paper is to develop a general result that embodies a large number of these particular constructions, capturing the essential idea that is common to all of them, and expressing it in topological terms.To do so, we introduce the effective topological notions of irreversible function and directional genericity and provide two main results that identify situations when such constructions are possible, clarifying the role of topology in many arguments from computability theory. We apply these abstract results to particular situations, illustrating their strength and deriving new results.This paper is an extended version of a conference paper with detailed proofs and new results.
Published: 2016
Full Text: View/download PDF

50. Handling topological changes during elastic registration

Author: Renato V. Soares, Christoph J. Paulus, Seong-Ho Kong, Nazim Haouchine, Stéphane Cotin, David Cazier, Computational Anatomy and Simulation for Medicine (MIMESIS), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et nanosciences d'Alsace (FMNGE), Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA), L'Institut hospitalo-universitaire de Strasbourg (IHU Strasbourg), Institut National de Recherche en Informatique et en Automatique (Inria)-l'Institut de Recherche contre les Cancers de l'Appareil Digestif (IRCAD)-Les Hôpitaux Universitaires de Strasbourg (HUS)-La Fédération des Crédits Mutuels Centre Est (FCMCE)-L'Association pour la Recherche contre le Cancer (ARC)-La société Karl STORZ, Seoul National University Hospital, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)-École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), and Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Models, Anatomic, elastic registration, Laparoscopic surgery, medicine.medical_treatment, Anatomical structures, laparoscopy, Biomedical Engineering, Health Informatics, 02 engineering and technology, Overlay, Topology, 0202 electrical engineering, electronic engineering, information engineering, medicine, Humans, Minimally Invasive Surgical Procedures, Radiology, Nuclear Medicine and imaging, Computer vision, Monocular camera, Depth Perception, non-rigid registration, business.industry, 020207 software engineering, General Medicine, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Computer Graphics and Computer-Aided Design, augmented reality, Computer Science Applications, Surgery, Computer-Assisted, Single view, Cutting, Tearing, 020201 artificial intelligence & image processing, Surgery, Augmented reality, Computer Vision and Pattern Recognition, Artificial intelligence, business, Depth perception, Topological Changes, Coherence (physics)
Abstract: International audience; Purpose: Locating the internal structures of an organ is a critical aspect of many surgical procedures. Minimally invasive surgery, associated with augmented reality techniques, offers the potential to visualize inner structures, allowing for improved analysis, depth perception or for supporting planning and decision systems.Methods: Most of the current methods dealing with rigid or non-rigid augmented reality make the assumption that the topology of the organ is not modified. As surgery relies essentially on cutting and dissection of anatomical structures, such methods are limited to the early stages of the surgery.We solve this shortcoming with the introduction of a method for physics-based elastic registration using a single view from a monocular camera.Singularities caused by topological changes are detected and propagated to the pre-operative model. This significantly improves the coherence between the actual laparoscopic view and the model, and provides added value in terms of navigation and decision-making, e.g. by overlaying the internal structures of an organ on the laparoscopic view.Results: Our real time augmentation method is assessed on several scenarios, using synthetic objects and real organs. In all cases, the impact of our approach is demonstrated, both qualitatively and quantitatively.Conclusion: The presented approach tackles the challenge of localizing internal structures throughout a complete surgical procedure, even after surgical cuts. This information is crucial for surgeons to improve the outcome for their surgical procedure and avoid complications.
Published: 2016
Full Text: View/download PDF

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

80 results on '"Inria Nancy - Grand Est"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources