Search

Your search keyword '"COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)"' showing total 50,971 results
Start Over Author "COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)"
50,971 results on '"COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)"'

1. Fast and stable schemes for non-linear osmosis filtering

Author

Calatroni, L., Morigi, S., Parisotto, S., Recupero, G. A., Morphologie et Images (MORPHEME), 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)-Institut de Biologie Valrose (IBV), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Signal, Images et Systèmes (Laboratoire I3S - SIS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS), Dipartimento di Matematica [Bologna], Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO), Department of Applied Mathematics and Theoretical Physics [Cambridge] (DAMTP), Faculty of mathematics Centre for Mathematical Sciences [Cambridge] (CMS), and University of Cambridge [UK] (CAM)-University of Cambridge [UK] (CAM)

Subjects
Computational Mathematics, Computational Theory and Mathematics, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], Modeling and Simulation, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Mathematics - Numerical Analysis, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], 68U10, 94A08, 49K20, 65M05, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
Abstract

We consider a non-linear variant of the transport-diffusion osmosis model for solving a variety of imaging problems such as shadow/soft-light removal and compact data representation. The non-linear behaviour is encoded in terms of a general scalar function g with suitable properties, which allows to balance the diffusion intensity on the different regions of the image while preventing smoothing artefacts. For the proposed model, conservation properties (intensity and non-negativity) are proved and a variational interpretation is showed for specific choices of g. Upon suitable spatial discretisation, both an explicit and a semi-implicit iterative scheme are considered, for which convergence restrictions and unconditional stability are proved, respectively. To validate the proposed modelling and the computational speed of the numerical schemes considered, we report several results and comparisons for the problem of shadow/light-spot removal and compact data representation, showing that artefact-free and computationally efficient results are obtained in comparison to standard linear and anisotropic models, and state-of-the art approaches., Comment: 25 pages, 14 figures

Published
2023

2. A Deep Dynamic Latent Block Model for the Co-clustering of Zero-Inflated Data Matrices

Author

Marchello, Giulia, Corneli, Marco, Bouveyron, Charles, Université Côte d'Azur (UCA), Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Modèles et algorithmes pour l’intelligence artificielle (MAASAI), 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)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Laboratoire Jean Alexandre Dieudonné (LJAD), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS), Culture et Environnements, Préhistoire, Antiquité, Moyen-Age (CEPAM), and ANR-19-P3IA-0002,3IA@cote d'azur,3IA Côte d'Azur(2019)

Subjects
[STAT]Statistics [stat], Latent Block Model, Co-clustering, VEM algorithm, zero-inflated distributions, [MATH]Mathematics [math], dynamic systems
Abstract

The simultaneous clustering of observations and features of data sets (known as co-clustering) has recently emerged as a central machine learning application to summarize massive data sets. However, most existing models focus on continuous and dense data in stationary scenarios, where cluster assignments do not evolve over time. This work introduces a novel latent block model for the dynamic co-clustering of data matrices with high sparsity. To properly model this type of data, we assume that the observations follow a time and block dependent mixture of zero-inflated distributions, thus combining stochastic processes with the time-varying sparsity modeling. To detect abrupt changes in the dynamics of both cluster memberships and data sparsity, the mixing and sparsity proportions are further modeled through systems of ordinary differential equations. The inference of the proposed model relies on an original variational EM procedure whose maximization step trains fully connected neural networks in order to solve the dynamical systems. The usual model selection question is also considered here through an original approach exploiting the ability of the model to work with empty clusters, thanks to the flexibility of deep neural networks. Numerical experiments on simulated and real world data sets demonstrate the effectiveness of the proposed methodology in the context of count data.

Published
2023

3. Spin-down by dynamo action in simulated radiative stellar layers

Author

Ludovic Petitdemange, Florence Marcotte, Christophe Gissinger, Laboratoire d'Etude du Rayonnement et de la Matière en Astrophysique et Atmosphères = Laboratory for Studies of Radiation and Matter in Astrophysics and Atmospheres (LERMA), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire de Paris, Université Paris sciences et lettres (PSL)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-CY Cergy Paris Université (CY), Control, Analysis and Simulations for TOkamak Research (CASTOR), 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)-Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Laboratoire Jean Alexandre Dieudonné (LJAD), Physique Non-Linéaire, Laboratoire de physique de l'ENS - ENS Paris (LPENS), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)-Département de Physique de l'ENS-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)-Département de Physique de l'ENS-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), Institut Universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), ANR-19-ERC7-0008,DYNSEED,Graines minimales de dynamos célestes(2019), and ANR-19-CE30-0025,MagnetDrive,Transformations d'energies controlées par instabilités magnetohydrodynamiques - de l'astrophysique aux applications industrielles(2019)

Subjects
[PHYS.PHYS.PHYS-FLU-DYN]Physics [physics]/Physics [physics]/Fluid Dynamics [physics.flu-dyn], Multidisciplinary, Astrophysics - Solar and Stellar Astrophysics, FOS: Physical sciences, [PHYS.ASTR.SR]Physics [physics]/Astrophysics [astro-ph]/Solar and Stellar Astrophysics [astro-ph.SR], Solar and Stellar Astrophysics (astro-ph.SR)
Abstract

International audience; The evolution of a star is influenced by its internal rotation dynamics through transport and mixing mechanisms, which are poorly understood. Magnetic fields can play a role in transporting angular momentum and chemical elements, but the origin of magnetism in radiative stellar layers is unclear. Using global numerical simulations, we identify a subcritical transition from laminar flow to turbulence caused by the generation of a magnetic dynamo. Our results have many properties of the theoretically proposed Tayler-Spruit dynamo mechanism, which strongly enhances transport of angular momentum in radiative zones. The dynamo generates deep toroidal fields that are screened by the stellar outer layers. This mechanism could produce strong magnetic fields inside radiative stars without an observable field on their surface.

Published
2023

4. A random growth model with any real or theoretical degree distribution

Author

Frédéric Giroire, Stéphane Pérennes, Thibaud Trolliet, Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), Combinatorics, Optimization and Algorithms for Telecommunications (COATI), COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-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), This work has been supported by the French government through the UCA JEDI(ANR-15-IDEX-01) and EUR DS4H (ANR-17-EURE-004) Investments in the Futureprojects, by the SNIF project, and by Inria associated team EfDyNet., ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015), Université Nice Sophia Antipolis (1965 - 2019) (UNS), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), EfdyNet, SNIF, and ANR-17-EURE-0004,UCA DS4H,UCA Systèmes Numériques pour l'Homme(2017)

Subjects
FOS: Computer and information sciences, Random Growth Model, General Computer Science, Twitter, 02 engineering and technology, Poisson distribution, Preferential attachment, Power law, Complex Networks, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], Theoretical Computer Science, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], symbols.namesake, Random Graphs, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Statistical physics, Mathematics, Social and Information Networks (cs.SI), Degree (graph theory), Preferential Attachment, Computer Science - Social and Information Networks, Function (mathematics), Complex network, Heavy-Tailed Distributions, Degree distribution, Degree Distribution, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], symbols, 020201 artificial intelligence & image processing, Node (circuits)
Abstract

The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree distribution. The degree distribution can either be theoretical or extracted from a real-world network. The main idea is to invert the recurrence equation commonly used to compute the degree distribution in order to find a convenient attachment function for node connections - commonly chosen as linear. We compute this attachment function for some classical distributions, as the power-law, broken power-law, geometric and Poisson distributions. We also use the model on an undirected version of the Twitter network, for which the degree distribution has an unusual shape. We finally show that the divergence of chosen attachment functions is heavily links to the heavy-tailed property of the obtained degree distributions., Comment: 23 pages, 3 figures

Published
2023

5. Algebraic flux correction finite element method with semi-implicit time stepping for solute transport in fractured porous media

Author

Brenner, Konstantin, Chorfi, Nejmeddine, Masson, Roland, Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), COmplex Flows For Energy and Environment (COFFEE), 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)-Laboratoire Jean Alexandre Dieudonné (LJAD), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), King Saud University [Riyadh] (KSU), and This project was funded by the National Plan for Science, Technology and Innovation (MAARIFAH), King Abdulaziz City for Science and Technology, Kingdom of Saudi Arabia, award number 14-MAT739-02.

Subjects
Computational Mathematics, algebraic flux correction, Computational Theory and Mathematics, transport equation, finite element method, finite volume method, Discrete Matrix Fracture model, Computers in Earth Sciences, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA], Computer Science Applications
Abstract

This work is concerned with the numerical modeling of the Darcy flow and solute transport in fractured porous media for which the fractures are modeled as interfaces of codimension one. The hybrid-dimensional flow and transport problems are discretizaed by a lumped piecewise linear finite element method, combined with the algebraic correction of the convective fluxes. The resulting transport discretization can be interpreted as a conservative finite volume scheme that satisfies the discrete maximum principle, while introducing a very limited amount of numerical diffusion. In the context of fractured porous media flow the CFL number may vary by several order of magnitude, which makes explicit time stepping unfeasible. To cope with this difficulty we propose an adaptive semi-implicit time stepping strategy that reduces to the low order linear implicit discretization in the high CFL regions that include, but may not be limited to the fracture network. The performance of the fully explicit and semi-implicit variants of the method are investigated through the numerical experiment.

Published
2022

6. Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation

Author

David Coudert, André Nusser, Laurent Viennot, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Max-Planck-Institut für Informatik (MPII), Max-Planck-Gesellschaft, Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria), ANR-17-CE22-0016,MultiMod,Routage dans les grands réseaux de transports multi-modal(2017), ANR-17-CE40-0015,DISTANCIA,Théorie métrique des graphes(2017), and ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015)

Subjects
FOS: Computer and information sciences, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Gromov hyperbolicity, Far-apart pairs iterator, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Graph algorithms, Theoretical Computer Science
Abstract

Hyperbolicity is a graph parameter that indicates how much the shortest-path distance metric of a graph deviates from a tree metric. It is used in various fields such as networking, security, and bioinformatics for the classification of complex networks, the design of routing schemes, and the analysis of graph algorithms. Despite recent progress, computing the hyperbolicity of a graph remains challenging. Indeed, the best known algorithm has time complexity O(n 3.69 ) , which is prohibitive for large graphs, and the most efficient algorithms in practice have space complexity O(n 2 ) . Thus, time as well as space are bottlenecks for computing the hyperbolicity. In this article, we design a tool for enumerating all far-apart pairs of a graph by decreasing distances. A node pair (u, v) of a graph is far-apart if both v is a leaf of all shortest-path trees rooted at u and u is a leaf of all shortest-path trees rooted at v . This notion was previously used to drastically reduce the computation time for hyperbolicity in practice. However, it required the computation of the distance matrix to sort all pairs of nodes by decreasing distance, which requires an infeasible amount of memory already for medium-sized graphs. We present a new data structure that avoids this memory bottleneck in practice and for the first time enables computing the hyperbolicity of several large graphs that were far out of reach using previous algorithms. For some instances, we reduce the memory consumption by at least two orders of magnitude. Furthermore, we show that for many graphs, only a very small fraction of far-apart pairs has to be considered for the hyperbolicity computation, explaining this drastic reduction of memory. As iterating over far-apart pairs in decreasing order without storing them explicitly is a very general tool, we believe that our approach might also be relevant to other problems.

Published
2022

7. A Controllability Method for Maxwell's Equations

Author

T. Chaumont-Frelet, M. J. Grote, S. Lanteri, J. H. Tang, Modélisation et méthodes numériques pour le calcul d'interactions onde-matière nanostructurée (ATLANTIS), 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)-Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Laboratoire Jean Alexandre Dieudonné (LJAD), Department of Computer Science (University of Basel), University of Basel (Unibas), Institut des Sciences de la Terre (ISTerre), Institut national des sciences de l'Univers (INSU - CNRS)-Institut de recherche pour le développement [IRD] : UR219-Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry])-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel-Université Grenoble Alpes (UGA), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Alexandre Dieudonné (JAD), Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), and Laboratoire Jean Alexandre Dieudonné (JAD)

Subjects
Computational Mathematics, Mathematics - Analysis of PDEs, time-harmonic scattering, Maxwell's equations, Applied Mathematics, FOS: Mathematics, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], exact controllability, Numerical Analysis (math.NA), Mathematics - Numerical Analysis, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA], Analysis of PDEs (math.AP), discontinuous Galerkin
Abstract

International audience; We propose a controllability method for the numerical solution of time-harmonic Maxwell's equations in their first-order formulation. By minimizing a quadratic cost functional, which measures the deviation from periodicity, the controllability method determines iteratively a periodic solution in the time domain. At each conjugate gradient iteration, the gradient of the cost functional is simply computed by running any time-dependent simulation code forward and backward for one period, thus leading to a non-intrusive implementation easily integrated into existing software. Moreover, the proposed algorithm automatically inherits the parallelism, scalability, and low memory footprint of the underlying time-domain solver. Since the time-periodic solution obtained by minimization is not necessarily unique, we apply a cheap post-processing filtering procedure which recovers the time-harmonic solution from any minimizer. Finally, we present a series of numerical examples which show that our algorithm greatly speeds up the convergence towards the desired time-harmonic solution when compared to simply running the time-marching code until the time-harmonic regime is eventually reached.

Published
2022

8. Preferential attachment hypergraph with high modularity

Author

Frédéric Giroire, Nicolas Nisse, Thibaud Trolliet, Małgorzata Sulkowska, Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), Combinatorics, Optimization and Algorithms for Telecommunications (COATI), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), and Wroclaw University of Science and Technology

Subjects
Social and Information Networks (cs.SI), FOS: Computer and information sciences, Physics - Physics and Society, preferential attachment, 05C82, 05C80, Sociology and Political Science, Social Psychology, Communication, hypergraph, FOS: Physical sciences, Computer Science - Social and Information Networks, Physics and Society (physics.soc-ph), complex network, FOS: Mathematics, Mathematics - Combinatorics, [INFO]Computer Science [cs], Combinatorics (math.CO), [MATH]Mathematics [math], modularity
Abstract

Numerous works have been proposed to generate random graphs preserving the same properties as real-life large-scale networks. However, many real networks are better represented by hypergraphs. Few models for generating random hypergraphs exist, and also, just a few models allow to both preserve a power-law degree distribution and a high modularity indicating the presence of communities. We present a dynamic preferential attachment hypergraph model which features partition into communities. We prove that its degree distribution follows a power-law, and we give theoretical lower bounds for its modularity. We compare its characteristics with a real-life co-authorship network and show that our model achieves good performances. We believe that our hypergraph model will be an interesting tool that may be used in many research domains in order to reflect better real-life phenomena.

Published
2022

9. Interoperable AI: Evolutionary Race Toward Sustainable Knowledge Sharing

Author

Stefan Sarkadi, Andrea G. B. Tettamanzi, Fabien Gandon, Web-Instrumented Man-Machine Interactions, Communities and Semantics (WIMMICS), 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)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), ANR-19-P3IA-0002,3IA@cote d'azur,3IA Côte d'Azur(2019), and ANR-19-CE23-0030,HyperAgents,Hypermedia pour des communautés de personnes et d'agents autonomes(2019)

Subjects
Computer Networks and Communications, [INFO]Computer Science [cs], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

Article and Supplementary Material; International audience; The advancement and deployment of artificial intelligent agents brought numerous benefits in knowledge and data gathering and processing. However, one of the key challenges in deploying such agents in an open environment like the Web is their interoperability as they currently mostly run in silos. In this paper we report on a simulation and evaluation based on evolutionary agent-based modelling to empirically test how sustainable different strategies are for knowledge sharing in open multi-agent systems (MAS). Our results show the importance of translation-based approaches and the need for incentives to support these.

Published
2022

10. Cours toujours

Author

Gandon, Fabien, Web-Instrumented Man-Machine Interactions, Communities and Semantics (WIMMICS), 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)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), and Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS)

Subjects
[INFO.INFO-WB]Computer Science [cs]/Web, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

International audience; Pour comprendre la récursivité, il faut avant tout... comprendre la récursivité. »-Stephen Hawking Mes anciens collègues sont partis et je reste assis dans ce rocking chair qu'ils m'ont offert ; prostré entre photo d'adieu et cliché de retraite. Mais il était temps que l'on me retire la craie et l'éponge car je commençais à les confondre avec le sabre et le bouclier. Ne vous méprenez pas, je ne compte pas encore d'Alzheimer dans mon carnet de contacts. J'étais juste devenu trop critique pour une formation uniforme, trop singulier pour l'éducation en série, et trop amer pour accepter sans mot dire la suite des évènements. Hmmm... Série et suite... Deux petites madeleines pour le « prof. d'info. » que j'étais. Et dire que Proust, dans ses brouillons, parlait d'une vulgaire tranche de pain grillé... ce carré rassis et fruste incomparable aux belles courbes lisses des madeleines. « Voyez-vous », m'avait dit l'inspecteur à sa dernière visite « vous êtes à cet âge où vous avez l'expérience qui légitimerait que l'on vous donne les moyens de changer le système ; mais vous êtes aussi trop vieux pour être... comment dire... contrôlable. » ...

Published
2022

11. On the hardness of determining the irregularity strength of graphs

Author

Bensmail, Julien, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)

Subjects
irregularity strength, distant irregularity strength, General Computer Science, algorithmic complexity, detectable colouring, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], graph labelling, Theoretical Computer Science
Abstract

International audience; Let G be a graph, and l:E(G) → {1,...,k} be a k-labelling of G, i.e., an assignment of labels from {1,...,k} to the edges of G. We say that l is irregular if no two distinct vertices of G are incident to the same sum of labels. The irregularity strength of G, denoted by s(G), is the smallest k such that irregular k-labellings of G exist. These notions were introduced in the late 1980s as an alternative way to deal with an optimisation problem where one aims at making a graph irregular by multiplying its edges in an optimal way. Since then, the irregularity strength has received a lot of attention, focusing mainly on proving bounds and investigating side aspects and variants. In this work, we consider the algorithmic complexity of determining the irregularity strength of a given graph. We prove that two close variants of this problem are NP-hard, which we suspect might indicate that the original problem is hard too. Namely, we prove that determining the distant irregularity strength, where only vertices within a certain distance are required to be incident to different sums of labels, and the multiset irregularity strength, where any two distinct vertices are required to be incident to different multisets of labels, are NP-hard problems.

Published
2022

12. Modularity of minor‐free graphs

Author

Michał Lasoń, Małgorzata Sulkowska, Wroclaw University of Science and Technology, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Institut of Mathematics - Polish Academy of Sciences (PAN), and Polska Akademia Nauk = Polish Academy of Sciences (PAN)

Subjects
[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], 05C83, 05C82, FOS: Mathematics, Mathematics - Combinatorics, Discrete Mathematics and Combinatorics, Combinatorics (math.CO), Geometry and Topology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], MathematicsofComputing_DISCRETEMATHEMATICS
Abstract

We prove that a class of graphs with an excluded minor and with the maximum degree sublinear in the number of edges is maximally modular, that is, modularity tends to 1 as the number of edges tends to infinity., 7 pages, 1 figure

Published
2022

13. Hy-FiX: Fast In-Place Upgrades of KVM Hypervisors

Author

Guillaume Urvoy-Keller, Dino Lopez-Pacheco, Quentin Jaquemart, Fabien Hermenier, Andrea Segalini, Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe SIGNAL, Signal, Images et Systèmes (Laboratoire I3S - SIS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), and Université Côte d'Azur (UCA)

Subjects
Hardware_MEMORYSTRUCTURES, Software_OPERATINGSYSTEMS, Computer Networks and Communications, business.industry, Computer science, Initialization, Cloud computing, Hypervisor, computer.software_genre, Hypervisor update, Computer Science Applications, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Hardware and Architecture, Virtual machine, Operating system, State (computer science), business, Cloud, computer, Host (network), Software, Data Center, Information Systems, Reboot, Live migration
Abstract

International audience; Maintaining up-to-date KVM hypervisors requires regular upgrades to the host kernel, hence rebooting the physical host with the consequent termination of running Virtual Machines (VMs). Cloud platforms capable of massive large-scale live migrations evacuate VMs from the hosts before rebooting, minimizing the impact over VM up-time. However, scenarios exist where resource constraints make live migration undesirable, or the presence of fault-tolerant instances (e.g., replicated services) favors the adoption of VM termination, a simpler but more disruptive strategy. In this article, we present Hy-FiX, a fast in-place upgrade solution for KVM hypervisors. Hy-FiX preserves VM memory across host reboots, protecting the execution state of running guests while hypervisor upgrades are applied. Hy-FiX memory preservation across reboot, combined with a mixed suspend-to-disk/suspend-to-RAM technique, achieves a 2.31-second checkpoint/restore time for a 256 GB VM, and Hy-FiX lazy memory initialization reboots an enterprise-class host in constant time (7.6 seconds) regardless of its equipped memory. Hy-FiX is, therefore, a better alternative to classical VM termination and restart.

Published
2022

14. Mixed and Nitsche's discretizations of Coulomb frictional contact-mechanics for mixed dimensional poromechanical models

Author

Mohamed LAAZIRI, Laurence Beaude, Franz Chouly, Roland Masson, Bureau de Recherches Géologiques et Minières (BRGM) (BRGM), Institut de Mathématiques de Bourgogne [Dijon] (IMB), Université de Bourgogne (UB)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS), COmplex Flows For Energy and Environment (COFFEE), 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)-Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Bureau de Recherches Géologiques et Minières (BRGM), ANDRA, I-Site BFC project NAANoD, and ANR-17-EURE-0002,EIPHI,Ingénierie et Innovation par les sciences physiques, les savoir-faire technologiques et l'interdisciplinarité(2017)

Subjects
Nitsche's method, Contact mechanics, Coulomb friction, Mechanics of Materials, Mechanical Engineering, Stabilized mixed method, Poromechanics, Discrete Fracture Matrix model, Computational Mechanics, General Physics and Astronomy, [PHYS.MECA]Physics [physics]/Mechanics [physics], Computer Science Applications
Abstract

International audience; This work deals with the discretization of single-phase Darcy flows in fractured and deformable porous media, including frictional contact at the matrix-fracture interfaces. Fractures are described as a network of planar surfaces leading to so-called mixed-dimensional models. Small displacements and a linear poro-elastic behavior are considered in the matrix. One key difficulty to simulate such coupled poro-mechanical models is related to the formulation and discretization of the contact mechanical sub-problem. Our starting point is based on the mixed formulation using facewise constant Lagrange multipliers along the fractures representing normal and tangential stresses. This is a natural choice for the discretization of the contact dual cone in order to account for complex fracture networks with corners and intersections. It leads to local expressions of the contact conditions and to efficient semi-smooth nonlinear solvers. On the other hand, such a mixed formulation requires to satisfy a compatibility condition between the discrete spaces restricting the choice of the displacement space and potentially leading to sub-optimal accuracy. This motivates the investigation of two alternative formulations based either on a stabilized mixed formulation or on the Nitsche's method. These three types of formulations are first investigated theoritically in order to enhance their connections. Then, they are compared numerically in terms of accuracy and nonlinear convergence. The sensitivity to the choice of the formulation parameters is also investigated. Several 2D test cases are considered with various fracture networks using both P1 and P2 conforming Finite Element discretizations of the displacement field and an Hybrid Finite Volume discretization of the mixed-dimensional Darcy flow model.

Published
2023

15. Graphes de Connaissances et Ontologie pour la Représentation de Données Immobilières Issues d’Annonces en Texte Libre

Author

Cadorel, Lucie, Tettamanzi, Andrea, Gandon, Fabien, Web-Instrumented Man-Machine Interactions, Communities and Semantics (WIMMICS), 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)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), and Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS)

Subjects
Knowlede Graph, Texte, Ontologie, Immobilier, Spatial data, Données spatiales, Graphe de Connaissances, Real Estate domain, Text, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

National audience; Nous décrivons nos premiers travaux sur la conception d'une ontologie et d’un graphe de connaissances pourla représentation des données immobilières issues d'annonces. Nous identifions plusieurs scénarios motivants àpartir des données extraites afin de justifier notre modélisation. Puis nous proposons une modélisation pour représenter les données spatiales incertaines et leurs géométries dans un graphe de connaissances.

Published
2023

16. Building a knowledge graph from manual annotations of ancient zoology texts

Author

Barbe, Arnaud, Tounsi Dhouib, Molka, Faron, Catherine, Corneli, Marco, Zucker, Arnaud, Web-Instrumented Man-Machine Interactions, Communities and Semantics (WIMMICS), 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)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Université Côte d'Azur (UCA), and Culture et Environnements, Préhistoire, Antiquité, Moyen-Age (CEPAM)

Subjects
Ontologies, Linked Data and Vocabularies, Ontologie, Histoire de la zoologie, [INFO]Computer Science [cs], History of Zoology, Graphes de connaissances, Données liées et vocabulaires, Knowledge Graphs, Semantic Annotation of Latin Texts, Annotation sémantique de textes latins
Abstract

National audience; This work is carried out in the framework of the IRN Zoomathia which aims to study the transmission of zoo- logical knowledge from Antiquity to the Middle Ages. In this context, a first work of manual annotation of Pline’s Naturalis Historia (books 8-11) on ancient zoology using concepts gathered in the thesaurus TheZoo was done by classicists. However, these annotations have been stored as comments in Word documents, which complicates the exploitation of this knowledge by epistemology, history and philiology researchers in their analysis of these ancient texts. In this article, we present our approach to transform manual annotations into an RDF knowledge graph allowing the integration and the interrogation of relevant knowledge in order to support researchers in their analysis of these texts and knowledge transmission through them. In order to validate the relevance of the model as well as the knowledge graph, we elicited from a domain expert a set of competency questions that we translated in SPARQL to answer them by querying the knowledge graph.; Ce travail est réalisé dans le cadre de l'IRN Zoomathia qui vise l'étude de la transmission des savoirs zoologiques de l'Antiquité au Moyen Âge. Dans ce contexte, un premier travail d'annotation manuelle de l'"Histoire Naturelle" de Pline l'Ancien sur la zoologie antique (livres 8-11) en utilisant des concepts rassemblés dans le thésaurus The-Zoo a été réalisé par des spécialistes de l'Antiquité. Cependant, ces annotations ont été réalisées avec des commentaires Word, ce qui rend complexe l'exploitation de ces connaissances par les chercheurs épistémologues, historiens et philologues dans leur travail d'analyse de ces textes anciens. Dans cet article, nous présentons notre approche de transformation de ces annotations manuelles en graphe de connaissance RDF permettant l'intégration et l'interrogation des connaissances extraites dans le but d'aider les chercheurs dans leur travail d'analyse de ces textes et de la transmission des connaissances à travers eux. Afin de valider la pertinence du modèle et le graphe de connaissance, nous avons recueilli auprès d'un expert du domaine un ensemble de questions de compétences que nous avons traduites en SPARQL pour y répondre en interrogeant le graphe de connaissance produit.

Published
2023

17. A Framework to Include and Exploit Probabilistic Information in SHACL Validation Reports

Author

Felin, Rémi, Faron, Catherine, Tettamanzi, Andrea G. B., Université Côte d'Azur (UCA), Web-Instrumented Man-Machine Interactions, Communities and Semantics (WIMMICS), 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)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), and ANR-19-P3IA-0002,3IA@cote d'azur,3IA Côte d'Azur(2019)

Subjects
Data Validation, [INFO]Computer Science [cs], Validation de données, Shape Testing, Evaluation probabiliste, Probabilistic Assessment, SHACL, RDF, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

International audience; The Shapes Constraint Language (SHACL) is a W3C recommendation which allows to represent constraints in RDF-shape graphs-, and validate RDF data graphs against these constraints. A SHACL validator produces a validation report whose result is false for a shape graph as soon as there is at least one node in the RDF data graph that does not conform to the shape. This Boolean result of the validation of an RDF data graph against an RDF shape graph is not suitable for discovering new high-potential shapes from the RDF data. In this paper, we propose a probabilistic framework to accept shapes with a realistic proportion of nodes in an RDF data graph that does not conform to it. Based on this framework, we propose an extension of the SHACL validation report to express a set of metrics including the generality and likelihood of shapes and we define a method to test a shape as a hypothesis test. Finally, we present the results of experiments conducted to validate a test RDF data graph against a set of shapes.

Published
2023

18. DeepWILD: Wildlife Identification, Localisation and estimation on camera trap videos using Deep learning

Author

Fanny Simões, Charles Bouveyron, Frédéric Precioso, Université Côte d'Azur (UCA), Interdisciplinary Institute for Artificial Intelligence (3iA Côte d’Azur), Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Modèles et algorithmes pour l’intelligence artificielle (MAASAI), 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)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Laboratoire Jean Alexandre Dieudonné (LJAD), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS), and ANR-19-P3IA-0002,3IA@cote d'azur,3IA Côte d'Azur(2019)

Subjects
Computational Theory and Mathematics, Ecology, Image classification, Object detection, [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], Applied Mathematics, Ecological Modeling, Modeling and Simulation, Deep learning, Camera trap, Ecology, Evolution, Behavior and Systematics, CNN, Computer Science Applications
Abstract

International audience; Videos and images from camera traps are more and more used by ecologists to estimate the population of species on a territory. It is a laborious work since experts have to analyse massive data sets manually. This takes also a lot of time to filter these videos when many of them do not contain animals or are with human presence. Fortunately, deep learning algorithms for object detection can help ecologists to identify multiple relevant species on their data and to estimate their population. In this study, we propose to go even further by using object detection model to detect, classify and count species on camera traps videos. To this end, we developed a 3-step process: (i) At the first stage, after splitting videos into images, we annotate images by associating bounding boxes to each label thanks to MegaDetector algorithm; (ii) then, we extend MegaDetector based on Faster R-CNN architecture with backbone Inception-ResNet-v2 in order to not only detect the 13 relevant classes but also to classify them; (iii) finally, we design a method to count individuals based on the maximum number of bounding boxes detected. This final stage of counting is evaluated in two different contexts: first including only detection results (i.e. comparing our predictions against the right number of individuals, no matter their true class), then an evolved version including both detection and classification results (i.e. comparing our predictions against the right number in the right class). The results obtained during the evaluation of our model on the test data set are: (i) 73,92\% mAP for classification, (ii) 96,88\% mAP for detection with a ratio Intersection-Over-Union (IoU) of 0.5 (overlapping ratio between groundtruth bounding box and the detected one), and (iii) 89,24\% mAP for detection at IoU=0.75. Highly represented classes, like humans, have highest values of mAP around 81\% whereas less represented classes in the train data set, such as dogs, have lowest values of mAP around 66\%. Regarding the proposed counting method, we predicted a count either exact or $\pm$ 1 unit for 87\% with detection results and for 48\% with detection and classification results of our test data set. Our model is also able to detect empty videos. To the best of our knowledge, this is the first study in France about the use of object detection model on a French national park to locate, identify and estimate the population of species from camera trap videos.

Published
2023

19. Deciding the Erdős-Pósa property in 3-connected digraphs ⋆

Author

Bensmail, Julien, Campos, Victor, Maia, Ana, Nisse, Nicolas, Silva, Ana, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Parallelism, Graphs and Optimization Research Group (ParGO), Universidade Federal do Ceará = Federal University of Ceará (UFC), Inria EA CANOE, projet Stic Am-Sud GALOP, projet CAPES-Cofecub Graphs, Optimization, Combinatorics and Algorithms, ANR-19-CE48-0013,DIGRAPHS,Digraphes(2019), ANR-17-CE22-0016,MultiMod,Routage dans les grands réseaux de transports multi-modal(2017), and ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015)

Subjects
Erdős-Pósa property Planar digraphs Butterfly minor, Butterfly minor, Planar digraphs, [INFO]Computer Science [cs], Erdős-Pósa property
Abstract

International audience; A (di)graph H has the Erdős-Pósa (EP) property for (butterfly) minors if there exists a function f : N → N such that, for any k ∈ N and any (di)graph G, either G contains at least k pairwise vertexdisjoint copies of H as (butterfly) minor, or there exists a subset T of at most f (k) vertices such that H is not a (butterfly) minor of G − T. It is a well known result of Robertson and Seymour that an undirected graph has the EP property if and only if it is planar. This result was transposed to digraphs by Amiri, Kawarabayashi, Kreutzer and Wollan, who proved that a strong digraph has the EP property for butterfly minors if, and only if, it is a butterfly minor of a cylindrical grid. Contrary to the undirected case where a graph is planar if, and only if, it is the minor of some grid, not all planar digraphs are butterfly minors of a cylindrical grid. In this work, we characterize the planar digraphs that have a butterfly model in a cylindrical grid. In particular, this leads to a linear-time algorithm that decides whether a weakly 3-connected strong digraph has the EP property.

Published
2023

20. Temporal Brain Networks Dataset

Author

Rossi, Aurora, Deslauriers-Gauthier, Samuel, Natale, Emanuele, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Modélisation des résaux dynamiques cérébraux (CRONOS), Centre Inria d'Université Côte d'Azur, and ANR-17-EURE-0004,UCA DS4H,UCA Systèmes Numériques pour l'Homme(2017)

Subjects
[SCCO.NEUR]Cognitive science/Neuroscience, Temporal Brain Networks, [INFO]Computer Science [cs], Temporal Graphs, Dynamic Graphs, Dataset
Abstract

International audience

Published
2023

21. Deep image prior inpainting of ancient frescoes in the Mediterranean Alpine arc

Author

Merizzi, Fabio, Saillard, Perrine, Acquier, Oceane, Morotti, Elena, Piccolomini, Elena Loli, Calatroni, Luca, Dessì, Rosa Maria, Dipartimento di Informatica - Scienza e Ingegneria [Bologna] (DISI), Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO), Culture et Environnements, Préhistoire, Antiquité, Moyen-Age (CEPAM), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Dipartimento di scienze politiche e sociali, Università degli studi di Bologna, Morphologie et Images (MORPHEME), 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)-Institut de Biologie Valrose (IBV), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Signal, Images et Systèmes (Laboratoire I3S - SIS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS), CNRS PRIME Imag'In, Arch-AI-story, Future AI Research (FAIR), and ANR-22-CE48-0010,TASKABILE,Apprentissage bi-niveau adapté à l'objectif de modéles statistiques flexibles pour l'imagerie et la vision(2022)

Subjects
FOS: Computer and information sciences, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Computer Vision and Pattern Recognition (cs.CV), Computer Science - Computer Vision and Pattern Recognition, [INFO]Computer Science [cs]
Abstract

The unprecedented success of image reconstruction approaches based on deep neural networks has revolutionised both the processing and the analysis paradigms in several applied disciplines. In the field of digital humanities, the task of digital reconstruction of ancient frescoes is particularly challenging due to the scarce amount of available training data caused by ageing, wear, tear and retouching over time. To overcome these difficulties, we consider the Deep Image Prior (DIP) inpainting approach which computes appropriate reconstructions by relying on the progressive updating of an untrained convolutional neural network so as to match the reliable piece of information in the image at hand while promoting regularisation elsewhere. In comparison with state-of-the-art approaches (based on variational/PDEs and patch-based methods), DIP-based inpainting reduces artefacts and better adapts to contextual/non-local information, thus providing a valuable and effective tool for art historians. As a case study, we apply such approach to reconstruct missing image contents in a dataset of highly damaged digital images of medieval paintings located into several chapels in the Mediterranean Alpine Arc and provide a detailed description on how visible and invisible (e.g., infrared) information can be integrated for identifying and reconstructing damaged image regions., Comment: 20 pages, 12 figures

Published
2023

22. Convolutional neural networks contain structured strong lottery tickets

Author

Carvalho Walraven da Cunha, Arthur, d'Amore, Francesco, Natale, Emanuele, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Aalto University, Centre National de la Recherche Scientifique (CNRS), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)

Subjects
[INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG]
Abstract

The Strong Lottery Ticket Hypothesis (SLTH) states that randomly-initialised neural networks contain subnetworks that can perform well without any training. Although unstructured pruning has been extensively studied in this context, its structured counterpart, which can deliver significant computational and memory efficiency gains, has been largely unexplored. One of the main reasons for this gap is the limitations of the underlying mathematical tools used in formal analyses of the SLTH. In this paper, we overcome these limitations: we leverage recent advances in the multidimensional generalisation of the Random Subset-Sum Problem and obtain a variant that admits the stochastic dependencies that arise when addressing structured pruning in the SLTH. We apply this result to prove, for a wide class of random Convolutional Neural Networks, the existence of structured subnetworks that can approximate any sufficiently smaller network. This is the first work to address the SLTH for structured pruning, opening up new avenues for further research on the hypothesis and contributing to the understanding of the role of overparameterization in deep learning.

Published
2023

23. An Integrated Framework for Understanding Multimodal Embodied Experiences in Interactive Virtual Reality

Author

Robert, Florent, Wu, Hui-Yin, Sassatelli, Lucile, Ramanoel, Stephen, Gros, Auriane, Winckler, Marco, Université Côte d'Azur (UCA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria), Biologically plausible Integrative mOdels of the Visual system : towards synergIstic Solutions for visually-Impaired people and artificial visiON (BIOVISION), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Web-Instrumented Man-Machine Interactions, Communities and Semantics (WIMMICS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe SIGNET, Signal, Images et Systèmes (Laboratoire I3S - SIS), Institut Universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), Laboratoire Motricité Humaine Expertise Sport Santé (LAMHESS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Université de Toulon (UTLN)-Université Côte d'Azur (UCA), Institut de la Vision, Institut National de la Santé et de la Recherche Médicale (INSERM)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Cognition Behaviour Technology (CobTek), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre Hospitalier Universitaire de Nice (CHU Nice)-Institut Claude Pompidou [Nice] (ICP - Nice)-Université Côte d'Azur (UCA), Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Idex UCA JEDI : IDEX reference center for extended reality XR²C², ANR-21-CE33-0001,CREATTIVE3D,Création de contextes 3D portés par l'attention pour la basse vision(2021), and ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015)

Subjects
immersion, Embodied experiences, 3D environments, Embodied experiences 3D environments immersion scene ontology task modeling interaction navigation user experience analysis, user experience analysis, task modeling, interaction, [INFO]Computer Science [cs], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], navigation, scene ontology
Abstract

International audience; Virtual Reality (VR) technology enables ``embodied interactions'' in realistic environments where users can freely move and interact, with deep physical and emotional states. However, a comprehensive understanding of the embodied user experience is currently limited by the extent to which one can make relevant observations, and the accuracy at which observations can be interpreted. Paul Dourish proposed a way forward through the characterisation of embodied interactions in three senses: ontology, intersubjectivity, and intentionality. In a joint effort between computer and neuro-scientists, we built a framework to design studies that investigate multimodal embodied experiences in VR, and apply it to study the impact of simulated low-vision on user navigation. Our methodology involves the design of 3D scenarios annotated with an ontology, modelling intersubjective tasks, and correlating multimodal metrics such as gaze and physiology to derive intentions. We show how this framework enables a more fine-grained understanding of embodied interactions in behavioural research.

Published
2023

24. SMART360: Simulating Motion prediction and Adaptive bitRate sTrategies for 360° video streaming

Author

Guimard, Quentin, Sassatelli, Lucile, Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe SIGNET, Signal, Images et Systèmes (Laboratoire I3S - SIS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Institut Universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), Association for Computing Machinery (ACM), ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015), ANR-17-EURE-0004,UCA DS4H,UCA Systèmes Numériques pour l'Homme(2017), and European Project: H2020-951911,H2020-EU.2.1.1. - INDUSTRIAL LEADERSHIP - Leadership in enabling and industrial technologies - Information and Communication Technologies (ICT),AI4Media(2020)

Subjects
bitrate adaptation, streaming simulations, [INFO.INFO-MM]Computer Science [cs]/Multimedia [cs.MM], 360° videos, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]
Abstract

Adaptive bitrate (ABR) algorithms are used in streaming media to adjust video or audio quality based on the viewer's network conditions to provide a smooth playback experience. With the rise of virtual reality (VR) headsets, 360° video streaming is growing rapidly and requires efficient ABR strategies to also adapt the video quality to the user's head position. However, research in this field is often difficult to compare due to a lack of reproducible simulations. To address this problem, we provide SMART360, a 360° streaming simulation environment to compare motion prediction and adaptive bitrates strategies. We provide sample inputs and baseline algorithms along with the simulator, as well as examples of results and visualizations that can be obtained with SMART360. The code and data are made publicly available.

Published
2023

25. REVISITING THE ROBUSTNESS OF THE MULTISCALE HYBRID-MIXED METHOD: THE FACE-BASED STRATEGY

Author

Paredes, Diego, Valentin, Frederic, Versieux, Henrique, Universidad de Concepción - University of Concepcion [Chile], Laboratorio Nacional de Computação Cientifica [Rio de Janeiro] (LNCC / MCT), Modélisation et méthodes numériques pour le calcul d'interactions onde-matière nanostructurée (ATLANTIS), 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)-Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), and Universidade Federal de Minas Gerais (UFMG)

Subjects
[MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
Abstract

This work proposes a new finite element for the mixed multiscale hybrid method (MHM) applied to the Poisson equation with highly oscillatory coefficients. Unlike the original MHM method, multiscale bases are the solution to local Neumann problems driven by piecewise continuous polynomial interpolation on the skeleton faces of the macroscale mesh. As a result, we prove the optimal convergence of MHM by refining the face partition and leaving the mesh of macroelements fixed. This property allows the MHM method to be resonance free under the usual assumptions of local regularity. The numerical analysis of the method also revisits and complements the original approach proposed by D. Paredes, F. Valentin and H. Versieux (2017). A numerical experiment evaluates the new theoretical results.

Published
2023

26. Shock profiles for hydrodynamic models for fluid-particles flows in the flowing regime

Author

Goudon, Thierry, Lafitte, Pauline, Mascia, Corrado, COmplex Flows For Energy and Environment (COFFEE), 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)-Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Laboratoire Jean Alexandre Dieudonné (LJAD), Mathématiques et Informatique pour la Complexité et les Systèmes (MICS), CentraleSupélec-Université Paris-Saclay, Fédération de Mathématiques de CentraleSupélec (FR3487), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Dipartimento di Matematica 'Guido Castelnuovo' [Roma I] (Sapienza University of Rome), and Università degli Studi di Roma 'La Sapienza' = Sapienza University [Rome] (UNIROMA)

Subjects
two-phase flow, Mathematics - Analysis of PDEs, Fluid-particles interactions two-phase flow hydrodynamic limit shock profiles Math. Subject Classification. 35C07 35L65 35Q35 76L05 Contents, hydrodynamic limit, FOS: Mathematics, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], shock profiles, 35C07 35L65 35Q35 76L05, Fluid-particles interactions, Analysis of PDEs (math.AP)
Abstract

Starting from coupled fluid-kinetic equations for the modeling of laden flows, we derive relevant viscous corrections to be added to asymptotic hydrodynamic systems, by means of Chapman-Enskog expansions and analyse the shock profile structure for such limiting systems. Our main findings can be summarized as follows. Firstly, we consider simplified models, which are intended to reproduce the main difficulties and features of more intricate systems. However, while they are more easily accessible to analysis, such toy-models should be considered with caution since they might lose many important structural properties of the more realistic systems. Secondly, shock profiles can be identified also in such a case, which can be proven to be stable at least in the regime of small amplitude shocks. Last, but not least, regarding at the temperature of the mixture flow as a parameter of the problem, we show that the zero-temperature model admits viscous shock profiles. Numerical results indicate that a similar conclusion should apply in the regime of small positive temperatures.

Published
2023

27. Using Chained Views and Follow-Up Queries to Assist the Visual Exploration of the Web of Big Linked Data

Author

Aline Menin, Minh Nhat Do, Carla Dal Sasso Freitas, Olivier Corby, Catherine Faron Zucker, Alain Giboin, Marco Winckler, Web-Instrumented Man-Machine Interactions, Communities and Semantics (WIMMICS), 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)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Instituto de Informática da UFRGS (UFRGS), Universidade Federal do Rio Grande do Sul [Porto Alegre] (UFRGS), Université Nice Sophia Antipolis (1965 - 2019) (UNS), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)

Subjects
[INFO.INFO-WB]Computer Science [cs]/Web, Human Factors and Ergonomics, linked data, Computer Science Applications, chained views, Human-Computer Interaction, [INFO.INFO-CY]Computer Science [cs]/Computers and Society [cs.CY], big data, distributed datasets, information visualization, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], follow-up queries, exploratory process, SPARQL queries
Abstract

International audience; The Web of Linked Open Data (LOD) provides access to a great number of dynamic datasets containing valuable information to support decision-making processes in diverse application domains while being publicly accessible and up-to-date. While information visualization techniques are useful to explore, analyze, and explain relationships within LOD data, the existing tools are limited to visualizing a single dataset at a time and, often, use static and preprocessed data. In this paper, we leverage the linked aspect of LOD to support the dynamic integration of data into a visualization system by connecting views and distributed LOD datasets using the socalled follow-up queries. We demonstrate how our approach uses dynamic SPARQL queries to integrate external data into the exploration flow through visualization techniques and enrich the ongoing analysis. We ran a semi-structured interview to assess the usefulness of our approach, which results were encouraging while showing its relevance to explore big linked data.

Published
2022

28. Stable GSTC Formulation for Maxwell’s Equations

Author

Nicolas Lebbe, Kim Pham, Agnes Maurel, Université Côte d'Azur (UCA), Centre National de la Recherche Scientifique (CNRS), Modélisation et méthodes numériques pour le calcul d'interactions onde-matière nanostructurée (ATLANTIS), 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)-Laboratoire Jean Alexandre Dieudonné (JAD), Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Institut des Sciences de la mécanique et Applications industrielles (IMSIA - UMR 9219), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-École Nationale Supérieure de Techniques Avancées (ENSTA Paris)-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Saclay-EDF R&D (EDF R&D), EDF (EDF)-EDF (EDF), Institut Langevin - Ondes et Images (UMR7587) (IL), Ecole Superieure de Physique et de Chimie Industrielles de la Ville de Paris (ESPCI Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP), Université Paris sciences et lettres (PSL), Nicolas Lebbe acknowledge support from French defence procurement agency under the ANR ASTRID Maturation program, grant agreement number ANR-18-ASMA-0006-01. Kim Pham acknowledges support from the Agence de l’Innovation de Défense (AID) from the Direction Générale de l’Armement (DGA), under grant n° 2019 65 0070 and the Agence Nationale de la Recherche under grant ANR-19-CE08-0006., ANR-18-ASMA-0006,OPERA,Optique planaire adaptative(2018), ANR-19-CE08-0006,METARESO,Propagation d'ondes dans des Métamatériaux Résonants(2019), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-École Nationale Supérieure de Techniques Avancées (ENSTA Paris)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-EDF R&D (EDF R&D), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[PHYS.PHYS.PHYS-OPTICS]Physics [physics]/Physics [physics]/Optics [physics.optics], Asymptotic analysis, Metafilms, [PHYS.MPHY]Physics [physics]/Mathematical Physics [math-ph], Metasurface, Numerical implementation of the enlarged GSTCs, Electrical and Electronic Engineering, Generalized sheet transition conditions (GSTC), Two-scale homogenization technique
Abstract

We revisit the classical zero-thickness Generalized Sheet Transition Conditions (GSTCs) which are a key tool for efficiently designing metafilms able to control the flow of light in a desired way. It is shown that it is more convenient to use an enlarged formulation of the GSTC in which the original metafilm is replaced by GSTCs that exclude the layer from the physical or computational domain. These new "layer" transition conditions have the same form as their "sheet" analogues hence they do not necessitate additional complications in their use; their advantage is that they provide a well-posed problem hence guaranty the stability of numerical schemes in the timedomain. These assessments are demonstrated for an all-dielectric structure; the effective susceptibility tensors are derived thanks to asymptotic analysis combined with homogenization technique and bounds for the susceptibilities entering the balance of energy are provided. While negative constant susceptibilities appear in the classical zero-thickness GSTCs, their values in the enlarged formulation are always positive which ensure the stability of the effective problem. Validation of the effective model is provided by means of comparison with direct numerics in two and three dimensions.

Published
2022

29. Frequency-Explicit A Posteriori Error Estimates for Finite Element Discretizations of Maxwell's Equations

Author

Théophile Chaumont-Frelet, Patrick Vega, Modélisation et méthodes numériques pour le calcul d'interactions onde-matière nanostructurée (ATLANTIS), 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)-Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Laboratoire Jean Alexandre Dieudonné (LJAD), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Alexandre Dieudonné (JAD), Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), and Laboratoire Jean Alexandre Dieudonné (JAD)

Subjects
Finite element methods, A posteriori error estimates, Numerical Analysis, Computational Mathematics, Maxwell's equations, High-frequency problems, Applied Mathematics, FOS: Mathematics, Discontinuous Galerkin methods, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], Numerical Analysis (math.NA), Mathematics - Numerical Analysis, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
Abstract

We consider residual-based a posteriori error estimators for Galerkin-type discretizations of time-harmonic Maxwell's equations. We focus on configurations where the frequency is high, or close to a resonance frequency, and derive reliability and efficiency estimates. In contrast to previous related works, our estimates are frequency-explicit. In particular, our key contribution is to show that even if the constants appearing in the reliability and efficiency estimates may blow up on coarse meshes, they become independent of the frequency for sufficiently refined meshes. Such results were previously known for the Helmholtz equation describing scalar wave propagation problems and we show that they naturally extend, at the price of many technicalities in the proofs, to Maxwell's equations. Our mathematical analysis is performed in the 3D case, and covers conforming N\'ed\'elec discretizations of the first and second family, as well as first-order (and hybridizable) discontinuous Galerkin schemes. We also present numerical experiments in the 2D case, where Maxwell's equations are discretized with N\'ed\'elec elements of the first family. These illustrating examples perfectly fit our key theoretical findings, and suggest that our estimates are sharp.

Published
2022

30. Reasoning about manipulation in multi-agent systems

Author

Leturc, Christopher, Bonnet, Grégory, Web-Instrumented Man-Machine Interactions, Communities and Semantics (WIMMICS), 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)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Equipe MAD - Laboratoire GREYC - UMR6072, Groupe de Recherche en Informatique, Image et Instrumentation de Caen (GREYC), Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Normandie Université (NU)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS)-Université de Caen Normandie (UNICAEN), and Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Neighborhood semantics, Philosophy, Deception, Logic, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.4: Knowledge Representation Formalisms and Methods/I.2.4.1: Modal logic, Modal logics, Manipulation, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.11: Distributed Artificial Intelligence/I.2.11.1: Intelligent agents, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

International audience; In many applications, selfish, dishonest or malicious agents may find an interest in manipulating others. While many works deal with designing robust systems or designing manipulative strategies, few works are interested in defining in a broad sense what is a manipulation and how we can reason with such a notion. In this article, based on a social science literature, we give at first a general definition of manipulation that can be applied in multi-agent systems. A manipulation is a deliberate effect of an agent (called a manipulator ) to instrumentalize another agent (called a victim), while making sure to conceal that effect. Secondly, we show how this definition is related with different fields in computer science where the conceptof manipulation is studied. Finally, we present a logical framework, called KBE, to express and reason about manipulations. Since manipulation relies on deliberate effects, KBE introduces a deliberate BIAT operator which abstracts deliberate consequences of actions. We prove that this logic is sound and complete and, we formally define manipulation. Furthermore, based on KBE, we express related notions such as coercion, persuasion, or deception and we show that these notions are different from manipulation.

Published
2022

31. A Unified Surface Geometric Framework for Feature-Aware Denoising, Hole Filling and Context-Aware Completion

Author

Luca Calatroni, Martin Huska, Serena Morigi, Giuseppe Antonio Recupero, Calatroni, Luca, Morphologie et Images (MORPHEME), 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)-Institut de Biologie Valrose (IBV), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Signal, Images et Systèmes (Laboratoire I3S - SIS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS), Dipartimento di Matematica [Bologna], Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO), Calatroni L., Huska M., Morigi S., and Recupero G.A.

Subjects
Willmore energy, Statistics and Probability, Surface inpainting, sparse non-convex optimization, Applied Mathematics, Context-aware mesh completion, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], [MATH.MATH-NA] Mathematics [math]/Numerical Analysis [math.NA], Condensed Matter Physics, Surface denoising, [INFO.INFO-TI] Computer Science [cs]/Image Processing [eess.IV], Variational surface restoration, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], Modeling and Simulation, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Geometry and Topology, Computer Vision and Pattern Recognition, [MATH.MATH-AP] Mathematics [math]/Analysis of PDEs [math.AP], [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
Abstract

Technologies for 3D data acquisition and 3D printing have enormously developed in the past few years, and, consequently, the demand for 3D virtual twins of the original scanned objects has increased. In this context, feature-aware denoising, hole filling and context-aware completion are three essential (but far from trivial) tasks. In this work, they are integrated within a geometric framework and realized through a unified variational model aiming at recovering triangulated surfaces from scanned, damaged and possibly incomplete noisy observations. The underlying non-convex optimization problem incorporates two regularisation terms: a discrete approximation of the Willmore energy forcing local sphericity and suited for the recovery of rounded features, and an approximation of the $$\ell _0$$ ℓ 0 pseudo-norm penalty favouring sparsity in the normal variation. The proposed numerical method solving the model is parameterization-free, avoids expensive implicit volume-based computations and based on the efficient use of the Alternating Direction Method of Multipliers. Experiments show how the proposed framework can provide a robust and elegant solution suited for accurate restorations even in the presence of severe random noise and large damaged areas.

Published
2022

32. Peut-on parler de « racisme d’État » en France ?

Author

Dhume, Fabrice, Dunezat, Xavier, Gourdeau, Camille, Rabaud, Aude, UCL - SSH/IACS - Institute of Analysis of Change in Contemporary and Historical Societies, Université Catholique de Louvain = Catholic University of Louvain (UCL), Institut Convergences Migrations [Aubervilliers] (IC Migrations), Centre de recherches sociologiques et politiques de Paris (CRESPPA), Université Paris 8 Vincennes-Saint-Denis (UP8)-Université Paris Nanterre (UPN)-Centre National de la Recherche Scientifique (CNRS), Unite de recherche migrations et sociétés (URMIS), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Institut de recherche pour le développement [IRD] : UR205-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)-Université Côte d'Azur (UCA), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Université Paris Diderot - Paris 7 (UPD7)-Institut de recherche pour le développement [IRD] : UR205-Centre National de la Recherche Scientifique (CNRS)

Subjects
antiracisme, politique migratoire, question raciale, racisme d'Etat, [SHS]Humanities and Social Sciences, colonialisme
Abstract

International audience; En 2017, le ministre français de l’Éducation nationale Jean-Michel Blanquer est applaudi par les députés lorsqu’il annonce, à l’Assemblée, porter plainte pour diffamation contre le syndicat SUD éducation 93 pour avoir « décidé de parler aussi de “racisme d’État” ». L’annonce fait l’objet d’une polémique à laquelle les sciences sociales, par médias interposés, participent. En mobilisant différents textuels (de presse et académiques), l’article répertorie les points de vue qui ont émergé « à chaud », puis esquisse une cartographie des usages différenciés de l’expression « racisme d’État » au sein de l’espace socioacadémique. Il ressort que le recours à cette catégorie s’inscrit dans un contexte politique marqué par diverses séquences institutionnelles ayant activé la « question raciale » et structuré la cristallisation d’un nouvel « antiracisme politique ». La double question du racisme d’État et de la généalogie coloniale de la République française polarise les points de vue sur les visages du racisme contemporain.

Published
2022

33. On the Nash number and the diminishing Grundy number of a graph

Author

Frédéric Havet, Allen Ibiapina, Leonardo Rocha, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Universidade Federal do Ceará = Federal University of Ceará (UFC), and State University of Ceara / Universidade Estadual do Ceara (UECE)

Subjects
Applied Mathematics, Grundy colouring, Discrete Mathematics and Combinatorics, Complexity, Colouring parameters, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Colouring, Game theory
Abstract

International audience; A Nash k-colouring is a k-colouring (S1, . . . , Sk) such that every vertex of Si is adjacent to a vertex in Sj, whenever |Sj| ≥ |Si|. The Nash Number of G, denoted by Nn(G), is the largest k such that G admits a Nash k-colouring. A diminishing greedy k-colouring is a k-colouring (S1, . . . , Sk) such that, for all 1 ≤ j < i ≤ k, |Si| ≤ |Sj| and every vertex of Si is adjacent to a vertex in Sj. The diminishing Grundy Number of G, denoted by Γ ↓(G), is the largest k such that G admits a diminishing greedy k-colouring. In this paper, we prove some properties of Nn and Γ ↓. We mainly study the relations between them and other graph parameters such as the clique number ω, the chromatic number χ , the Grundy number Γ , and the maximum degree ∆. In particular we study the chain of inequalities ω(G) ≤ χ(G) ≤ Nn(G) ≤ Γ ↓(G) ≤ Γ (G) ≤ ∆(G)+1. We show each inequality γ1(G) ≤ γ2(G) of this chain is loose, in the sense that there is no function f such that γ2(G) ≤ f (γ1(G)). We also prove the existence or non-existence of inequalities analogue to Reed’s one stating that there exists ε > 0 such that χ (G) ≤ εω(G) + (1 − ε)(∆(G) + 1).We then study the Nash number and the diminishing Grundy number of trees and forests, and prove that Γ (F ) − 1 ≤ Nn(F ) ≤ Γ ↓(F ) ≤ Γ (F ).Finally we study the complexity of related problems. We show that computing the Nash number or the diminishing Grundy number is NP-hard even when the input graph is bipartite or chordal. We also show that deciding whether a graph satisfies γ1(G) = γ2(G) is NP-hard for every pair (γ1, γ2) with γ1 ∈ {Nn, Γ ↓} and γ2 ∈ {ω, χ , Γ , ∆ + 1}

Published
2022

34. On a vertex-capturing game

Author

Julien Bensmail, Fionn Mc Inerney, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), and Helmholtz Center for Information Security [Saarbrücken] (CISPA)

Subjects
combinatorial game, Computer Science::Computer Science and Game Theory, General Computer Science, ComputingMilieux_PERSONALCOMPUTING, Quantum Physics, 2-player game, graph, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], scoring game, MathematicsofComputing_DISCRETEMATHEMATICS, Computer Science::Cryptography and Security, Theoretical Computer Science
Abstract

International audience; In this paper, we study the recently introduced scoring game played on graphs called the Edge-Balanced Index Game. This game is played on a graph by two players, Alice and Bob, who take turns colouring an uncoloured edge of the graph. Alice plays first and colours edges red, while Bob colours edges blue. The game ends once all the edges have been coloured. A player captures a vertex if more than half of its incident edges are coloured by that player, and the player that captures the most vertices wins.Using classical arguments from the field, we first prove general properties of this game. Namely, we prove that there is no graph in which Bob can win (if Alice plays optimally), while Alice can never capture more than 2 more vertices than Bob (if Bob plays optimally). Through dedicated arguments, we then investigate more specific properties of the game, and focus on its outcome when played in particular graph classes. Specifically, we determine the outcome of the game in paths, cycles, complete bipartite graphs, and Cartesian grids, and give partial results for trees and complete graphs.

Published
2022

35. Pody: a Solid-based approach to embody agents in Web-based Multi-Agent-Systems

Author

Zimmermann, Antoine, Ciortea, Andrei, Faron, Catherine, O'Neill, Eoin, Poveda-Villalón, María, École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT), Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), Institut Henri Fayol (FAYOL-ENSMSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Département Informatique et systèmes intelligents ( FAYOL-ENSMSE), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE), University of St.Gallen (HSG), Université Côte d’Azur, Inria, CNRS, Sophia Antipolis, France, Université Côte d'Azur (UCA), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Web-Instrumented Man-Machine Interactions, Communities and Semantics (WIMMICS), 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)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), University College Dublin [Dublin] (UCD), Ontology Engineering Group [Madrid] (OEG), Facultad de Informática [Madrid] (UPM), Universidad Politécnica de Madrid (UPM)-Universidad Politécnica de Madrid (UPM), and Facultad de Informatica

Subjects
Situatedness, Embodiment, Solid, [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], [INFO.INFO-WB]Computer Science [cs]/Web, [INFO]Computer Science [cs], Multi-Agent Systems, Multi-Agent Systems Semantic Web Embodiment Situatedness Solid, Semantic Web
Abstract

International audience; In this paper we discuss the problem of situatedness for agents perceiving and acting on the Web (namely, "Web agents"). Assuming Web agents are embodied on the World Wide Web, then we must define what a Web agent's body is. We first provide an abstract definition of a Web agent's body in terms of what it should comprise. Then we propose a concrete definition of it relying on Solid, a recent Web technology for Social Linked Data: we implement a Web agent's body as a data pod. Consequently, we coin the term pody to refer to the Web entity that embodies an agent on the Web with Solid. This paper summarises the findings of a working group from the Dagstuhl Seminar 23081: Agents on the Web (February 19-24, 2023).

Published
2023

36. AnoRand: A Semi Supervised Deep Learning Anomaly Detection Method by Random Labeling

Author

Mayaki, Mansour Zoubeirou A, Riveill, Michel, Modèles et algorithmes pour l’intelligence artificielle (MAASAI), 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)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)

Subjects
FOS: Computer and information sciences, Computer Science - Machine Learning, [INFO]Computer Science [cs], Machine Learning (cs.LG)
Abstract

Anomaly detection or more generally outliers detection is one of the most popular and challenging subject in theoretical and applied machine learning. The main challenge is that in general we have access to very few labeled data or no labels at all. In this paper, we present a new semi-supervised anomaly detection method called \textbf{AnoRand} by combining a deep learning architecture with random synthetic label generation. The proposed architecture has two building blocks: (1) a noise detection (ND) block composed of feed forward ferceptron and (2) an autoencoder (AE) block. The main idea of this new architecture is to learn one class (e.g. the majority class in case of anomaly detection) as well as possible by taking advantage of the ability of auto encoders to represent data in a latent space and the ability of Feed Forward Perceptron (FFP) to learn one class when the data is highly imbalanced. First, we create synthetic anomalies by randomly disturbing (add noise) few samples (e.g. 2\%) from the training set. Second, we use the normal and the synthetic samples as input to our model. We compared the performance of the proposed method to 17 state-of-the-art unsupervised anomaly detection method on synthetic datasets and 57 real-world datasets. Our results show that this new method generally outperforms most of the state-of-the-art methods and has the best performance (AUC ROC and AUC PR) on the vast majority of reference datasets. We also tested our method in a supervised way by using the actual labels to train the model. The results show that it has very good performance compared to most of state-of-the-art supervised algorithms.

Published
2023

37. Optimisation de plan de vol de drones autonomes pour une recharge rapide de capteurs

Author

Dias da Silva, Igor, Busnel, Yann, Caillouet, Christelle, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Université Côte d'Azur (UCA), Département Systèmes Réseaux, Cybersécurité et Droit du numérique (IMT Atlantique - SRCD), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Self-prOtecting The futurE inteRNet (SOTERN), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de 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)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), and RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2)

Subjects
Internet des objets, Recharge énergétique, Optimisation, [INFO]Computer Science [cs], Drones Optimisation Recharge énergétique Internet des objets, Drones
Abstract

International audience; Nous proposons une solution en deux étapes pour déterminer des trajectoires quasi-optimal de véhicules aériens sans pilote (UAV), ou drones, afin de recharger rapidement un réseau de capteurs au sol, augmentant ainsi la durée de vie de celui-ci. Nous nous concentrons sur une solution de recharge sans fil par radiofréquence (RF), lequel permet notamment de pouvoir charger plusieurs capteurs en parallèle par un même drone. Cependant, il existe une forte déperdition d'énergie lorsque plusieurs drones chargent le même capteur simultanément. Nous optimisons donc le plan de vol de la flotte de drones afin de minimiser le temps nécessaire pour charger tous les capteurs, tout en évitant cette déperdition.

Published
2023

38. Groupage sur le chemin pour borner la largeur de coupe

Author

Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Havet, Frédéric, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), ANR-17-CE22-0016,MultiMod,Routage dans les grands réseaux de transports multi-modal(2017), and ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015)

Subjects
densité, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], cutwidth, groupage, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], largeur de coupe, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Abstract

International audience; La largeur de coupe (cutwidth) est un paramètre utilisé dans de nombreux problèmes d'ordonnancement linéaire (layout). Calculer la largeur de coupe est un problème NP-complet, mais il est possible de concevoir des algorithmes de branch-and-bound efficaces si on dispose de bonnes bornes inférieures pour couper des branches lors de l'exploration. Savoir évaluer rapidement de bonnes bornes dans chaque noeud de l'arbre de recherche est donc crucial. Dans cet article, nous donnons de nouvelles bornes basées sur différents paramètres de densité du graphe. Nous donnons aussi une borne inférieure basée sur le groupage de requêtes sur le chemin.

Published
2023

39. Harnessing Bullying Traces to Enhance Bullying Participant Role Identification in Multi-Party Chats

Author

Ollagnier, Anaïs, Cabrio, Elena, Villata, Serena, Web-Instrumented Man-Machine Interactions, Communities and Semantics (WIMMICS), 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)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Université Côte d'Azur (UCA), FLAIRS, ANR-19-P3IA-0002,3IA@cote d'azur,3IA Côte d'Azur(2019), and ANR-22-CMAS-0004,EFELIA Côte d'Azur,Ecole Française de l'Intelligence Artificielle - Site Côte d'Azur(2022)

Subjects
bullying participant role detection, [INFO]Computer Science [cs], online hate detection, multi-party chats, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

International audience; As online content continues to grow, so does the spread of online hate, especially on social media. Most research efforts conducted on the task of bullying participant role identification are directed towards social networks such as Twitter and Instagram. However, private instant messaging platforms and channels were pinpointed in recent studies as the most prominent grounds for cyberbullying, especially among teens. Since data collection from major social media platforms is strictly limited, very few studies have investigated this task in a multi-party setting. However, the recent release of resources mimicking online aggression situations that may occur among teens on private instant messaging platforms contributes to filling this gap. In this study, we introduce a full pipeline aiming at automating the identification of bullying participant roles (bully and victim) in multi-party chats. Leveraging pre-trained language models and different learning frameworks, we perform hateful content classification of exchanged messages according to a binary scheme (online hate or no online hate). Then,-from these bullying tracesbullying behavioural cues (repetition and intention to harm) are derived and formalised into a role scoring function. As a result, the proposed pipeline identifies the bully and the victim among chat participants. Evaluated against state-ofthe-art methods, the proposed pipeline achieves better performances considering all the datasets and roles to predict. In addition, the error analysis confirms that deriving bullying behavioural cues is beneficial to the task of participant role identification.

Published
2023

40. Neural Network Information Leakage through Hidden Learning

Author

Arthur Carvalho Walraven da Cunha, Emanuele Natale, Laurent Viennot, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Centre National de la Recherche Scientifique (CNRS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Networks, Graphs and Algorithms (GANG), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), OPAL-Meso, COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Inria Sophia Antipolis - Méditerranée (CRISAM), Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP), Inria, CNRS, I3S, and Université Côte d'Azur

Subjects
Artificial Neural Network, Hidden computation, Information security, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG]
Abstract

We investigate the problem of making a neural network perform some hidden computation whose result can be easily retrieved from the network output. In particular, we consider the following scenario. A user is provided a neural network for a classification task by a company. We further assume that the company has limited access to the user's computation, and can only observe the output of the network when the user evaluates it. The user's input to the network contains some sensible information. We provide a simple and efficient training procedure, called Hidden Learning, that produces two networks such that i) One of the networks solves the original classification task with comparable performance to state of the art solutions of the task; ii) The other network takes as input the output of the first and solves another classification task that retrieves the sensible information with considerable accuracy. Our result might expose important issues from an information security point of view, as for the use of artificial neural networks in sensible applications.

Published
2023

41. Sémantique formelle du langage PsyC

Author

Siron, Fabien, Potop-Butucaru, Dumitru, de Simone, Robert, Chabrol, Damien, Methni, Amira, Logical Time for Formal Embedded System Design (KAIROS), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), KRONO‐SAFE, and Inria - Sophia Antipolis

Subjects
Logical Execution Time, Système Temps-Réel, Multiform Logical Time, Sémantique Formelle, Temps d’Exécution Logique, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, Real-Time Systems, Temps Logique Multiforme, Formal Semantics
Abstract

Time must be taken into account from the very start of the design of real-time systems. Because exact computation durations are usually not available in early design phase, multiple formalisms based on the concept of Multiform Logical Time have been introduced. Thesynchronous approach introduced a discretized abstraction of time based on logical clocks, on which computation happens logically instantaneously. While being very expressive, the synchronous approach suffer from compilation issues when mapping logical time to non-negligible real-time computation durations. In answer, the Logical Execution Time (LET) paradigm has been introduced to give such a compromise between the strong expressiveness of the synchronous approach and traditional task scheduling, making LET a perfect fit for the temporal architecture and the software integration of real-time systems. In this report, we consider a variation of LET extended with logical clocks, namely synchronous LET (sLET), implemented in the industrial language PsyC. The sLET approach — and thus PsyC — allows to specify computation to be executed inside a logical interval up to the next occurrence of a logical clock expression (i.e. in opposition to a constant duration). As sLET is based on both LET and the synchronous approach, we give in this report two operational semantics of the PsyC language: a native semantics (or big-step) based on the Structural Operational Semantics approach (S.O.S.) and a synchronous semantics defined by translation to the Esterel language. The former gathers all valid computation schedulings as an equivalence class, of which the latter provides a specific representative (as-soon-as-possible execution). We show the semantics equivalence of those two semantics at interval boundaries. While the native semantics is mainly used for compilation, future work will show how logical timing properties can be verified using those two semantics.; Le temps doit être pris en compte dès le début de la conception des systèmes temps-réel. Du fait que les durées exactes des calculs ne sont généralement pas disponibles au début de la phase de conception, plusieurs formalismes basés sur le concept de Temps Logique Multiforme ont été introduits dans la littérature. L’approche synchrone introduit une abstraction discrète du temps basée sur des horloges logiques, sur lesquels les calculs s’effectuent logiquement instantanément. Bien que très expressive, l’approche synchrone souffre de difficultés de compilation lors de l’association du temps logique à des durées de calculs non négligeables. En réponse, le paradigme Temps d’Exécution Logique (LET) a été introduit comme compromis entre l’expressivité de l’approche synchrone et l’ordonnancement temps-réel traditionnel, ce qui fait que le LET est parfaitement adapté à la modélisation d’architecture temporelle. Dans ce rapport, nous considérons une variation du LET enrichi via l’usage d’horloges logiques, que nous appellerons LET synchrone (sLET), implémenté par le langage industriel PsyC. L’approche sLET— et donc le PsyC — permet de spécifier un calcul comme étant exécuté au sein d’un intervalle de temps logique jusqu’à la prochaine occurrence d’une expression d’horloge (en opposition à une durée constante). Du fait que sLET est basé à la fois sur LET et sur l’approche synchrone, nous donnons dans ce rapport deux sémantiques opérationnelles du PsyC : une sémantique native (ou grand pas) basée sur une approche à la Plotkin (S.O.S.) et une sémantique synchrone définie par traduction vers le langage Esterel. La première regroupe tous les ordonnancement valides sous forme de classe d’équivalence, dans laquelle la seconde donne un représentant spécifique (dès que possible). Nous montrons l’équivalence sémantique de ces deux sémantiques sur les bornes des intervalles. La sémantique native est principalement utilisée pour la compilation, tandis que des travaux à venir montreront comment vérifier des propriétés de temporisation en utilisant essentiellement la sémantique synchrone.

Published
2023

42. Age‐dependent changes in epidermal architecture explored using an automated image analysis algorithm on in vivo reflectance confocal microscopy images

Author

Imane Lboukili, Georgios N. Stamatas, Xavier Descombes, Morphologie et Images (MORPHEME), 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)-Institut de Biologie Valrose (IBV), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Signal, Images et Systèmes (Laboratoire I3S - SIS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS), and Johnson & Johnson Santé Beauté France

Subjects
keratinocytes, stratum spinosum, epidermis, [SDV]Life Sciences [q-bio], stratum granulosum, [INFO]Computer Science [cs], Dermatology
Abstract

International audience; BackgroundReflectance confocal microscopy (RCM) allows for real-time in vivo visualization of the epidermis at the cellular level noninvasively. Parameters relating to tissue architecture can be extracted from RCM images, however, analysis of such images requires manual identification of cells to derive these parameters, which can be time-consuming and subject to human error, highlighting the need for an automated cell identification method.MethodsFirst, the region-of-interest (ROI) containing cells needs to be identified, followed by the identification of individual cells within the ROI. To perform this task, we use successive applications of Sato and Gabor filters. The final step is post-processing improvement of cell detection and removal of size outliers. The proposed algorithm is evaluated on manually annotated real data. It is then applied to 5345 images to study the evolution of epidermal architecture in children and adults. The images were acquired on the volar forearm of healthy children (3 months to 10 years) and women (25–80 years), and on the volar forearm and cheek of women (40–80 years). Following the identification of cell locations, parameters such as cell area, cell perimeter, and cell density are calculated, as well as the probability distribution of the number of nearest neighbors per cell. The thicknesses of the Stratum Corneum and supra-papillary epidermis are also calculated using a hybrid deep-learning method.ResultsEpidermal keratinocytes are significantly larger (area and perimeter) in the granular layer than in the spinous layer and they get progressively larger with a child's age. Skin continues to mature dynamically during adulthood, as keratinocyte size continues to increase with age on both the cheeks and volar forearm, but the topology and cell aspect ratio remain unchanged across different epidermal layers, body sites, and age. Stratum Corneum and supra-papillary epidermis thicknesses increase with age, at a faster rate in children than in adults.ConclusionsThe proposed methodology can be applied to large datasets to automate image analysis and the calculation of parameters relevant to skin physiology. These data validate the dynamic nature of skin maturation during childhood and skin aging in adulthood.

Published
2023

43. A Sea of Words: An In-Depth Analysis of Anchors for Text Data

Author

Lopardo, Gianluigi, Precioso, Frederic, Garreau, Damien, Modèles et algorithmes pour l’intelligence artificielle (MAASAI), 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)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS), Université Côte d'Azur (UCA), Laboratoire Jean Alexandre Dieudonné (LJAD), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), ANR-21-CE23-0005,NIM-ML,Méthodes d'explicabilité de nouvelle génération(2021), and European Project: H2020-951911,H2020-EU.2.1.1. - INDUSTRIAL LEADERSHIP - Leadership in enabling and industrial technologies - Information and Communication Technologies (ICT),AI4Media(2020)

Subjects
FOS: Computer and information sciences, Computer Science - Machine Learning, Artificial Intelligence (cs.AI), Computer Science - Computation and Language, [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], Statistics - Machine Learning, Computer Science - Artificial Intelligence, Machine Learning (stat.ML), Computation and Language (cs.CL), Machine Learning (cs.LG)
Abstract

Anchors (Ribeiro et al., 2018) is a post-hoc, rule-based interpretability method. For text data, it proposes to explain a decision by highlighting a small set of words (an anchor) such that the model to explain has similar outputs when they are present in a document. In this paper, we present the first theoretical analysis of Anchors, considering that the search for the best anchor is exhaustive. After formalizing the algorithm for text classification, we present explicit results on different classes of models when the vectorization step is TF-IDF, and words are replaced by a fixed out-of-dictionary token when removed. Our inquiry covers models such as elementary if-then rules and linear classifiers. We then leverage this analysis to gain insights on the behavior of Anchors for any differentiable classifiers. For neural networks, we empirically show that the words corresponding to the highest partial derivatives of the model with respect to the input, reweighted by the inverse document frequencies, are selected by Anchors., Accepted to AISTATS 2023. 9+2 page paper, 21-page appendix

Published
2023

44. Function-as-a-Service for the Cloud-to-Thing Continuum: A Systematic Mapping Study

Author

Bárbara Oliveira, Nicolas Ferry, Hui Song, Rustem Dautov, Ankica Barišić, Atslands Rego da Rocha, Logical Time for Formal Embedded System Design (KAIROS), 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)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), SINTEF Digital, Microsystems and Nanotechnology [Oslo], Universidade Federal do Ceará = Federal University of Ceará (UFC), and European Project: 101070455

Subjects
Cloud-to-Thing Continuum, Function-as-a-Service, Internet of Things, Systematic Mapping Study, Cloud, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract

International audience; Until recently, Internet of Things applications were mainly seen as a means to gather sensor data for further processing in the Cloud. Nowadays, with the advent of Edge and Fog Computing, digital services are dragged closer to the physical world, with data processing and storage tasks distributed across the whole Cloud-to-Thing continuum. Function-as-a-Service (FaaS) is gaining momentum as one of the promising programming models for such digital services. This work investigates the current research landscape of applying FaaS over the Cloud-to-Thing continuum. In particular, we investigate the support offered by existing FaaS platforms for the deployment, placement, orchestration, and execution of functions across the whole continuum using the Systematic Mapping Study methodology. We selected 33 primary studies and analyzed their data, bringing a broad view on the current research landscape in the area.

Published
2023

45. Trefftz approximation space for Poisson equation in perforated domains

Author

Boutilier, Miranda, Brenner, Konstantin, Dolean, Victorita, Université Côte d'Azur (UCA), COmplex Flows For Energy and Environment (COFFEE), 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)-Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), University of Strathclyde [Glasgow], and ANR-20-CE46-0005,Top-up,High-resolution topography upscaling for overland flows(2020)

Subjects
Trefftz method, Multi-scale finite element method, [MATH]Mathematics [math], Domain Decomposition, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
Abstract

For the Poisson equation posed in a planar domain containing a large number of polygonal perforations, we propose a low dimensional approximation space based on a coarse polygonal partitioning of the domain. Similar to other multi-scale numerical methods, this coarse space is spanned by basis functions that are locally discrete harmonic. We provide an error estimate in the energy norm that only depends on the regularity of the solution over the edges of the coarse skeleton. For a specific edge refinement procedure, this estimate allows to establish the superconvergence of the method even if the true solution has a low general regularity. Combined with the Restricted Additive Schwarz method, the proposed coarse space leads to an efficient two-level iterative linear solver which achieves the fine-scale finite element error in few iterations. The numerical experiment showcases the use of this coarse space over the test cases involving singular solutions and realistic urban geometries.

Published
2023

46. Fed-MIWAE: Federated Imputation of Incomplete Data via Deep Generative Models

Author

Balelli, Irene, Sportisse, Aude, Cremonesi, Francesco, Mattei, Pierre-Alexandre, Lorenzi, Marco, E-Patient : Images, données & mOdèles pour la médeciNe numériquE (EPIONE), 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), Université Côte d'Azur (UCA), Modèles et algorithmes pour l’intelligence artificielle (MAASAI), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS), Interdisciplinary Institute for Artificial Intelligence (3iA Côte d’Azur), and ANR-19-P3IA-0002,3IA@cote d'azur,3IA Côte d'Azur(2019)

Subjects
FOS: Computer and information sciences, Computer Science - Machine Learning, Deep Learning, Statistics - Machine Learning, Missing data, Federated pre-processing, Federated learning, Machine Learning (stat.ML), [STAT.OT]Statistics [stat]/Other Statistics [stat.ML], Variational autoencoders, Machine Learning (cs.LG)
Abstract

Federated learning allows for the training of machine learn- ing models on multiple decentralized local datasets without requiring explicit data exchange. However, data pre-processing, including strate- gies for handling missing data, remains a major bottleneck in real-world federated learning deployment, and is typically performed locally. This approach may be biased, since the subpopulations locally observed at each center may not be representative of the overall one. To address this issue, this paper first proposes a more consistent approach to data stan- dardization through a federated model. Additionally, we propose Fed- MIWAE, a federated version of the state-of-the-art imputation method MIWAE, a deep latent variable model for missing data imputation based on variational autoencoders. MIWAE has the great advantage of being easily trainable with classical federated aggregators. Furthermore, it is able to deal with MAR (Missing At Random) data, a more challenging missing-data mechanism than MCAR (Missing Completely At Random), where the missingness of a variable can depend on the observed ones. We evaluate our method on multi-modal medical imaging data and clinical scores from a simulated federated scenario with the ADNI dataset. We compare Fed-MIWAE with respect to classical imputation methods, ei- ther performed locally or in a centralized fashion. Fed-MIWAE allows to achieve imputation accuracy comparable with the best centralized method, even when local data distributions are highly heterogeneous. In addition, thanks to the variational nature of Fed-MIWAE, our method is designed to perform multiple imputation, allowing for the quantification of the imputation uncertainty in the federated scenario.

Published
2023

47. On global and monotone convergence of the preconditioned Newton's method for some mildly nonlinear systems

Author

Brenner, Konstantin, Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), COmplex Flows For Energy and Environment (COFFEE), 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)-Laboratoire Jean Alexandre Dieudonné (LJAD), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)

Subjects
Mildly nonlinear systems, Newton's method, nonlinear multi-splitting, nonlinear preconditioning, global monotone convergence, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
Abstract

For mildly nonlinear systems involving only diagonal nonlinearities, the global, and essentially monotone, convergence of Newton's method can be established based on concavity/convexity arguments and provided that the Jacobian of the system has a nonnegative inverse. We show that the nonlinear preconditioning resulting from the multi-splitting of the system can preserve those attractive theoretical properties. Our convergence analysis applies in particular to block Jacobi-Newton, RASPEN and the two-step RAS/Newton method. The numerical experiment, based on a discrete porous media equation, shows that the performance of those methods is essentially independent of the mesh size.

Published
2023

48. Main conclusions and perspectives from the collective scientific assessment of the effects of plant protection products on biodiversity and ecosystem services along the land–sea continuum in France and French overseas territories

Author

Stéphane Pesce, Laure Mamy, Wilfried Sanchez, Marcel Amichot, Joan Artigas, Stéphanie Aviron, Carole Barthélémy, Rémy Beaudouin, Carole Bedos, Annette Bérard, Philippe Berny, Cédric Bertrand, Colette Bertrand, Stéphane Betoulle, Eve Bureau-Point, Sandrine Charles, Arnaud Chaumot, Bruno Chauvel, Michael Coeurdassier, Marie-France Corio-Costet, Marie-Agnès Coutellec, Olivier Crouzet, Isabelle Doussan, Juliette Faburé, Clémentine Fritsch, Nicola Gallai, Patrice Gonzalez, Véronique Gouy, Mickael Hedde, Alexandra Langlais, Fabrice Le Bellec, Christophe Leboulanger, Christelle Margoum, Fabrice Martin-Laurent, Rémi Mongruel, Soizic Morin, Christian Mougin, Dominique Munaron, Sylvie Nélieu, Céline Pelosi, Magali Rault, Sergi Sabater, Sabine Stachowski-Haberkorn, Elliott Sucré, Marielle Thomas, Julien Tournebize, Sophie Leenhardt, Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Institut National de l'Environnement Industriel et des Risques (INERIS), Aix Marseille Université (AMU), Ecologie fonctionnelle et écotoxicologie des agroécosystèmes (ECOSYS), AgroParisTech-Université Paris-Saclay-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Université de Reims Champagne-Ardenne (URCA), Centre Norbert Elias (CNELIAS), École des hautes études en sciences sociales (EHESS)-Avignon Université (AU)-Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), Modélisation et écotoxicologie prédictives, Département biostatistiques et modélisation pour la santé et l'environnement [LBBE], Laboratoire de Biométrie et Biologie Evolutive - UMR 5558 (LBBE), Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-VetAgro Sup - Institut national d'enseignement supérieur et de recherche en alimentation, santé animale, sciences agronomiques et de l'environnement (VAS)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-VetAgro Sup - Institut national d'enseignement supérieur et de recherche en alimentation, santé animale, sciences agronomiques et de l'environnement (VAS)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire de Biométrie et Biologie Evolutive - UMR 5558 (LBBE), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-VetAgro Sup - Institut national d'enseignement supérieur et de recherche en alimentation, santé animale, sciences agronomiques et de l'environnement (VAS)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Chrono-environnement (UMR 6249) (LCE), Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC), MARine Biodiversity Exploitation and Conservation (UMR MARBEC), Institut de Recherche pour le Développement (IRD)-Institut Français de Recherche pour l'Exploitation de la Mer (IFREMER)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), RiverLy - Fonctionnement des hydrosystèmes (RiverLy), Institut Français de Recherche pour l'Exploitation de la Mer (IFREMER), Institut Sophia Agrobiotech (ISA), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Université Côte d'Azur (UCA), Laboratoire Microorganismes : Génome et Environnement (LMGE), Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA), Biodiversité agroécologie et aménagement du paysage (UMR BAGAP), Ecole supérieure d'Agricultures d'Angers (ESA)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Institut Agro Rennes Angers, 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), Laboratoire Population-Environnement-Développement (LPED), Institut de Recherche pour le Développement (IRD)-Aix Marseille Université (AMU), Environnement Méditerranéen et Modélisation des Agro-Hydrosystèmes (EMMAH), Avignon Université (AU)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Interactions Cellules Environnement - UR (ICE), VetAgro Sup - Institut national d'enseignement supérieur et de recherche en alimentation, santé animale, sciences agronomiques et de l'environnement (VAS), Centre de recherches insulaires et observatoire de l'environnement (CRIOBE), Université de Perpignan Via Domitia (UPVD)-École Pratique des Hautes Études (EPHE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Stress Environnementaux et BIOsurveillance des milieux aquatiques (SEBIO), Institut National de l'Environnement Industriel et des Risques (INERIS)-Université de Reims Champagne-Ardenne (URCA)-Université Le Havre Normandie (ULH), Normandie Université (NU)-Normandie Université (NU)-SFR Condorcet, Université de Reims Champagne-Ardenne (URCA)-Centre National de la Recherche Scientifique (CNRS)-Université de Reims Champagne-Ardenne (URCA)-Centre National de la Recherche Scientifique (CNRS), Agroécologie [Dijon], Université de Bourgogne (UB)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Institut Agro Dijon, Santé et agroécologie du vignoble (UMR SAVE), Université de Bordeaux (UB)-Institut des Sciences de la Vigne et du Vin (ISVV)-Ecole Nationale Supérieure des Sciences Agronomiques de Bordeaux-Aquitaine (Bordeaux Sciences Agro)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Dynamique et durabilité des écosystèmes : de la source à l’océan (DECOD), Institut Français de Recherche pour l'Exploitation de la Mer (IFREMER)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Office français de la biodiversité (OFB), Groupe de Recherche en Droit, Economie et Gestion (GREDEG), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Laboratoire d'Etude et de Recherche sur l'Economie, les Politiques et les Systèmes Sociaux (LEREPS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Institut d'Études Politiques [IEP] - Toulouse-École Nationale Supérieure de Formation de l'Enseignement Agricole de Toulouse-Auzeville (ENSFEA), Environnements et Paléoenvironnements OCéaniques (EPOC), Observatoire aquitain des sciences de l'univers (OASU), Université Sciences et Technologies - Bordeaux 1 (UB)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Université Sciences et Technologies - Bordeaux 1 (UB)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-École Pratique des Hautes Études (EPHE), Ecologie fonctionnelle et biogéochimie des sols et des agro-écosystèmes (UMR Eco&Sols), Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Institut de Recherche pour le Développement (IRD)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Institut Agro Montpellier, Institut de l'Ouest : Droit et Europe (IODE), Université de Rennes (UR)-Centre National de la Recherche Scientifique (CNRS), Fonctionnement agroécologique et performances des systèmes de cultures horticoles (UPR HORTSYS), Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad), Aménagement des Usages des Ressources et des Espaces marins et littoraux - Centre de droit et d'économie de la mer (AMURE), Institut Français de Recherche pour l'Exploitation de la Mer (IFREMER)-Université de Brest (UBO)-Institut Universitaire Européen de la Mer (IUEM), Institut de Recherche pour le Développement (IRD)-Institut national des sciences de l'Univers (INSU - CNRS)-Université de Brest (UBO)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS), Ecosystèmes aquatiques et changements globaux (UR EABX), Institut méditerranéen de biodiversité et d'écologie marine et continentale (IMBE), Avignon Université (AU)-Aix Marseille Université (AMU)-Institut de recherche pour le développement [IRD] : UMR237-Centre National de la Recherche Scientifique (CNRS), Universitat de Girona (UdG), Physiologie et Toxines des Microalgues Toxiques et Nuisibles (PHYTOX), Centre Universitaire de Formation et de Recherche de Mayotte (CUFR), Unité de Recherches Animal et Fonctionnalités des Produits Animaux (URAFPA), Université de Lorraine (UL)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Hydrosystèmes continentaux anthropisés : ressources, risques, restauration (UR HYCAR), Direction de l'Expertise scientifique collective, de la Prospective et des Etudes, and French Office for Biodiversity (OFB) through the national ECOPHYTO plan

Subjects
Health, Toxicology and Mutagenesis, [SDE.MCG]Environmental Sciences/Global Changes, Biocontrol, General Medicine, Expertise, Environment, Ecotoxicology, Pollution, Modelling, [SDE]Environmental Sciences, Environmental Chemistry, Pesticides, [SDE.BE]Environmental Sciences/Biodiversity and Ecology, Ecological risk assessment
Abstract

International audience; Preservation of biodiversity and ecosystem services is critical for sustainable development and human well-being. However, an unprecedented erosion of biodiversity is observed and the use of plant protection products (PPP) has been identified as one of its main causes. In this context, at the request of the French Ministries responsible for the Environment, for Agriculture and for Research, a panel of 46 scientific experts ran a nearly 2-year-long (2020-2022) collective scientific assessment (CSA) of international scientific knowledge relating to the impacts of PPP on biodiversity and ecosystem services. The scope of this CSA covered the terrestrial, atmospheric, freshwater, and marine environments (with the exception of groundwater) in their continuity from the site of PPP application to the ocean, in France and French overseas territories, based on international knowledge produced on or transposable to this type of context (climate, PPP used, biodiversity present, etc.). Here, we provide a brief summary of the CSA's main conclusions, which were drawn from about 4500 international publications. Our analysis finds that PPP contaminate all environmental matrices, including biota, and cause direct and indirect ecotoxicological effects that unequivocally contribute to the decline of certain biological groups and alter certain ecosystem functions and services. Levers for action to limit PPP-driven pollution and effects on environmental compartments include local measures from plot to landscape scales and regulatory improvements. However, there are still significant gaps in knowledge regarding environmental contamination by PPPs and its effect on biodiversity and ecosystem functions and services. Perspectives and research needs are proposed to address these gaps.

Published
2023

49. On a Hamiltonian regularization of scalar conservation laws

Author

Guelmame, Billel, Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), COmplex Flows For Energy and Environment (COFFEE), 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)-Laboratoire Jean Alexandre Dieudonné (LJAD), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), Unité de Mathématiques Pures et Appliquées (UMPA-ENSL), École normale supérieure de Lyon (ENS de Lyon)-Centre National de la Recherche Scientifique (CNRS), Laboratoire Jean Alexandre Dieudonné (JAD), Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Alexandre Dieudonné (JAD), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), Université Nice Sophia Antipolis (... - 2019) (UNS), Université Côte d'Azur (UCA)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS), and Université Côte d'Azur (UCA)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Nice Sophia Antipolis (... - 2019) (UNS)

Subjects
regularization, Mathematics::Analysis of PDEs, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], generalized Hunter Saxton equation, Oleinik inequality, Scalar conservation laws, nonlinear evolution equation, conservative and dissipative solutions, Hamiltonian
Abstract

In this paper, we study a regularization of a scalar conservation law (SCL), which is obtained by modifying its Lagrangian. This regularization is parameterized by $\ell$ and conserves formally an $H^1$-like energy. Proof of the existence of local smooth solutions are given in this paper. In addition, we prove the existence of global weak solutions satisfying a uniform (on $\ell$) one-sided Oleinik inequality for this regularization, and also for a generalized Hunter--Saxton equation. Moreover, when $\ell \to 0$ (resp. $\ell \to \infty$), we prove that the solutions of the regularized equation converge up to a subsequence to $u_0$ (resp.$ u^\infty$) a solution of the SCL (resp. a generalized Hunter--Saxton equation), at least before the appearance of singularities.

Published
2023

50. HiDAnet: RGB-D Salient Object Detection via Hierarchical Depth Awareness

Author

Zongwei Wu, Guillaume Allibert, Fabrice Meriaudeau, Chao Ma, Cédric Demonceaux, Imagerie et Vision Artificielle [Dijon] (ImViA), Université de Bourgogne (UB), Signal, Images et Systèmes (Laboratoire I3S - SIS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Institut de Chimie Moléculaire de l'Université de Bourgogne [Dijon] (ICMUB), Université de Bourgogne (UB)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS), Shangaï Jiao Tong University [Shangaï], Recalage visuel avec des modèles physiquement réalistes (TANGRAM), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS), French Conseil Régional de Bourgogne-Franche-Comté, ANR-18-CE33-0004,CLARA,Couplage Apprentissage et Vision pour Contrôle de Robots Aeriens(2018), and ANR-15-IDEX-0003,BFC,ISITE ' BFC(2015)

Subjects
FOS: Computer and information sciences, Computer Vision and Pattern Recognition (cs.CV), Computer Science - Computer Vision and Pattern Recognition, Depth-Aware Channel Attention, RGB-D Saliency Detection, Computer Graphics and Computer-Aided Design, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Software
Abstract

International audience; RGB-D saliency detection aims to fuse multi-modal cues to accurately localize salient regions. Existing works often adopt attention modules for feature modeling, with few methods explicitly leveraging fine-grained details to merge with semantic cues. Thus, despite the auxiliary depth information, it is still challenging for existing models to distinguish objects with similar appearances but at distinct camera distances. In this paper, from a new perspective, we propose a novel Hierarchical Depth Awareness network (HiDAnet) for RGB-D saliency detection. Our motivation comes from the observation that the multigranularity properties of geometric priors correlate well with the neural network hierarchies. To realize multi-modal and multi-level fusion, we first use a granularity-based attention scheme to strengthen the discriminatory power of RGB and depth features separately. Then we introduce a unified cross dual-attention module for multi-modal and multi-level fusion in a coarse-to-fine manner. The encoded multi-modal features are gradually aggregated into a shared decoder. Further, we exploit a multi-scale loss to take full advantage of the hierarchical information. Extensive experiments on challenging benchmark datasets demonstrate that our HiDAnet performs favorably over the state-of-the-art methods by large margins. The source code can be found in https://github.com/Zongwei97/HIDANet/.

Published
2023

Catalog

Books, media, physical & digital resources
See catalog results