Author: "Department of computing" / Publisher: hal ccsd - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Department of computing"' showing total 271 results

Start Over Author "Department of computing" Publisher hal ccsd

271 results on '"Department of computing"'

1. Experiences with Domain-specific Language Embedding in Scala

Author: Department of computing (Department of computing) ; Macquarie University, Delft University of Technology [[Delft] ; Delft University of Technology, Julia Lawall and Laurent Réveillère, Sloane, Tony, Department of computing (Department of computing) ; Macquarie University, Delft University of Technology [[Delft] ; Delft University of Technology, Julia Lawall and Laurent Réveillère, and Sloane, Tony
Abstract: International audience, Object-oriented frameworks are often difficult to use. Framework- specific extensions to integrated development environments (IDEs) aim to mitigate the difficulty by offering tools that leverage the knowledge about framework's application programming interfaces (APIs). These tools commonly offer support for code visualization, automatic and interactive code generation, and code validation. Current practices, however, require such extensions to be custom-built manually for each supported framework. In this paper, we propose an approach to building framework-specific IDE extensions based on framework-specific modeling languages (FSMLs). We show how the definitions of different FSMLs can be interpreted in these extensions to provide advanced tool support for different framework APIs that the FSMLs are designed for.

2. Parallel Model Checking for Temporal Epistemic Logic

Author: Computing Laboratory (OUCL) ; University of Oxford, Department of Computing [London] ; Imperial College London, CONNECT, European Project : 231167, ICT, FP7-ICT-2007-3, CONNECT(2009), Kwiatkowska, Marta, Lomuscio, Alessio, Qu, Hongyang, Computing Laboratory (OUCL) ; University of Oxford, Department of Computing [London] ; Imperial College London, CONNECT, European Project : 231167, ICT, FP7-ICT-2007-3, CONNECT(2009), Kwiatkowska, Marta, Lomuscio, Alessio, and Qu, Hongyang
Abstract: International audience, We investigate the problem of the verification of multiagent systems by means of parallel algorithms. We present algorithms for CTLK, a logic combining branching time temporal logic with epistemic modalities. We report on an implementation of these algorithms and present the experimental results obtained. The results point to a significant speed-up in the verification step.

3. The Science of Quantitative Information Flow

Author: Mário S. Alvim, Konstantinos Chatzikokolakis, Annabelle McIver, Carroll Morgan, Catuscia Palamidessi, Geoffrey Smith, Computer Science Department [Belo Horizonte] (DCC), Universidade Federal de Minas Gerais, Concurrency, Mobility and Transactions (COMETE), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Department of computing (Department of computing), Macquarie University, National ICT Australia [Sydney] (NICTA), Knight Foundation - School of Computing and Information Sciences [Miami] (FIU | CIS), Florida International University [Miami] (FIU), Equipe Associée LOGIS, ANR-16-CE25-0011,REPAS,Des systèmes logiciels fiables et conscients des données privées, via les métriques de bisimulation(2016), European Project: 835294,H2020 Pilier ERC,HYPATIA(2019), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), and Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)
Subjects: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO]Computer Science [cs], ComputingMilieux_MISCELLANEOUS
Abstract: International audience
Published: 2020
Full Text: View/download PDF

4. Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields

Author: Gábor Ivanyos, Nitin Saxena, Miklos Santha, Igor E. Shparlinski, Marek Karpinski, Institute for Computer Science and Control [Budapest], University of Bonn, Centre National de la Recherche Scientifique (CNRS), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Centre for Quantum Technologies [Singapore] (CQT), National University of Singapore (NUS), Department of computing (Department of computing), and Macquarie University
Subjects: FOS: Computer and information sciences, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], General Computer Science, 0102 computer and information sciences, Rational function, 01 natural sciences, Character sum, ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), [INFO]Computer Science [cs], Analytic number theory, Number Theory (math.NT), 0101 mathematics, ComputingMilieux_MISCELLANEOUS, Mathematics, Discrete mathematics, Mathematics - Number Theory, Applied Mathematics, 010102 general mathematics, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, Computer Science Applications, Polynomial interpolation, Finite field, 010201 computation theory & mathematics, Quantum algorithm, Monic polynomial, Interpolation
Abstract: We consider the problem of recovering (that is, interpolating) and identity testing of a “hidden” monic polynomial f, given an oracle access to $${f}{(x)}^e$$ for $$x\in \mathbb {F}_q$$ , where $$\mathbb {F}_q$$ is finite field of q elements (extension fields access is not permitted). The naive interpolation algorithm needs $$O(e \deg f)$$ queries and thus requires $$e\deg f
Published: 2018
Full Text: View/download PDF

5. Using STPA in an ISO 26262 compliant process

Author: Mallya , A., Pantelic , V., Adedjouma , M., Lawford , M., Wassyng , A., Department of Computing and Software (McMaster University), McMaster University [Hamilton, Ontario], Département Ingénierie Logiciels et Systèmes (DILS), Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Laboratoire d'Intégration des Systèmes et des Technologies (LIST), Department of Computing and Software ( McMaster University ), Département Ingénierie Logiciels et Systèmes ( DILS ), Laboratoire d'Intégration des Systèmes et des Technologies ( LIST ), and Commissariat à l'énergie atomique et aux énergies alternatives ( CEA ) -Université Paris-Saclay-Commissariat à l'énergie atomique et aux énergies alternatives ( CEA ) -Université Paris-Saclay
Subjects: Safety engineering, [ INFO ] Computer Science [cs], STPA, Risk analysis, Hazards, Original equipment manufacturers, Automotive functional safeties, Battery management systems, Hazard analysis, Development process, [INFO]Computer Science [cs], Automotive subsystems, ASILs, Automotive industry, ISO 26262, Risk assessment
Abstract: Conference of 35th International Conference on Computer Safety, Reliability, and Security, SAFECOMP 2016 ; Conference Date: 21 September 2016 Through 23 September 2016; Conference Code:181379; International audience; ISO 26262 is the de facto standard for automotive functional safety, and every automotive Original Equipment Manufacturer (OEM), as well as their major suppliers, are striving to ensure that their development processes are ISO 26262 compliant. ISO 26262 mandates both hazard analysis and risk assessment. Systems Theoretic Process Analysis (STPA) is a relatively new hazard analysis technique, that promises to overcome some limitations of traditional hazard analysis techniques. In this paper, we analyze how STPA can be used in an ISO 26262 compliant process. We also provide an excerpt of our application of STPA on an automotive subsystem as per the concept phase of ISO 26262.
Published: 2016
Full Text: View/download PDF

6. La découverte des règles d'association dans un contexte distribué avec des données manquantes : Décomposition tensorielle

Author: El Ayyadi, Isam, Ouziri, Mourad, Benbernou, Salima, Younas, Muhammad, Laboratoire d'Informatique Paris Descartes (LIPADE - EA 2517), Université Paris Descartes - Paris 5 (UPD5), CCT (Department of Computing and Communication Technologies), Oxford Brookes University, Laboratoire d'Informatique Paris Descartes ( LIPADE - EA 2517 ), Université Paris Descartes - Paris 5 ( UPD5 ), and CCT ( Department of Computing and Communication Technologies )
Subjects: [ MATH ] Mathematics [math], [ INFO.INFO-IR ] Computer Science [cs]/Information Retrieval [cs.IR], [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], [MATH]Mathematics [math]
Abstract: International audience; Résumé. Le recueil des flux de données à travers des capteurs est devenu es-sentiel dans notre vie de chaque jour, allant de la surveillance du trafic en temps réel aux interventions d'urgence et de surveillance de la santé. Le volume des données entrant est généralement trop élevé pour être stocké et les calculs sur le flux doivent être exécutés en temps réel pour détecter rapidement des évé-nements intéressants (par exemple : la détection et la notification d'accident, le contrôle de congestion du réseau, gestion des pannes de réseau, détection d'in-trusion). Cependant, plusieurs de ces événements isolés peuvent également être conjointement surveillés et corrélés afin d'adapter le comportement du système et de prendre les mesures appropriées lors d'une détection d'anomalie. Dans cet article nous présentons une nouvelle technique permettant de découvrir les règles d'association manquantes dans un réseau multimodal. L'approche pro-posée est basée sur la décomposition d'un tenseur de confiance avec des valeurs manquantes. Elle est validée par des résultats expérimentaux qui montrent son importance et sa viabilité.
Published: 2015

7. Improving the SAT Modulo ODE Approach to Hybrid Systems Analysis by Combining Different Enclosure Methods

Author: Andreas Eggers, Martin Fränzle, Nedialko S. Nedialkov, Nacim Ramdani, Carl von Ossietzky Universität - Department of Computing Science, Carl Von Ossietzky Universität Oldenburg, Laboratoire pluridisciplinaire de recherche en ingénierie des systèmes, mécanique et énergétique (PRISME), Université d'Orléans (UO)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), Department of Computing and Software (McMaster University), and McMaster University [Hamilton, Ontario]
Subjects: 0209 industrial biotechnology, Computer science, Modulo, Ode, MathematicsofComputing_NUMERICALANALYSIS, 020207 software engineering, 02 engineering and technology, Interval (mathematics), Solver, [SPI.AUTO]Engineering Sciences [physics]/Automatic, 020901 industrial engineering & automation, Reachability, Modeling and Simulation, Satisfiability modulo theories, Hybrid system, ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, 0202 electrical engineering, electronic engineering, information engineering, Heuristics, Algorithm, Software
Abstract: International audience; Aiming at automatic verification and analysis techniques for hybrid discrete-continuous systems, we present a novel combination of enclosure methods for ordinary differential equations (ODEs) with the iSAT solver for large Boolean combinations of arithmetic constraints. Improving on our previous work, the contribution of this paper lies in combining iSAT with VNODE-LP, as a state-of-the-art interval solver for ODEs, and with bracketing systems, which exploit monotonicity properties allowing to find enclosures for problems that VNODE-LP alone cannot enclose tightly. We apply the combined iSAT-ODE solver to the analysis of a variety of non-linear hybrid systems by solving predicative encodings of reachability properties and of an inductive stability argument, and evaluate the impact of the different enclosure methods, decision heuristics, and their combination. Our experiments include classic benchmarks from the literature, as well as a newly-designed conveyor belt system that combines hybrid behavior of parallel components, a slip-stick friction model with non-linear dynamics and flow invariants, and several dimensions of parameterization. In the paper, we also present and evaluate an extension of VNODE-LP tailored to its use as a deduction mechanism within iSAT-ODE, to allow fast re-evaluations of enclosures over arbitrary subranges of the analyzed time span.
Published: 2015
Full Text: View/download PDF

8. Additive and multiplicative notions of leakage, and their capacities

Author: Konstantinos Chatzikokolakis, Catuscia Palamidessi, Geoffrey Smith, Carroll Morgan, Annabelle McIver, Mário S. Alvim, Computer Science Department [Belo Horizonte] (DCC), Universidade Federal de Minas Gerais, Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Department of computing (Department of computing), Macquarie University, National ICT Australia [Sydney] (NICTA), Microsoft Research - Inria Joint Centre (MSR - INRIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Microsoft Research Laboratory Cambridge-Microsoft Corporation [Redmond, Wash.], Knight Foundation - School of Computing and Information Sciences [Miami] (FIU | CIS), Florida International University [Miami] (FIU), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Theoretical computer science, Computer science, Multiplicative function, channel capacity, Vulnerability, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, Information theory, Quantitative information flow, confidentiality, 01 natural sciences, Channel capacity, Information sensitivity, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, Entropy (information theory), 020201 artificial intelligence & image processing, Confidentiality, Design methods, Dalenius Desideratum
Abstract: International audience; Protecting sensitive information from improper disclosure is a fundamental security goal. It is complicated, and difficult to achieve, often because of unavoidable or even unpredictable operating conditions that can lead to breaches in planned security defences. An attractive approach is to frame the goal as a quantitative problem, and then to design methods that measure system vulnerabilities in terms of the amount of information they leak. A consequence is that the precise operating conditions, and assumptions about prior knowledge, can play a crucial role in assessing the severity of any measured vunerability. We develop this theme by concentrating on vulnerability measures that are robust in the sense of allowing general leakage bounds to be placed on a program, bounds that apply whatever its operating conditions and whatever the prior knowledge might be. In particular we propose a theory of channel capacity, generalising the Shannon capacity of information theory, that can apply both to additive- and to multiplicative forms of a recently-proposed measure known as g-leakage. Further, we explore the computational aspects of calculating these (new) capacities: one of these scenarios can be solved efficiently by expressing it as a Kantorovich distance, but another turns out to be NP-complete. We also find capacity bounds for arbitrary correlations with data not directly accessed by the channel, as in the scenario of Dalenius's Desideratum.
Published: 2014
Full Text: View/download PDF

9. Bridging the gap between speech technology and natural language processing: an evaluation toolbox for term discovery systems

Author: Bogdan Ludusan, Versteegh, M., Aren Jansen, Guillaume Gravier, Xuan-Nga Cao, Mark Johnson, Emmanuel Dupoux, Laboratoire de sciences cognitives et psycholinguistique (LSCP), Département d'Etudes Cognitives - ENS Paris (DEC), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-École des hautes études en sciences sociales (EHESS)-Centre National de la Recherche Scientifique (CNRS), Human Language Technology Center of Excellence [Baltimore] (HLTCOE), Johns Hopkins University (JHU), Center for Language and Speech Processing [Baltimore] (CLSP), Multimedia content-based indexing (TEXMEX), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Department of computing (Department of computing), Macquarie University, École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-École normale supérieure - Paris (ENS-PSL), 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)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique
Subjects: evaluation, spoken term discovery, word segmentation, [INFO.INFO-MM]Computer Science [cs]/Multimedia [cs.MM]
Abstract: International audience; The unsupervised discovery of linguistic terms from either continuous phoneme transcriptions or from raw speech has seen an increasing interest in the past years both from a theoretical and a practical standpoint. Yet, there exists no common accepted evaluation method for the systems performing term discovery. Here, we propose such an evaluation toolbox, drawing ideas from both speech technology and natural language processing. We first transform the speech-based output into a symbolic representation and compute five types of evaluation metrics on this representation: the quality of acoustic matching, the quality of the clusters found, and the quality of the alignment with real words (type, token, and boundary scores). We tested our approach on two term discovery systems taking speech as input, and one using symbolic input. The latter was run using both the gold transcription and a transcription obtained from an automatic speech recognizer, in order to simulate the case when only imperfect symbolic information is available. The results obtained are analysed through the use of the proposed evaluation metrics and the implications of these metrics are discussed.
Published: 2014

10. Using Witten Laplacians to locate index-1 saddle points

Author: Lelièvre, Tony, Parpas, Panos, Centre d'Enseignement et de Recherche en Mathématiques et Calcul Scientifique (CERMICS), École des Ponts ParisTech (ENPC), MATHematics for MatERIALS (MATHERIALS), École des Ponts ParisTech (ENPC)-École des Ponts ParisTech (ENPC)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Department of Computing [Imperial College London], Imperial College London, Leverhulme TrustJ.P. Morgan A.I. Faculty AwardsEPSRC through grant number EP/W003317/1, ANR-19-CE40-0010,QuAMProcs,Analyse Quantitative de Processus Metastables(2019), and European Project: 810367,EMC2(2019)
Subjects: MSC codes. 65C35, 37N30, 65K10, FOS: Physical sciences, Numerical Analysis (math.NA), Computational Physics (physics.comp-ph), Dimer method, Optimization and Control (math.OC), 65C35, 37N30, 65K10, Saddle point search, FOS: Mathematics, Mathematics - Numerical Analysis, Witten Laplacian, Mathematics - Optimization and Control, Physics - Computational Physics, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
Abstract: We introduce a new stochastic algorithm to locate the index-1 saddle points of a function $V:\mathbb R^d \to \mathbb R$, with $d$ possibly large. This algorithm can be seen as an equivalent of the stochastic gradient descent which is a natural stochastic process to locate local minima. It relies on two ingredients: (i) the concentration properties on index-1 saddle points of the first eigenmodes of the Witten Laplacian (associated with $V$) on $1$-forms and (ii) a probabilistic representation of a partial differential equation involving this differential operator. Numerical examples on simple molecular systems illustrate the efficacy of the proposed approach.
Published: 2022

11. Deep learning in veterinary medicine, an approach based on CNN to detect pulmonary abnormalities from lateral thoracic radiographs in cats

Author: Léo Dumortier, Florent Guépin, Marie-Laure Delignette-Muller, Caroline Boulocher, Thomas Grenier, VetAgro Sup - Institut national d'enseignement supérieur et de recherche en alimentation, santé animale, sciences agronomiques et de l'environnement (VAS), Department of Computing [Imperial College London], Imperial College London, 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), Interactions Cellules Environnement - UR (ICE), Centre de Recherche en Acquisition et Traitement de l'Image pour la Santé (CREATIS), Université de Lyon-Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), Data Science Institute, Imperial College London, Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Hospices Civils de Lyon (HCL)-Université Jean Monnet - Saint-Étienne (UJM)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), and Grenier, Thomas
Subjects: Diagnostic Imaging, Radiography, Deep Learning, Multidisciplinary, [SDV.BA.MVSA]Life Sciences [q-bio]/Animal biology/Veterinary medicine and animal Health, Predictive Value of Tests, Cats, [SDV.BA.MVSA] Life Sciences [q-bio]/Animal biology/Veterinary medicine and animal Health, Animals, Neural Networks, Computer, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract: Thoracic radiograph (TR) is a complementary exam widely used in small animal medicine which requires a sharp analysis to take full advantage of Radiographic Pulmonary Pattern (RPP). Although promising advances have been made in deep learning for veterinary imaging, the development of a Convolutional Neural Networks (CNN) to detect specifically RPP from feline TR images has not been investigated. Here, a CNN based on ResNet50V2 and pre-trained on ImageNet is first fine-tuned on human Chest X-rays and then fine-tuned again on 500 annotated TR images from the veterinary campus of VetAgro Sup (Lyon, France). The impact of manual segmentation of TR’s intrathoracic area and enhancing contrast method on the CNN’s performances has been compared. To improve classification performances, 200 networks were trained on random shuffles of training set and validation set. A voting approach over these 200 networks trained on segmented TR images produced the best classification performances and achieved mean Accuracy, F1-Score, Specificity, Positive Predictive Value and Sensitivity of 82%, 85%, 75%, 81% and 88% respectively on the test set. Finally, the classification schemes were discussed in the light of an ensemble method of class activation maps and confirmed that the proposed approach is helpful for veterinarians.
Published: 2022
Full Text: View/download PDF

12. On the Extremality of an 80-Dimensional Lattice

Author: Stehlé, Damien, Watkins, Mark, Computer arithmetic (ARENAIRE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), School of Mathematics and statistics [Sydney], The University of Sydney, Department of computing (Department of computing), Macquarie University, École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), and Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL)
Subjects: ComputingMilieux_MISCELLANEOUS
Abstract: International audience
Published: 2010

13. Low-dimensional lattice basis reduction revisited

Author: Damien Stehlé, Phong Q. Nguyen, Laboratoire d'informatique de l'école normale supérieure (LIENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (CASCADE), Département d'informatique de l'École normale supérieure (DI-ENS), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), School of Mathematics and statistics [Sydney], The University of Sydney, Department of computing (Department of computing), Macquarie University, Département d'informatique - ENS Paris (DI-ENS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Inria Paris-Rocquencourt, École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Discrete mathematics, Binary GCD algorithm, Lattice problem, 010102 general mathematics, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 01 natural sciences, Euclidean distance, Combinatorics, Euclidean algorithm, Mathematics (miscellaneous), Quadratic equation, 010201 computation theory & mathematics, Lattice (order), 0101 mathematics, Lattice reduction, Greedy algorithm, Mathematics
Abstract: Lattice reduction is a geometric generalization of the problem of computing greatest common divisors. Most of the interesting algorithmic problems related to lattice reduction are NP-hard as the lattice dimension increases. This article deals with the low-dimensional case. We study a greedy lattice basis reduction algorithm for the Euclidean norm, which is arguably the most natural lattice basis reduction algorithm because it is a straightforward generalization of an old two-dimensional algorithm of Lagrange, usually known as Gauss' algorithm, and which is very similar to Euclid's gcd algorithm. Our results are twofold. From a mathematical point of view, we show that up to dimension four, the output of the greedy algorithm is optimal: The output basis reaches all the successive minima of the lattice. However, as soon as the lattice dimension is strictly higher than four, the output basis may be arbitrarily bad as it may not even reach the first minimum. More importantly, from a computational point of view, we show that up to dimension four, the bit-complexity of the greedy algorithm is quadratic without fast integer arithmetic, just like Euclid's gcd algorithm. This was already proved by Semaev up to dimension three using rather technical means, but it was previously unknown whether or not the algorithm was still polynomial in dimension four. We propose two different analyzes: a global approach based on the geometry of the current basis when the length decrease stalls, and a local approach showing directly that a significant length decrease must occur every O (1) consecutive steps. Our analyzes simplify Semaev's analysis in dimensions two and three, and unify the cases of dimensions two to four. Although the global approach is much simpler, we also present the local approach because it gives further information on the behavior of the algorithm.
Published: 2009

14. Information Propagation Speed in Mobile and Delay Tolerant Networks

Author: Jacquet, Philippe, Mans, Bernard, High performance communication (HIPERCOM), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Paris-Sud - Paris 11 (UP11)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Department of computing (Department of computing), Macquarie University, Australian Research Council Grant, Equipe associee, and INRIA
Subjects: [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], information propagation, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Computer Science::Networking and Internet Architecture, MANET, intermittently connected networks, speed, performances, information theory
Abstract: Recent research has highlighted the necessity of developing routing protocols for mobile ad hoc networks where end-to-end multi-hop paths may not exist and communication routes may only be available through time and mobility. Depending on the context, these networks are commonly referred as Intermittently Connected Mobile Networks (ICNs) or Delay/Disruption Tolerant Networks (DTNs). Conversely, little is known about the inherent properties of such networks, and consequently, performance evaluations are often limited to comparative simulations (using mobility models or actual traces). The goal of this paper is to increase our understanding of possible performances of DTNs. After introducing our formal model, we use analytical tools to derive theoretical upper-bounds of the information propagation speed in wireless mobile networks. We also present some numerical simulations to illustrate the accuracy of the bounds in numerous scenarios.
Published: 2007

15. Personalization of Web Services - Concepts, Challenges, and Solutions

Author: Qusay H. Mahmoud, Ghita Kouadri Mostéfaoui, Djamal Benslimane, Zakaria Maamar, S Kouadri Mostefaoui, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), SI LIRIS, Équipe gestionnaire des publications, College of Information Technology (CIT), department of computing and information science (DCIS), Department of Computing [London], Biomedical Image Analysis Group [London] (BioMedIA), Imperial College London-Imperial College London, Service Oriented Computing (SOC), and Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon)
Subjects: World Wide Web, Multimedia, Computer science, [INFO]Computer Science [cs], Web service, [INFO] Computer Science [cs], computer.software_genre, Web intelligence, computer, Personalization
Abstract: Later on, Plus tard
Published: 2006

16. Quantum Black Holes: Entropy and Entanglement on the Horizon

Author: Etera R. Livine, Daniel R. Terno, Livine, Etera, Laboratoire de Physique de l'ENS Lyon (Phys-ENS), École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon, Department of computing (Department of computing), Macquarie University, École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), and Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)
Subjects: Nuclear and High Energy Physics, Event horizon, White hole, FOS: Physical sciences, General Relativity and Quantum Cosmology (gr-qc), 01 natural sciences, General Relativity and Quantum Cosmology, Micro black hole, [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph], Quantum mechanics, 0103 physical sciences, 010306 general physics, Black hole thermodynamics, [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph], Physics, Quantum Physics, [PHYS.GRQC] Physics [physics]/General Relativity and Quantum Cosmology [gr-qc], 010308 nuclear & particles physics, Membrane paradigm, Fuzzball, 3. Good health, Black hole, [PHYS.GRQC]Physics [physics]/General Relativity and Quantum Cosmology [gr-qc], Quantum Physics (quant-ph), Hawking radiation
Abstract: We are interested in black holes in Loop Quantum Gravity (LQG). We study the simple model of static black holes: the horizon is made of a given number of identical elementary surfaces and these small surfaces all behaves as a spin-s system accordingly to LQG. The chosen spin-s defines the area unit or area resolution, which the observer uses to probe the space(time) geometry. For s=1/2, we are actually dealing with the qubit model, where the horizon is made of a certain number of qubits. In this context, we compute the black hole entropy and show that the factor in front of the logarithmic correction to the entropy formula is independent of the unit s. We also compute the entanglement between parts of the horizon. We show that these correlations between parts of the horizon are directly responsible for the asymptotic logarithmic corrections. This leads us to speculate on a relation between the evaporation process and the entanglement between a pair of qubits and the rest of the horizon. Finally, we introduce a concept of renormalisation of areas in LQG., Revtex4, 25 pages, 4 figures
Published: 2006

17. Reconstructing Quantum Geometry from Quantum Information: Area Renormalisation, Coarse-Graining and Entanglement on Spin Networks

Author: Livine, Etera R., Terno, Daniel R., Livine, Etera, Laboratoire de Physique de l'ENS Lyon (Phys-ENS), École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon, Department of computing (Department of computing), Macquarie University, École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), and Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)
Subjects: [PHYS.GRQC] Physics [physics]/General Relativity and Quantum Cosmology [gr-qc], [PHYS.GRQC]Physics [physics]/General Relativity and Quantum Cosmology [gr-qc], FOS: Physical sciences, General Relativity and Quantum Cosmology (gr-qc), General Relativity and Quantum Cosmology
Abstract: After a brief review of spin networks and their interpretation as wave functions for the (space) geometry, we discuss the renormalisation of the area operator in loop quantum gravity. In such a background independent framework, we propose to probe the structure of a surface through the analysis of the coarse-graining and renormalisation flow(s) of its area. We further introduce a procedure to coarse-grain spin network states and we quantitatively study the decrease in the number of degrees of freedom during this process. Finally, we use these coarse-graining tools to define the correlation and entanglement between parts of a spin network and discuss their potential interpretation as a natural measure of distance in such a state of quantum geometry., Comment: 27 pages, 12 figures, RevTex4
Published: 2006

18. Entanglement of zero angular momentum mixtures and black hole entropy

Author: Etera R. Livine, Daniel R. Terno, Laboratoire de Physique de l'ENS Lyon (Phys-ENS), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Department of computing (Department of computing), Macquarie University, École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon, and Livine, Etera
Subjects: Physics, Quantum Physics, Angular momentum, 010308 nuclear & particles physics, Hilbert space, FOS: Physical sciences, Quantum entanglement, Squashed entanglement, 01 natural sciences, Multipartite entanglement, Atomic and Molecular Physics, and Optics, symbols.namesake, [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph], Unitary group, Quantum mechanics, 0103 physical sciences, symbols, Quantum Physics (quant-ph), 010306 general physics, Black hole thermodynamics, Entropy (arrow of time), [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph]
Abstract: We calculate the entanglement of formation and the entanglement of distillation for arbitrary mixtures of the zero spin states on an arbitrary-dimensional bipartite Hilbert space. Such states are relevant to quantum black holes and to decoherence-free subspaces based communication. The two measures of entanglement are equal and scale logarithmically with the system size. We discuss its relation to the black hole entropy law. Moreover, these states are locally distinguishable but not locally orthogonal, thus violating a conjecture that the entanglement measures coincide only on locally orthogonal states. We propose a slightly weaker form of this conjecture. Finally, we generalize our entanglement analysis to any unitary group., 5 pages, revtex4 Final version. A discussion of local orthogonality and entanglement is added
Published: 2005

19. Automatically Distributing and Updating In-Network Management Rules for Software Defined Networks

Author: Ahmad Abboud, Remi Garcia, Abdelkader Lahmadi, Michael Rusinowitch, Adel Bouhoula, Mondher Ayadi, NUMERYX, Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria), Resilience and Elasticity for Security and ScalabiliTy of dynamic networked systems (RESIST), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Department of Computing and Games, Teesside University, Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Proof techniques for security protocols (PESTO), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM), and Arabian Gulf University, Kingdom of Bahrain
Subjects: [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation
Abstract: International audience
Published: 2022
Full Text: View/download PDF

20. Contention-related crash failures: Definitions, agreement algorithms, and impossibility results

Author: Anaïs Durand, Michel Raynal, Gadi Taubenfeld, 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), Department of Computing, Polytechnic University, Hong Kong, the World Is Distributed Exploring the tension between scale and coordination (WIDE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), and Reichman University [Herzliya]
Subjects: General Computer Science, Concurrency, Asynchronous system, Contention, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Agreement algorithm, Process crash, Theoretical Computer Science
Abstract: International audience; This article explores an interplay between process crash failures and concurrency. Namely, it aims at answering the question, “Is it possible to cope with more crash failures when some number of crashes occur before some predefined contention point happened?”. These crashes are named λ-constrained crashes, where λ is the predefined contention point (known by the processes). Hence, this article considers two types of process crashes: λ-constrained crashes and classical crashes (which can occur at any time and are consequently called any-time crashes). Considering a system made up of n asynchronous processes communicating through atomic read/write registers, the article focuses on the design of two agreement-related algorithms. Assuming λ = n − 1 and no any-time failure, the first algorithm solves the consensus problem in the presence of one λ-constrained crash failure, thereby circumventing the well-known FLP impossibility result. The second algorithm considers k-set agreement for k ≥ 2. It is a k-set agreement algorithm such that λ = n − ` and ` ≥ k = m + f that works in the presence of up to (2m + ` − k) λ-constrained crashes and (f − 1) any-time crashes, i.e., up to t = (2m + ` − k) + (f − 1) process crashes. It follows that considering the timing of failures with respect to a predefined contention point enlarges the space of executions in which k-set agreement can be solved despite the combined effect of asynchrony, concurrency, and process crashes. The paper also presents agreement-related impossibilityresults for consensus and k-set agreement in the context of λ-constrained process crashes (with or without any-time crashes)
Published: 2022
Full Text: View/download PDF

21. Enabling Markovian Representations under Imperfect Information

Author: Francesco Belardinelli, Borja G. León, Vadim Malvone, Informatique, Biologie Intégrative et Systèmes Complexes (IBISC), Université d'Évry-Val-d'Essonne (UEVE), Department of Computing [Imperial College London], Imperial College London, Informatique, BioInformatique, Systèmes Complexes (IBISC), Université d'Évry-Val-d'Essonne (UEVE)-Université Paris-Saclay, Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), Télécom ParisTech, Autonomic and Critical Embedded Systems (ACES), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Rocha, AP, Steels, L, and VandenHerik, J
Subjects: Technology, Science & Technology, non-Markovian Rewards, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Computer Science, Software Engineering, nonMarkovian Rewards, Computer Science, Artificial Intelligence, Partial Observability, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Computer Science, Theory & Methods, [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], Markov Decision Processes, Computer Science, Extended Partially Observable Decision Process, Computer Science, Interdisciplinary Applications
Abstract: International audience; Markovian systems are widely used in reinforcement learning (RL), when the successful completion of a task depends exclusively on the last interaction between an autonomous agent and its environment. Unfortunately, real-world instructions are typically complex and often better described as non-Markovian. In this paper we present an extension method that allows solving partially-observable non-Markovian reward decision processes (PONMRDPs) by solving equivalent Markovian models. This potentially facilitates Markovian-based state-of-the-art techniques, including RL, to find optimal behaviours for problems best described as PONMRDP. We provide formal optimality guarantees of our extension methods together with a counterexample illustrating that naive extensions from existing techniques in fully-observable environments cannot provide such guarantees.
Published: 2022
Full Text: View/download PDF

22. Extending Intel-X86 Consistency and Persistency: {F}ormalising the Semantics of Intel-X86 Memory Types and Non-Temporal Stores

Author: Azalea Raad, Luc Maranget, Viktor Vafeiadis, Department of Computing [Imperial College London], Imperial College London, Langages de programmation : systèmes de types, concurrence, preuve de programme (CAMBIUM), Collège de France (CdF (institution))-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Max Planck Institute for Software Systems (MPI-SWS), This work was also supported in part by a UKRI Future Leaders Fellowship [grant number MR/V024299/1], European Project: 101003349 ,H2020-EU.1.1. - EXCELLENT SCIENCE - European Research Council (ERC),PERSIST (2021), and UK Research and Innovation
Subjects: 010302 applied physics, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Cacheability, 020207 software engineering, 02 engineering and technology, Non-temporal accesses, 01 natural sciences, Non-volatile memory, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, 0103 physical sciences, Memory persistency, 0202 electrical engineering, electronic engineering, information engineering, Memory types, Intel-x86, Safety, Risk, Reliability and Quality, Software, Weak memory
Abstract: Existing semantic formalisations of the Intel-x86 architecture cover only a small fragment of its available features that are relevant for the consistency semantics of multi-threaded programs as well as the persistency semantics of programs interfacing with non-volatile memory. We extend these formalisations to cover: (1) non-temporal writes, which provide higher performance and are used to ensure that updates are flushed to memory; (2) reads and writes to other Intel-x86 memory types, namely uncacheable, write-combined, and write-through; as well as (3) the interaction between these features. We develop our formal model in both operational and declarative styles, and prove that the two characterisations are equivalent. We have empirically validated our formalisation of the consistency semantics of these additional features and their subtle interactions by extensive testing on different Intel-x86 implementations.
Published: 2022
Full Text: View/download PDF

23. Compositional modelling of immune response and virus transmission dynamics

Author: W. Waites, M. Cavaliere, V. Danos, R. Datta, R. M. Eggo, T. B. Hallett, D. Manheim, J. Panovska-Griffiths, T. W. Russell, V. I. Zarnitsyna, Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), Department of Computer and Information Sciences [Univ Strathclyde], University of Strathclyde [Glasgow], Department of Computing and Mathematics, Manchester Metropolitan University, Manchester, UK, Department of Chemical Engineering, Worcester Polytechnic Institute, Worcester Polytechnic Institute, London School of Hygiene and Tropical Medicine (LSHTM), Imperial College London, Technion - Israel Institute of Technology [Haifa], Nuffield Department of Medicine [Oxford, UK] (Big Data Institute), University of Oxford, University of California [Los Angeles] (UCLA), University of California (UC), Department of Microbiology and Immunology, Emory University School of Medicine, Atlanta, GA, USA, Manchester Metropolitan University (MMU), Analyse Statique par Interprétation Abstraite (ANTIQUE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), The Queen's College, Emory University School of Medicine, Emory University [Atlanta, GA], Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Inria de Paris, University of Oxford [Oxford], WW, DM and TH acknowledge support from the Foundation for Innovative New Diagnostics. WW and RME were supported by MRC grant MR/V027956/1. DM also acknowledges support from the Center for Eﬀective Altruism’s Long-Term Future Fund., Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), and Danos, Vincent
Subjects: QR355, process calculi, General Science & Technology, General Mathematics, [SDV]Life Sciences [q-bio], Populations and Evolution (q-bio.PE), General Engineering, Immunity, General Physics and Astronomy, COVID-19, [INFO] Computer Science [cs], epidemics, immune response, [SDV] Life Sciences [q-bio], COVID-19 Testing, RA0421, FOS: Biological sciences, Humans, [INFO]Computer Science [cs], QA, Quantitative Biology - Populations and Evolution, multi-scale modelling
Abstract: Transmission models for infectious diseases are typically formulated in terms of dynamics between individuals or groups with processes such as disease progression or recovery for each individual captured phenomenologically, without reference to underlying biological processes. Furthermore, the construction of these models is often monolithic: they do not allow one to readily modify the processes involved or include the new ones, or to combine models at different scales. We show how to construct a simple model of immune response to a respiratory virus and a model of transmission using an easily modifiable set of rules allowing further refining and merging the two models together. The immune response model reproduces the expected response curve of PCR testing for COVID-19 and implies a long-tailed distribution of infectiousness reflective of individual heterogeneity. This immune response model, when combined with a transmission model, reproduces the previously reported shift in the population distribution of viral loads along an epidemic trajectory. This article is part of the theme issue ‘Technical challenges of modelling real-life epidemics and examples of overcoming these’.
Published: 2021
Full Text: View/download PDF

24. Strategic Reasoning with a Bounded Number of Resources: the Quest for Tractability

Author: Francesco Belardinelli, Stéphane Demri, Department of Computing [Imperial College London], Imperial College London, Informatique, BioInformatique, Systèmes Complexes (IBISC), Université d'Évry-Val-d'Essonne (UEVE)-Université Paris-Saclay, Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Centre National de la Recherche Scientifique (CNRS), Francesco Belardinelli acknowledges the support of the ANR JCJC Project SVeDaS (ANR-16-CE40- 0021) and Stéphane Demri acknowledges the support of the Centre National de la Recherche Scientifique (C.N.R.S.)., and ANR-16-CE40-0021,SVeDaS,Spécification et Vérification des Systèmes basés sur les Données(2016)
Subjects: Linguistics and Language, Theoretical computer science, Computer science, EXPTIME, 0102 computer and information sciences, 02 engineering and technology, resource, 01 natural sciences, Language and Linguistics, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Artificial Intelligence, 0202 electrical engineering, electronic engineering, information engineering, Temporal logic, [INFO]Computer Science [cs], Special case, linear-time temporal operator, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, Parity game, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 010201 computation theory & mathematics, Turing reduction, Bounded function, Path (graph theory), complexity, alternating-time temporal logic ATL+
Abstract: International audience; The resource-bounded alternating-time temporal logic RB±ATL combines strategic reasoning with reasoning about resources. Its model-checking problem is known to be 2EXPTIME-complete (the same as its proper extension RB±ATL$^⁎$) and fragments have been identified to lower the complexity.In this work, we consider the variant RB±ATL+ that allows for Boolean combinations of path formulae starting with single temporal operators, but restricted to a single resource, providing an interesting trade-off between temporal expressivity and resource analysis. We show that the model-checking problem for RB±ATL+ restricted to a single agent and a single resource is $\Delta_{2}^{P}$-complete, hence the same as for the standard branching-time temporal logic CTL+. In this case reasoning about resources comes at no extra computational cost. When a fixed finite set of linear-time temporal operators is considered, the model-checking problem drops to PTIME, which includes the special case of RB±ATL restricted to a single agent and a single resource. Furthermore, we show that, with an arbitrary number of agents and a fixed number of resources, the model-checking problem for RB±ATL+ can be solved in EXPTIME using a sophisticated Turing reduction to the parity game problem for alternating vector addition systems with states (AVASS).
Published: 2021
Full Text: View/download PDF

25. General framework for deriving reproducible Krylov subspace algorithms: A BiCGStab case study

Author: Iakymchuk, Roman, Graillat, Stef, Aliaga, José, Performance et Qualité des Algorithmes Numériques (PEQUAN), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Fraunhofer Institute of Industrial Mathematics (Fraunhofer ITWM), Fraunhofer (Fraunhofer-Gesellschaft), Universitat Jaime I (UJI), ANR-20-CE46-0009,INTERFLOP,Plateforme d'analyse pour l'arithmétique flottante(2020), European Project: 842528,Robust, Iakymchuk, Roman, Plateforme d'analyse pour l'arithmétique flottante - - INTERFLOP2020 - ANR-20-CE46-0009 - AAPG2020 - VALID, Robust and Energy-Efficient Numerical Solvers Towards Reliable and Sustainable Scientific Computations - Robust - 842528 - INCOMING, Department of Computing Science [Umeå, Sweden], and Umeå University
Subjects: fused multiply-add, accuracy, [INFO.INFO-AO]Computer Science [cs]/Computer Arithmetic, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], [MATH.MATH-NA] Mathematics [math]/Numerical Analysis [math.NA], Reproducibility, floating-point expansion, High-Performance Computing, [INFO.INFO-MS] Computer Science [cs]/Mathematical Software [cs.MS], long accumulator, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-AO] Computer Science [cs]/Computer Arithmetic, preconditioned BiCGStab, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA], [INFO.INFO-MS]Computer Science [cs]/Mathematical Software [cs.MS]
Abstract: Parallel implementations of Krylov subspace algorithms often help to accelerate the procedure to find the solution of a linear system. However, from the other side, such parallelization coupled with asynchronous and out-of-order execution often enlarge the non-associativity of floating-point operations. This results in non-reproducibility on the same or different settings. This paper proposes a general framework for deriving reproducible and accurate variants of a Krylov subspace algorithm. The proposed algorithmic strategies are reinforced by programmability suggestions to assure deterministic and accurate executions. The framework is illustrated on the preconditioned BiCGStab method for the solution of non-symmetric linear systems in parallel environments with message-passing. Finally, we verify the two reproducible variants of PBiCGStab on a set matrices from the SuiteSparse Matrix Collection.
Published: 2021

26. Gradual Semantics for Weighted Bipolar SETAFs

Author: Bruno Yun, Srdjan Vesic, Department of Computing Science - University of Aberdeen (CSD), University of Aberdeen, Centre de Recherche en Informatique de Lens (CRIL), and Université d'Artois (UA)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Cognitive science, Semantics (computer science), Computer science, 06 humanities and the arts, 02 engineering and technology, Computational argumentation, 0603 philosophy, ethics and religion, 16. Peace & justice, Argumentation theory, Argument, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs], 060301 applied ethics
Abstract: International audience; Gradual semantics are now well-studied in the computational argumentation literature. In this paper, we argue that gradual semantics that can handle both bipolarity (e.g. attacks and supports) and sets of attacking arguments (i.e. several arguments together attacking an argument) might be useful in some contexts. We define the formal framework and properties for such semantics. We proceed by adapting, studying and implementing three well-known semantics from the bipolar gradual literature to this new framework.
Published: 2021
Full Text: View/download PDF

27. A brief review of vertebrate sex evolution with a pledge for integrative research: towards ‘ sexomics ’

Author: Yann Guiguen, Blanche Capel, Nicole Valenzuela, Qi Zhou, Michail Rovatsos, Manfred Schartl, Ben J. Evans, Matthias Stöck, Frédéric Veyrunes, Lukáš Kratochvíl, Tony Gamble, Alexander Suh, Heiner Kuhl, Institut des Sciences de l'Evolution de Montpellier (UMR ISEM), École pratique des hautes études (EPHE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université de Montpellier (UM)-Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Centre National de la Recherche Scientifique (CNRS)-Institut de recherche pour le développement [IRD] : UR226, Leibniz Institute of Freshwater Ecology and Inland Fisheries (IGB), Hiroshima University, Charles University [Prague] (CU), Department of Computing and Software (McMaster University), McMaster University [Hamilton, Ontario], University of East Anglia [Norwich] (UEA), Uppsala University, Iowa State University (ISU), Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-École Pratique des Hautes Études (EPHE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université de Montpellier (UM)-Institut de recherche pour le développement [IRD] : UR226-Centre National de la Recherche Scientifique (CNRS), Huzhou University [Zhejiang], University of Vienna [Vienna], Marquette University [Milwaukee], Duke University Medical Center, University of Würzburg, Texas State University, Laboratoire de Physiologie et Génomique des Poissons (LPGP), Structure Fédérative de Recherche en Biologie et Santé de Rennes ( Biosit : Biologie - Santé - Innovation Technologique )-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), M.St. and M.Sc. were in part supported by COFASP/ERANET (STURGEoNOMICS) by the German Federal Ministry of Food and Agriculture through the Federal Office for Agriculture and Food (grant nos. 2816ERA04G, and 2816ERA05G), M.Sc. was also funded by the German Research Foundation (DFG), grant nos. SCHA408/14-1 und 15-1, H.K. was funded by the German Research Foundation (DFG), grant no. KU 3596/1-1 (project no. 324050651), L.K. and M.R. were supported by the Czech Science Foundation (project no. 17-22604S), B.J.E. was supported by the Natural Sciences and Engineering Research Council of Canada (RGPIN-2017-05770), A.S. was supported by the Swedish Research Council Vetenskapsrådet (grant nos. 2016-05139547 and 2020-04436), N.V. was supported by a grant from the National Science Foundation (grant no. IOS-1555999), B.C. was supported by a grant from the National Science Foundation (grant no. IOS-1256675), Q.Z. is supported by a European Research Council Starting Grant (grant no. 677696)., and Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-École pratique des hautes études (EPHE)
Subjects: Male, 0106 biological sciences, 0301 basic medicine, Sex Differentiation, media_common.quotation_subject, sex determination, Genomics, Fertility, [SDV.BID]Life Sciences [q-bio]/Biodiversity, 010603 evolutionary biology, 01 natural sciences, Genome, General Biochemistry, Genetics and Molecular Biology, [SDV.BDLR.RS]Life Sciences [q-bio]/Reproductive Biology/Sexual reproduction, Evolution, Molecular, Evolutionsbiologi, reproduction, 03 medical and health sciences, Genome Size, biology.animal, [SDV.BBM.GTP]Life Sciences [q-bio]/Biochemistry, Molecular Biology/Genomics [q-bio.GN], Testis, evolution, genomics, Animals, Sex organ, Clade, Review Articles, [SDV.BDD.GAM]Life Sciences [q-bio]/Development Biology/Gametogenesis, media_common, Evolutionary Biology, Dosage compensation, Sexual differentiation, biology, sex chromosomes, Ovary, Vertebrate, Articles, Sex Determination Processes, Biological Evolution, 030104 developmental biology, Evolutionary biology, Female, General Agricultural and Biological Sciences, vertebrates
Abstract: Triggers and biological processes controlling male or female gonadal differentiation vary in vertebrates, with sex determination (SD) governed by environmental factors or simple to complex genetic mechanisms that evolved repeatedly and independently in various groups. Here, we review sex evolution across major clades of vertebrates with information on SD, sexual development and reproductive modes. We offer an up-to-date review of divergence times, species diversity, genomic resources, genome size, occurrence and nature of polyploids, SD systems, sex chromosomes, SD genes, dosage compensation and sex-biased gene expression. Advances in sequencing technologies now enable us to study the evolution of SD at broader evolutionary scales, and we now hope to pursue asexomicsintegrative research initiative across vertebrates. The vertebratesexomecomprises interdisciplinary and integrated information on sexual differentiation, development and reproduction at all biological levels, from genomes, transcriptomes and proteomes, to the organs involved in sexual and sex-specific processes, including gonads, secondary sex organs and those with transcriptional sex-bias. Thesexomealso includes ontogenetic and behavioural aspects of sexual differentiation, including malfunction and impairment of SD, sexual differentiation and fertility. Starting from data generated by high-throughput approaches, we encourage others to contribute expertise to building understanding of thesexomesof many key vertebrate species.This article is part of the theme issue ‘Challenging the paradigm in sex chromosome evolution: empirical and theoretical insights with a focus on vertebrates (Part I)’.
Published: 2021
Full Text: View/download PDF

28. Internal shortest absent word queries in constant time and linear space

Author: Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis, Goldsmiths, University of London (Goldsmiths College), University of London [London], Interdisciplinary Center Herzliya (IDC), Ural Federal University [Ekaterinburg] (UrFU), Centrum Wiskunde & Informatica (CWI), Vrije Universiteit Amsterdam [Amsterdam] (VU), Equipe de recherche européenne en algorithmique et biologie formelle et expérimentale (ERABLE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Department of Computing, Goldsmiths, University of London, The Interdisciplinary Center Herzliya, Israel, Bioinformatics, AIMMS, Bio Informatics (IBIVU), and Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands
Subjects: FOS: Computer and information sciences, String algorithms, CONSTANT TIME, General Computer Science, INTERNAL SHORTS, INTERNAL QUERY, Internal queries, TIME-SPACE, Theoretical Computer Science, PREPROCESS, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), [INFO]Computer Science [cs], Computer Science::Databases, Shortest absent word, SHORT ABSENT WORD, Bit parallelism, LINEAR SPACES, internal queries, string algorithms, SPACE DATA STRUCTURES, COMPUTATIONAL METHODS, bit parallelism, shortest absent word, SDG 4 - Quality Education
Abstract: Comment: 13 pages, 1 figure, 4 tables, Given a string $T$ of length $n$ over an alphabet $\Sigma\subset \{1,2,\ldots,n^{O(1)}\}$ of size $\sigma$, we are to preprocess $T$ so that given a range $[i,j]$, we can return a representation of a shortest string over $\Sigma$ that is absent in the fragment $T[i]\cdots T[j]$ of $T$. We present an $O(n)$-space data structure that answers such queries in constant time and can be constructed in $O(n\log_\sigma n)$ time.
Published: 2021
Full Text: View/download PDF

29. Unlocking the beamforming potential of LoRa for long-range multi-target respiration sensing

Author: Rong Zheng, Kai Niu, Zhaoxin Chang, Jie Xiong, Daqing Zhang, Junqi Ma, Fusang Zhang, Beihong Jin, University of Chinese Academy of Sciences [Beijing] (UCAS), State Key Laboratory of Computer Science [Beijing] (LCS), Institute of Software Chinese Academy of Sciences [Beijing], Institut Polytechnique de Paris (IP Paris), Département Réseaux et Services Multimédia Mobiles (RS2M), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Algorithmes, Composants, Modèles Et Services pour l'informatique répartie (ACMES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), College of Information and Computer Sciences [Amherst], University of Massachusetts [Amherst] (UMass Amherst), University of Massachusetts System (UMASS)-University of Massachusetts System (UMASS), Department of Computing and Software (McMaster University), McMaster University [Hamilton, Ontario], Beijing University of Posts and Telecommunications (BUPT), and Peking University [Beijing]
Subjects: Beamforming, Signal processing, Multi-target respiration sensing, Computer Networks and Communications, Computer science, Long range sensing, Transmitter, Real-time computing, 020206 networking & telecommunications, 020207 software engineering, 02 engineering and technology, Synchronization, Human-Computer Interaction, Hardware and Architecture, Channel state information, Default gateway, LoRa beamforming, Contactless sensing, 0202 electrical engineering, electronic engineering, information engineering, Key (cryptography), [INFO]Computer Science [cs], Communication channel
Abstract: International audience; Despite extensive research effort in contact-free sensing using RF signals in the last few years, there still exist significant barriers preventing their wide adoptions. One key issue is the inability to sense multiple targets due to the intrinsic nature of relying on reflection signals for sensing: the reflections from multiple targets get mixed at the receiver and it is extremely difficult to separate these signals to sense each individual. This problem becomes even more severe in long-range LoRa sensing because the sensing range is much larger compared to WiFi and acoustic based sensing. In this work, we address the challenging multi-target sensing issue, moving LoRa sensing one big step towards practical adoption. The key idea is to effectively utilize multiple antennas at the LoRa gateway to enable spatial beamforming to support multi-target sensing. While traditional beamforming methods adopted in WiFi and Radar systems rely on accurate channel information or transmitter-receiver synchronization, these requirements can not be satisfied in LoRa systems: the transmitter and receiver are not synchronized and no channel state information can be obtained from the cheap LoRa nodes. Another interesting observation is that while beamforming helps to increase signal strength, the phase/amplitude information which is critical for sensing can get corrupted during the beamforming process, eventually compromising the sensing capability. In this paper, we propose novel signal processing methods to address the issues above to enable long-range multi-target reparation sensing with LoRa. Extensive experiments show that our system can monitor the respiration rates of five human targets simultaneously at an average accuracy of 98.1%.
Published: 2021
Full Text: View/download PDF

30. Stoichiometric Ecotoxicology for a Multisubstance World

Author: Laure Pecquerie, James H. Larson, Kimberly L. Schulz, Chiara Accolla, David M. Costello, Yun Kang, Roxanne Karimi, Roger M. Nisbet, J. Thad Scott, Erica M. Rutter, Kevin B. Flores, Nathan Pollesch, Michael Danger, Paul C. Frost, Nicole D. Wagner, Bryan W. Brooks, Rebecca A. Everett, Louise M. Stevenson, Justin N. Murdock, Christopher M. Heggerud, Gregory D. Mayer, Hao Wang, Angela Peace, Teresa J. Mathews, Yang Kuang, Cheryl A. Murphy, Philipp Antczak, Department of Mathematics and Statistics [Texas Tech], Texas Tech University [Lubbock] (TTU), Trent University, Baylor University, Laboratoire Interdisciplinaire des Environnements Continentaux (LIEC), Institut Ecologie et Environnement (INEE), Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire Terre et Environnement de Lorraine (OTELo), Institut national des sciences de l'Univers (INSU - CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut national des sciences de l'Univers (INSU - CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), University of Minnesota [Twin Cities] (UMN), University of Minnesota System, Center for Molecular Medicine [Cologne] (CMMC), University of Cologne, Kent State University, Department of Mathematics and Statistics [Haverford], Haverford College, Center for Research in Scientific Computation [Raleigh] (CRSC), North Carolina State University [Raleigh] (NC State), University of North Carolina System (UNC)-University of North Carolina System (UNC), University of Alberta, School of Marine and Atmospheric Sciences [Stony Brook] (SoMAS), Stony Brook University [SUNY] (SBU), State University of New York (SUNY)-State University of New York (SUNY), Arizona State University [Tempe] (ASU), Environmental Sciences Division [Oak Ridge], Oak Ridge National Laboratory [Oak Ridge] (ORNL), UT-Battelle, LLC-UT-Battelle, LLC, Tennessee Tech University [Cookeville] (TTU), Michigan State University [East Lansing], Michigan State University System, Department of Ecology, Evolution and Marine Biology [Santa Barbara] (EEMB), University of California [Santa Barbara] (UCSB), University of California-University of California, Institut Français de Recherche pour l'Exploitation de la Mer - Brest (IFREMER Centre de Bretagne), Institut Français de Recherche pour l'Exploitation de la Mer (IFREMER), US Environmental Protection Agency (EPA), University of California [Merced], University of California, SUNY College of Environmental Science and Forestry (SUNY-ESF), State University of New York (SUNY), UT-Battelle, LLC, Department of Computing Science [Edmonton], Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Observatoire Terre et Environnement de Lorraine (OTELo), Institut national des sciences de l'Univers (INSU - CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut national des sciences de l'Univers (INSU - CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut national des sciences de l'Univers (INSU - CNRS), and Institut Français de Recherche pour l'Exploitation de la Mer - Brest (IFREMER)
Subjects: 0106 biological sciences, Chemistry, [SDE.MCG]Environmental Sciences/Global Changes, toxicity, [SDV.BID]Life Sciences [q-bio]/Biodiversity, 010501 environmental sciences, 010603 evolutionary biology, 01 natural sciences, multiple stressors, 13. Climate action, Environmental chemistry, [SDE]Environmental Sciences, Ecotoxicology, nutrient ratios, [SDE.BE]Environmental Sciences/Biodiversity and Ecology, elemental imbalances, General Agricultural and Biological Sciences, ComputingMilieux_MISCELLANEOUS, ecotoxicological models, 0105 earth and related environmental sciences
Abstract: Nutritional and contaminant stressors influence organismal physiology, trophic interactions, community structure, and ecosystem-level processes; however, the interactions between toxicity and elemental imbalance in food resources have been examined in only a few ecotoxicity studies. Integrating well-developed ecological theories that cross all levels of biological organization can enhance our understanding of ecotoxicology. In the present article, we underline the opportunity to couple concepts and approaches used in the theory of ecological stoichiometry (ES) to ask ecotoxicological questions and introduce stoichiometric ecotoxicology, a subfield in ecology that examines how contaminant stress, nutrient supply, and elemental constraints interact throughout all levels of biological organization. This conceptual framework unifying ecotoxicology with ES offers potential for both empirical and theoretical studies to deepen our mechanistic understanding of the adverse outcomes of chemicals across ecological scales and improve the predictive powers of ecotoxicology.
Published: 2021
Full Text: View/download PDF

31. Angular MIMO for Underwater Wireless Optical Communications: Link Modelling and Tracking

Author: Abdallah S. Ghazy, Mohammad-Ali Khalighi, Steve Hranilovic, Department of Computing and Software (McMaster University), McMaster University [Hamilton, Ontario], Institut FRESNEL (FRESNEL), Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU), and Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS)
Subjects: 010505 oceanography, business.industry, Computer science, Mechanical Engineering, Acoustics, MIMO, Transmitter, Detector, Ocean Engineering, 01 natural sciences, Background noise, Channel capacity, Angle of arrival, 0103 physical sciences, [SPI.OPTI]Engineering Sciences [physics]/Optics / Photonic, Wireless, Electrical and Electronic Engineering, business, 010301 acoustics, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, 0105 earth and related environmental sciences, Communication channel, Computer Science::Information Theory
Abstract: Angular imaging multiple-input--multiple-output (A-MIMO) is investigated for short-range, high-speed underwater wireless optical communications (UWOCs) where, unlike conventional imaging MIMO (C-MIMO), data are transmitted in an angle rather than in space. In this approach, the strict requirements of on-axis alignment and fixed channel length are relaxed. This technique also allows for simpler estimation of the relative misalignment between the transmitter and the receiver from the received image. For the first time, we derive a comprehensive model for the underwater A-MIMO link by taking into account link misalignment, background noise, as well as seawater absorption and scattering. Power distributions at the receiver are modeled by the angle of arrival of the received signal on the lens and its position of arrival on the focal plane of the detector. We further propose and model a tracked A-MIMO (TA-MIMO) system that maintains the alignment between the two ends of the link, for which the distribution of the residual tracking error is calculated. The UWOC channel capacity is then estimated for buoyed-to-fixed (B2F) (which has dominant angular misalignments) and mobile-to-fixed (M2F) (which has dominant off-axis misalignment) communication scenarios. Numerical results indicate that in the B2F scenario, A-MIMO is sensitive to angular misalignments; however, TA-MIMO outperforms C-MIMO. In the case of M2F links, A-MIMO greatly outperforms C-MIMO when off-axis misalignments are present. This work serves as a design guide to determine the selection of A-MIMO, TA-MIMO, or C-MIMO receivers depending on the misalignment conditions for a particular underwater application.
Published: 2021
Full Text: View/download PDF

32. Detection and Segmentation of Elements in Traffic: A Survey

Author: Zhu, Hang, Saha, Sujoy, Department of Computing Science, University of Alberta, University of Alberta, and University of Alberta,Canada
Subjects: Pedestrian Detection, Image segmentation, Image processing, Element Detection, [INFO]Computer Science [cs], Autonomous Driving, Image analysis
Abstract: As one of the important applications of computer vision, the study of object detection has been deeply explored by many researchers. Some of its sub-topics, for instance, face detection and pedestrian detection, have already been applied in real-world applications. These successful applications suggest the great potential of object detection methodology in assisting human activities. With the advance of technology, the need for automatic image analysis rises rapidly in many scenarios. More and more cases that require real-time image analysis emerges. To fulfill this demand, pipelines are created to be compatible with different devices. For instance, as the autonomous vehicle becomes popular, the carputer, which is the central control unit of all the vehicle components, is taking more responsibility for processing data from the sensors, thus results in a limitation on pipeline computational cost. In this survey, we reviewed some of the existing detection and/or segmentation projects and explored their feasibility of further adaptions.
Published: 2021

33. Video monitoring of in-channel wood: from flux characterization and prediction to recommendations to equip stations

Author: Hervé Piégay, Hossein Ghaffarian, Bruce MacVicar, Lise Vaudor, Kristell Michel, Aurélie Antonio, Zhi Zhang, Department of Computing and Information Sciences [Kansas] (CIS@K-STATE), Kansas State University, Environnement Ville Société (EVS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-École nationale supérieure d'architecture de Lyon (ENSAL)-École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École Nationale des Travaux Publics de l'État (ENTPE)-Université Jean Monnet [Saint-Étienne] (UJM)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université Lumière - Lyon 2 (UL2)-École normale supérieure - Lyon (ENS Lyon), Department of Civil and Environmental Engineering [Waterloo], University of Waterloo [Waterloo], Plateforme ISIG. 15, CNRS-UMR 5600, École normale supérieure - Lyon (ENS Lyon), Environnement, Ville, Société (EVS), École normale supérieure de Lyon (ENS de Lyon)-École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-École Nationale des Travaux Publics de l'État (ENTPE)-École nationale supérieure d'architecture de Lyon (ENSAL)-Centre National de la Recherche Scientifique (CNRS), UMR 5600 EVS, Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-École Nationale des Travaux Publics de l'État (ENTPE)-École nationale supérieure d'architecture de Lyon (ENSAL)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), and Ghaffarian, Hossein
Subjects: [SDE] Environmental Sciences, Hydrology, geography, geography.geographical_feature_category, Watershed, 010504 meteorology & atmospheric sciences, Flood myth, Geography, Planning and Development, Flow (psychology), 0207 environmental engineering, Drainage basin, Hydrograph, 02 engineering and technology, 01 natural sciences, Flux (metallurgy), Volume (thermodynamics), 13. Climate action, [SDE]Environmental Sciences, Earth and Planetary Sciences (miscellaneous), Environmental science, 020701 environmental engineering, Channel (geography), 0105 earth and related environmental sciences, Earth-Surface Processes
Abstract: Wood flux (piece number per time interval) is a key parameter for understanding wood budgeting, determining the controlling factors, and managing flood risk in a river basin. Quantitative wood flux data is critically needed to improve the understanding of wood dynamics and estimate wood discharge in rivers. In this study, the streamside videography technique was applied to detect wood passage and measure instantaneous rates of wood transport. The goal was to better understand how wood flux responds to flood and wind events and then predict wood flux. In total, one exceptional wind and 7 flood events were monitored on the Ain River, France, and around than 24000 wood pieces were detected visually. It is confirmed that, in general, there is a threshold of wood motion in the river equal to 60% of bankfull discharge. However, in a flood following a windy day, no obvious threshold for wood motion was observed, confirms that wind is important for the preparation of wood for transport between floods. In two multi-peaks floods, around two-thirds of the total amount of wood was delivered on the first peak, which confirms the importance of the time between floods for predicting wood fluxes. Moreover, we found an empirical relation between wood frequency and wood discharge, which is used to estimate the total wood amount produced by each of the floods. The data set is then used to develop a random forest regression model to predict wood frequency as a function of three input variables that are derived from the flow hydrograph. The model calculates the total wood volume either during day or night based on the video monitoring technique for the first time, which expands its utility for wood budgeting in a watershed. A one-to-one link is then established between the fraction of detected pieces of wood and the dimensionless parameter “passing time ×framerate”, which provides a general guideline for the design of monitoring stations.
Published: 2020

34. Application and Theory of Petri Nets and Concurrency - 41st International Conference, PETRI NETS 2020, Paris, France, June 24-25, 2020, Proceedings

Author: Janicki, Ryszard, Sidorova, Natalia, Chatain, Thomas, Department of Computing and Software (McMaster University), McMaster University [Hamilton, Ontario], Eindhoven University of Technology [Eindhoven] (TU/e), Laboratoire Spécification et Vérification (LSV), Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Centre National de la Recherche Scientifique (CNRS), Université Paris-Saclay, Modeling and Exploitation of Interaction and Concurrency (MEXICO), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Spécification et Vérification (LSV), and Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)
Subjects: [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], ComputingMilieux_MISCELLANEOUS
Abstract: International audience
Published: 2020
Full Text: View/download PDF

35. Human-agent Explainability: An Experimental Case Study on the Filtering of Explanations

Author: Amro Najjar, Christophe Nicolle, Yazan Mualla, Stéphane Galland, Igor Haman Tchappi, Timotheus Kampik, Connaissance et Intelligence Artificielle Distribuées [Dijon] (CIAD), Université de Technologie de Belfort-Montbeliard (UTBM)-Université de Bourgogne (UB), Département de Mathématiques et Informatique [Univ Ngaoundéré] (UN-FS), Faculté de Sciences [Univ Ngaoundéré] (UN-FS), Université de Ngaoundéré/University of Ngaoundéré [Cameroun] (UN)-Université de Ngaoundéré/University of Ngaoundéré [Cameroun] (UN), Computer Science and Communications Research Unit [Luxembourg] (CSC), Laboratory of Advanced Software SYstems [Luxembourg] (LASSY), Université du Luxembourg (Uni.lu)-Université du Luxembourg (Uni.lu), Department of Computing Science [Umeå, Sweden], Umeå University, and Université Bourgogne Franche-Comté [COMUE] (UBFC)
Subjects: Human-Computer Interaction, Explainable Artificial Intelligence, Human–computer interaction, Computer science, Intelligent Aerial Transport Systems, Human agent, Robot, State (computer science), Agent-Based Simulation, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract: International audience; 12th International Conference on Agents and Artificial Intelligence (ICAART 2020), Valletta, Malta, 1970.The communication between robots/agents and humans is a challenge, since humans are not typically capable of understanding the robot's state of mind. To overcome this challenge, this paper relies on the recent advances of the domain of eXplainable Artificial Intelligence (XAI) to trace the decisions of the agents and increase the human's understandability of the agents behaviour, and hence improve efficiency and user satisfaction. In particular, we propose a Human-Agent EXplainability Architecture (HAEXA) to model human-agent explainability. HAEXA filters the explanations provided by the agents to the human user to reduce the user's cognitive load. To evaluate HAEXA, a human-computer interaction experiment is conducted, where participants watch an agent-based simulation of aerial package delivery and fill in a questionnaire that collects their responses. The questionnaire is built according to XAI metrics as established in the literature. The significance of the results is verified using emph{One-tailed Mann-Whitney U} tests. The results show that explainability increases the understandability of the simulation by human users. However, too many details in the explanations overwhelms them; hence, in many scenarios it is preferable to filter the explanations.
Published: 2020
Full Text: View/download PDF

36. Key questions for next-generation biomonitoring

Author: Andreas Makiola, Zacchaeus G. Compson, Donald J. Baird, Matthew A. Barnes, Sam P. Boerlijst, Agnès Bouchez, Georgina Brennan, Alex Bush, Elsa Canard, Tristan Cordier, Simon Creer, R. Allen Curry, Patrice David, Alex J. Dumbrell, Dominique Gravel, Mehrdad Hajibabaei, Brian Hayden, Berry van der Hoorn, Philippe Jarne, J. Iwan Jones, Battle Karimi, Francois Keck, Martyn Kelly, Ineke E. Knot, Louie Krol, Francois Massol, Wendy A. Monk, John Murphy, Jan Pawlowski, Timothée Poisot, Teresita M. Porter, Kate C. Randall, Emma Ransome, Virginie Ravigné, Alan Raybould, Stephane Robin, Maarten Schrama, Bertrand Schatz, Alireza Tamaddoni-Nezhad, Krijn B. Trimbos, Corinne Vacher, Valentin Vasselon, Susie Wood, Guy Woodward, David A. Bohan, Agroécologie [Dijon], Université de Bourgogne (UB)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Environment and Climate Change Canada, University of New Brunswick (UNB), Texas Tech University [Lubbock] (TTU), Naturalis Biodiversity Center [Leiden], Leiden University, Centre Alpin de Recherche sur les Réseaux Trophiques et Ecosystèmes Limniques (CARRTEL), Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry])-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Bangor University, Institut de Génétique, Environnement et Protection des Plantes (IGEPP), Institut National de la Recherche Agronomique (INRA)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-AGROCAMPUS OUEST, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro), Biodiversité, Gènes & Communautés (BioGeCo), Institut National de la Recherche Agronomique (INRA)-Université de Bordeaux (UB), Molecular Ecology and Fisheries Genetics Laboratory, School of Biological Sciences, Centre d’Ecologie Fonctionnelle et Evolutive (CEFE), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-École pratique des hautes études (EPHE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre international d'études supérieures en sciences agronomiques (Montpellier SupAgro)-Institut National de la Recherche Agronomique (INRA)-Université Paul-Valéry - Montpellier 3 (UPVM)-Institut national d’études supérieures agronomiques de Montpellier (Montpellier SupAgro), Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut de Recherche pour le Développement (IRD [France-Sud]), Université de Sherbrooke (UdeS), Department of Integrative Biology & Biodiversity Institute of Ontario, University of Guelph, Simon Fraser University (SFU.ca), School of Biological and Chemical Sciences, Queen Mary University of London (QMUL), Bowburn Consultancy, Évolution, Écologie et Paléontologie (Evo-Eco-Paleo) - UMR 8198 (Evo-Eco-Paléo), Université de Lille-Centre National de la Recherche Scientifique (CNRS), Google Inc., Department of genetics and evolution, University of Geneva [Switzerland], Université de Montréal (UdeM), Plymouth Marine Laboratory (PML), PML, Peuplements végétaux et bioagresseurs en milieu tropical (UMR PVBMT), Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Institut de Recherche pour le Développement (IRD)-Université de La Réunion (UR)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Département Systèmes Biologiques (Cirad-BIOS), Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad), Syngenta, Institut National Agronomique Paris-Grignon (INA P-G), Department of Computing, Imperial College London, Bio-Protection Research Centre, Lincoln University, Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry])-Institut National de la Recherche Agronomique (INRA), Maladies infectieuses et vecteurs : écologie, génétique, évolution et contrôle (MIVEGEC), Institut de Recherche pour le Développement (IRD [France-Sud])-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Biodiversité, Gènes et Communautés, Institut National de la Recherche Agronomique (INRA), Université de Sherbrooke [Sherbrooke], Université Paul-Valéry - Montpellier 3 (UM3)-Institut National de la Recherche Agronomique (INRA)-Centre international d'études supérieures en sciences agronomiques (Montpellier SupAgro)-École pratique des hautes études (EPHE)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD [France-Sud])-Institut national d’études supérieures agronomiques de Montpellier (Montpellier SupAgro), Institut National de la Recherche Agronomique (INRA)-Université de Bourgogne (UB)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Université Bourgogne Franche-Comté [COMUE] (UBFC), Université de Montréal [Montréal], Institut National de la Recherche Agronomique (INRA)-Université de Bourgogne (UB)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement, Universiteit Leiden, Université de Rennes (UR)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-INSTITUT AGRO Agrocampus Ouest, Université de Bordeaux (UB)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Université Paul-Valéry - Montpellier 3 (UPVM)-École Pratique des Hautes Études (EPHE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD [France-Sud])-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Institut Agro - Montpellier SupAgro, Évolution, Écologie et Paléontologie (Evo-Eco-Paleo) - UMR 8198 (Evo-Eco-Paléo (EEP)), Université de Genève = University of Geneva (UNIGE), Natural Environment Research Council (NERC), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD [France-Sud]), Institut de Recherche pour le Développement (IRD [France-Sud])-Centre National de la Recherche Scientifique (CNRS)-École pratique des hautes études (EPHE)-Université de Montpellier (UM)-Institut national d’études supérieures agronomiques de Montpellier (Montpellier SupAgro)-Institut National de la Recherche Agronomique (INRA)-Centre international d'études supérieures en sciences agronomiques (Montpellier SupAgro)-Université Paul-Valéry - Montpellier 3 (UM3), INRAE UMR IGEPP RENNES FRA, Partenaires IRSTEA, and Institut national de recherche en sciences et technologies pour l'environnement et l'agriculture (IRSTEA)-Institut national de recherche en sciences et technologies pour l'environnement et l'agriculture (IRSTEA)
Subjects: 0106 biological sciences, Computer science, [SDV.SA.AGRO]Life Sciences [q-bio]/Agricultural sciences/Agronomy, DIVERSITY, 01 natural sciences, Field (computer science), TEXT, Biomonitoring, 0502 Environmental Science and Management, lcsh:Environmental sciences, ComputingMilieux_MISCELLANEOUS, General Environmental Science, lcsh:GE1-350, 0303 health sciences, Biodiversity assessment, Suite, SCIENCE, METRICS, artificial intelligence, NETWORKS, biodiversity assessment, PARADIGM, [SDE]Environmental Sciences, Évaluation des ressources, P01 - Conservation de la nature et ressources foncières, Biodiversité, Environmental risk management, Life Sciences & Biomedicine, Écosystème, INDEXES, Environmental Sciences & Ecology, 010603 evolutionary biology, Surveillance de l’environnement, 03 medical and health sciences, QH301, ecological networks, PLANT, QH426, 030304 developmental biology, Science & Technology, Frame (networking), [SDV.BBM.BM]Life Sciences [q-bio]/Biochemistry, Molecular Biology/Molecular biology, 15. Life on land, Data science, Ecological network, MICROBIOME, metabarcoding, Key (cryptography), eDNA, [SDE.BE]Environmental Sciences/Biodiversity and Ecology, ENVIRONMENTAL DNA, Environmental Sciences, [SDV.EE.IEO]Life Sciences [q-bio]/Ecology, environment/Symbiosis
Abstract: International audience; Classical biomonitoring techniques have focused primarily on measures linked to various biodiversity metrics and indicator species. Next-generation biomonitoring (NGB) describes a suite of tools and approaches that allow the examination of a broader spectrum of organizational levels-from genes to entire ecosystems. Here, we frame 10 key questions that we envisage will drive the field of NGB over the next decade. While not exhaustive, this list covers most of the key challenges facing NGB, and provides the basis of the next steps for research and implementation in this field. These questions have been grouped into current- and outlook-related categories, corresponding to the organization of this paper.
Published: 2020
Full Text: View/download PDF

37. Applications of Haptics in Medicine

Author: David Pinzon, Minh Tu Pham, Mahdi Tavakoli, Pierre Boulanger, Ali Torabi, Fei Liu, Richard Moreau, Arnaud Lelevé, Angel Ricardo Licona, Ampère, Département Méthodes pour l'Ingénierie des Systèmes (MIS), Ampère (AMPERE), École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), Department of Computing Science, University of Alberta, University of Alberta, and Troy McDaniel, Sethuraman Panchanathan
Subjects: 0209 industrial biotechnology, Medical staff, Computer science, InformationSystems_INFORMATIONINTERFACESANDPRESENTATION(e.g.,HCI), Kinesthetic learning, 02 engineering and technology, Haptics, Robotics, Surgical training, GeneralLiterature_MISCELLANEOUS, 3. Good health, [SPI.AUTO]Engineering Sciences [physics]/Automatic, 03 medical and health sciences, 020901 industrial engineering & automation, 0302 clinical medicine, Human–computer interaction, 030220 oncology & carcinogenesis, Surgical skills, Medicine, Haptic technology
Abstract: International audience; Touch is one of the most important sensory inputs during the performance of surgery. However, the literature on kinesthetic and tactile feedback both called haptics in surgical training remains rudimentary. This rudimentary knowledge is partial since that haptic feedback is difficult to describe, as well as record and playback. This chapter aims at focusing on the use of haptics in the training of medical staff and also as a complementary tool for robotized and remote procedures. It provides an overview of the various available technologies to perform haptic feedback and details on how haptic guidance can enhance surgical skill acquisition. A critical review of available haptic interfaces vis-a-vis medical interventions to be performed is provided. The chapter ends with an illustration merging the advantages of usual supervised hands-on training and the ones offered by computer-based training: dual-user training simulators.
Published: 2020
Full Text: View/download PDF

38. MODELS AND ALGORITHMS FOR EVACUATION PLANNING FOR WILDFIRES

Author: Artigues, Christian, Hébrard, Emmanuel, Quilliot, Alain, Stuckey, Peter, Toussaint, Hélène, Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes (LIMOS), Université Blaise Pascal - Clermont-Ferrand 2 (UBP)-Université d'Auvergne - Clermont-Ferrand I (UdA)-SIGMA Clermont (SIGMA Clermont)-Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS), Department of Computing and Information Systems, University of Melbourne, 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)-Université Clermont Auvergne [2017-2020] (UCA [2017-2020])-Centre National de la Recherche Scientifique (CNRS), ANR-19-P3IA-0004,ANITI,Artificial and Natural Intelligence Toulouse Institute(2019), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, SIGMA Clermont (SIGMA Clermont)-Université d'Auvergne - Clermont-Ferrand I (UdA)-Ecole Nationale Supérieure des Mines de St Etienne-Centre National de la Recherche Scientifique (CNRS)-Université Blaise Pascal - Clermont-Ferrand 2 (UBP), Ecole Nationale Supérieure des Mines de St Etienne-Université Clermont Auvergne [2017-2020] (UCA [2017-2020])-Centre National de la Recherche Scientifique (CNRS), Artigues, Christian, and Artificial and Natural Intelligence Toulouse Institute - - ANITI2019 - ANR-19-P3IA-0004 - P3IA - VALID
Subjects: [INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]
Abstract: International audience; During the period 2016-2019, the H2020 GEOSAFE European project [1] has gathered both practitioners and academic researchers from the E.U. and Australia with the overall objective of developing methods and tools enabling authorities to organize an effective response to wildfire. In such circumstances, decisions which have to be taken are about fighting the cause of the disaster, adapting standard logistics (food, drinkable water, health…) to the current state of infrastructures, assigning and routing resources, and evacuating endangered areas (see [2, 3]). We focus here on the last kind of the decisions, and more specifically on what is called the late evacuation problem, that means the evacuation of people and eventually critical goods which have stayed at a place endangered by wildfire as long as possible. While in practice evacuation planning is principally designed by experts, Operations Research and Computer Aided approaches have more recently addressed this problem [4]. In both cases, it is commonly admitted that planners work according to a 2-step process: the first step, which works as a pre-process, is a routing step devoted to the identification of the routes that evacuees are going to follow in order to go from their original location to an assigned shelter spot; the second step, which is a scheduling problem and has to be performed in real time in face of an evolving situation, is about the scheduling of the evacuation of estimated late evacuees along these predetermined routes, while taking into account predictions about the availability of these routes. As a matter of fact, efficiently performing this second step means first forecasting the different possible scenarios for wildfire propagation, and next deciding about priority rules and evacuation rates imposed to evacuees when their respective routes share a same arc of the transit network (see [2, 4, 5]). While the forecasting issue is not going to be addressed here, one should be aware of its importance and difficulty, specifically in the specific case of wildfire, because of the dependence of wildfire expansion on changing winds, fuel load and terrain contours. It has to be handled through statistical management techniques [2, 3]. We address here the evacuation issue through its two main combinatorial optimization features, which means both its scheduling and routing side.-The scheduling model which we use is close to the one proposed in [5] and called the non preemptive evacuation planning problem (NEPP). According to this model, estimated remaining evacuees have been previously clustered into groups, every group being characterized by its original location and its volume or population. For every such a group
Published: 2019

39. ECSNeT++ : A simulator for distributed stream processing on edge and cloud environments

Author: Aaron Harwood, Gayashan Amarasinghe, Shanika Karunasekera, Marcos Dias De Assuncao, Department of Computing and Information Systems, University of Melbourne, The University of MelbourneParkville, VIC, Australia., Algorithms and Software Architectures for Distributed and HPC Platforms (AVALON), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Laboratoire de l'Informatique du Parallélisme (LIP), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Lyon (ENS Lyon), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), École normale supérieure de Lyon (ENS de Lyon), and This work is partially funded by the Melbourne Research Scholarship of The University of Melbourne and the Elite PhD Scholars’ Programme of the University Grants Commission of Sri Lanka .
Subjects: Distributed Stream Processing, Ubiquitous computing, Computer Networks and Communications, business.industry, Computer science, Internet of Things, 020206 networking & telecommunications, Cloud computing, 02 engineering and technology, Stream processing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Hardware and Architecture, Software deployment, 0202 electrical engineering, electronic engineering, information engineering, Edge Computing, 020201 artificial intelligence & image processing, The Internet, business, Software, Simulation, Edge computing, ComputingMilieux_MISCELLANEOUS
Abstract: International audience; The objective of Internet of Things (IoT) is ubiquitous computing. As a result many computing enabled, connected devices are deployed in various environments, where these devices keep generating unbounded event streams related to the deployed environment. The common paradigm is to process these event streams at the cloud using the available Distributed Stream Processing (DSP) frameworks. However, with the emergence of Edge Computing, another convenient computing paradigm has been presented for executing such applications. Edge computing introduces the concept of using the underutilised potential of a large number of computing enabled connected devices such as IoT, located outside the cloud. In order to develop optimal strategies to utilise this vast number of potential resources, a realistic test bed is required. However, due to the overwhelming scale and heterogeneity of the edge computing device deployments, the amount of effort and investment required to set up such an environment is high. Therefore, a realistic simulation environment that can accurately predict the behaviour and performance of a large-scale, real deployment is extremely valuable. While the state-of-the-art simulation tools consider different aspects of executing applications on edge or cloud computing environments, we found that no simulator considers all the key characteristics to perform a realistic simulation of the execution of DSP applications on edge and cloud computing environments. To the best of our knowledge, the publicly available simulators lack being verified against real world experimental measurements, i.e. for calibration and to obtain accurate estimates of e.g. latency and power consumption. In this paper, we present our ECSNeT++ simulation toolkit which has been verified using real world experimental measurements for executing DSP applications on edge and cloud computing environments. ECSNeT++ models deployment and processing of DSP applications on edge-cloud environments and is built on top of OMNeT++/INET. By using multiple configurations of two real DSP applications, we show that ECSNeT++ is able to model a real deployment, with proper calibration. We believe that with the public availability of ECSNeT++ as an open source framework, and the verified accuracy of our results, ECSNeT++ can be used effectively for predicting the behaviour and performance of DSP applications running on large scale, heterogeneous edge and cloud computing device deployments.
Published: 2019
Full Text: View/download PDF

40. Imperfect Information in Alternating-Time Temporal Logic on Finite Traces

Author: Alessio Lomuscio, Francesco Belardinelli, Sasha Rubin, Aniello Murano, Informatique, BioInformatique, Systèmes Complexes (IBISC), Université d'Évry-Val-d'Essonne (UEVE), Department of Computing [Imperial College London], Imperial College London, Dipartimento di Ingegneria Elettrica e delle Tecnologie dell'Informazione [Napoli] (DIETI), Università degli studi di Napoli Federico II, ANR-16-CE40-0021,SVeDaS,Spécification et Vérification des Systèmes basés sur les Données(2016), Baldoni M.,Dastani M.,Liao B.,Sakurai Y.,Zalila Wenkstern R., Belardinelli, F., Lomuscio, A., Murano, A., Rubin, S., and University of Naples Federico II = Università degli studi di Napoli Federico II
Subjects: Model checking, Theoretical computer science, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Computer science, Carry (arithmetic), Perfect information, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 02 engineering and technology, Alternating-time Temporal Logic, Decidability, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Temporal logic, State (computer science), Observability
Abstract: We introduce a logic to reason about strategic abilities in finite games under imperfect information. We interpret Alternating-time Temporal Logic on interpreted systems with final states, where agents only have partial observability of the system’s global state. We consider the model checking problem in this setting. We prove that the complexity results available for the case of infinite traces carry over to the finite traces case. We show that when only public actions are allowed, the verification problem under perfect recall becomes decidable. © 2019, Springer Nature Switzerland AG.
Published: 2019
Full Text: View/download PDF

41. One for All and All for One: Scalable Consensus in a Hybrid Communication Model

Author: Jiannong Cao, Michel Raynal, the World Is Distributed Exploring the tension between scale and coordination (WIDE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Department of computing [Hong Kong], Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique)
Subjects: Consensus algorithm, Theoretical computer science, Computer science, Modularity, Context (language use), 0102 computer and information sciences, 02 engineering and technology, Binary consensus, Local coin, 01 natural sciences, Message-passing, 0202 electrical engineering, electronic engineering, information engineering, Atomic register, Asynchronous system, Cluster analysis, ComputingMilieux_MISCELLANEOUS, Message passing, Scalability, Hybrid communication, Process crash failure, Compare-and-swap, Shared memory, Compare and swap, 010201 computation theory & mathematics, Asynchronous communication, Cluster, Models of communication, 020201 artificial intelligence & image processing, Common coin, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract: This paper addresses consensus in an asynchronous model where the processes are partitioned into clusters. Inside each cluster, processes can communicate through a shared memory, which favors efficiency. Moreover, any pair of processes can also communicate through a message-passing communication system, which favors scalability. In such a "hybrid communication" context, the paper presents two simple binary consensus algorithms (one based on local coins, the other one based on a common coin). These algorithms are straightforward extensions of existing message-passing randomized round-based consensus algorithms. At each round, the processes of each cluster first agree on the same value (using an underlying shared memory consensus algorithm), and then use a message-passing algorithm to converge on the same decided value. The algorithms are such that, if all except one processes of a cluster crash, the surviving process acts as if all the processes of its cluster were alive (hence the motto "one for all and all for one"). As a consequence, the hybrid communication model allows us to obtain simple, efficient, and scalable fault-tolerant consensus algorithms. As an important side effect, according to the size of each cluster, consensus can be obtained even if a majority of processes crash.
Published: 2019
Full Text: View/download PDF

42. IMPROVING UNDERWATER ACCURACY BY EMPIRICAL WEIGHTING OF IMAGE OBSERVATIONS

Author: Fabio Remondino, Arnadi Murtiyoso, Erica Nocerino, Pierre Drap, Fabio Menna, Niclas Börlin, Pierre Grussenmeyer, 3D Optical Metrology unit [Trento, Italy] (3DOM), Fondazione Bruno Kessler [Trento, Italy] (FBK), Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), Institute for Theoretical Physics [ETH Zürich] (ITP), Department of Physics [ETH Zürich] (D-PHYS), Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology [Zürich] (ETH Zürich)- Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology [Zürich] (ETH Zürich), Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS), Department of Computing Science [Umeå, Sweden], Umeå University, Photogrammetry and Geomatics Group, univOAK, Archive ouverte, Remondino, Fabio, Toschi, I., Fuse, T., Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)-École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Réseau nanophotonique et optique, Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Matériaux et nanosciences d'Alsace (FMNGE), and Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)
Subjects: lcsh:Applied optics. Photonics, Computer science, Image quality, Beräkningsmatematik, Aucun, image observation weighting, Bundle adjustment, Port (circuit theory), 02 engineering and technology, lcsh:Technology, 01 natural sciences, law.invention, Entrance pupil, law, image quality, Computer vision, underwater photogrammetry, bundle adjustment, Sannolikhetsteori och statistik, 14. Life underwater, Underwater, Probability Theory and Statistics, lcsh:T, business.industry, 010401 analytical chemistry, lcsh:TA1501-1820, 021001 nanoscience & nanotechnology, Sciences de l'ingénieur [physics]/Génie civil, 0104 chemical sciences, Weighting, Lens (optics), Computational Mathematics, [SPI.GCIV]Engineering Sciences [physics]/Civil Engineering, lcsh:TA1-2040, Pinhole camera, [SPI.GCIV] Engineering Sciences [physics]/Civil Engineering, Artificial intelligence, lcsh:Engineering (General). Civil engineering (General), 0210 nano-technology, business
Abstract: An underwater imaging system with camera and lens behind a flat port does not behave as a standard pinhole camera with additional parameters. Indeed, whenever the entrance pupil of the lens is not in contact with the flat port, the standard photogrammetric model is not suited anymore and an extended mathematical model that considers the different media would be required. Therefore, when dealing with flat ports, the use of the classic photogrammetric formulation represents a simplification of the image formation phenomenon, clearly causing a degradation in accuracy. Furthermore, flat ports significantly change the characteristics of the enclosed imaging device and negatively affect the image quality, introducing heavy curvilinear distortions and optical aberrations. With the aim of mitigating the effect of systematic errors introduced by a combination of (i) image quality degradation, induced by the flat ports, and (ii) a non-rigorous modelling of refraction, this paper presents a stochastic model for image observations that penalises those that are more affected by aberrations and departure from the pinhole model. Experiments were carried out at sea and in pools showing that the use of the proposed stochastic model is beneficial for the final accuracy with improvements up to 50 %.
Published: 2019
Full Text: View/download PDF

43. Semidefinite programming hierarchies for quantum error correction

Author: Berta, Mario, Borderi, Francesco, Fawzi, Omar, Scholz, Volkher, Department of Computing [Imperial College London], Imperial College London, Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Modèles de calcul, Complexité, Combinatoire (MC2), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), ANR-18-CE47-0011,ACOM,Une Théorie Algorithmique de la Communcation(2018), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Fawzi, Omar, and APPEL À PROJETS GÉNÉRIQUE 2018 - Une Théorie Algorithmique de la Communcation - - ACOM2018 - ANR-18-CE47-0011 - AAPG2018 - VALID
Subjects: [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph]
Abstract: We give asymptotically converging semidefinite programming hierarchies of outer bounds on bilinear programs of the form $\mathrm{Tr}\big[M(X\otimes Y)\big]$, maximized with respect to semidefinite constraints on $X$ and $Y$. Applied to the problem of quantum error correction this gives hierarchies of efficiently computable outer bounds on the optimal fidelity for any message dimension and error model. The first level of our hierarchies corresponds to the non-signalling assisted fidelity previously studied by [Leung & Matthews, IEEE Trans.~Inf.~Theory 2015], and positive partial transpose constraints can be added and used to give a sufficient criterion for the exact convergence at a given level of the hierarchy. To quantify the worst case convergence speed of our hierarchies, we derive novel quantum de Finetti theorems that allow imposing linear constraints on the approximating state. In particular, we give finite de Finetti theorems for quantum channels, quantifying closeness to the convex hull of product channels as well as closeness to local operations and classical forward communication assisted channels. As a special case this constitutes a finite version of Fuchs-Schack-Scudo's asymptotic de Finetti theorem for quantum channels. Finally, our proof methods also allow us to answer an open question from [Brand\~ao & Harrow, STOC 2013] by improving the approximation factor of de Finetti theorems with no symmetry from $O(d^{k/2})$ to $\mathrm{poly}(d,k)$, where $d$ denotes local dimension and $k$ the number of copies.
Published: 2019

44. Hybrid Mechanisms for On-Demand Transport

Author: Michal Jakob, Malcolm Egan, Nir Oren, Modèle et algorithmes pour des systèmes de communication fiables (MARACAS), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), Faculty of Electrical Engineering [Prague] (FEL CTU), Czech Technical University in Prague (CTU), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria), Department of Computing Science - University of Aberdeen (CSD), University of Aberdeen, Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Grenoble - Rhône-Alpes, and Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Computer science, Taxis, Public transportation, Profit (economics), Revenue loss, Microeconomics, taxis, On demand, 0502 economics and business, Probability density function, pricing, Common value auction, [INFO]Computer Science [cs], Urban areas, on-demand transport, Routing, 050210 logistics & transportation, business.industry, Mechanical Engineering, Resource management, 05 social sciences, Subsidy, Vehicles, Computer Science Applications, Public transport, Automotive Engineering, business
Abstract: Market mechanisms are now playing a key role in the allocation and pricing of on-demand transportation services. In practice, most such services use posted-price mechanisms, where both passengers and drivers are offered a journey price which they can accept or reject. However, providers such as Liftago and GrabTaxi have begun to adopt a mechanism whereby auctions are used to price drivers. These latter mechanisms are neither posted-price nor classical double auctions and can instead be considered a hybrid mechanism. In this paper, we describe and study the properties of a novel hybrid on-demand transport mechanism. As these mechanisms require knowledge of passenger demand, we analyze the data-profit tradeoff as well as how the passenger and driver preferences influence mechanism performance. We show that the revenue loss for the provider scales with $\sqrt {n\log n}$ for $n$ passenger requests under a multi-armed bandit learning algorithm with beta-distributed preferences. We also investigate the effect of subsidies on both profit and the number of successful journeys allocated by the mechanism, comparing these with a posted-price mechanism, showing improvements in profit with a comparable number of successful requests.
Published: 2019
Full Text: View/download PDF

45. Logic-Based Program Synthesis and Transformation

Author: Mesnard, Frédéric, Stuckey, Peter, Laboratoire d'Informatique et de Mathématiques (LIM), Université de La Réunion (UR), Department of Computing and Information Systems, and University of Melbourne
Subjects: [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], ComputingMilieux_MISCELLANEOUS
Abstract: International audience
Published: 2019

46. Skeletal Semantics and their Interpretations

Author: Bodin, Martin, Gardner, Philippa, Jensen, Thomas, Schmitt, Alan, Department of Computing [Imperial College London], Imperial College London, Software certification with semantic analysis (CELTIQUE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), ANR-17-CE25-0014,CISC,Certification de compilation Sure pour l'IoT(2017), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Engineering & Physical Science Research Council (E, Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique)
Subjects: FOS: Computer and information sciences, Computer Science - Programming Languages, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], programming language, abstract interpretation, semantics, Programming Languages (cs.PL)
Abstract: The development of mechanised language specification based on structured operational semantics, with applications to verified compilers and sound program analysis, requires huge effort. General theory and frameworks have been proposed to help with this effort. However, none of this work provides a systematic way of developing concrete and abstract semantics, connected together by a general consistency result. We introduce a skeletal semantics of a language, where each skeleton describes the complete semantic behaviour of a language construct. We define a general notion of interpretation, which provides a systematic and language-independent way of deriving semantic judgements from the skeletal semantics. We explore four generic interpretations: a simple well-formedness interpretation; a concrete interpretation; an abstract interpretation; and a constraint generator for flow-sensitive analysis. We prove general consistency results between interpretations, depending only on simple language-dependent lemmas. We illustrate our ideas using a simple While language., Comment: 31 pages, POPL, article 44
Published: 2019
Full Text: View/download PDF

47. Unifying the framework of Multi-Layer Network and Visual Analytics

Author: Søren Knudsen, Jan Aerts, Daniel Archambault, Remco Chang, Jean-Daniel Fekete, Martin Grandjean, Jessie Kennedy, Mikko Kivelä, Matteo Magnani, Helen Purchase, Christian Tominski, Paola Valdivia, Tatiana von Landesberger, University of Calgary, University of Copenhagen = Københavns Universitet (KU), Hasselt University (UHasselt), Department of Computer Science [Swansea], Swansea University, Tufts University [Medford], Analysis and Visualization (AVIZ), Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Université de Lausanne (UNIL), Edinburgh Napier University, Aalto University School of Science and Technology [Aalto, Finland], Uppsala University, Department of Computing Science, University of Glasgow, Computer Science and Electrical Engineering, University of Rostock, Department of Computer Science, Technische Universität Darmstadt (TU Darmstadt), University of Copenhagen = Københavns Universitet (UCPH), Université de Lausanne = University of Lausanne (UNIL), and Technische Universität Darmstadt - Technical University of Darmstadt (TU Darmstadt)
Subjects: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [SHS.STAT]Humanities and Social Sciences/Methods and statistics, Information design, Data visualization, Social network analyses, graph theory, [SHS.INFO]Humanities and Social Sciences/Library and information sciences, Complex networks, Multi-layer networks, Complexity, Networks, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], Data visualisation
Abstract: International audience; The notion of multi-layer networks introduces a general framework and common vocabulary for existing ideas in complex network theory. In doing so, it is possible to understand and compare these dierent ideas in a new and more fruitful manner. However, to make this operationalizable to the visualization and visual analytics community, we need more clarity. For example: What is a layer? What are the semantics of interlayer edges, and specifically, identity links between layers? Can dierent multilayered networks be expressed or implemented in the same way? And vice versa, can one multilayered network be expressed or implemented in dierent ways?
Published: 2019

48. Strain-Enhanced Charge-to-Spin Conversion in Ta/Fe/Pt Multilayers Grown on Flexible Mica Substrate

Author: Liu, Er, Fache, T., Cespedes-Berrocal, D, Zhang, Zhi, Petit-Watelot, S., Mangin, Stéphane, Xu, Feng, Rojas-Sánchez, J.-C, Institut Jean Lamour (IJL), Université de Lorraine (UL)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS), Department of Computing and Information Sciences [Kansas] (CIS@K-STATE), Kansas State University, Universitat Politècnica de Catalunya [Barcelona] (UPC), Unité mixte de physique CNRS/Thales (UMPhy CNRS/THALES), THALES-Centre National de la Recherche Scientifique (CNRS), IMPACT N4S, and ANR-15-IDEX-0004,LUE,Isite LUE(2015)
Subjects: [PHYS.COND.CM-MS]Physics [physics]/Condensed Matter [cond-mat]/Materials Science [cond-mat.mtrl-sci]
Abstract: International audience; Recent demonstration of magnetization manipulation has been focused on the utilization of pure spin current converted by charge current in nonmagnetic materials with strong spin-orbit coupling (SOC), which stimulates intensive studies on the exploration of materials with larger SOC, such as heavy metals and topological insulators. We suggest an alternative approach for enhancing the effective charge-to-spin conversion efficiency by applying strain in Ta/Fe/Pt films grown on flexible mica substrates. We experimentally demonstrate a large and tunable charge-to-spin conversion efficiency in Ta/Fe/Pt films by applying compressive strain within a flexible substrate, and over 50% enhancement of effective spin Hall angle eff SHE of up to approximately 0.2 is achieved in a 6.26‰ strained film. Our findings may spur further work on the integration of flexible electronics and SOC and may potentially lead to the innovation of alternative flexible spintronics devices.
Published: 2019
Full Text: View/download PDF

49. Ecological networks reveal resilience of agro-ecosystems to changes in farming management

Author: Athen Ma, Xueke Lu, Guy Woodward, Clare Gray, Alireza Tamaddoni-Nezhad, Alan Raybould, David A. Bohan, Queen Mary University of London (QMUL), University of Warwick, School of Biological and Chemical Sciences [London], Imperial College London, Syngenta Crop Protection, University of Surrey (UNIS), Department of Computing, Agroécologie [Dijon], and Université de Bourgogne (UB)-Institut National de la Recherche Agronomique (INRA)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement
Subjects: 0106 biological sciences, Crops, Agricultural, Natural resource economics, Agriculture/methods, media_common.quotation_subject, [SDV]Life Sciences [q-bio], Biodiversity, 010603 evolutionary biology, 01 natural sciences, 03 medical and health sciences, Animals, [SDV.BV]Life Sciences [q-bio]/Vegetal Biology, Ecosystem, Agricultural productivity, Ecology, Evolution, Behavior and Systematics, ComputingMilieux_MISCELLANEOUS, 030304 developmental biology, media_common, 2. Zero hunger, Sustainable development, 0303 health sciences, Crops, Agricultural/classification, Ecology, business.industry, Agriculture, 15. Life on land, Invertebrates, United Kingdom, Ecological network, 13. Climate action, Sustainable management, [SDE]Environmental Sciences, Psychological resilience, Business
Abstract: Sustainable management of ecosystems and growth in agricultural productivity is at the heart of the United Nations' Sustainable Development Goals for 2030. New management regimes could revolutionize agricultural production, but require an evaluation of the risks and opportunities. Replacing existing conventional weed management with genetically modified, herbicide-tolerant (GMHT) crops, for example, might reduce herbicide applications and increase crop yields, but remains controversial owing to concerns about potential impacts on biodiversity. Until now, such new regimes have been assessed at the species or assemblage level, whereas higher-level ecological network effects remain largely unconsidered. Here, we conduct a large-scale network analysis of invertebrate communities across 502 UK farm sites to GMHT management in different crop types. We find that network-level properties were overwhelmingly shaped by crop type, whereas network structure and robustness were apparently unaltered by GMHT management. This suggests that taxon-specific effects reported previously did not escalate into higher-level systemic structural change in the wider agricultural ecosystem. Our study highlights current limitations of autecological assessments of effect in agriculture in which species interactions and potential compensatory effects are overlooked. We advocate adopting the more holistic system-level evaluations that we explore here, which complement existing assessments for meeting our future agricultural needs.
Published: 2019
Full Text: View/download PDF

50. Sufficient conditions for the marked graph realisability of labelled transition systems

Author: Harro Wimmel, Eike Best, Thomas Hujsa, and Department of Computing Science, Carl von Ossietzky Universität Oldenburg, D-26111 Oldenburg, Germany
Subjects: Discrete mathematics, Marked graph, Class (set theory), General Computer Science, Realisability, Realisation, Context (language use), 0102 computer and information sciences, 02 engineering and technology, Petri net, 01 natural sciences, Theoretical Computer Science, Combinatorics, Set (abstract data type), Synthesis, 010201 computation theory & mathematics, Petri Net, 0202 electrical engineering, electronic engineering, information engineering, Stochastic Petri net, 020201 artificial intelligence & image processing, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, Representation (mathematics), Labelled Transition System, Mathematics
Abstract: This paper describes two results within the context of Petri net synthesis from labelled transition systems. We consider a set of structural properties of transition systems, and we show that, given such properties, it is possible to re-engineer a Petri net realisation into one which lies inside the set of marked graphs, a well-understood and useful class of Petri nets. The first result originates from Petri net based workflow specifications, where it is desirable that k customers can share a system without mutual interferences. In a Petri net representation of a workflow, the presence of k customers can be modelled by an initial k-marking, in which the number of tokens on each place is a multiple of k. For any initial k-marking with k ≥ 2 , we show that other desirable assumptions such as reversibility and persistence suffice to guarantee marked graph realisability. For the case that k = 1 , we show that the existence of certain cycles, along with other properties such as reversibility and persistence, again suffices to guarantee marked graph realisability.
Published: 2018
Full Text: View/download PDF

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

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

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Publication Type

Database

271 results on '"Department of computing"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources