Author: "Inria Saclay" - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Inria Saclay"' showing total 11,885 results

Start Over Author "Inria Saclay"

11,885 results on '"Inria Saclay"'

1. Semileptonic B→D∗∗ decays in lattice QCD: a feasability study and first results

Author: Atoui, M.Laboratoire de Physique Corpusculaire de Clermont-Ferrand, Unité Mixte de Recherche 6533 CNRS/IN2P3, Université Blaise Pascal, BP 80026, Campus des Cézeaux, 24 avenue des Landais, 63171, Aubière Cedex, France, Blossier, B.(Laboratoire de Physique Théorique, Unité Mixte de Recherche 8627 du Centre National de la Recherche Scientifique et Université Paris-Sud XI, Bâtiment 210, 91405, Orsay Cedex, France), Morénas, V.(Laboratoire de Physique Corpusculaire de Clermont-Ferrand, Unité Mixte de Recherche 6533 CNRS/IN2P3, Université Blaise Pascal, BP 80026, Campus des Cézeaux, 24 avenue des Landais, 63171, Aubière Cedex, France), Pène, O.(Laboratoire de Physique Théorique, Unité Mixte de Recherche 8627 du Centre National de la Recherche Scientifique et Université Paris-Sud XI, Bâtiment 210, 91405, Orsay Cedex, France), and Petrov, K.(Inria Saclay, Bâtiment Alan Turing, 1 rue Honoré d’Estienne d’Orves, Campus de l’Ecole Polytechnique, 91120, Palaiseau, France)
Abstract: We compute the decays B→D0∗ and B→D2∗ with finite masses for the b and c quarks. We first discuss the spectral properties of both the B meson as a function of its momentum and the D0∗ and D2∗ at rest. We compute the theoretical formulae leading to the decay amplitudes from the three-point and two-point correlators. We then compute the amplitudes at zero recoil of B→D0∗ , which turns out not to be vanishing contrary to what happens in the heavy quark limit. This opens the possibility to get better agreement with experiment. To improve the continuum limit we have added a set of data with smaller lattice spacing. The B→D2∗ vanishes at zero recoil and we show a convincing signal but only slightly more than 1 sigma from 0. In order to reach quantitatively significant results we plan to exploit fully smaller lattice spacings as well as another lattice regularisation.
Published: 2015

2. Effective diffusion tensor computed by homogenization

Author: CMAP, Ecole Polytechnique, LPMC, CNRS - Ecole Polytechnique, Neurospin, CEA Saclay, Equipe DEFI, INRIA Saclay, Universität Leipzig, Nguyen, Dang Van, Grebenkov, Denis, Poupon, Cyril, Le Bihan, Denis, Li, Jing-Rebecca Li, CMAP, Ecole Polytechnique, LPMC, CNRS - Ecole Polytechnique, Neurospin, CEA Saclay, Equipe DEFI, INRIA Saclay, Universität Leipzig, Nguyen, Dang Van, Grebenkov, Denis, Poupon, Cyril, Le Bihan, Denis, and Li, Jing-Rebecca Li
Abstract: The convergence of the long-time apparent diffusion tensor of diffusion magnetic resonance imaging (dMRI) to the effective diffusion tensor obtained by mathematical homogenization theory was considered for two-compartment geometric models containing non-elongated cells of general shapes. A numerical study was conducted in two and three dimensions to demonstrate this convergence as a function of the diffusion time.
Published: 2015

3. Innocuous Double Rounding of Basic Arithmetic Operations

Author: ONERA, LRI, INRIA Saclay -- Île-de-France, Roux, Pierre; ISAE, ONERA, ONERA, LRI, INRIA Saclay -- Île-de-France, and Roux, Pierre; ISAE, ONERA
Abstract: Double rounding occurs when a floating-point value is first rounded to an intermediate precision before being rounded to a final precision. The result of two such consecutive roundings can differ from the result obtained when directly rounding to the final precision. Double rounding practically happens, for instance, when implementing the IEEE754 binary32 format with an arithmetic unit performing operations only in the larger binary64 format, such as done in the PowerPC or x87 floating-point units. It belongs to the folklore in the floating-point arithmetic community that double rounding is innocuous for the basic arithmetic operations (addition, division, multiplication, and square root) as soon as the final precision is about twice larger than the intermediate one. This paper adresses the formal proof of this fact considering underflow cases and its extension to radices other than two.
Published: 2014

4. Distributed KNN-graph approximation via hashing

Author: ZENITH: Scientific Data Management (ZENITH) ; INRIA - Département Informatique (INFO/LIRMM) ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; Université de Montpellier (UM) - CNRS - Université de Montpellier (UM) - CNRS - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; Université de Montpellier (UM) - CNRS - Université de Montpellier (UM) - CNRS, INRIA Saclay - Ile de France (INRIA Saclay - Ile de France) ; INRIA, European Project : 288720, ICT, FP7-ICT-2011-7, GLOCAL - ENLARGED EU(2011), Trad, Riadh, Joly, Alexis, Nozha, Boujemaa, ZENITH: Scientific Data Management (ZENITH) ; INRIA - Département Informatique (INFO/LIRMM) ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; Université de Montpellier (UM) - CNRS - Université de Montpellier (UM) - CNRS - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; Université de Montpellier (UM) - CNRS - Université de Montpellier (UM) - CNRS, INRIA Saclay - Ile de France (INRIA Saclay - Ile de France) ; INRIA, European Project : 288720, ICT, FP7-ICT-2011-7, GLOCAL - ENLARGED EU(2011), Trad, Riadh, Joly, Alexis, and Nozha, Boujemaa
Abstract: International audience, Efficiently constructing the K-Nearest Neighbor Graph (K-NNG) of large and high dimensional datasets is crucial for many applications with feature-rich objects, such as images or other multimedia content. In this paper we investigate the use of high dimensional hashing methods for efficiently approximating the K-NNG, notably in distributed environments. We first discuss the importance of balancing issues on the performance of such approaches and show why the baseline approach using Locality Sensitive Hashing does not perform well. Our new KNN-join method is based on RMMH, a recently introduced hash function family based on randomly trained classifiers. We show that the resulting hash tables are much more balanced and that the number of resulting collisions can be greatly reduced without degrading quality. We further improve the load balancing of our distributed approach by designing a parallelized local join algorithm, implemented within the MapReduce framework.

5. Finger-Based Manipulation in Immersive Spaces and the Real World

Author: INRIA Sophia Antipolis - GRAPHDECO ; INRIA Sophia Antipolis (INRIA Sophia Antipolis) ; INRIA - INRIA, Laboratoire de Recherche en Informatique (LRI) ; CNRS - Université Paris-Sud - Paris 11 (UP11), IN-SITU (INRIA Saclay - Ile de France) ; CNRS - INRIA - Université Paris-Sud - Paris 11 (UP11), This work was supported in part by the Regional Council of Provence Alpes-Côte d’Azur and the EU project VERVE., IEEE, European Project : 288914, ICT, FP7-ICT-2011-7, VERVE(2011), Chapoulie, Emmanuelle, Tsandilas, Theophanis, Oehlberg, Lora, Mackay, Wendy E., Drettakis, George, INRIA Sophia Antipolis - GRAPHDECO ; INRIA Sophia Antipolis (INRIA Sophia Antipolis) ; INRIA - INRIA, Laboratoire de Recherche en Informatique (LRI) ; CNRS - Université Paris-Sud - Paris 11 (UP11), IN-SITU (INRIA Saclay - Ile de France) ; CNRS - INRIA - Université Paris-Sud - Paris 11 (UP11), This work was supported in part by the Regional Council of Provence Alpes-Côte d’Azur and the EU project VERVE., IEEE, European Project : 288914, ICT, FP7-ICT-2011-7, VERVE(2011), Chapoulie, Emmanuelle, Tsandilas, Theophanis, Oehlberg, Lora, Mackay, Wendy E., and Drettakis, George
Abstract: International audience, Immersive environments that approximate natural interaction with physical 3D objects are designed to increase the user’s sense of presence and improve performance by allowing users to transfer existing skills and expertise from real to virtual environments. However, limitations of current Virtual Reality technologies, e.g., low-fidelity real-time physics simulations and tracking problems, make it difficult to ascertain the full potential of finger-based 3D manipulation techniques. This paper decomposes 3D object manipulation into the component movements, taking into account both physical constraints and mechanics. We fabricate five physical devices that simulate these movements in a measurable way under experimental conditions. We then implement the devices in an immersive environment and conduct an experiment to evaluate direct finger-based against ray-based object manipulation. The key contribution of this work is the careful design and creation of physical and virtual devices to study physics-based 3D object manipulation in a rigorous manner in both real and virtual setups.

6. Corroborating Information from Disagreeing Views

Author: LEO (INRIA Saclay - Ile de France) ; Université Paris-Sud - Paris 11 (UP11) - INRIA - CNRS, Rutgers, The State University of New Jersey [New Brunswick] (RUTGERS) ; Rutgers, The State University of New Jersey, Télécom ParisTech, This work has been partially funded by the European Research Council under the European Community's Seventh Framework Programme (FP7/2007-2013) / ERC grant Webdam, agreement 226513. http://webdam.inria.fr/, European Project : 226513, ERC, ERC-2008-AdG, WEBDAM(2008), Galland, Alban, Abiteboul, Serge, Marian, Amélie, Senellart, Pierre, LEO (INRIA Saclay - Ile de France) ; Université Paris-Sud - Paris 11 (UP11) - INRIA - CNRS, Rutgers, The State University of New Jersey [New Brunswick] (RUTGERS) ; Rutgers, The State University of New Jersey, Télécom ParisTech, This work has been partially funded by the European Research Council under the European Community's Seventh Framework Programme (FP7/2007-2013) / ERC grant Webdam, agreement 226513. http://webdam.inria.fr/, European Project : 226513, ERC, ERC-2008-AdG, WEBDAM(2008), Galland, Alban, Abiteboul, Serge, Marian, Amélie, and Senellart, Pierre
Abstract: International audience, We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want to predict the truth values of the facts. Beyond simple methods such as voting (typically rather accurate), we explore techniques based on ``corroboration'', i.e., taking into account trust in the views. We introduce three fixpoint algorithms corresponding to different levels of complexity of an underlying probabilistic model. They all estimate both truth values of facts and trust in the views. We present experimental studies on synthetic and real-world data. This analysis illustrates how and in which context these methods improve corroboration results over baseline methods. We believe that corroboration can serve in a wide range of applications such as source selection in the semantic Web, data quality assessment or semantic annotation cleaning in social networks. This work sets the bases for a wide range of techniques for solving these more complex problems.

7. Distributed XML Design

Author: DAHU (INRIA Saclay - Ile de France) ; CNRS - INRIA - École normale supérieure - Cachan (ENS Cachan), Computing Laboratory (OUCL) ; University of Oxford, Università della Calabria [Arcavacata di Rende] (Unical) ; University of Calabria, S. Abiteboul was supported by the ERC Advanced Grant Webdam and by the French ANR Grant Docflow. G. Gottlob was supported by EPSRC grant EP/E010865/1., European Project : 226513, ERC, ERC-2008-AdG, WEBDAM(2008), Abiteboul, Serge, Gottlob, Georg, Manna, Marco, DAHU (INRIA Saclay - Ile de France) ; CNRS - INRIA - École normale supérieure - Cachan (ENS Cachan), Computing Laboratory (OUCL) ; University of Oxford, Università della Calabria [Arcavacata di Rende] (Unical) ; University of Calabria, S. Abiteboul was supported by the ERC Advanced Grant Webdam and by the French ANR Grant Docflow. G. Gottlob was supported by EPSRC grant EP/E010865/1., European Project : 226513, ERC, ERC-2008-AdG, WEBDAM(2008), Abiteboul, Serge, Gottlob, Georg, and Manna, Marco
Abstract: International audience, A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML tree some of whose leaves are "docking points", to which XML subtrees can be attached. These subtrees may be provided and controlled by peers at remote locations, or may correspond to the result of function calls, e.g., Web services. If a global type τ, e.g. a DTD, is specified for a distributed document T, it would be most desirable to be able to break this type into a collection of local types, called a local typing, such that the document satisfies τ if and only if each peer (or function) satisfies its local type. In this paper we lay out the fundamentals of a theory of local typing and provide formal definitions of three main variants of locality: local typing, maximal local typing, and perfect typing, the latter being the most desirable. We study the following relevant decision problems: (i) given a typing for a design, determine whether it is local, maximal local, or perfect; (ii) given a design, establish whether a (maximal) local, or perfect typing does exist. For some of these problems we provide tight complexity bounds (polynomial space), while for the others we show exponential upper bounds. A main contribution is a polynomial-space algorithm for computing a perfect typing in this context, if it exists.

8. Distributed Monitoring with Collaborative Prediction

Author: Laboratoire de Recherche en Informatique (LRI) ; CNRS - Université Paris-Sud - Paris 11 (UP11), TAO (INRIA Saclay - Ile de France) ; CNRS - INRIA - Université Paris-Sud - Paris 11 (UP11), Centre de recherche en applications et traitement de l'image pour la santé (CREATIS) ; CNRS - INSERM - Hospices Civils de Lyon - Université Claude Bernard Lyon 1 (UCBL) - Institut National des Sciences Appliquées (INSA), France Grilles, Chinese Scholarship council, European Project : 261323, INFRA, FP7-INFRASTRUCTURES-2010-2, EGI-INSPIRE(2010), Feng, Dawei, Germain-Renaud, Cecile, Glatard, Tristan, Laboratoire de Recherche en Informatique (LRI) ; CNRS - Université Paris-Sud - Paris 11 (UP11), TAO (INRIA Saclay - Ile de France) ; CNRS - INRIA - Université Paris-Sud - Paris 11 (UP11), Centre de recherche en applications et traitement de l'image pour la santé (CREATIS) ; CNRS - INSERM - Hospices Civils de Lyon - Université Claude Bernard Lyon 1 (UCBL) - Institut National des Sciences Appliquées (INSA), France Grilles, Chinese Scholarship council, European Project : 261323, INFRA, FP7-INFRASTRUCTURES-2010-2, EGI-INSPIRE(2010), Feng, Dawei, Germain-Renaud, Cecile, and Glatard, Tristan
Abstract: International audience, Isolating users from the inevitable faults in large distributed systems is critical to Quality of Experience. We formulate the problem of probe selection for fault prediction based on end-to-end probing as a Collaborative Prediction (CP) problem. On an extensive experimental dataset from the EGI grid, the combination of the Maximum Margin Matrix Factor- ization approach to CP and Active Learning shows excellent performance, reducing the number of probes typically by 80% to 90%.

9. Infrastructure

Author: AVIZ (INRIA Saclay - Ile de France) ; INRIA, Eurographics Association, European Project : 225924, ICT, FP7-ICT-2007-C, VISMASTER CA(2008), Fekete, Jean-Daniel, AVIZ (INRIA Saclay - Ile de France) ; INRIA, Eurographics Association, European Project : 225924, ICT, FP7-ICT-2007-C, VISMASTER CA(2008), and Fekete, Jean-Daniel
Abstract: International audience, Supporting the strong demand in data storage, computation and interactive performances required by visual analytics applications is still a challenge. All currently existing visual analytics applications need to build their own specialised infrastructure for their speciﬁc problem. One of the most difficult issues of visual analytics is that it is both user driven and data-driven. It is user-driven because during the interactive steps of the analysis, the user is specifying algorithms and parameters to explore the data. It is also data-driven because new data is made available to the user at unpredictable times, such as when algorithms run or databases are updated. This chapter describes the landscape of software and hardware solutions to address this difficult issues.

10. Efficient fault monitoring with Collaborative Prediction

Author: Laboratoire de Recherche en Informatique (LRI) ; CNRS - Université Paris-Sud - Paris 11 (UP11), TAO (INRIA Saclay - Ile de France) ; CNRS - INRIA - Université Paris-Sud - Paris 11 (UP11), Centre de recherche en applications et traitement de l'image pour la santé (CREATIS) ; CNRS - INSERM - Hospices Civils de Lyon - Université Claude Bernard Lyon 1 (UCBL) - Institut National des Sciences Appliquées (INSA), France Grilles, European Project : 261323, INFRA, FP7-INFRASTRUCTURES-2010-2, EGI-INSPIRE(2010), Feng, Dawei, Germain-Renaud, Cecile, Glatard, Tristan, Laboratoire de Recherche en Informatique (LRI) ; CNRS - Université Paris-Sud - Paris 11 (UP11), TAO (INRIA Saclay - Ile de France) ; CNRS - INRIA - Université Paris-Sud - Paris 11 (UP11), Centre de recherche en applications et traitement de l'image pour la santé (CREATIS) ; CNRS - INSERM - Hospices Civils de Lyon - Université Claude Bernard Lyon 1 (UCBL) - Institut National des Sciences Appliquées (INSA), France Grilles, European Project : 261323, INFRA, FP7-INFRASTRUCTURES-2010-2, EGI-INSPIRE(2010), Feng, Dawei, Germain-Renaud, Cecile, and Glatard, Tristan
Abstract: National audience, Isolating users from the inevitable faults in large distributed systems is critical to Quality of Experience. We formulate the problem of probe selection for fault prediction based on end-to-end probing as a Collaborative Prediction (CP) problem. On an extensive experimental dataset from the EGI grid, the combination of the Maximum Margin Matrix Factorization approach to CP and Active Learning shows excellent performance, reducing the number of probes typically by 80% to 90%.

11. Rule-Based Application Development using Webdamlog

Author: Laboratoire Spécification et Vérification [Cachan] (LSV) ; CNRS - INRIA - École normale supérieure - Cachan (ENS Cachan), DAHU (INRIA Saclay - Ile de France) ; CNRS - INRIA - École normale supérieure - Cachan (ENS Cachan), University of Massachusetts (UMASS) ; University of Massachusetts, Drexel University (DREXEL UNIVERSITY) ; Université - Drexel University, Skoltech ; Skoltech, McGill University [Montreal] ; McGill University, European Project : 226513, ERC, ERC-2008-AdG, WEBDAM(2008), Abiteboul, Serge, Antoine, Émilien, Miklau, Gerome, Stoyanovich, Julia, Testard, Jules, Laboratoire Spécification et Vérification [Cachan] (LSV) ; CNRS - INRIA - École normale supérieure - Cachan (ENS Cachan), DAHU (INRIA Saclay - Ile de France) ; CNRS - INRIA - École normale supérieure - Cachan (ENS Cachan), University of Massachusetts (UMASS) ; University of Massachusetts, Drexel University (DREXEL UNIVERSITY) ; Université - Drexel University, Skoltech ; Skoltech, McGill University [Montreal] ; McGill University, European Project : 226513, ERC, ERC-2008-AdG, WEBDAM(2008), Abiteboul, Serge, Antoine, Émilien, Miklau, Gerome, Stoyanovich, Julia, and Testard, Jules
Abstract: International audience, We present the WebdamLog system for managing distributed data on the Web in a peer-to-peer manner. We demonstrate the main features of the system through an application called Wepic for sharing pictures between attendees of the sigmod conference. Using Wepic, the attendees will be able to share, download, rate and annotate pictures in a highly decentralized manner. We show how WebdamLog handles heterogeneity of the devices and services used to share data in such a Web setting. We exhibit the simple rules that define the Wepic application and show how to easily modify the Wepic application.

12. Delaunay stability via perturbations

Author: GEOMETRICA (INRIA Sophia Antipolis / INRIA Saclay - Ile de France) ; INRIA, Advanced Computing and Microelectronics Unit [Kolkata] (ACMU) ; INDIAN STATISTICAL INSTITUTE, INRIA, European Project : 255827, ICT, FP7-ICT-2009-C, CG LEARNING(2010), Boissonnat, Jean-Daniel, Dyer, Ramsay, Ghosh, Arijit, GEOMETRICA (INRIA Sophia Antipolis / INRIA Saclay - Ile de France) ; INRIA, Advanced Computing and Microelectronics Unit [Kolkata] (ACMU) ; INDIAN STATISTICAL INSTITUTE, INRIA, European Project : 255827, ICT, FP7-ICT-2009-C, CG LEARNING(2010), Boissonnat, Jean-Daniel, Dyer, Ramsay, and Ghosh, Arijit
Abstract: We present an algorithm that takes as input a finite point set in Euclidean space, and performs a perturbation that guarantees that the Delaunay triangulation of the resulting perturbed point set has quantifiable stability with respect to the metric and the point positions. There is also a guarantee on the quality of the simplices: they cannot be too flat. The algorithm provides an alternative tool to the weighting or refinement methods to remove poorly shaped simplices in Delaunay triangulations of arbitrary dimension, but in addition it provides a guarantee of stability for the resulting triangulation., On présente un algorithme qui prend en entrée un ensemble fini de points de l'espace euclidien et les perturbent un peu de façon à garantir que la triangulation de Delaunay des points perturbés est stable de manière quantifiable vis à vis de perturbations de la métrique ou de la position des points. L'algorithme offre également une garantie sur la qualité des simplexes : ils ne peuvent pas être trop plats. L'algorithme propose une alternative simple aux techniques de pondération ou de raffinement qui permettent d'éliminer les simplexes plats des triangulations de Delaunay de dimension arbitraire, et fournit en plus une garantie sur la stabilité de la triangulation construite.

13. A Lightweight Formalization of the Metatheory of Bisimulation-Up-To

Author: PARSIFAL (INRIA Saclay - Ile de France) ; CNRS - INRIA - Polytechnique - X, Indiana University, Xavier Leroy and Alwen Tiu, European Project : 291592, ERC, ERC-2011-ADG_20110209, PROOFCERT(2012), Chaudhuri, Kaustuv, Cimini, Matteo, Miller, Dale, PARSIFAL (INRIA Saclay - Ile de France) ; CNRS - INRIA - Polytechnique - X, Indiana University, Xavier Leroy and Alwen Tiu, European Project : 291592, ERC, ERC-2011-ADG_20110209, PROOFCERT(2012), Chaudhuri, Kaustuv, Cimini, Matteo, and Miller, Dale
Abstract: International audience, Bisimilarity of two processes is formally established by producing a bisimulation relation that contains those two processes and obeys certain closure properties. In many situations, particularly when the under-lying labeled transition system is unbounded, these bisimulation relations can be large and even infinite. The bisimulation-up-to technique has been developed to reduce the size of the relations being computed while retaining soundness, that is, the guarantee of the existence of a bisimulation. Such techniques are increasingly becoming a critical ingredient in the automated checking of bisimilarity. This paper is devoted to the formalization of the meta theory of several major bisimulation-up-to techniques for the process calculi CCS and the π-calculus (with replication). Our formalization is based on recent work on the proof theory of least and greatest fixpoints, particularly the use of relations defined (co-)inductively, and of co-inductive proofs about such relations, as implemented in the Abella theorem prover. An important feature of our formalization is that our definitions of the bisimulation-up-to relations are, in most cases, straightforward translations of published informal definitions, and our proofs clarify several technical details of the informal descriptions. Since the logic behind Abella also supports λ-tree syntax and generic reasoning using the ∇-quantifier, our treatment of the π-calculus is both direct and natural.

14. Zigzag Persistence via Reflections and Transpositions

Author: GEOMETRICA (INRIA Sophia Antipolis / INRIA Saclay - Ile de France) ; INRIA, ANR-13-BS01-0008, TopData, Analyse Topologique des Données : Méthodes Statistiques et Estimation - TopData(2013), European Project : 339025, 31/01/2019, GUDHI(0000), Maria, Clément, Oudot, Steve, GEOMETRICA (INRIA Sophia Antipolis / INRIA Saclay - Ile de France) ; INRIA, ANR-13-BS01-0008, TopData, Analyse Topologique des Données : Méthodes Statistiques et Estimation - TopData(2013), European Project : 339025, 31/01/2019, GUDHI(0000), Maria, Clément, and Oudot, Steve
Abstract: International audience, We introduce a new algorithm for computing zigzag persis-tence, designed in the same spirit as the standard persistence algorithm. Our algorithm reduces a single matrix, maintains an explicit set of chains encoding the persistent homology of the current zigzag, and updates it under simplex insertions and removals. The total worst-case running time matches the usual cubic bound. A noticeable difference with the standard persistence al-gorithm is that we do not insert or remove new simplices "at the end" of the zigzag, but rather "in the middle". To do so, we use arrow reflections and transpositions, in the same spirit as reflection functors in quiver theory. Our analysis introduces new kinds of reflections in quiver representation theory: the "injective and surjective diamonds". It also in-troduces the "transposition diamond" which models arrow transpositions. For each type of diamond we are able to predict the changes in the interval decomposition and as-sociated compatible bases. Arrow transpositions have been studied previously in the context of standard persistent ho-mology, and we extend the study to the context of zigzag persistence. For both types of transformations, we provide simple procedures to update the interval decomposition and associated compatible homology basis.

15. The ARCOMEM Architecture for Social- and Semantic-Driven Web Archiving

Author: OAK (INRIA Saclay - Ile de France) ; Université Paris-Sud - Paris 11 (UP11) - INRIA - CNRS, Laboratoire de Recherche en Informatique (LRI) ; CNRS - Université Paris-Sud - Paris 11 (UP11), Leibniz Universität Hannover [Hannover] (LUH) ; Leibniz Universität Hannover, National Technical University of Athens [Athens] (NTUA) ; National Technical University of Athens, Department of Informatics [Athens] (CS-AUEB), Laboratoire Traitement et Communication de l'Information (LTCI) ; Télécom ParisTech - Institut Mines-Télécom - CNRS, Laboratoire BioGeMME (Biologie et Génétique des Mammifères Marins dans leur Environnement) (BioGeMME) ; Université européenne de Bretagne (UEB) - Université de Bretagne Occidentale (UBO), European Project : 270239, ICT, FP7-ICT-2009-6, ARCOMEM(2010), Cautis, Bogdan, Risse, Thomas, Demidova, Elena, Dietze, Stefan, Peters, Wim, Papailiou, Nikolaos, Doka, Katerina, Stavrakas, Yannis, Plachouras, Vassilis, Senellart, Pierre, Carpentier, Florent, Mantric, Amin, Siehndel, Patrick, Spiliotopoulos, Dimitris, OAK (INRIA Saclay - Ile de France) ; Université Paris-Sud - Paris 11 (UP11) - INRIA - CNRS, Laboratoire de Recherche en Informatique (LRI) ; CNRS - Université Paris-Sud - Paris 11 (UP11), Leibniz Universität Hannover [Hannover] (LUH) ; Leibniz Universität Hannover, National Technical University of Athens [Athens] (NTUA) ; National Technical University of Athens, Department of Informatics [Athens] (CS-AUEB), Laboratoire Traitement et Communication de l'Information (LTCI) ; Télécom ParisTech - Institut Mines-Télécom - CNRS, Laboratoire BioGeMME (Biologie et Génétique des Mammifères Marins dans leur Environnement) (BioGeMME) ; Université européenne de Bretagne (UEB) - Université de Bretagne Occidentale (UBO), European Project : 270239, ICT, FP7-ICT-2009-6, ARCOMEM(2010), Cautis, Bogdan, Risse, Thomas, Demidova, Elena, Dietze, Stefan, Peters, Wim, Papailiou, Nikolaos, Doka, Katerina, Stavrakas, Yannis, Plachouras, Vassilis, Senellart, Pierre, Carpentier, Florent, Mantric, Amin, Siehndel, Patrick, and Spiliotopoulos, Dimitris
Abstract: International audience

16. The Hidden Web, XML and Semantic Web: A Scientific Data Management Perspective

Author: LEO (INRIA Saclay - Ile de France) ; Université Paris-Sud - Paris 11 (UP11) - INRIA - CNRS, Montclair State University ; Montclair State University, Queensland University of Technology [Brisbane] (QUT) ; Queensland University ot Technology, Télécom ParisTech, European Project : 226513, ERC, ERC-2008-AdG, WEBDAM(2008), Suchanek, Fabian, Varde, Aparna, Nayak, Richi, Senellart, Pierre, LEO (INRIA Saclay - Ile de France) ; Université Paris-Sud - Paris 11 (UP11) - INRIA - CNRS, Montclair State University ; Montclair State University, Queensland University of Technology [Brisbane] (QUT) ; Queensland University ot Technology, Télécom ParisTech, European Project : 226513, ERC, ERC-2008-AdG, WEBDAM(2008), Suchanek, Fabian, Varde, Aparna, Nayak, Richi, and Senellart, Pierre
Abstract: International audience, The World Wide Web no longer consists just of HTML pages. Our work sheds light on a number of trends on the Internet that go beyond simple Web pages. The hidden Web provides a wealth of data in semi-structured form, accessible through Web forms and Web services. These services, as well as numerous other applications on the Web, commonly use XML, the eXtensible Markup Language. XML has become the lingua franca of the Internet that allows customized markups to be defined for specific domains. On top of XML, the Semantic Web grows as a common structured data source. In this work, we first explain each of these developments in detail. Using real-world examples from scientific domains of great interest today, we then demonstrate how these new developments can assist the managing, harvesting, and organization of data on the Web. On the way, we also illustrate the current research avenues in these domains. We believe that this effort would help bridge multiple database tracks, thereby attracting researchers with a view to extend database technology.

17. Evolution of synchronous female bilateral breast cancers and response to treatment

Author: Anne-Sophie Hamy, Judith Abécassis, Keltouma Driouch, Lauren Darrigues, Mathias Vandenbogaert, Cecile Laurent, Francois Zaccarini, Benjamin Sadacca, Myriam Delomenie, Enora Laas, Odette Mariani, Thanh Lam, Beatriz Grandal, Marick Laé, Ivan Bieche, Sophie Vacher, Jean-Yves Pierga, Etienne Brain, Celine Vallot, Judicael Hotton, Wilfrid Richer, Dario Rocha, Zakia Tariq, Veronique Becette, Didier Meseure, Laetitia Lesage, Anne Vincent-Salomon, Natalie Filmann, Jenny Furlanetto, Sibylle Loibl, Elise Dumas, Joshua J. Waterfall, Fabien Reyal, Residual Tumor & Response to Treatment Laboratory [Paris] (RT2Lab), Immunité et cancer (U932), Institut Curie [Paris]-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut Curie [Paris]-Institut National de la Santé et de la Recherche Médicale (INSERM), Institut Curie [Paris], Modèles et inférence pour les données de Neuroimagerie (MIND), IFR49 - Neurospin - CEA, Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-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), Méthodes computationnelles et mathématiques pour comprendre la société et la santé à partir de données (SODA), Inria Saclay - Ile de France, Département de chirurgie, Département de Recherche Translationnelle, Unité de génétique et biologie des cancers (U830), Institut Curie [Paris]-Institut National de la Santé et de la Recherche Médicale (INSERM), Departement de chirurgie [Institut Curie], Geneva University Hospitals and Geneva University, Département de Pathologie [CHU Rouen], CHU Rouen, Normandie Université (NU)-Normandie Université (NU)-Université de Rouen Normandie (UNIROUEN), Normandie Université (NU), Institut Cochin (IC UM3 (UMR 8104 / U1016)), Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Dynamique de l'information génétique : bases fondamentales et cancer (DIG CANCER), Institut Curie [Paris]-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Institut Jean Godinot [Reims], UNICANCER, and German Breast Group (GBG)
Subjects: [SDV]Life Sciences [q-bio], General Medicine, General Biochemistry, Genetics and Molecular Biology
Abstract: Synchronous bilateral breast cancer (sBBC) occurs after both breasts have been affected by the same germline genetics and environmental exposures. Little evidence exists regarding immune infiltration and response to treatment in sBBCs. Here we show that the impact of the subtype of breast cancer on levels of tumor infiltrating lymphocytes (TILs, n = 277) and on pathologic complete response (pCR) rates (n = 140) differed according to the concordant or discordant subtype of breast cancer of the contralateral tumor: luminal breast tumors with a discordant contralateral tumor had higher TIL levels and higher pCR rates than those with a concordant contralateral tumor. Tumor sequencing revealed that left and right tumors (n = 20) were independent regarding somatic mutations, copy number alterations and clonal phylogeny, whereas primary tumor and residual disease were closely related both from the somatic mutation and from the transcriptomic point of view. Our study indicates that tumor-intrinsic characteristics may have a role in the association of tumor immunity and pCR and demonstrates that the characteristics of the contralateral tumor are also associated with immune infiltration and response to treatment.
Published: 2023

18. Novel SPD matrix representations considering cross-frequency coupling for EEG classification using Riemannian geometry

Author: Yamamoto, Maria, Mellot, Apolline, Chevallier, Sylvain, Lotte, Fabien, Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), TAckling the Underspecified (TAU), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Modèles et inférence pour les données de Neuroimagerie (MIND), IFR49 - Neurospin - CEA, Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-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), Popular interaction with 3d content (Potioc), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, and ANR-20-THIA-0013,UDOPIA,Programme Doctoral en Intelligence Artificielle de l'Université Paris-Saclay(2020)
Subjects: Brain-computer interfaces (BCI), [MATH.MATH-DG]Mathematics [math]/Differential Geometry [math.DG], [SDV.NEU]Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], Electroencephalography (EEG), Riemannian geometry, cross-frequency coupling (CFC)
Abstract: International audience; Accurate classification of cognitive states from Electroencephalographic (EEG) signals is crucial in neuroscience applications such as Brain-Computer Interfaces (BCIs). Classification pipelines based on Riemannian geometry are often state-of-the-art in the BCI field. In this type of BCI, covariance matrices based on EEG signals of independent frequency bands are used as classification features. However, there is significant neuroscience evidence of neural interactions across frequency bands, such as cross-frequency coupling (CFC). Therefore, in this paper, we propose novel symmetric positive definite (SPD) matrix representations considering CFC for Riemannian geometry-based EEG classification. The spatial interactions of phase and amplitude within and between frequency bands are described in three different CFC SPD matrices. This allows us to include additional discriminative neurophysiological features that are not available in the conventional Riemannian EEG features. Our method was evaluated using a mental workload classification task from a public passive BCI dataset. Our fused model of the three CFC covariance matrices showed statistically significant improvements in average classification accuracies from the conventional covariance matrix in the theta and alpha bands by 18.32% and in the beta and gamma bands by 4.34% with smaller standard deviations. This result confirmed the effectiveness of considering more diverse neurophysiological interactions within and between frequency bands for Riemannian EEG classification.
Published: 2023

19. Gradient-based adaptive importance samplers

Author: Elvira, Víctor, Chouzenoux, Emilie, Akyildiz, Ömer Deniz, Martino, Luca, School of Mathematics - University of Edinburgh, University of Edinburgh, OPtimisation Imagerie et Santé (OPIS), 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)-Centre de vision numérique (CVN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-CentraleSupélec-Université Paris-Saclay, Centre de vision numérique (CVN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay, Imperial College London, Universidad Rey Juan Carlos [Madrid] (URJC), ANR-17-CE40-0031,PISCES,Méthodes d'échantillonnage d'importance adaptatives pour l'inférence Bayésienne dans les systèmes complexes(2017), European Project: ERC-2019-STG-850925,MAJORIS(2020), Chouzenoux, Emilie, Méthodes d'échantillonnage d'importance adaptatives pour l'inférence Bayésienne dans les systèmes complexes - - PISCES2017 - ANR-17-CE40-0031 - AAPG2017 - VALID, ERC-2019-STG-850925 - MAJORIS - ERC-2019-STG-850925 - INCOMING, and Inria Saclay - Île de France
Subjects: FOS: Computer and information sciences, Poisson field, Bayesian inference, Mathematics - Statistics Theory, Statistics Theory (math.ST), Statistics - Computation, Adaptive importance sampling, FOS: Mathematics, Gaussian mixture, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Monte Carlo, [STAT.ME]Statistics [stat]/Methodology [stat.ME], Computation (stat.CO), Langevin adaptation, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract: International audience; Importance sampling (IS) is a powerful Monte Carlo methodology for the approximation of intractable integrals, very often involving a target probability distribution. The performance of IS heavily depends on the appropriate selection of the proposal distributions where the samples are simulated from. In this paper, we propose an adaptive importance sampler, called GRAMIS, that iteratively improves the set of proposals. The algorithm exploits geometric information of the target to adapt the location and scale parameters of those proposals. Moreover, in order to allow for a cooperative adaptation, a repulsion term is introduced that favors a coordinated exploration of the state space. This translates into a more diverse exploration and a better approximation of the target via the mixture of proposals. Moreover, we provide a theoretical justification of the repulsion term. We show the good performance of GRAMIS in two problems where the target has a challenging shape and cannot be easily approximated by a standard uni-modal proposal.
Published: 2023

20. A Lagrangian Approach for Aggregative Mean Field Games of Controls with Mixed and Final Constraints

Author: J. Frédéric Bonnans, Justina Gianatti, Laurent Pfeiffer, Controle, Optimisation, modèles, Méthodes et Applications pour les Systèmes Dynamiques non linéaires (COMMANDS), Centre de Mathématiques Appliquées - Ecole Polytechnique (CMAP), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Universidad Nacional de Rosario [Santa Fe], Centro Franco Argentino de Ciencias de la Información y de Sistemas [Rosario] (CIFASIS), Consejo Nacional de Investigaciones Científicas y Técnicas [Buenos Aires] (CONICET)-Universidad Nacional de Rosario [Santa Fe], Dynamical Interconnected Systems in COmplex Environments (DISCO), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire des signaux et systèmes (L2S), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), and Universidad Nacional de Rosario [Santa Fe]-Consejo Nacional de Investigaciones Científicas y Técnicas [Buenos Aires] (CONICET)
Subjects: Computer Science::Computer Science and Game Theory, aggregative games, Control and Optimization, Optimization and Control (math.OC), Applied Mathematics, Lagrangian equilibria, FOS: Mathematics, TheoryofComputation_GENERAL, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], constrained optimal control, Mathematics - Optimization and Control, Mean field games of controls
Abstract: The objective of this paper is to analyze the existence of equilibria for a class of deterministic mean field games of controls. The interaction between players is due to both a congestion term and a price function which depends on the distributions of the optimal strategies. Moreover, final state and mixed state-control constraints are considered, the dynamics being nonlinear and affine with respect to the control. The existence of equilibria is obtained by Kakutani's theorem, applied to a fixed point formulation of the problem. Finally, uniqueness results are shown under monotonicity assumptions.
Published: 2023

21. On Rectangle-Decomposable 2-Parameter Persistence Modules

Author: Botnan, Magnus Bakke, Lebovici, Vadim, Oudot, Steve, Cabello, Sergio, Chen, Danny Z., Mathematics, Vrije Universiteit Amsterdam [Amsterdam] (VU), 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), Sergio Cabello, Danny Z. Chen, Schloss Dagstuhl--Leibniz-Zentrum für Informatik, La Géometrie au Service du Numérique (GEOMERIX), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut Polytechnique de Paris (IP Paris), Cabello, Sergio, and Chen, Danny Z.
Subjects: Computational Geometry (cs.CG), FOS: Computer and information sciences, Topological data analysis, SDG 10 - Reduced Inequalities, Multiparameter persistence, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], Theoretical Computer Science, Computational Theory and Mathematics, [MATH.MATH-AT]Mathematics [math]/Algebraic Topology [math.AT], FOS: Mathematics, Computer Science - Computational Geometry, Discrete Mathematics and Combinatorics, Algebraic Topology (math.AT), Mathematics - Algebraic Topology, Geometry and Topology, rank invaria, Rank invariant
Abstract: This paper addresses two questions: (a) can we identify a sensible class of 2-parameter persistence modules on which the rank invariant is complete? (b) can we determine efficiently whether a given 2-parameter persistence module belongs to this class? We provide positive answers to both questions, and our class of interest is that of rectangle-decomposable modules. Our contributions include: on the one hand, a proof that the rank invariant is complete on rectangle-decomposable modules, together with an inclusion-exclusion formula for counting the multiplicities of the summands; on the other hand, algorithms to check whether a module induced in homology by a bifiltration is rectangle-decomposable, and to decompose it in the affirmative, with a better complexity than state-of-the-art decomposition methods for general 2-parameter persistence modules. Our algorithms are backed up by a new structure theorem, whereby a 2-parameter persistence module is rectangle-decomposable if, and only if, its restrictions to squares are. This local characterization is key to the efficiency of our algorithms, and it generalizes previous conditions derived for the smaller class of block-decomposable modules. It also admits an algebraic formulation that turns out to be a weaker version of the one for block-decomposability. By contrast, we show that general interval-decomposability does not admit such a local characterization, even when locality is understood in a broad sense. Our analysis focuses on the case of modules indexed over finite grids, the more general cases are left as future work., Comment: This is the final version to be published in DCG. Changed the algorithm in Section 3 for computing the rank invariant, which was incorrect. The new algorithm reduces to computing 1-parameter vineyards along a family of paths in the grid. It was first proposed in the PhD thesis of D. Morozov
Published: 2022

22. Wavelets in the Deep Learning Era

Author: Zaccharie Ramzi, Kevin Michalewicz, Jean-Luc Starck, Thomas Moreau, Philippe Ciuciu, Modelling brain structure, function and variability based on high-field MRI data (PARIETAL), 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)-Service NEUROSPIN (NEUROSPIN), Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Astrophysique Interprétation Modélisation (AIM (UMR_7158 / UMR_E_9005 / UM_112)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP), Service NEUROSPIN (NEUROSPIN), Université Paris-Saclay-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-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), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Modèles et inférence pour les données de Neuroimagerie (MIND), and IFR49 - Neurospin - CEA
Subjects: Statistics and Probability, Denoising, Neural Networks, Applied Mathematics, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], Wavelets, Condensed Matter Physics, Machine Learning, Image restoration, Deep Learning, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, 0102 Applied Mathematics, Modeling and Simulation, 0801 Artificial Intelligence and Image Processing, Artificial Intelligence & Image Processing, Geometry and Topology, Computer Vision and Pattern Recognition, 0802 Computation Theory and Mathematics
Abstract: International audience; Sparsity-based methods, such as wavelets, have been the state of the art for more than 20 years for inverse problems before being overtaken by neural networks. In particular, U-nets have proven to be extremely effective. Their main ingredients are a highly nonlinear processing, a massive learning made possible by the flourishing of optimization algorithms with the power of computers (GPU) and the use of large available datasets for training. It is far from obvious to say which of these three ingredients has the biggest impact on the performance. While the many stages of nonlinearity are intrinsic to deep learning, the usage of learning with training data could also be exploited by sparsity-based approaches. The aim of our study is to push the limits of sparsity to use, similarly to U-nets, massive learning and large datasets, and then to compare the results with U-nets. We present a new network architecture, called learnlets, which conserves the properties of sparsity-based methods such as exact reconstruction and good generalization properties, while fostering the power of neural networks for learning and fast calculation. We evaluate the model on image denoising tasks. Our conclusion is that U-nets perform better than learnlets on image quality metrics in distribution, while learnlets have better generalization properties.
Published: 2022

23. Coqlex: Generating Formally Verified Lexers

Author: Ouedraogo, Wendlasida, Scherer, Gabriel, Strassburger, Lutz, Automatisation et ReprésenTation: fOndation du calcUl et de la déducTion (PARTOUT), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), INRIA Saclay - Ile-de-France, and OUEDRAOGO, Wendlasida
Subjects: FOS: Computer and information sciences, Computer Science - Programming Languages, [INFO] Computer Science [cs], Lexer, Tokenizer, Formal verification, Lexical analyzers, OCamllex, Compilers, Verbatim++, Regexp, Coq, [INFO]Computer Science [cs], Programming Languages (cs.PL)
Abstract: A compiler consists of a sequence of phases going from lexical analysis to code generation. Ideally, the formal verification of a compiler should include the formal verification of each component of the tool-chain. An example is the CompCert project, a formally verified C compiler, that comes with associated tools and proofs that allow to formally verify most of those components. However, some components, in particular the lexer, remain unverified. In fact, the lexer of Compcert is generated using OCamllex, a lex-like OCaml lexer generator that produces lexers from a set of regular expressions with associated semantic actions. Even though there exist various approaches, like CakeML or Verbatim++, to write verified lexers, they all have only limited practical applicability. In order to contribute to the end-to-end verification of compilers, we implemented a generator of verified lexers whose usage is similar to OCamllex. Our software, called Coqlex, reads a lexer specification and generates a lexer equipped with a Coq proof of its correctness. It provides a formally verified implementation of most features of standard, unverified lexer generators. The conclusions of our work are two-fold: Firstly, verified lexers gain to follow a user experience similar to lex/flex or OCamllex, with a domain-specific syntax to write lexers comfortably. This introduces a small gap between the written artifact and the verified lexer, but our design minimizes this gap and makes it practical to review the generated lexer. The user remains able to prove further properties of their lexer. Secondly, it is possible to combine simplicity and decent performance. Our implementation approach that uses Brzozowski derivatives is noticeably simpler than the previous work in Verbatim++ that tries to generate a deterministic finite automaton (DFA) ahead of time, and it is also noticeably faster thanks to careful design choices. We wrote several example lexers that suggest that the convenience of using Coqlex is close to that of standard verified generators, in particular, OCamllex. We used Coqlex in an industrial project to implement a verified lexer of Ada. This lexer is part of a tool to optimize safety-critical programs, some of which are very large. This experience confirmed that Coqlex is usable in practice, and in particular that its performance is good enough. Finally, we performed detailed performance comparisons between Coqlex, OCamllex, and Verbatim++. Verbatim++ is the state-of-the-art tool for verified lexers in Coq, and the performance of its lexer was carefully optimized in previous work by Egolf and al. (2022). Our results suggest that Coqlex is two orders of magnitude slower than OCamllex, but two orders of magnitude faster than Verbatim++. Verified compilers and other language-processing tools are becoming important tools for safety-critical or security-critical applications. They provide trust and replace more costly approaches to certification, such as manually reading the generated code. Verified lexers are a missing piece in several Coq-based verified compilers today. Coqlex comes with safety guarantees, and thus shows that it is possible to build formally verified front-ends.
Published: 2023

24. Stable Vectorization of Multiparameter Persistent Homology using Signed Barcodes as Measures

Author: Loiseaux, David, Scoccola, Luis, Carrière, Mathieu, Botnan, Magnus Bakke, Oudot, Steve, 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), Northeastern University [Boston], Vrije Universiteit Amsterdam [Amsterdam] (VU), La Géometrie au Service du Numérique (GEOMERIX), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut Polytechnique de Paris (IP Paris), and ANR-19-P3IA-0002,3IA@cote d'azur,3IA Côte d'Azur(2019)
Subjects: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Machine Learning, Statistics - Machine Learning, [MATH.MATH-AT]Mathematics [math]/Algebraic Topology [math.AT], FOS: Mathematics, Algebraic Topology (math.AT), Computer Science - Computational Geometry, Machine Learning (stat.ML), [INFO]Computer Science [cs], Mathematics - Algebraic Topology, Machine Learning (cs.LG)
Abstract: Persistent homology (PH) provides topological descriptors for geometric data, such as weighted graphs, which are interpretable, stable to perturbations, and invariant under, e.g., relabeling. Most applications of PH focus on the one-parameter case -- where the descriptors summarize the changes in topology of data as it is filtered by a single quantity of interest -- and there is now a wide array of methods enabling the use of one-parameter PH descriptors in data science, which rely on the stable vectorization of these descriptors as elements of a Hilbert space. Although the multiparameter PH (MPH) of data that is filtered by several quantities of interest encodes much richer information than its one-parameter counterpart, the scarceness of stability results for MPH descriptors has so far limited the available options for the stable vectorization of MPH. In this paper, we aim to bring together the best of both worlds by showing how the interpretation of signed barcodes -- a recent family of MPH descriptors -- as signed measures leads to natural extensions of vectorization strategies from one parameter to multiple parameters. The resulting feature vectors are easy to define and to compute, and provably stable. While, as a proof of concept, we focus on simple choices of signed barcodes and vectorizations, we already see notable performance improvements when comparing our feature vectors to state-of-the-art topology-based methods on various types of data., 23 pages, 3 figures, 8 tables
Published: 2023

25. Collaborative Ad Transparency: Promises and Limitations

Author: Gkiouzepi, Eleni, Andreou, Athanasios, Goga, Oana, Loiseau, Patrick, Technical University of Berlin / Technische Universität Berlin (TU), Algorithmic Transparency Institute (ATI), Rich Data Analytics at Cloud Scale (CEDAR), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), IA coopérative : équité, vie privée, incitations (FAIRPLAY), Centre de Recherche en Économie et Statistique (CREST), Ecole Nationale de la Statistique et de l'Analyse de l'Information [Bruz] (ENSAI)-École polytechnique (X)-École Nationale de la Statistique et de l'Administration Économique (ENSAE Paris)-Centre National de la Recherche Scientifique (CNRS)-Ecole Nationale de la Statistique et de l'Analyse de l'Information [Bruz] (ENSAI)-École polytechnique (X)-École Nationale de la Statistique et de l'Administration Économique (ENSAE Paris)-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)-Institut Polytechnique de Paris (IP Paris)-Criteo AI Lab, Criteo [Paris]-Criteo [Paris], ANR-17-CE23-0014,PRoTecT,Vie Privee et Confiance dans l'Internet Oriente Utilisateur(2017), ANR-21-CE23-0031,PROPEOS,Personnalisation de services en ligne respectueuse de la vie privée(2021), ANR-20-CE23-0007,FairPlay,Algorithmes équitables via la théorie des jeux et l'apprentissage séquentiel(2020), ANR-19-P3IA-0003,MIAI,MIAI @ Grenoble Alpes(2019), European Project: 952215,TAILOR(2020), European Project: 101021377,TRUST aWARE(2021), Loiseau, Patrick, Vie Privee et Confiance dans l'Internet Oriente Utilisateur - - PRoTecT2017 - ANR-17-CE23-0014 - AAPG2017 - VALID, Personnalisation de services en ligne respectueuse de la vie privée - - PROPEOS2021 - ANR-21-CE23-0031 - AAPG2021 - VALID, Algorithmes équitables via la théorie des jeux et l'apprentissage séquentiel - - FairPlay2020 - ANR-20-CE23-0007 - AAPG2020 - VALID, MIAI @ Grenoble Alpes - - MIAI2019 - ANR-19-P3IA-0003 - P3IA - VALID, and Foundations of Trustworthy AI - Integrating Reasoning, Learning and Optimization - TAILOR - 2020-09-01 - 2023-08-31 - 952215 - VALID
Subjects: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI], [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Abstract: International audience; Several targeted advertising platforms offer transparency mechanisms, but researchers and civil societies repeatedly showed that those have major limitations. In this paper, we propose a collaborative ad transparency method to infer, without the cooperation of ad platforms, the targeting parameters used by advertisers to target their ads. Our idea is to ask users to donate data about their attributes and the ads they receive and to use this data to infer the targeting attributes of an ad campaign. We propose a Maximum Likelihood Estimator based on a simplified Bernoulli ad delivery model. We first test our inference method through controlled ad experiments on Facebook. Then, to further investigate the potential and limitations of collaborative ad transparency, we propose a simulation framework that allows varying key parameters. We validate that our framework gives accuracies consistent with real-world observations such that the insights from our simulations are transferable to the real world. We then perform an extensive simulation study for ad campaigns that target a combination of two attributes. Our results show that we can obtain good accuracy whenever at least ten monitored users receive an ad. This usually requires a few thousand monitored users, regardless of population size. Our simulation framework is based on a new method to generate a synthetic population with statistical properties resembling the actual population, which may be of independent interest.
Published: 2023

26. GLADIS: A General and Large Acronym Disambiguation Benchmark

Author: Chen, Lihu, Varoquaux, Gaël, Suchanek, Fabian M., Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), Télécom ParisTech, Data, Intelligence and Graphs (DIG), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Modelling brain structure, function and variability based on high-field MRI data (PARIETAL), Service NEUROSPIN (NEUROSPIN), Université Paris-Saclay-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire de Neuroimagerie Assistée par Ordinateur (LNAO), Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Méthodes computationnelles et mathématiques pour comprendre la société et la santé à partir de données (SODA), Inria Saclay - Ile de France, and ANR-20-CHIA-0012,NoRDF,Modéliser et extraire des informations complexes du texte en langage naturel(2020)
Subjects: FOS: Computer and information sciences, Computer Science - Computation and Language, Acronym Disambiguation, [INFO]Computer Science [cs], Entity Linking, Benchmark, Computation and Language (cs.CL), [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract: Acronym Disambiguation (AD) is crucial for natural language understanding on various sources, including biomedical reports, scientific papers, and search engine queries. However, existing acronym disambiguation benchmarks and tools are limited to specific domains, and the size of prior benchmarks is rather small. To accelerate the research on acronym disambiguation, we construct a new benchmark named GLADIS with three components: (1) a much larger acronym dictionary with 1.5M acronyms and 6.4M long forms; (2) a pre-training corpus with 160 million sentences; (3) three datasets that cover the general, scientific, and biomedical domains. We then pre-train a language model, \emph{AcroBERT}, on our constructed corpus for general acronym disambiguation, and show the challenges and values of our new benchmark., Long paper at EACL 23
Published: 2023
Full Text: View/download PDF

27. Modélisation des neurones, équation de Bloch-Torrey et leur application à l'estimation de la microstructure du cerveau par IRM de diffusion

Author: Fang, Chengran, Modèles et inférence pour les données de Neuroimagerie (MIND), IFR49 - Neurospin - CEA, Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-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), Inversion of Differential Equations For Imaging and physiX (IDEFIX), 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)-Unité de Mathématiques Appliquées (UMA), École Nationale Supérieure de Techniques Avancées (ENSTA Paris)-École Nationale Supérieure de Techniques Avancées (ENSTA Paris), Université Paris-Saclay, Jing-Rebecca Li, and Demian Wassermann
Subjects: Bloch-Torrey equation, Modélisation des neurones, Numerical simulation, IRM de diffusion, Apprentissage automatique, Diffusion MRI, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Équation de Bloch-Torrey, Imagerie de la microstructure du cerveau, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, Neuron modeling, Simulation numérique, [MATH.MATH-MP]Mathematics [math]/Mathematical Physics [math-ph], Brain microstructure imaging, Machine learning, [INFO.INFO-IM]Computer Science [cs]/Medical Imaging, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
Abstract: Non-invasively estimating brain microstructure that consists of a very large number of neurites, somas, and glial cells is essential for future neuroimaging. Diffusion MRI (dMRI) is a promising technique to probe brain microstructural properties below the spatial resolution of MRI scanners. Due to the structural complexity of brain tissue and the intricate diffusion MRI mechanism, in vivo microstructure estimation is challenging.Existing methods typically use simplified geometries, particularly spheres, and sticks, to model neuronal structures and to obtain analytical expressions of intracellular signals. The validity of the assumptions made by these methods remains undetermined. This thesis aims to facilitate simulationdriven brain microstructure estimation by replacing simplified geometries with realistic neuron geometry models and the analytical intracellular signal expressions with diffusion MRI simulations. Combined with accurate neuron geometry models, numerical dMRI simulations can give accurate intracellular signals and seamlessly incorporate effects arising from, for instance, neurite undulation or water exchange between soma and neurites.Despite these advantages, dMRI simulations have not been widely adopted due to the difficulties in constructing realistic numerical phantoms, the high computational cost of dMRI simulations, and the difficulty in approximating the implicit mappings between dMRI signals and microstructure properties. This thesis addresses the above problems by making four contributions. First, we develop a high-performance opensource neuron mesh generator and make publicly available over a thousand realistic cellular meshes.The neuron mesh generator, swc2mesh, can automatically and robustly convert valuable neuron tracing data into realistic neuron meshes. We have carefully designed the generator to maintain a good balance between mesh quality and size. A neuron mesh database, NeuronSet, which contains 1213 simulation-ready cell meshes and their neuroanatomical measurements, was built using the mesh generator. These meshes served as the basis for further research. Second, we increased the computational efficiency of the numerical matrix formalism method by accelerating the eigendecomposition algorithm and exploiting GPU computing. The speed was increased tenfold. With similar accuracy, the optimized numerical matrix formalism is 20 times faster than the FEM method and 65 times faster than a GPU-based Monte Carlo method. By performing simulations on realistic neuron meshes, we investigated the effect of water exchange between somas and neurites, and the relationship between soma size and signals. We then implemented a new simulation method that provides a Fourier-like representation of the dMRI signals. This method was derived theoretically and implemented numerically. We validated the convergence of the method and showed that the error behavior is consistent with our error analysis. Finally, we propose a simulation-driven supervised learning framework to estimate brain microstructure using diffusion MRI. By exploiting the powerful modeling and computational capabilities that are mentioned above, we have built a synthetic database containing the dMRI signals and microstructure parameters of 1.4 million artificial brain voxels. We have shown that this database can help approximate the underlying mappings of the dMRI signals to volume and surface fractions using artificial neural networks.; L'estimation non invasive de la microstructure du cerveau, qui se compose de nombreux neurites, de somas et de cellules gliales, est essentielle pour l'imagerie cérébrale. L'IRM de diffusion (IRMd) est une technique prometteuse pour sonder les propriétés microstructurelles du cerveau en dessous de la résolution spatiale des scanners IRM. En raison de la complexité structurelle du tissu cérébral et du mécanisme complexe de l'IRM de diffusion, l'estimation de la microstructure in vivo est un défi. Les méthodes existantes utilisent généralement des géométries simplifiées, notamment des sphères et des bâtons, pour modéliser les structures neuronales et obtenir des expressions analytiques des signaux intracellulaires. La validité des hypothèses faites par ces méthodes reste indéterminée. Cette thèse vise à faciliter l'estimation de la microstructure du cerveau par simulation en remplaçant les géométries simplifiées par des modèles réalistes de la géométrie des neurones et les expressions analytiques des signaux intracellulaires par des simulations d'IRM de diffusion. Combinées à des modèles précis de la géométrie des neurones, les simulations numériques d'IRMd peuvent donner des signaux intracellulaires précis et incorporer les effets dus, par exemple, à l'ondulation des neurites ou à l'échange d'eau entre le soma et les neurites.Malgré ces avantages, les simulations d'IRMd n'ont pas été largement adoptées en raison de l'inaccessibilité des fantômes numériques, de la faible efficacité de calcul des simulateurs d'IRMd et de la difficulté d'approximer les mappings implicites entre les signaux d'IRMd et les propriétés de la microstructure. Cette thèse contribue à la résolution des problèmes susmentionnés de la manière suivante : (1) en développant un générateur de maillage de neurones open-source et en rendant accessibles au public plus d'un millier de maillages cellulaires réalistes ; (2) en augmentant d'un facteur dix l'efficacité de calcul de la méthode du formalisme matriciel numérique ; (3) en mettant en œuvre une nouvelle méthode de simulation qui fournit une représentation de type Fourier des signaux IRMd ; (4) en proposant un cadre d'apprentissage supervisé basé sur la simulation pour estimer la microstructure du cerveau par IRM de diffusion.
Published: 2023

28. Recommandations sur les « éditeurs de la zone grise »

Author: Blanqui, Frédéric, Canteaut, Anne, de Jong, Hidde, Imperiale, Sébastien, Mitton, Nathalie, Pallez, Guillaume, Pennec, Xavier, Rival, Xavier, Thirion, Bertrand, Deduction modulo, interopérabilité et démonstration automatique (DEDUCTEAM), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Cryptologie symétrique, cryptologie fondée sur les codes et information quantique (COSMIQ), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Analyse, ingénierie et contrôle des micro-organismes (MICROCOSME), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Grenoble Alpes (UGA), Mathematical and Mechanical Modeling with Data Interaction in Simulations for Medicine (M3DISIM), Laboratoire de mécanique des solides (LMS), École polytechnique (X)-Mines Paris - PSL (École nationale supérieure des mines de Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Mines Paris - PSL (École nationale supérieure des mines de Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Self-organizing Future Ubiquitous Network (FUN), Inria Lille - Nord Europe, Scalable Storage for Clouds and Beyond (KerData), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), E-Patient : Images, données & mOdèles pour la médeciNe numériquE (EPIONE), Inria Sophia Antipolis - Méditerranée (CRISAM), Analyse Statique par Interprétation Abstraite (ANTIQUE), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Modèles et inférence pour les données de Neuroimagerie (MIND), IFR49 - Neurospin - CEA, Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Inria Saclay - Ile de France, and Inria
Subjects: [INFO]Computer Science [cs], [MATH]Mathematics [math]
Abstract: Recommandations de la Commission d'Évaluation Inria, adoptées le 25 janvier 2023, sur certains éditeurs, notamment MDPI et Frontiers, qui prennent depuis quelques années une place significative dans les domaines de l'informatique et des mathématiques, disciplines où ils étaient absents par le passé.
Published: 2023

29. Convergence Analysis of Block Majorize-Minimize Subspace Approach

Author: Chouzenoux, Emilie, Fest, Jean-Baptiste, OPtimisation Imagerie et Santé (OPIS), 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)-Centre de vision numérique (CVN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-CentraleSupélec-Université Paris-Saclay, Inria Saclay - Île de France, European Project: ERC-2019-STG-850925,MAJORIS(2020), European Project: ERC-2019-STG-850925,MAJORIS, Chouzenoux, Emilie, and ERC-2019-STG-850925 - MAJORIS - ERC-2019-STG-850925 - INCOMING
Subjects: majorization-minimization, non-convex optimization, Block alternating method, memory gradient, Kurdyka-Lojasiewicz, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, quasi-Newton, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract: We consider the minimization of a differentiable Lipschitz gradient but non necessarily convex, function F defined on R N. We propose an accelerated gradient descent approach which combines three strategies, namely (i) a variable metric derived from the majorization-minimization principle ; (ii) a subspace strategy incorporating information from the past iterates ; (iii) a block alternating update. Under the assumption that F satisfies the Kurdyka-Łojasiewicz property, we give conditions under which the sequence generated by the resulting block majorize-minimize subspace algorithm converges to a critical point of the objective function, and we exhibit convergence rates for its iterates.
Published: 2023

30. Intégration de la recherche de connexion dans les requêtes de graphique

Author: Anadiotis, Angelos Christos, Manolescu, Ioana, Mohanty, Madhulika, Mohanty, Madhulika, Oracle Labs Switzerland, École polytechnique (X), Rich Data Analytics at Cloud Scale (CEDAR), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), ANR-20-CHIA-0015,SourcesSay,Analyse et Interconnexion Intelligente des Contenus Héterogènes dans des Arènes Numériques(2020), and Inria Saclay - Île de France
Subjects: FOS: Computer and information sciences, Artificial Intelligence (cs.AI), [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Computer Science - Databases, [INFO.INFO-WB] Computer Science [cs]/Web, Computer Science - Artificial Intelligence, [INFO.INFO-WB]Computer Science [cs]/Web, Keyword Search on Graphs, [INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB], Databases (cs.DB), [INFO]Computer Science [cs], Graph Queries, Graph Data Management
Abstract: National audience; Graph data management and querying has many practical applications. When graphs are very heterogeneous and/or users are unfamiliar with their structure, they may need to find how two or more groups of nodes are connected in a graph, even when users are not able to describe the connections. This is only partially supported by existing query languages, which allow searching for paths, but not for trees connecting three or more node groups. The latter is related to the NP-hard Group Steiner Tree problem, and has been previously considered for keyword search in databases. In this work, we formally show how to integrate connecting tree patterns (CTPs, in short) within a graph query language such as SPARQL or Cypher, leading to an Extended Query Language (or EQL, in short). We then study a set of algorithms for evaluating CTPs; we generalize prior keyword search work, most importantly by (i) considering bidirectional edge traversal and (ii) allowing users to select any score function for ranking CTP results. To cope with very large search spaces, we propose an efficient pruning technique and formally establish a large set of cases where our algorithm, MOLESP, is complete even with pruning. Our experiments validate the performance of our CTP and EQL evaluation algorithms on a large set of synthetic and real-world workloads.
Published: 2023

31. An optimal control-based numerical method for scalar transmission problems with sign-changing coefficients

Author: Ciarlet, Patrick, Lassounon, David, Mahran Rihani, Ciarlet, Patrick, Propagation des Ondes : Étude Mathématique et Simulation (POEMS), 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)-Unité de Mathématiques Appliquées (UMA), École Nationale Supérieure de Techniques Avancées (ENSTA Paris)-École Nationale Supérieure de Techniques Avancées (ENSTA Paris)-Centre National de la Recherche Scientifique (CNRS), Institut de Recherche Mathématique de Rennes (IRMAR), 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)-École normale supérieure - Rennes (ENS Rennes)-Université de Rennes 2 (UR2)-Centre National de la Recherche Scientifique (CNRS)-INSTITUT AGRO Agrocampus Ouest, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro), Centre de Mathématiques Appliquées - Ecole Polytechnique (CMAP), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), ANR-11-LABX-0020,LEBESGUE,Centre de Mathématiques Henri Lebesgue : fondements, interactions, applications et Formation(2011), Centre National de la Recherche Scientifique (CNRS)-Unité de Mathématiques Appliquées (UMA), École Nationale Supérieure de Techniques Avancées (ENSTA Paris)-École Nationale Supérieure de Techniques Avancées (ENSTA Paris)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Université de Rennes 2 (UR2), Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-INSTITUT AGRO Agrocampus Ouest
Subjects: optimal control, transmission problem, FOS: Mathematics, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), [MATH] Mathematics [math], [MATH]Mathematics [math], sign-changing coefficients, fictitious domain methods
Abstract: In this work, we present a new numerical method for solving the scalar transmission problem with sign-changing coefficients. In electromagnetism, such a transmission problem can occur if the domain of interest is made of a classical dielectric material and a metal or a metamaterial, with for instance an electric permittivity that is strictly negative in the metal or metamaterial. The method is based on an optimal control reformulation of the problem. Contrary to other existing approaches, the convergence of this method is proved without any restrictive condition. In particular, no condition is imposed on the a priori regularity of the solution to the problem, and no condition is imposed on the meshes, other than that they fit with the interface between the two media. Our results are illustrated by some (2D) numerical experiments.
Published: 2023

32. Inversion of Eddy-Current Signals Using a Level-Set Method and Block Krylov Solvers

Author: Audibert, Lorenzo, Girardon, Hugo, Haddar, Houssem, Jolivet, Pierre, Inversion of Differential Equations For Imaging and physiX (IDEFIX), 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)-Unité de Mathématiques Appliquées (UMA), École Nationale Supérieure de Techniques Avancées (ENSTA Paris)-École Nationale Supérieure de Techniques Avancées (ENSTA Paris), Shape reconstruction and identification (DeFI ), Centre de Mathématiques Appliquées - Ecole Polytechnique (CMAP), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Ecole Nationale Supérieure d'Electrotechnique, d'Electronique, d'Informatique, d'Hydraulique et de Télécommunications (ENSEEIHT), Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université de Toulouse (UT), This work was granted access to the GENCI-sponsored HPC resources of TGCC@CEA under allocations A0070607519 and A0090607519., Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Mathématiques Appliquées - Ecole Polytechnique (CMAP), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), ENSEEIHT, and Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées
Subjects: large-scale inverse problems AMS subject classifications. 35Q61, 49Q10, block Krylov methods, 78A46, eddy currents, [MATH]Mathematics [math], 65F10, domain decomposition preconditioners, large-scale inverse problems
Abstract: International audience; The application motivating this work is related to the identification of deposits inside nuclear power plant steam generators using eddy-current probes. We consider a realistic experimental process that relies on the scan of a domain by sweeping along a tube axis a probe made out of coils, playing the role of the sources/receivers. Solving the inverse shape problem associated with these measurements using a least squares method requires solutions to the eddy-current and the adjoint problems for a large number of right-hand sides at each gradient-descent iteration. Additional cost in the forward solver comes from the use of a potential formulation of the problem that has the advantage of being independent from the topology of the conductive media (that may vary during iterations). We use a level-set approach to avoid remeshing and handle unknown topologies. The crucial ingredient in our algorithm is an optimized way of handling high numbers of right-hand sides for iterative solvers of large-scale problems. We first benchmark various block Krylov methods, block GMRES and block BGCRODR, to test their effectiveness compared to their standard counterpart, i.e., GMRES and GCRODR. Then, we propose for BGCRODR a new implementation for recycling information from previously generated Krylov bases that scales better than traditional approaches. This part is independent from the practical inverse problem at hand. The efficiency of the overall inversion procedure is finally demonstrated on realistic synthetic 3D examples.
Published: 2023

33. Predicting high-resolution turbulence details in space and time

Author: Bai, Kai, Wang, Chunhao, Desbrun, Mathieu, Liu, Xiaopei, ShanghaiTech University [Shanghai], Shanghai Institute of Microsystem and Information Technology (SIMIT), Graduate University of Chinese [Beijing] (UCAS), Chinese Academy of Sciences [Changchun Branch] (CAS), Département d'informatique de l'École polytechnique (X-DEP-INFO), École polytechnique (X), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria), California Institute of Technology (CALTECH), La Géometrie au Service du Numérique (GEOMERIX), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut Polytechnique de Paris (IP Paris), and This work was supported by the National Natural Science Foundation of China (No. 62072310 and No. 61976138) as well as ShanghaiTech University. M. Desbrun gratefully acknowledges generous support from Inria, Pixar Animation Studios and Ansys Inc.
Subjects: Physics::Fluid Dynamics, Smoke Animation, Neural Networks, Fluid Simulation, [INFO]Computer Science [cs], [MATH]Mathematics [math], Computer Graphics and Computer-Aided Design, Dictionary Learning, ComputingMethodologies_COMPUTERGRAPHICS
Abstract: International audience; Predicting the fine and intricate details of a turbulent flow field in both space and time from a coarse input remains a major challenge despite the availability of modern machine learning tools. In this paper, we present a simple and effective dictionary-based approach to spatio-temporal upsampling of fluid simulation. We demonstrate that our neural network approach can reproduce the visual complexity of turbulent flows from spatially and temporally coarse velocity fields even when using a generic training set. Moreover, since our method generates finer spatial and/or temporal details through embarrassingly-parallel upsampling of small local patches, it can efficiently predict high-resolution turbulence details across a variety of grid resolutions. As a consequence, our method offers a whole range of applications varying from fluid flow upsampling to fluid data compression. We demonstrate the efficiency and generalizability of our method for synthesizing turbulent flows on a series of complex examples, highlighting dramatically better results in spatio-temporal upsampling and flow data compression than existing methods as assessed by both qualitative and quantitative comparisons.
Published: 2021

34. Inverse Scattering Theory and Transmission Eigenvalues: Second Edition

Author: Houssem Haddar, David Colton, Fioralba Cakoni, Department of Mathematics - Rutgers School of Arts and Sciences, Rutgers, The State University of New Jersey [New Brunswick] (RU), Rutgers University System (Rutgers)-Rutgers University System (Rutgers), Department of Mathematical Sciences (University of Delaware), University of Delaware [Newark], Inversion of Differential Equations For Imaging and physiX (IDEFIX), 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)-Unité de Mathématiques Appliquées (UMA), École Nationale Supérieure de Techniques Avancées (ENSTA Paris)-École Nationale Supérieure de Techniques Avancées (ENSTA Paris), Rutgers University System (Rutgers), Department of Mathematical Sciences, Shape reconstruction and identification (DeFI ), Centre de Mathématiques Appliquées - Ecole Polytechnique (CMAP), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Mathématiques Appliquées - Ecole Polytechnique (CMAP), and École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Physics, 010102 general mathematics, [INFO.INFO-NA]Computer Science [cs]/Numerical Analysis [cs.NA], 01 natural sciences, 010101 applied mathematics, Transmission (telecommunications), Quantum mechanics, Inverse scattering problem, Scattering theory, Quantum inverse scattering method, 0101 mathematics, [MATH]Mathematics [math], Eigenvalues and eigenvectors, ComputingMilieux_MISCELLANEOUS, [MATH.MATH-SP]Mathematics [math]/Spectral Theory [math.SP]
Abstract: International audience; In the first edition of this book, we discussed methods for determining the support of an inhomogeneous media from measured far field data as well as an extensive study of the central role played by the transmission eigenvalue problem in the mathematical development of these methods. In particular, we introduced the generalized linear sampling method (GLSM) and showed that this method provides a mathematical explanation of why it is permissible to use Tikhonov regularization to obtain an approximate solution of the far field equation associated with the linear sampling method.In the five years since the first edition of our book appeared, there has been considerable progress in both the development of GLSM as well as the theory of transmission eigenvalues. In this second edition, in addition to correcting typos in the first edition, we have added several highlights taken from these new developments. In particular, we have included new chapters on 1) the use of modified background media in the nondestructive testing of materials and in particular methods for determining the modified transmission eigenvalues that arise in such applications from measured far field data, 2) a study of a subset of transmission eigenvalues, called non-scattering wave numbers, through the use of techniques taken from the theory of free boundary value problems for elliptic partial differential equations and 3) the duality between scattering poles and transmission eigenvalues which, in addition to their intrinsic mathematical interest, leads to new methods for the numerical computation of scattering poles.
Published: 2022

35. Efficient computation of Riemann–Roch spaces for plane curves with ordinary singularities

Author: Abelard, Simon, Couvreur, Alain, Lecerf, Grégoire, Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Geometry, arithmetic, algorithms, codes and encryption (GRACE), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and ANR-21-CE39-0009,BARRACUDA,Algèbre, preuves, protocoles, algorithmes, courbes, et surfaces pour les codes et leurs applications(2021)
Subjects: [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], Riemann-Roch spaces, Mathematics::Algebraic Geometry, Algebra and Number Theory, Algebraic curves, Applied Mathematics, ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, MathematicsofComputing_NUMERICALANALYSIS, Complexity, [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG], [MATH]Mathematics [math]
Abstract: International audience; We revisit the seminal Brill-Noether algorithm for plane curves with ordinary singularities. Our new approach takes advantage of fast algorithms for polynomials and structured matrices. We design a new probabilistic algorithm of type Las Vegas that computes a Riemann-Roch space in expected sub-quadratic time.
Published: 2022

36. A Survey of the Proof-Theoretic Foundations of Logic Programming

Author: Dale Miller, Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Automatisation et ReprésenTation: fOndation du calcUl et de la déducTion (PARTOUT), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, F.3.2, F.4.1, Computer science, Semantics (computer science), 0102 computer and information sciences, Mathematical proof, computer.software_genre, 01 natural sciences, Theoretical Computer Science, Artificial Intelligence, Computer Science::Logic in Computer Science, Structural proof theory, 0101 mathematics, Logic programming, Functional programming, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Computer Science - Programming Languages, Programming language, 010102 general mathematics, Classical logic, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Linear logic, Logic in Computer Science (cs.LO), TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computational Theory and Mathematics, 010201 computation theory & mathematics, Hardware and Architecture, Proof theory, Computer Science::Programming Languages, computer, Software, Programming Languages (cs.PL)
Abstract: Several formal systems, such as resolution and minimal model semantics, provide a framework for logic programming. In this paper, we will survey the use of structural proof theory as an alternative foundation. Researchers have been using this foundation for the past 35 years to elevate logic programming from its roots in first-order classical logic into higher-order versions of intuitionistic and linear logic. These more expressive logic programming languages allow for capturing stateful computations and rich forms of abstractions, including higher-order programming, modularity, and abstract data types. Term-level bindings are another kind of abstraction, and these are given an elegant and direct treatment within both proof theory and these extended logic programming languages. Logic programming has also inspired new results in proof theory, such as those involving polarity and focused proofs. These recent results provide a high-level means for presenting the differences between forward-chaining and backward-chaining style inferences. Anchoring logic programming in proof theory has also helped identify its connections and differences with functional programming, deductive databases, and model checking., To appear in Theory and Practice of Logic Programming (TPLP)
Published: 2021

37. Deep Probabilistic Matrix Factorization on Graphs: Application to Drug Repositioning for Monkeypox

Author: Jain, Stuti, Chouzenoux, Emilie, Majumdar, Angshul, OPtimisation Imagerie et Santé (OPIS), 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)-Centre de vision numérique (CVN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-CentraleSupélec-Université Paris-Saclay, Indraprastha Institute of Information Technology [New Delhi] (IIIT-Delhi), The authors acknowledge support from Inria Saclay, through the International Inria Team program COMPASS. S.J. and E.C. acknowledge support from the European Research Council Starting Grant MAJORIS ERC-2019- STG-850925., and Inria Saclay
Subjects: [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
Abstract: Motivation: Over the centuries, there have been occurrences of various viral pandemics, one after another. There were major outbreaks caused by the Ebola virus, influenza virus, Mers-COV virus, Sars-COV virus, and most recently, the COVID-19 pandemic caused by Sars-COV-2. These pandemics caused havoc in the world, killed millions of humans and severely effected the world economy. Statistics indicate that COVID-19 will probably become endemic very soon. However, as the cases of monkeypox caused by the monkeypox virus (MPV) are seen to be increasing rapidly, there are fears that we might enter into another pandemic. The COVID-19 pandemic researchers faced numerous challenges in creating a viable vaccine, including a scarcity of time, high costs, and the potential for adverse effects due to lack of proper testing. In order to avoid these problems now use of existing drugs seem to be the best way to treat the infected individuals. This is called drug repositioning. This research aims to repurpose existing drugs for treating monkeypox. We aim to solve the problem of drug-virus interaction (DVA) through deep probabilistic matrix factorization with graph regularization. Here, we recast the curated database of drug-virus associations as a binary matrix, indicating whether the specific drug (from row) has been utilized for treating the associated virus (from column). This matrix is sparse. Prospective treatment regimes planning (using existing drugs) require to infer the missing entries of this matrix. We also utilize metadata for drugs and viruses, obtained from chemical and mechanism of action based similarities between drugs and genomic and symptomatic similarities between the viruses. We demonstrate that our proposed approach significantly outperforms stateof-the-art MF methods. Moreover, when our algorithm is used to make in silico predictions of anti-virals for monkeypox, it returns the drugs that are already being used to treat infected patients.This shows the high efficacy of our algorithm.
Published: 2022

38. T-coercivité et problèmes mixtes

Author: Barré, Mathieu, Ciarlet, Patrick, Laboratoire de mécanique des solides (LMS), École polytechnique (X)-Mines Paris - PSL (École nationale supérieure des mines de Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Mathematical and Mechanical Modeling with Data Interaction in Simulations for Medicine (M3DISIM), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Mines Paris - PSL (École nationale supérieure des mines de Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-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), Propagation des Ondes : Étude Mathématique et Simulation (POEMS), 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)-Unité de Mathématiques Appliquées (UMA), and École Nationale Supérieure de Techniques Avancées (ENSTA Paris)-École Nationale Supérieure de Techniques Avancées (ENSTA Paris)-Centre National de la Recherche Scientifique (CNRS)
Subjects: [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
Abstract: Classically, the well-posedness of variational formulations of mixed linear problems is achieved through the inf-sup condition. In this note, we propose an alternative framework to study such problems by using the T-coercivity approach. This is a constructive approach that leads to the design of suitable approximations in a simple way. In general, the derivation of the uniform discrete inf-sup condition for the approximate problems stems straightforwardly from the study of the original problem. To support our view, we solve a series of classical mixed problems with the T-coercivity approach. Among others, the celebrated Fortin Lemma appears naturally in the numerical analysis of the approximate problems.; Classiquement, le caractère bien posé des formulations variationnelles de problèmes linéaires mixtes est obtenu à l'aide de la condition inf-sup. Dans cette note, nous proposons un cadre alternatif pour étudier de tels problèmes en utilisant la notion de T-coercivité. Il s'agit d'une approche constructive qui permet en outre de concevoir simplement des approximations numériques adaptées car la dérivation de la condition inf-sup discrète uniforme découle en général directement de l'étude du problème continu. Pour appuyer notre propos, nous résolvons une série de problèmes mixtes classiques grâce à la notion de Tcoercivité. Entre autres, le lemme de Fortin apparaît naturellement dans l'analyse numérique des problèmes discrets.
Published: 2022

39. Bayesian calibration with adaptive model discrepancy

Author: Leoni, Nicolas, Le Maitre, Olivier, Rodio, Maria Giovanna, Congedo, Pietro Marco, Uncertainty Quantification in Scientific Computing and Engineering (PLATON), Centre de Mathématiques Appliquées - Ecole Polytechnique (CMAP), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), CEA- Saclay (CEA), Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Inria Saclay - Île de France, CEA - Commissariat à l'énergie atomique et aux énergies alternatives, and CNRS
Subjects: [PHYS.PHYS.PHYS-FLU-DYN]Physics [physics]/Physics [physics]/Fluid Dynamics [physics.flu-dyn], Model error, Bayesian calibration, Uncertainty Quantification, Identifiability, Model discrepancy
Abstract: We investigate a computer model calibration technique inspired by the wellknown Bayesian framework of Kennedy and O'Hagan. We tackle the full Bayesian formulation where model parameter and model discrepancy hyperparameters are estimated jointly and reduce the problem dimensionality by introducing a functional relationship that we call the Full Maximum a Posteriori (FMP) method. This method also eliminates the need for a true value of model parameters that caused identifiability issues in the KOH formulation. When the joint posterior is approximated as a mixture of Gaussians, the FMP calibration is proved to avoid some pitfalls of the KOH calibration, namely missing some probability regions and underestimating the posterior variance. We then illustrate two numerical examples where both model error and measurement uncertainty are estimated together. Using the solution to the full Bayesian problem as a reference, we show that the FMP results are accurate, robust and avoid the need for high-dimensional Markov Chains for sampling.
Published: 2022

40. Predicting future cognitive decline from non-brain and multimodal brain imaging data in healthy and pathological aging

Author: Hebling Vieira, Bruno, Liem, Franziskus, Dadi, Kamalaker, Engemann, Denis A, Gramfort, Alexandre, Bellec, Pierre, Craddock, Richard Cameron, Damoiseaux, Jessica S, Steele, Christopher J, Yarkoni, Tal, Langer, Nicolas, Margulies, Daniel S, Varoquaux, Gael, Universität Zürich [Zürich] = University of Zurich (UZH), Modèles et inférence pour les données de Neuroimagerie (MIND), IFR49 - Neurospin - CEA, Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Université du Québec à Montréal = University of Québec in Montréal (UQAM), The University of Texas Medical Branch (UTMB), Wayne State University [Detroit], Concordia University [Montreal], The University of Texas Medical School at Houston, Centre de Recherche de l'Institut du Cerveau et de la Moelle épinière (CRICM), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), Méthodes computationnelles et mathématiques pour comprendre la société et la santé à partir de données (SODA), Inria Saclay - Ile de France, ANR-20-IADJ-0002,AI-cog,IA pour les sociétés touchées par le vieillissement: des concepts fondamentaux aux outils pratiques pour l'apprentissage cognitif facilité par l'IA(2020), University of Zurich, and Hebling Vieira, Bruno
Subjects: Aging, Neuroimaging, 2717 Geriatrics and Gerontology, [STAT.OT]Statistics [stat]/Other Statistics [stat.ML], 1309 Developmental Biology, 1302 Aging, Activities of Daily Living, Biomarker, Machine learning, Predictive modeling, Cross-validation, Open science, [INFO.INFO-IM]Computer Science [cs]/Medical Imaging, Humans, Cognitive Dysfunction, Aged, Aged, 80 and over, [STAT.AP]Statistics [stat]/Applications [stat.AP], 10093 Institute of Psychology, General Neuroscience, Brain, 2800 General Neuroscience, Middle Aged, Magnetic Resonance Imaging, 2728 Neurology (clinical), Neurology (clinical), Geriatrics and Gerontology, 150 Psychology, Developmental Biology
Abstract: Previous literature has focused on predicting a diagnostic label from structural brain imaging. Since subtle changes in the brain precede a cognitive decline in healthy and pathological aging, our study predicts future decline as a continuous trajectory instead. Here, we tested whether baseline multimodal neuroimaging data improve the prediction of future cognitive decline in healthy and pathological aging. Nonbrain data (demographics, clinical, and neuropsychological scores), structural MRI, and functional connectivity data from OASIS-3 (N = 662; age = 46–96 years) were entered into cross-validated multitarget random forest models to predict future cognitive decline (measured by CDR and MMSE), on average 5.8 years into the future. The analysis was preregistered, and all analysis code is publicly available. Combining non-brain with structural data improved the continuous prediction of future cognitive decline (best test-set performance: R2 = 0.42). Cognitive performance, daily functioning, and subcortical volume drove the performance of our model. Including functional connectivity did not improve predictive accuracy. In the future, the prognosis of age-related cognitive decline may enable earlier and more effective individualized cognitive, pharmacological, and behavioral interventions., Neurobiology of Aging, 118, ISSN:0197-4580, ISSN:1558-1497
Published: 2022

41. The evolution of mining pools and miners’ behaviors in the Bitcoin blockchain

Author: Natkamon Tovanich, Nicolas HEULOT, Nicolas Soulié, Petra Isenberg, IRT SystemX, Centre de Recherche en Économie et Statistique (CREST), Ecole Nationale de la Statistique et de l'Analyse de l'Information [Bruz] (ENSAI)-École polytechnique (X)-École Nationale de la Statistique et de l'Administration Économique (ENSAE Paris)-Centre National de la Recherche Scientifique (CNRS), Geometry, arithmetic, algorithms, codes and encryption (GRACE), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Département Droit, Economie et Finances (IMT-BS - DEFI), Télécom Ecole de Management (TEM)-Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom Business School (IMT-BS), Institut Mines-Télécom [Paris] (IMT), Laboratoire en Innovation, Technologies, Economie et Management (EA 7363) (LITEM), Université d'Évry-Val-d'Essonne (UEVE)-Université Paris-Saclay-Institut Mines-Télécom Business School (IMT-BS), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Analysis and Visualization (AVIZ), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Interaction avec l'Humain (IaH), Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), and LITEM-NPR
Subjects: Bitcoin mining, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Computer Networks and Communications, Visual analytics, [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET], Electrical and Electronic Engineering, Mining pools, Pool hopping, [SHS.ECO]Humanities and Social Sciences/Economics and Finance, Bitcoin
Abstract: International audience; We analyzed 23 mining pools and explore the mobility of miners throughout Bitcoin's history. Mining pools have emerged as major players to ensure that the Bitcoin system stays secure, valid, and stable. Many questions remain open regarding how mining pools have evolved throughout Bitcoin's history and when and why miners join or leave the pools. We investigated the reward payout flow of mining pools and characterized them based on payout irregularity and structural complexity. Based on our proposed algorithm, we identified miners and studied their mobility in the pools over time. Our analysis shows that Bitcoin mining is an industry that is sensitive to external events (e.g., market price and government policy). Over time, competition between pools involving reward schemes and pool fees motivated miners to migrate between pools (i.e., pool hopping and cross pooling). These factors converged toward optimal scheme and values, which made mining activities more stable.
Published: 2022

42. Exathlon

Author: Nesime Tatbul, Yanlei Diao, Vincent Jacob, Fei Song, Arnaud Stiegler, Bijan Rad, Rich Data Analytics at Cloud Scale (CEDAR), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Intel Corporation [USA], MIT Computer Science & Artificial Intelligence Lab (MIT CSAIL), Massachusetts Institute of Technology (MIT), and Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Inria Saclay - Ile de France
Subjects: FOS: Computer and information sciences, Computer Science - Machine Learning, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Process (engineering), Computer science, business.industry, Anomaly (natural sciences), General Engineering, Databases (cs.DB), [INFO.INFO-NE]Computer Science [cs]/Neural and Evolutionary Computing [cs.NE], computer.software_genre, Pipeline (software), Machine Learning (cs.LG), [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Computer Science - Databases, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], Analytics, Spark (mathematics), Benchmark (computing), Anomaly detection, Data mining, Time series, business, computer
Abstract: International audience; Access to high-quality data repositories and benchmarks have been instrumental in advancing the state of the art in many experimental research domains. While advanced analytics tasks over time series data have been gaining lots of attention, lack of such community resources severely limits scientific progress. In this paper, we present Exathlon, the first comprehensive public benchmark for explainable anomaly detection over high-dimensional time series data. Exathlon has been systematically constructed based on real data traces from repeated executions of large-scale stream processing jobs on an Apache Spark cluster. Some of these executions were intentionally disturbed by introducing instances of six different types of anomalous events (e.g., misbehaving inputs, resource contention, process failures). For each of the anomaly instances, ground truth labels for the root cause interval as well as those for the extended effect interval are provided, supporting the development and evaluation of a wide range of anomaly detection (AD) and explanation discovery (ED) tasks. We demonstrate the practical utility of Exathlon's dataset, evaluation methodology, and end-toend data science pipeline design through an experimental study with three state-of-the-art AD and ED techniques.
Published: 2021

43. Tissue outcome prediction in hyperacute ischemic stroke: Comparison of machine learning models

Author: Sylvain Charron, Guillaume Turc, Jean-Claude Baron, Joseph Benzakoun, Bertrand Thirion, Wagih Ben Hassen, Gregoire Boulouis, Catherine Oppenheim, Olivier Naggara, Laurence Legrand, Institut de psychiatrie et neurosciences de Paris (IPNP - U1266 Inserm), Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Paris (UP), GHU Paris Psychiatrie et Neurosciences, Université de Paris - UFR Médecine Paris Centre [Santé] (UP Médecine Paris Centre), Université de Paris (UP), Modelling brain structure, function and variability based on high-field MRI data (PARIETAL), 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)-Service NEUROSPIN (NEUROSPIN), Université Paris-Saclay-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Institut National de la Santé et de la Recherche Médicale (INSERM)-Université Paris Cité (UPCité), UFR Médecine [Santé] - Université Paris Cité (UFR Médecine UPCité), Université Paris Cité (UPCité), Service NEUROSPIN (NEUROSPIN), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Male, Clinical Decision-Making, 030204 cardiovascular system & hematology, Machine learning, computer.software_genre, Machine Learning, 03 medical and health sciences, 0302 clinical medicine, Predictive Value of Tests, [INFO.INFO-IM]Computer Science [cs]/Medical Imaging, Humans, Medicine, Acute ischemic stroke, Stroke, Aged, Ischemic Stroke, Retrospective Studies, Neuroradiology, Aged, 80 and over, business.industry, Penumbra, Brain, Original Articles, Middle Aged, Prognosis, medicine.disease, Patient management, Diffusion Magnetic Resonance Imaging, Neurology, Infarction, Reperfusion, Ischemic stroke, Female, Neurology (clinical), Artificial intelligence, Treatment decision making, Cardiology and Cardiovascular Medicine, Outcome prediction, business, computer, 030217 neurology & neurosurgery, Follow-Up Studies
Abstract: Machine Learning (ML) has been proposed for tissue fate prediction after acute ischemic stroke (AIS), with the aim to help treatment decision and patient management. We compared three different ML models to the clinical method based on diffusion-perfusion thresholding for the voxel-based prediction of final infarct, using a large MRI dataset obtained in a cohort of AIS patients prior to recanalization treatment. Baseline MRI (MRI0), including diffusion-weighted sequence (DWI) and Tmax maps from perfusion-weighted sequence, and 24-hr follow-up MRI (MRI24h) were retrospectively collected in consecutive 394 patients AIS patients (median age = 70 years; final infarct volume = 28mL). Manually segmented DWI24h lesion was considered the final infarct. Gradient Boosting, Random Forests and U-Net were trained using DWI, apparent diffusion coefficient (ADC) and Tmax maps on MRI0 as inputs to predict final infarct. Tissue outcome predictions were compared to final infarct using Dice score. Gradient Boosting had significantly better predictive performance (median [IQR] Dice Score as for median age, maybe you can replace the comma with an equal sign for consistency 0.53 [0.29–0.68]) than U-Net (0.48 [0.18–0.68]), Random Forests (0.51 [0.27–0.66]), and clinical thresholding method (0.45 [0.25–0.62]) ( P
Published: 2021

44. Optimizing full 3D SPARKLING trajectories for high-resolution T2*-weighted Magnetic Resonance Imaging

Author: R, Chaithya G, Weiss, Pierre, Daval-Fr��rot, Guillaume, Massire, Aur��lien, Vignaud, Alexandre, Ciuciu, Philippe, Service NEUROSPIN (NEUROSPIN), Université Paris-Saclay-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Modèles et inférence pour les données de Neuroimagerie (MIND), IFR49 - Neurospin - CEA, Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-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), Institut de Mathématiques de Toulouse UMR5219 (IMT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS), PRIMO (ITAV), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut des Technologies Avancées en sciences du Vivant (ITAV), Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS), Siemens Healthineers [Saint-Denis], Building large instruments for neuroimaging: from population imaging to ultra-high magnetic fields (BAOBAB), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Centre National de la Recherche Scientifique (CNRS), Chaithya Giliyar Radhakrishna was supported by the CEA NUMERICS PhD program, which received European funding from Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No800945.We acknowledge the financial support of the CrossDisciplinary Program on Numerical Simulation of CEA (SILICOSMIC project, PI: P. Ciuciu), the French Alternative Energies and Atomic Energy Commission. This work was granted access to the HPC resources of TGCC in France under the allocation 2019-GCH0424 made by GENCI. Pierre Weiss was supported by the ANR JCJC Optimization on Measures Spaces ANR-17-CE23-0013-01 and the ANR-3IA Artificial and Natural Intelligence Toulouse Institute., ANR-17-CE23-0013,OMS,Optimisation sur des espaces de mesures(2017), ANR-19-P3IA-0004,ANITI,Artificial and Natural Intelligence Toulouse Institute(2019), Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Modelling brain structure, function and variability based on high-field MRI data (PARIETAL), 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)-Service NEUROSPIN (NEUROSPIN), Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut des Technologies Avancées en sciences du Vivant (ITAV), Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS), Unité Baobab (BAOBAB), and We acknowledge the financial support of the CrossDisciplinary Program on Numerical Simulation of CEA (SILICOSMIC project, PI: P. Ciuciu), the French Alternative Energies and Atomic Energy Commission. This work was granted access to the HPC resources of TGCC in France under the allocation 2019-GCH0424 made by GENCI. Pierre Weiss was supported by the ANR JCJC Optimization on Measures Spaces ANR-17-CE23-0013-01 and the ANR-3IA Artificial and Natural Intelligence Toulouse Institute.
Subjects: FOS: Computer and information sciences, 3D MRI, Computer Science - Distributed, Parallel, and Cluster Computing, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, non-Cartesian, [INFO.INFO-IM]Computer Science [cs]/Medical Imaging, Distributed, Parallel, and Cluster Computing (cs.DC), acceleration, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], optimization, compressed sensing
Abstract: International audience; The Spreading Projection Algorithm for Rapid K-space samplING, or SPARKLING, is an optimization-driven method that has been recently introduced for accelerated 2D T2*-w MRI using compressed sensing. It has then been extended to address 3D imaging using either stacks of 2D sampling patterns or a local 3D strategy that optimizes a single sampling trajectory at a time. 2D SPARKLING actually performs variable density sampling (VDS) along a prescribed target density while maximizing sampling efficiency and meeting the gradient-based hardware constraints. However, 3D SPARKLING has remained limited in terms of acceleration factors along the third dimension if one wants to preserve a peaky point spread function (PSF) and thus good image quality.In this paper, in order to achieve higher acceleration factors in 3D imaging while preserving image quality, we propose a new efficient algorithm that performs optimization on full 3D SPARKLING. The proposed implementation based on fast multipole methods (FMM) allows us to design sampling patterns with up to 10^7 k-space samples, thus opening the door to 3D VDS. We compare multi-CPU and GPU implementations and demonstrate that the latter is optimal for 3D imaging in the high-resolution acquisition regime (600µm isotropic). Finally, we show that this novel optimization for full 3D SPARKLING outperforms stacking strategies or 3D twisted projection imaging through retrospective and prospective studies on NIST phantom and in vivo brain scans at 3 Tesla. Overall the proposed method allows for 2.5-3.75x shorter scan times compared to GRAPPA-4 parallel imaging acquisition at 3 Tesla without compromising image quality.
Published: 2022

45. A generic numerical solver for modeling the influence of stress conditions on guided wave propagation for SHM applications

Author: Dalmora, Andre, Imperiale, Alexandre, Imperiale, Sébastien, Moireau, Philippe, Département Imagerie et Simulation pour le Contrôle (DISC), Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire de mécanique des solides (LMS), École polytechnique (X)-Mines Paris - PSL (École nationale supérieure des mines de Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), European Project: 860104,H2020-MSCA-ITN-2019,GW4SHM, Mathematical and Mechanical Modeling with Data Interaction in Simulations for Medicine (M3DISIM), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Mines Paris - PSL (École nationale supérieure des mines de Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: EOCs, 3D Shell Elements, Spectral Finite Elements, Prestresses, [PHYS.MECA.SOLID]Physics [physics]/Mechanics [physics]/Solid mechanics [physics.class-ph], Wave Propagation, Guided Waves, Numerical Simulation, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Struc- tural Health Monitoring
Abstract: In leading-edge industrial applications, assessing structure integrity is an important aspect of safety requirements. Structural Health Monitoring (SHM) proposes to use sensors and signal processing units in situ. One of the most attractive SHM techniques relies on ultrasonic guided waves. Modeling and simulation can be helpful tools for the design or the reliability assessment of SHM solutions. Currently available models developed for that purpose do not take into account effects of operational conditions such as internal stresses. These conditions can change wave propagation and therefore affect the interpretation of recorded signals. The objective of this work is to propose a model that fills this gap, and to derive corresponding numerical methods for elastic wave propagation in an arbitrarily deformed medium. Any hyperelastic constitutive law can be considered. As the structures considered are usually thin, we avoid shear-locking by using a shell formulation to solve the quasi-static problem representing the effects of structure loading. The computed displacement is then fed into a spectral elements method (SFEM) kernel to solve the time-domain linearized 3D elastodynamics problem representing the wave propagation. We validate our model against experimental data in the literature for an isotropic aluminium plate under tensile forces. Additionally, we apply these numerical procedures to a realistic bending experiment of a steel pipe. These validations steps show that our generic approach is able to capture the effects of stresses on ultrasonic guided wave propagation such as changes in wave velocity and induced anisotropy.
Published: 2022

46. Analyse de convergence pour des méthodes d’inversion multi-étapes de type one-shot

Author: Bonazzoli, Marcella, Haddar, Houssem, Vu, Tuan, Inversion of Differential Equations For Imaging and physiX (IDEFIX), 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)-Unité de Mathématiques Appliquées (UMA), École Nationale Supérieure de Techniques Avancées (ENSTA Paris)-École Nationale Supérieure de Techniques Avancées (ENSTA Paris), Inria Saclay, and ENSTA ParisTech
Subjects: problèmes inverses, méthodes de type one-shot, analyse de convergence, parameter identification, one-shot methods, inverse problems, identification de paramètres, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA], convergence analysis
Abstract: In this work we are interested in general linear inverse problems where the corresponding forward problem is solved iteratively using fixed point methods. Then one-shot methods, which iterate at the same time on the forward problem solution and on the inverse problem unknown, can be applied. We analyze two variants of the so-called multi-step one-shot methods and establish sufficient conditions on the descent step for their convergence, by studying the eigenvalues of the block matrix of the coupled iterations. Several numerical experiments are provided to illustrate the convergence of these methods in comparison with the classical usual and shifted gradient descent. In particular, we observe that very few inner iterations on the forward problem are enough to guarantee good convergence of the inversion algorithm.; Dans ce travail nous nous intéressons à des problèmes inverses linéaires généraux où le problème direct correspondant est résolu de façon itérative en utilisant des méthodes de point fixe. Ainsi, les méthodes de type one-shot, qui itèrent en même temps sur la solution du problème direct et l’inconnue du problème inverse, peuvent être appliquées. Nous considérons deux variantes des méthodes multi-étapes de type one-shot et nous établissons des conditions suffisantes et nécessaires sur le pas de descente pour leur convergence, en étudiant les valeurs propres de la matrice par blocs des itérations couplées. Plusieurs tests numériques sont présentés pour illustrer la convergence de ces méthodes par rapport aux méthodes de descente de gradient usuelle et décentrée. En particulier, nous observons que très peu d’itérations internes pour le problème direct sont suffisantes pour garantir une bonne convergence de l’algorithme d’inversion.
Published: 2022

47. Une approche avec l’apprentissage par renforcement profond pour le protocole IRSA

Author: Hmedoush, Iman, Adjih, Cédric, Mühlethaler, Paul, inTeRnet BEyond the usual (TRiBE ), 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), Mise en réseau fiable, sans fil à faible consommation et micro-robotique (AIO), Inria de Paris, and INRIA-SACLAY
Subjects: IoT, Random Access, Coded Slotted Aloha (CSA), Machine Learning (ML), Acc`es Ale´atoire, Evolution de la Densité, Successive Interference Cancellation (SIC), Apprentissage Automatique, [SPI]Engineering Sciences [physics], Density Evolution (DE), mMTC, Annulation Successive des Interférences, Irregular Repetition Slotted Aloha (IRSA), Slotted Aloha à répétition irrégulière (IRSA)
Abstract: Irregular Repetition Slotted Aloha (IRSA) is one candidate member of a family of random access-based protocols to solve massive connectivity problem for Internet of Things (IoT) networks. The key features of this protocol is to allow users to repeat their packets multiple times in the same frame and use Successive Interference Cancellation (SIC) to decode collided packets at the receiver. Although, the plain IRSA scheme can asympotically reach the optimal 1 [packet/slot]. But there are still many obstacles to achieve this performance, specially when considering short frame length. In this report, we study two new variants of IRSA with short frame length, and we optimize their performance using a Deep Reinforcement Learning approach. In our first variant, Random Codeword Selection-IRSA (RC-IRSA), we consider an IRSA approach with random codeword selection, where each codeword represents the transmission strategy of a user on the slots. We apply a Deep Reinforcement Learning to optimize RC-IRSA: we train a Deep Neural Network model that choses the slots on which the user sends its packets. Our DRL approach for RC-IRSA is a new optimization method for IRSA using a DRL approach and it works as a base for our second proposed IRSA variant DS-IRSA.Our second variant is a sensing protocol based on IRSA and trained with machine learning to synchronize the nodes during the transmission and avoid collisions. For that aim, we proposed DS-IRSA, Deep Learning Sensing-based IRSA protocol which is composed of two phases: a sensing phase, where the nodes can sense the channel and send short jamming signals, followed by a classical IRSA transmission phase. We use a DRL algorithm to optimize its performance. Our proposed protocol has shown an excellent performance to achieve an optimal performance of almost 1 [decoded user/slot] for small frame sizes (≤ 5) slots and with enough sensing duration.; Irregular Repetition Slotted Aloha (IRSA) est un candidat d’une famille de protocoles d’accès aléatoire pour résoudre le problème de la connectivité massive pour les réseaux de l’internet des objets (IoT). Les principales caractéristiques de ce protocole sont de permettre aux utilisateurs de répéter leurs paquets plusieurs fois dans la même trame et d’utiliser l’annulation successive d’interférences (SIC) au niveau du récepteur pour décoder les paquets en collision. Le protocole IRSA simple peut asympotiquement atteindre le 1 [paquet/slot] optimal. Mais il existe encore de nombreux obstacles pour atteindre ces performances, en particulier lorsque l’on considère une longueur courte de trame. Dans ce rapport, nous étudions deux nouvelles variantes d’IRSA avec une longueur courte de trame, et nous optimisons leurs performances en utilisant une approche d’apprentissage par renforcement profond (DRL). Dans notre première variante, Random Codeword Selection-IRSA (RC-IRSA), nous considérons une approche IRSA avec sélection aléatoire de mots de code, où chaque mot de code représente la stratégie de transmission d’un utilisateur sur les slots. Nous appliquons un DRL pour optimiser le RC-IRSA : nous utilisons un modèle avec des réseaux de neurones multi-couches qui choisit les slots sur lesquels l’utilisateur envoie ses paquets. Notre approche DRL pour RC-IRSA est une nouvelle méthode d’optimisation pour IRSA utilisant une approche DRL et elle fonctionne comme une base pournotre proposition de deuxième variante d’IRSA, DS-IRSA. Cette deuxième variante est un protocole d’écoute basé sur IRSA et entraîné avec un model d’apprentissage automatique pour synchroniser les nœuds pendant la transmission et éviter les collisions. Ainsi, nous proposons DS-IRSA, le protocole IRSA basé sur le DRL qui est composé de deux phases : une phase de détection, où les nœuds peuvent détecter le canal et envoyer de courts signaux de d’occupation du canal, suivie d’une phase de transmission IRSA classique. Nous utilisons un algorithme DRL pour optimiser ses performances. Notre protocole proposé a montré d’excellentes performances et atteint une performance optimale de près de 1 [utilisateur décodé/slot] pour les petites tailles de trame (≤ 5) slots et avec une durée de détection suffisante.
Published: 2022

48. Complex Coordinate-Based Meta-Analysis with Probabilistic Programming

Author: Valentin Iovene, Gaston Zanitti, Demian Wassermann, Service NEUROSPIN (NEUROSPIN), Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Université Paris-Saclay, Modelling brain structure, function and variability based on high-field MRI data (PARIETAL), 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)-Service NEUROSPIN (NEUROSPIN), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), European Project: 757672,H2020 Pilier ERC,NeuroLang(2018), Université Paris-Saclay-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: FOS: Computer and information sciences, [SCCO]Cognitive science, Computer Science - Programming Languages, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, [SDV.NEU]Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC], General Medicine, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Programming Languages (cs.PL)
Abstract: With the growing number of published functional magnetic resonance imaging (fMRI) studies, meta-analysis databases and models have become an integral part of brain mapping research. Coordinate-based meta-analysis (CBMA) databases are built by extracting both coordinates of reported peak activations and term associations using natural language processing techniques from neuroimaging studies. Solving term-based queries on these databases makes it possible to obtain statistical maps of the brain related to specific cognitive processes. However, existing tools for analysing CBMA data are limited in their expressivity to propositional logic, restricting the variety of their queries. Moreover, with tools like Neurosynth, term-based queries on multiple terms often lead to power failure, because too few studies from the database contribute to the statistical estimations. We design a probabilistic domain-specific language (DSL) standing on Datalog and one of its probabilistic extensions, CP-Logic, for expressing and solving complex logic-based queries. We show how CBMA databases can be encoded as probabilistic programs. Using the joint distribution of their Bayesian network translation, we show that solutions of queries on these programs compute the right probability distributions of voxel activations. We explain how recent lifted query processing algorithms make it possible to scale to the size of large neuroimaging data, where knowledge compilation techniques fail to solve queries fast enough for practical applications. Finally, we introduce a method for relating studies to terms probabilistically, leading to better solutions for two-term conjunctive queries (CQs) on smaller databases. We demonstrate results for two-term CQs, both on simulated meta-analysis databases and on the widely used Neurosynth database.
Published: 2021

49. Physiologically Based Modeling of Food Digestion and Intestinal Microbiota: State of the Art and Future Challenges. An INFOGEST Review

Author: Béatrice Laroche, George van Aken, Ahmed Al-Razaz, E. George, Steven Le Feunteun, Matthijs Dekker, Science et Technologie du Lait et de l'Oeuf (STLO), AGROCAMPUS OUEST, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Essex Pathways, University of Essex, University of Essex, Food Quality and Design Group, Department of Agrotechnology and Food Sciences, Department of Environmental Sciences [Wageningen], Wageningen University and Research [Wageningen] (WUR)-Wageningen University and Research [Wageningen] (WUR), School of Computing and Mathematical Sciences, University of Greenwich, Mathématiques et Informatique Appliquées du Génome à l'Environnement [Jouy-En-Josas] (MaIAGE), Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Dynamiques de populations multi-échelles pour des systèmes physiologiques (MUSCA), 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)-Physiologie de la reproduction et des comportements [Nouzilly] (PRC), Institut Français du Cheval et de l'Equitation [Saumur]-Université de Tours (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Institut Français du Cheval et de l'Equitation [Saumur]-Université de Tours (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Mathématiques et Informatique Appliquées du Génome à l'Environnement [Jouy-En-Josas] (MaIAGE), Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Cosun Innovation Center, Royal Cosun, Division of Human Nutrition, Wageningen University, INFOGEST COST Action FA1005 (2011–2015) and the INFOGEST network funded by INRAE for enabling the networking required to write this review.LITERATURE, Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Inria Saclay - Ile de France, Institut Français du Cheval et de l'Equitation [Saumur]-Université de Tours-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Institut Français du Cheval et de l'Equitation [Saumur]-Université de Tours-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-INSTITUT AGRO Agrocampus Ouest, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro), and Institut Français du Cheval et de l'Equitation [Saumur] (IFCE)-Université de Tours (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Institut Français du Cheval et de l'Equitation [Saumur] (IFCE)-Université de Tours (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Mathématiques et Informatique Appliquées du Génome à l'Environnement [Jouy-En-Josas] (MaIAGE)
Subjects: 0301 basic medicine, Physicochemical Processes, 030109 nutrition & dietetics, Process (engineering), Computer science, digestion, Q1, Diet, Gastrointestinal Microbiome, 03 medical and health sciences, Food Quality and Design, transit, 030104 developmental biology, Digestion (alchemy), Food, in silico, microbiota, Life Science, Humans, gastrointestinal tract, Biochemical engineering, absorption, [SDV.AEN]Life Sciences [q-bio]/Food and Nutrition, VLAG, Food Science
Abstract: This review focuses on modeling methodologies of the gastrointestinal tract during digestion that have adopted a systems-view approach and, more particularly, on physiologically based compartmental models of food digestion and host–diet–microbiota interactions. This type of modeling appears very promising for integrating the complex stream of mechanisms that must be considered and retrieving a full picture of the digestion process from mouth to colon. We may expect these approaches to become more and more accurate in the future and to serve as a useful means of understanding the physicochemical processes occurring in the gastrointestinaltract, interpreting postprandial in vivo data, making relevant predictions, and designing healthier foods. This review intends to provide a scientific and historical background of this field of research, before discussing the future challenges and potential benefits of the establishment of such a model to study and predict food digestion and absorption in humans.
Published: 2021

50. Gender and sex bias in COVID-19 epidemiological data through the lens of causality

Author: Natalia Díaz-Rodríguez, Rūta Binkytė, Wafae Bakkali, Sannidhi Bookseller, Paola Tubaro, Andrius Bacevičius, Sami Zhioua, Raja Chatila, Universidad de Granada = University of Granada (UGR), Institut Polytechnique de Paris (IP Paris), Concurrency, Mobility and Transactions (COMETE), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Amazon, Ecole Pour l'Informatique et les Techniques Avancées (EPITA), Centre de Recherche en Économie et Statistique (CREST), Ecole Nationale de la Statistique et de l'Analyse de l'Information [Bruz] (ENSAI)-École polytechnique (X)-École Nationale de la Statistique et de l'Administration Économique (ENSAE Paris)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), TAckling the Underspecified (TAU), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), OSE Immunotherapeutics [Nantes], Institut des Systèmes Intelligents et de Robotique (ISIR), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), and European Project: 835294,H2020 Pilier ERC,HYPATIA(2019)
Subjects: Artificial intelligence, Healthcare, COVID-19, Gender, Causal fairness, Library and Information Sciences, Management Science and Operations Research, Explainability, Computer Science Applications, Causality, Equality, Media Technology, [INFO]Computer Science [cs], Sex, Equality Artificial intelligence, Information Systems
Abstract: The COVID-19 pandemic has spurred a large amount of experimental and observational studies reporting clear correlation between the risk of developing severe COVID-19 (or dying from it) and whether the individual is male or female. This paper is an attempt to explain the supposed male vulnerability to COVID-19 using a causal approach. We proceed by identifying a set of confounding and mediating factors, based on the review of epidemiological literature and analysis of sex-dis-aggregated data. Those factors are then taken into consideration to produce explainable and fair prediction and decision models from observational data. The paper outlines how non-causal models can motivate discriminatory policies such as biased allocation of the limited resources in intensive care units (ICUs). The objective is to anticipate and avoid disparate impact and discrimination, by considering causal knowledge and causalbased techniques to compliment the collection and analysis of observational big-data. The hope is to contribute to more careful use of health related information access systems for developing fair and robust predictive models., ERC grant Hypatia under the European Union's Horizon 2020 research and innovation programme 835294, Spanish Government Juan de la Cierva Incorporacion contract IJC2019-039152-I, Google Research Scholar Grant, Marie Sklodowska-Curie Actions (MSCA) Postdoctoral Fellowship 101059332, Universidad de Granada/CBUA
Published: 2023

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

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

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Publication Type

Journal

Database

Publisher

11,885 results on '"Inria Saclay"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources