Author: "Department of computing" - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Department of computing"' showing total 4,693 results

Start Over Author "Department of computing"

4,693 results on '"Department of computing"'

1. Modelling and simulation in developmental genetics /

Author: Descheneau, Catherine, 1948-2016, University of Alberta. Department of Computing Science, University of Alberta Libraries (archive.org), Descheneau, Catherine, 1948-2016, and University of Alberta. Department of Computing Science
Subjects: Computer simulation, Data processing, Developmental genetics, Mathematical models
Published: 1981

2. A parallel simulator for multibody systems based on group equations

Author: Department of Computing and Systems, University of Murcia, Murcia, Spain, Department of Engineering and Technology of Computers, University of Murcia, Murcia, Spain, Ministerio de Economía y Competitividad, Cano, José Carlos, Cuenca, Javier, Saura Sánchez, Mariano, Giménez, Domingo, Segado Cabezos, Pablo, Department of Computing and Systems, University of Murcia, Murcia, Spain, Department of Engineering and Technology of Computers, University of Murcia, Murcia, Spain, Ministerio de Economía y Competitividad, Cano, José Carlos, Cuenca, Javier, Saura Sánchez, Mariano, Giménez, Domingo, and Segado Cabezos, Pablo
Abstract: Multibody systems consist of a set of components connected through some joints, where the movement of the system is determined by those of its components. Their design is computationally demanding, and the group equations formulation facilitates the application of parallelism to reduce the simulation time. A simulator for the kinematic analysis of multibody systems on up-to-date computational nodes (multicore CPU+GPU) is presented. The movement of the components is simulated by repeatedly solving independent linear systems working on sparse matrices. The appropriate selection of the linear algebra library to be used and the degree of parallelism at each level (explicit with OpenMP and implicit with multithread libraries) help obtain important reductions in the simulation time.
Published: 2019

3. High volume ergonomic simulation of chairs

Author: Department Of Computing, Imperial College London
Abstract: To understand what makes a chair comfortable or practical we need to test a large number of chairs, both good and bad. Due to the numbers involved we cannot achieve this with physical testing. Instead we use simpli ed ergonomic simulations. The sim- ulations presented here produce pressure maps within the range given the literature, along with several other measures of comfort and practicality. This was done sub- stantially faster than examples in the literature, permitting collection of thousands of results.
Published: 2016

4. Improving Individual Predictions using Social Networks Assortativity

Author: Telenor - Telenor Research, MIT Media Lab - Human Dynamics, Imperial College London - Data Science Institute and Department of Computing, UCL - SST/ICTM/ELEN - Pôle en ingénierie électrique, Mulders, Dounia, de Bodt, Cyril, Bjelland, Johannes, Pentland, Alex (Sandy), Verleysen, Michel, de Montjoye, Yves-Alexandre, 12th International Workshop on Self-Organizing Maps and Learning Vector Quantization, Clustering and Data Visualization (WSOM+), Telenor - Telenor Research, MIT Media Lab - Human Dynamics, Imperial College London - Data Science Institute and Department of Computing, UCL - SST/ICTM/ELEN - Pôle en ingénierie électrique, Mulders, Dounia, de Bodt, Cyril, Bjelland, Johannes, Pentland, Alex (Sandy), Verleysen, Michel, de Montjoye, Yves-Alexandre, and 12th International Workshop on Self-Organizing Maps and Learning Vector Quantization, Clustering and Data Visualization (WSOM+)
Abstract: Social networks are known to be assortative with respect to many attributes, such as age, weight, wealth, level of education, ethnicity and gender. This can be explained by influences and homophilies. Independently of its origin, this assortativity gives us information about each node given its neighbors. Assortativity can thus be used to improve individual predictions in a broad range of situations, when data are missing or inaccurate. This paper presents a general framework based on probabilistic graphical models to exploit social network structures for improving individual predictions of node attributes. Using this framework, we quantify the assortativity range leading to an accuracy gain in several situations. We finally show how specific characteristics of the network can improve performances further. For instance, the gender assortativity in real-world mobile phone data changes significantly according to some communication attributes. In this case, individual predictions with 75% accuracy are improved by up to 3%.
Published: 2017

5. Relationship-based access control: its expression and enforcement through hybrid logic

Author: Department Of Computing, Imperial College London
Abstract: Access control policy is typically de ned in terms of attributes, but in many applications it is more natural to de- ne permissions in terms of relationships that resources, systems, and contexts may enjoy. The paradigm of relationshipbased access control has been proposed to address this issue, and modal logic has been used as a technical foundation. We argue here that hybrid logic { a natural and wellestablished extension of modal logic { addresses limitations in the ability of modal logic to express certain relationships. Also, hybrid logic has advantages in the ability to e ciently compute policy decisions relative to a relationship graph. We identify a fragment of hybrid logic to be used for expressing relationship-based access-control policies, show that this fragment supports important policy idioms, and study its expressiveness. We also capture the previously studied notion of relational policies in a static type system. Finally, we point out that use of our hybrid logic removes an exponential penalty in existing attempts of specifying complex relationships such as \at least three friends".
Published: 2011

6. Generating obstacle conditions for requirements completeness

Author: Imperial College London, UK - Department of Computing, UCL - SST/ICTM/INGI - Pôle en ingénierie informatique, Alrajeh, Dalal, Kramer, Jeff, van Lamsweerde, Axel, Russo, Alessandra, Uchitel, Sebastian, International Conference on Software Engineering, Imperial College London, UK - Department of Computing, UCL - SST/ICTM/INGI - Pôle en ingénierie informatique, Alrajeh, Dalal, Kramer, Jeff, van Lamsweerde, Axel, Russo, Alessandra, Uchitel, Sebastian, and International Conference on Software Engineering
Abstract: Missing requirements are known to be among the major causes of software failure. They often result from a natural inclination to conceive over-ideal systems where the software-to-be and its environment always behave as expected. Obstacle analysis is a goal-anchored form of risk analysis whereby exceptional conditions that may obstruct system goals are identified, assessed and resolved to produce complete requirements. Various techniques have been proposed for identifying obstacle conditions systematically. Among these, the formal ones have limited applicability or are costly to automate. This paper describes a tool-supported technique for generating a set of obstacle conditions guaranteed to be complete and consistent with respect to the known domain properties. The approach relies on a novel combination of model checking and learning technologies. Obstacles are iteratively learned from counterexample and witness traces produced by model checking against a goal and converted into positive and negative examples, respectively. A comparative evaluation is provided with respect to published results on the manual derivation of obstacles in a real safety-critical system for which failures have been reported.
Published: 2012

7. A qualitative approach to effort judgment for web service composition based SOA implementations

Author: Jeffery, Ross, Computer Science & Engineering, Faculty of Engineering, UNSW, O'Brien, Liam, CSIRO eResearch, Keung, Jacky, Department of Computing, The Hong Kong Polytechnic University, Li, Zheng, Computer Science & Engineering, Faculty of Engineering, UNSW, Jeffery, Ross, Computer Science & Engineering, Faculty of Engineering, UNSW, O'Brien, Liam, CSIRO eResearch, Keung, Jacky, Department of Computing, The Hong Kong Polytechnic University, and Li, Zheng, Computer Science & Engineering, Faculty of Engineering, UNSW
Abstract: Before developing any Service-Oriented Architecture (SOA) based software, effort estimation will be inevitably required for many purposes ranging from budget analysis to cost-benefit balance. Therefore, effort estimation plays a vital role in SOA implementations. Nevertheless, effort estimation for SOA implementation confronts many challenges due to both the complexity of SOA and the diversity of SOA projects. The current approaches based on traditional techniques are normally not adequate for estimating the effort of SOA implementations. Meanwhile, there is a lack of work on effort estimation for SOA implementation within the published literature. To decrease the complexity and difficulty of the problems of effort estimation before building SOA systems, this thesis concentrates on one particular type of SOA projects: service composition based SOA implementations. As enterprises move to having more and more services, and business applications increasingly rely on subscribing services, the major problem in SOA implementations will be service composition and may be less on development of new services. Moreover, it has been identified that the benefits of SOA cannot be fully realized until reaching the level of service composition. Therefore, it is worthwhile to narrow down our concerns from generic SOA implementations to service composition based SOA implementations that do not take into account service migration or new service development. Considering Web service is the de facto representation of service in practice, we can further focus on Web service composition (WSC) based SOA implementations.Considering the limitations to empirically implementing SOA projects by using various WSC approaches, learning by doing is nearly an impossible way to collect development data for quantitatively unfolding the research into effort estimation for WSC-based SOA implementations. Fortunately, learning by analogy is a feasible alternative to investigate dist
Published: 2011

8. Conic formulation for lp-norm optimization

Author: UCL - EUEN/CORE - Center for operations research and econometrics, McMaster University - Department of Computing and Software, Glineur, François, Terlaky, Tamas, UCL - EUEN/CORE - Center for operations research and econometrics, McMaster University - Department of Computing and Software, Glineur, François, and Terlaky, Tamas
Abstract: In this paper, we formulate the lp-norm optimization problem as a conic optimization problem, derive its duality properties (weak duality, zero duality gap, and primal attainment) using standard conic duality and show how it can be solved in polynomial time applying the framework of interior-point algorithms based on self-concordant barriers.
Published: 2004

9. 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.

10. 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.

11. 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

12. 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

13. ON DIGIT PATTERNS IN EXPANSIONS OF RATIONAL NUMBERS WITH PRIME DENOMINATOR

Author: Igor E. Shparlinski, Wolfgang Steiner, Department of computing (Department of computing), Macquarie University, Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), and Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Discrete mathematics, Rational number, Mathematics - Number Theory, General Mathematics, 010102 general mathematics, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], Numerical digit, Prime (order theory), 010201 computation theory & mathematics, FOS: Mathematics, Fraction (mathematics), Number Theory (math.NT), 0101 mathematics, Mathematics
Abstract: International audience; We show that, for any fixed $\varepsilon > 0$ and almost all primes $p$, the $g$-ary expansion of any fraction $m/p$ with $\gcd(m,p) = 1$ contains almost all $g$-ary strings of length $k < (5/24 - \varepsilon) \log_g p$. This complements a result of J. Bourgain, S. V. Konyagin, and I. E. Shparlinski that asserts that, for almost all primes, all $g$-ary strings of length $k < (41/504 -\varepsilon) \log_g p$ occur in the $g$-ary expansion of $m/p$.
Published: 2012
Full Text: View/download PDF

14. 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

15. (Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes

Author: Gabriel Bathie, Nicolas Bousquet, Yixin Cao, Yuping Ke, Théo Pierron, École normale supérieure de Lyon (ENS de Lyon), Graphes, AlgOrithmes et AppLications (GOAL), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Université Lumière - Lyon 2 (UL2)-É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)-Université Lumière - Lyon 2 (UL2)-É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), Department of Computing, Polytechnic University, Hong Kong, RGC grant 15201317, RGC grant 15226116, NSFC grant 61972330, and ANR-18-CE40-0032,GrR,Reconfiguration de Graphes(2018)
Subjects: General Computer Science, Applied Mathematics, kernelization, split graphs, (sub)linear kernels, graph editing, [INFO]Computer Science [cs], Computer Science Applications
Abstract: International audience; In a (parameterized) graph edge modification problem, we are given a graph G, an integer k and a (usually well-structured) class G of graphs, and asked whether it is possible to transform G into a graph G ′ ∈ G by adding and/or removing at most k edges. Parameterized graph edge modification problems received considerable attention in the last decades. In this paper, we focus on finding small kernels for edge modification problems. One of the most studied problems is the Cluster Editing problem, in which the goal is to partition the vertex set into a disjoint union of cliques. Even if a 2k-vertex kernel exists for Cluster Editing, this kernel does not reduce the size of the instance in most cases. Therefore, we explore the question of whether linear kernels are a theoretical limit in edge modification problems, in particular when the target graph class is very structured (such as a partition into cliques for instance). We prove, as far as we know, the first sublinear kernel for an edge modification problem. Namely, we show that Clique + Independent Set Deletion, which is a restriction of Cluster Deletion, admits a kernel of size O(k/ log k). We also obtain small kernels for several other edge modification problems. We first show that Cluster Deletion admits a 2k-vertex kernel as Cluster Editing, improving the previous 4kvertex kernel. We prove that (Pseudo-)Split Completion (and the equivalent (Pseudo-)Split Deletion) admits a linear kernel, improving the existing quadratic kernel. We also prove that Trivially Perfect Completion admits a quadratic kernel (improving the cubic kernel), and finally prove that its triangle-free version (Starforest Deletion) admits a linear kernel, which is optimal under the Exponential Time Hypothesis.
Published: 2022
Full Text: View/download PDF

16. Approximating Perfect Recall when Model Checking Strategic Abilities: Theory and Applications

Author: Francesco Belardinelli, Alessio Lomuscio, Vadim Malvone, Emily Yu, Informatique, BioInformatique, Systèmes Complexes (IBISC), Université d'Évry-Val-d'Essonne (UEVE)-Université Paris-Saclay, Department of Computing [Imperial College London], Imperial College London, 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), and Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris
Subjects: [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], Artificial Intelligence, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract: International audience; The model checking problem for multi-agent systems against specifications in the alternating-time temporal logic AT L, hence AT L∗ , under perfect recall and imperfect information is known to be undecidable. To tackle this problem, in this paper we investigate a notion of bounded recall under incomplete information. We present a novel three-valued semantics for AT L∗ in this setting and analyse the corresponding model checking problem. We show that the three-valued semantics here introduced is an approximation of the classic two-valued semantics, then give a sound, albeit partial, algorithm for model checking two-valued perfect recall via its approximation as three-valued bounded recall. Finally, we extend MCMAS, an open-source model checker for AT L and other agent specifications, to incorporate bounded recall; we illustrate its use and present experimental results.
Published: 2022
Full Text: View/download PDF

17. 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

18. 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

19. 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

20. 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

21. Robust Interval Observer for Systems Described by the Fornasini–Marchesini Second Model

Author: Thomas Chevet, Andreas Rauh, Thach Ngoc Dinh, Julien Marzat, Tarek Raissi, DTIS, ONERA, Université Paris Saclay [Palaiseau], ONERA-Université Paris-Saclay, Carl von Ossietzky Universität - Department of Computing Science, Carl Von Ossietzky Universität Oldenburg, CEDRIC. Traitement du signal et architectures électroniques (CEDRIC - LAETITIA), Centre d'études et de recherche en informatique et communications (CEDRIC), and Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)
Subjects: Fornasini-Marchesini second model, Two-dimensional systems, Control and Optimization, Control and Systems Engineering, Interval observer, Discrete-time systems, Robust observer, [SPI.AUTO]Engineering Sciences [physics]/Automatic
Abstract: International audience; This letter proposes a novel robust interval observer for a two-dimensional (treated as a synonym for a double-indexed system) linear time-invariant discrete-time system described by the Fornasini-Marchesini second model. This system is subject to unknown but bounded state disturbances and measurement noise. Built on recent interval estimation strategies designed for one-dimensional systems, the proposed observer is based on the introduction of weighting matrices which provide additional degrees of freedom in comparison with the classical structure relying on a change of coordinates. Linear matrix inequality conditions for the exponential stability and peak-to-peak performance of a two-dimensional system described by the Fornasini-Marchesini second model are then proposed, and applied to the design of a robust interval observer. Numerical simulation results are provided to show the efficiency of the proposed estimation strategy.
Published: 2022
Full Text: View/download PDF

22. 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

23. 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

24. Software Engineering for Self-Adaptive Systems: A Second Research Roadmap

Author: Gregor Engels, Kurt Geihs, Hausi A. Müller, Mauro Pezzè, Jeff Magee, Sam Malek, Ron Desmarais, Kenny Wong, Vincenzo Grassi, Bojan Cukic, Schahram Dustdar, Bradley Schmerl, Karl M. Göschka, Oscar Nierstrasz, Christian Prehofer, Dennis B. Smith, Raffaela Mirandola, Luciano Baresi, Jesper Andersson, Basil Becker, Thomas Vogel, Yuriy Brun, Richard D. Schlichting, João Pedro Sousa, Antónia Lopes, Norha M. Villegas, Marin Litoiu, Ladan Tahvildari, John Mylopoulos, Gabriel Tamura, Jeff Kramer, Gabor Karsai, Nelly Bencomo, Mary Shaw, Rogério de Lemos, Holger Giese, Alessandra Gorla, Serge Mankovskii, Jochen Wuttke, Paola Inverardi, Wilhelm Schäfer, Danny Weyns, University of Kent [Canterbury], University of Potsdam = Universität Potsdam, University of Victoria [Canada] (UVIC), Carnegie Mellon University [Pittsburgh] (CMU), Department of Clinical Neurology [Oxford], University of Oxford-FMRIB Centre- John Radcliffe Hospital [Oxford University Hospital], Politecnico di Milano [Milan] (POLIMI), Hasso Plattner Institute for Software Systems Engineering (HPI), Hasso Plattner Institute [Potsdam, Germany], Software architectures and distributed systems (ARLES), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), University of Washington [Seattle], West Virginia University [Morgantown], Vienna University of Technology (TU Wien), University of Paderborn, Universität Kassel [Kassel], Faculty of Informatics [Lugano], Università della Svizzera italiana = University of Italian Switzerland (USI), Dipartimento di Informatica [Italy] (DI), Università degli Studi dell'Aquila = University of L'Aquila (UNIVAQ), Vanderbilt University School of Engineering [Nashville] (VUSE), Department of Computing [London], Biomedical Image Analysis Group [London] (BioMedIA), Imperial College London-Imperial College London, Department of Informatics [Lisbon], Universidade de Lisboa = University of Lisbon (ULISBOA), George Mason University [Fairfax], CA Technologies [New York], Dipartimento di Elettronica e Informazione (DEI), Università degli Studi di Trento (UNITN), Software Composition Group [Bern] (SCG), Universität Bern [Bern] (UNIBE), Ludwig Maximilian University [Munich] (LMU), C-LAB [Paderborn], AT&T Bell Laboratories, Department of Computer Science [Fairfax] (Volgenau School of Engineering), Adaptive Distributed Applications and Middleware (ADAM), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Department of Electrical and Computer Engineering [Waterloo] (ECE), University of Waterloo [Waterloo], Université Robert Schuman - Strasbourg III, Catholic University of Leuven - Katholieke Universiteit Leuven (KU Leuven), Department of Computing Science [Edmonton], University of Alberta, Institute for Software Research (ISR), Department of Computer Science [York] (CS-YORK), University of York [York, UK], De Lemos, Rogério and Giese, Holger and Müller, Hausi and Shaw, Mary, University of Potsdam, University of Oxford [Oxford]- John Radcliffe Hospital [Oxford University Hospital]-FMRIB Centre, Technical University of Vienna [Vienna] (TU WIEN), Università della Svizzera italiana (USI), Università degli Studi dell'Aquila [L'Aquila] (UNIVAQ.IT), University of Lisbon, Universität Bern [Bern], Bell Laboratories, University of Victoria [Canada] ( UVIC ), Carnegie Mellon University [Pittsburgh] ( CMU ), Politecnico di Milano [Milan], Hasso Plattner Institute for Software Systems Engineering ( HPI ), Software architectures and distributed systems ( ARLES ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ), Technical University of Vienna [Vienna] ( TU WIEN ), Università della Svizzera italiana ( USI ), Dipartimento di Informatica [Italy] ( DI ), Università degli Studi dell'Aquila [L'Aquila] ( UNIVAQ.IT ), Vanderbilt University School of Engineering [Nashville] ( VUSE ), Biomedical Image Analysis Group [London] ( BioMedIA ), Dipartimento di Elettronica e Informazione ( DEI ), Università di Trento, Software Composition Group [Bern] ( SCG ), Ludwig Maximilian University [Munich] ( LMU ), Department of Computer Science [Fairfax] ( Volgenau School of Engineering ), Adaptive Distributed Applications and Middleware ( ADAM ), Laboratoire d'Informatique Fondamentale de Lille ( LIFL ), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique ( Inria ) -Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique ( CNRS ) -Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique ( Inria ) -Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique ( CNRS ) -Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique ( Inria ), Department of Electrical and Computer Engineering [Waterloo] ( ECE ), Katholieke Universiteit Leuven ( KU Leuven ), University of Alberta [Edmonton], Institute for Software Research ( ISR ), Department of Computer Science [York] ( CS-YORK ), De Lemos, Rogério and Giese, Holger and Müller, Hausi and Shaw, Mary, University of Oxford [Oxford]-FMRIB Centre- John Radcliffe Hospital [Oxford University Hospital], Università degli Studi dell'Aquila (UNIVAQ), and Universidade de Lisboa (ULISBOA)
Subjects: Sistemas adaptativos, Software Engineering Process Group, Automatización y sistemas de control, decentralization, Computer science, Computer programming, processes, Ingeniería, [ INFO.INFO-IU ] Computer Science [cs]/Ubiquitous Computing, self-adaptive software system, Computer Science (all), Theoretical Computer Science, 02 engineering and technology, Sistemas de software, Automation Command and control system, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, self-adaptive software system, software engineering, roadmap, 510 Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Software system, Software verification and validation, roadmap, 000 Computer science, knowledge & systems, Social software engineering, design spaces, business.industry, verification and validation, Software development, Information and Computer Science, 020207 software engineering, Systems development life cycle, System of systems engineering, 020201 artificial intelligence & image processing, Ingeniería de software, Software engineering, business, Settore ING-INF/05 - Sistemi di Elaborazione delle Informazioni, Software engineering for self-adaptive systems, Verification and validation, software engineering
Abstract: The goal of this roadmap paper is to summarize the state-of-the-art and identify research challenges when developing, deploying and managing self-adaptive software systems. Instead of dealing with a wide range of topics associated with the field, we focus on four essential topics of self-adaptation: design space for self-adaptive solutions, software engineering processes for self-adaptive systems, from centralized to decentralized control, and practical run-time verification & validation for self-adaptive systems. For each topic, we present an overview, suggest future directions, and focus on selected challenges. This paper complements and extends a previous roadmap on software engineering for self-adaptive systems published in 2009 covering a different set of topics, and reflecting in part on the previous paper. This roadmap is one of the many results of the Dagstuhl Seminar 10431 onSoftware Engineering for Self-Adaptive Systems,which took place in October 2010.
Published: 2013
Full Text: View/download PDF

25. Parameter Optimization for an Underwater Optical Wireless Vertical Link Subject to Link Misalignments

Author: Ikenna Chinazaekpere Ijeh, Steve Hranilovic, Mohammad-Ali Khalighi, Institut FRESNEL (FRESNEL), Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU), Department of Computing and Software (McMaster University), McMaster University [Hamilton, Ontario], and Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Computer science, business.industry, Mechanical Engineering, Attenuation, Monte Carlo method, Ocean Engineering, Vertical underwater links, Silicon photomultiplier, Link misalignment, Parameter optimization, Control theory, [SPI.OPTI]Engineering Sciences [physics]/Optics / Photonic, Optical wireless, Wireless, Sensitivity (control systems), Electrical and Electronic Engineering, Performance improvement, Adaptive optics, business, Underwater wireless optical communications, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Communication channel
Abstract: International audience; We consider transmitter-receiver (Tx-Rx) parameter optimization for a vertical underwater wireless optical communication link under misalignment conditions. The Tx is assumed to use a light-emitting diode while the Rx uses a silicon photomultiplier that allows a high Rx sensitivity. We consider two typical application scenarios and investigate optimization of the Tx and the Rx parameters to optimize the link performance in terms of outage probability. We derive accurate analytical expressions for the distribution of the channel attenuation accounting for link misalignments, which allows for the evaluation of the link performance in terms of bit-error-rate and outage probability without resorting to costly Monte Carlo simulations. Through numerical results, we show and discuss the impact of parameter optimization on the link performance in different link configurations and for various misalignment conditions. In particular, the presented results show the significant performance improvement resulting from optimizing the Tx beam divergence and the Rx FoV in the presence of pointing errors.
Published: 2021
Full Text: View/download PDF

26. 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

27. 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

28. The entropic boundary law in BF theory

Author: Daniel R. Terno, Etera R. Livine, 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), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), and Livine, Etera
Subjects: Physics, Nuclear and High Energy Physics, Quantum Physics, [PHYS.GRQC] Physics [physics]/General Relativity and Quantum Cosmology [gr-qc], 010308 nuclear & particles physics, Graph embedding, Voltage graph, FOS: Physical sciences, General Relativity and Quantum Cosmology (gr-qc), Topological graph, 01 natural sciences, Symmetry protected topological order, Topological entropy in physics, General Relativity and Quantum Cosmology, [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph], Quantum mechanics, 0103 physical sciences, Bipartite graph, [PHYS.GRQC]Physics [physics]/General Relativity and Quantum Cosmology [gr-qc], Topological graph theory, Quantum Physics (quant-ph), 010306 general physics, [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph], Topological quantum number, Mathematical physics
Abstract: We compute the entropy of a closed bounded region of space for pure 3d Riemannian gravity formulated as a topological BF theory for the gauge group SU(2) and show its holographic behavior. More precisely, we consider a fixed graph embedded in space and study the flat connection spin network state without and with particle-like topological defects. We regularize and compute exactly the entanglement for a bipartite splitting of the graph and show it scales at leading order with the number of vertices on the boundary (or equivalently with the number of loops crossing the boundary). More generally these results apply to BF theory with any compact gauge group in any space-time dimension., 17 pages
Published: 2008

29. Bulk Entropy in Loop Quantum Gravity

Author: Etera R. Livine, Daniel R. Terno, 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), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), and Livine, Etera
Subjects: Physics, Nuclear and High Energy Physics, [PHYS.GRQC] Physics [physics]/General Relativity and Quantum Cosmology [gr-qc], 010308 nuclear & particles physics, Immirzi parameter, Configuration entropy, FOS: Physical sciences, General Relativity and Quantum Cosmology (gr-qc), 01 natural sciences, General Relativity and Quantum Cosmology, Quantum relative entropy, Generalized relative entropy, Quantum mechanics, 0103 physical sciences, [PHYS.GRQC]Physics [physics]/General Relativity and Quantum Cosmology [gr-qc], 010306 general physics, Black hole thermodynamics, Entropy (arrow of time), Residual entropy, Joint quantum entropy
Abstract: In the framework of loop quantum gravity (LQG), having quantum black holes in mind, we generalize the previous boundary state counting (gr-qc/0508085) to a full bulk state counting. After a suitable gauge fixing we are able to compute the bulk entropy of a bounded region (the "black hole") with fixed boundary. This allows us to study the relationship between the entropy and the boundary area in details and we identify a holographic regime of LQG where the leading order of the entropy scales with the area. We show that in this regime we can fine tune the factor between entropy and area without changing the Immirzi parameter., Comment: 13 pages
Published: 2007
Full Text: View/download PDF

30. 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

31. 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

32. Quantum causal histories in the light of quantum information

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: High Energy Physics - Theory, Nuclear and High Energy Physics, Quantitative Biology::Tissues and Organs, FOS: Physical sciences, Quantum channel, General Relativity and Quantum Cosmology (gr-qc), Astrophysics, 01 natural sciences, General Relativity and Quantum Cosmology, Open quantum system, Quantum probability, Theoretical physics, [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph], 0103 physical sciences, Quantum operation, Quantum information, 010306 general physics, [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph], Physics, Consistent histories, Quantum discord, Quantum Physics, [PHYS.GRQC] Physics [physics]/General Relativity and Quantum Cosmology [gr-qc], [PHYS.HTHE]Physics [physics]/High Energy Physics - Theory [hep-th], 010308 nuclear & particles physics, Astrophysics (astro-ph), High Energy Physics - Theory (hep-th), Quantum process, [PHYS.GRQC]Physics [physics]/General Relativity and Quantum Cosmology [gr-qc], [PHYS.HTHE] Physics [physics]/High Energy Physics - Theory [hep-th], Quantum Physics (quant-ph)
Abstract: We use techniques of quantum information theory to analyze the quantum causal histories approach to quantum gravity. We show that while it is consistent to introduce closed timelike curves (CTCs), they cannot generically carry independent degrees of freedom. Moreover, if the effective dynamics of the chronology-respecting part of the system is linear, it should be completely decoupled from the CTCs. In the absence of a CTC not all causal structures admit the introduction of quantum mechanics. It is possible for those and only for those causal structures that can be represented as quantum computational networks. The dynamics of the subsystems should not be unitary or even completely positive. However, we show that other commonly maid assumptions ensure the complete positivity of the reduced dynamics., Comment: 9 pages, 8 eps figures
Published: 2006
Full Text: View/download PDF

33. 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

34. 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

35. 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

36. Under-Sea Ice Diffusing Optical Communications

Author: Abdallah S. Ghazy, Mohammad-Ali Khalighi, Haitham S. Khallaf, 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: geography, geography.geographical_feature_category, Underwater wireless optical communication, General Computer Science, 020209 energy, General Engineering, Optical communication, 02 engineering and technology, AUVs, TK1-9971, Oceanography, diffusing communication, 0202 electrical engineering, electronic engineering, information engineering, Sea ice, [SPI.OPTI]Engineering Sciences [physics]/Optics / Photonic, channel impulse response, 020201 artificial intelligence & image processing, General Materials Science, Electrical engineering. Electronics. Nuclear engineering, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Geology
Abstract: International audience; In this paper, we propose a novel approach to establish a reliable high-speed broadcast communication link between a group of autonomous underwater vehicles (AUVs) swarm under-sea ice. We utilize the fact that sea ice exists above the AUVs to diffuse the optical beam sent from AUV transmitter. We model this channel using a new seawater-sea ice cascaded layers (SSCL) model in which the vertical channel is divided into multiple layers based on their optical characteristics. The diffusing pattern of the SSCL model is computed using Monte Carlo numerical ray-tracing technique. We derive a quasi-analytic equation for the channel impulse response (CIR) which is valid for AUV receivers with different configurations, locations and orientations. The communication performance of underwater sea ice diffusing system is quantified via bit error rate performance, power penalty and and maximum achievable bit rate. Our results reveal that, for a snow-covered sea ice sheet with thickness of 36 cm and bare sea ice sheet with thickness 12 cm, the proposed system can achieve a broadcast communication rate of 100 Mbps with ranges up to 3.5 meters and 3 meters, respectively, with BER less than 10 −3 and average transmitted power of 100 mW. INDEX TERMS underwater wireless optical communication, diffusing communication, AUVs, channel impulse response.
Published: 2021
Full Text: View/download PDF

37. 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

38. Optimization of vaccination for COVID-19 in the midst of a pandemic

Author: Qi Luo, Ryan Weightman, Sean T. McQuade, Mateo Díaz, Emmanuel Trélat, William Barbour, Dan Work, Samitha Samaranayake, Benedetto Piccoli, Clemson University, Center for Computational and Integrative Biology [Camden] (CCIB), Rutgers University [Camden], Rutgers University System (Rutgers)-Rutgers University System (Rutgers), Department of Computing and Mathematical sciences, California Institute of Technology (CALTECH), Control And GEometry (CaGE ), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jacques-Louis Lions (LJLL (UMR_7598)), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Laboratoire Jacques-Louis Lions (LJLL (UMR_7598)), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Vanderbilt University [Nashville], Cornell University [New York], and The authors acknowledge the support of the NSF CMMI project # 2033580 'Managing pan-demic by managing mobility'. R.W., S.T.M. and B.P. acknowledge the support of the Joseph and Loretta Lopez Chair endowment.
Subjects: Statistics and Probability, SARS-CoV-2, Applied Mathematics, General Engineering, Populations and Evolution (q-bio.PE), COVID-19, 2020 Mathematics Subject Classiﬁcation. Primary: 58F15, 58F17, Secondary: 53C35, Computer Science Applications, Optimal control, SEIR compartmental models, Optimization and Control (math.OC), FOS: Biological sciences, FOS: Mathematics, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Quantitative Biology - Populations and Evolution, Vaccine, Mathematics - Optimization and Control
Abstract: During the Covid-19 pandemic a key role is played by vaccination to combat the virus. There are many possible policies for prioritizing vaccines, and different criteria for optimization: minimize death, time to herd immunity, functioning of the health system. Using an age-structured population compartmental finite-dimensional optimal control model, our results suggest that the eldest to youngest vaccination policy is optimal to minimize deaths. Our model includes the possible infection of vaccinated populations. We apply our model to real-life data from the US Census for New Jersey and Florida, which have a significantly different population structure. We also provide various estimates of the number of lives saved by optimizing the vaccine schedule and compared to no vaccination.
Published: 2022
Full Text: View/download PDF

39. 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

40. 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

41. Survey on nonlocal games and operator space theory

Author: Vidick, Thomas [Department of Computing and Mathematical Sciences, California Institute of Technology, Pasadena, California 91125 (United States)]
Published: 2016
Full Text: View/download PDF

42. 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

43. Communication Technologies Enabling Effective UAV Networks: A Standards Perspective

Author: Anna Maria Vegni, Valeria Loscri, Carlos T. Calafate, Pietro Manzoni, Department of Engineering, Università degli Studi Roma Tre = Roma Tre University (ROMA TRE), Self-organizing Future Ubiquitous Network (FUN), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Department of Computing Engineering, Universitat Politècnica de València (UPV), This work was partially supported by the 'Ministerio de Ciencia, Innovación y Universidades, Programa Estatal de Investigación, Desarrollo e Innovación Orientada a los Retos de la Sociedad, Proyectos I+D+I 2018', Spain, under Grant RTI2018-096384-B-I00., Vegni, A. M., Loscri, V., Calafate, C. T., Manzoni, P., and Roma Tre University
Subjects: ARQUITECTURA Y TECNOLOGIA DE COMPUTADORES, Computer Networks and Communications, Management of Technology and Innovation, 09.- Desarrollar infraestructuras resilientes, promover la industrialización inclusiva y sostenible, y fomentar la innovación, [SCCO.COMP]Cognitive science/Computer science, ComputerApplications_COMPUTERSINOTHERSYSTEMS, Safety, Risk, Reliability and Quality, Law
Abstract: [EN] Recent developments in the unmanned aerial vehicles (UAVs) field have made evident the need for a standardization process of the communication technologies supporting direct information exchange, thus enabling UAV-to-UAV networking. We consider this is necessary to achieve all sorts of cooperative tasks requiring real-time (or near-real-time) synchronization, including swarm formation and collision avoidance. In this article, we therefore argue in favor of introducing a new standard that would address this specific area, highlighting why current technologies are not adequate, what the different steps toward rapid standardization are, and which lessons have been learned from related fields, namely the vehicular and robotic environments, in the past few years., This work is derived from R&D project RTI2018-096384-B-I00 funded by MCIN/ AEI/10.13039/501100011033 and ERDF A way of making Europe.
Published: 2021
Full Text: View/download PDF

44. 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

45. 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

46. Quantum probabilities as Dempster-Shafer probabilities in the lattice of subspaces

Author: Vourdas, A. [Department of Computing, University of Bradford, Bradford BD7 1DP (United Kingdom)]
Published: 2014
Full Text: View/download PDF

47. 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

48. 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

49. Validity, reliability, and responsiveness of daily monitoring visual analog scales in MASK-air®

Author: Sousa‐Pinto, Bernardo, Eklund, Patrik, Pfaar, Oliver, Klimek, Ludger, Zuberbier, Torsten, Czarlewski, Wienczyslawa, Cardona Dahl, Victòria, Institut Català de la Salut, [Sousa-Pinto B] MEDCIDS – Department of Community Medicine, Information and Health Decision Sciences, Faculty of Medicine, University of Porto, Porto, Portugal. CINTESIS – Center for Health Technology and Services Research, University of Porto, Porto, Portugal. RISE – Health Research Network, University of Porto, Porto, Portugal. [Eklund P] Department of Computing Science, Umeå University, Umeå, Sweden. [Pfaar O] Department of Otorhinolaryngology, Head and Neck Surgery, Section of Rhinology and Allergy, University Hospital Marburg, Philipps Universität Marburg, Marburg, Germany. [Klimek L] Department of Otolaryngology, Head and Neck Surgery, Universitätsmedizin Mainz, Mainz, Germany. Center for Rhinology and Allergology, Wiesbaden, Germany. [Zuberbier T] Department of Dermatology and Allergy, Comprehensive Allergy Center, Charité Universitätsmedizin Berlin, Humboldt‐Universität zu Berlin, Berlin, Germany. [Czarlewski W] MASK‐air, Montpellier, France. Medical Consulting Czarlewski, Levallois, France. MACVIA‐France, Montpellier, France. [Cardona V] Secció d’Al•lèrgia, Servei de Medicina Interna, Vall d’Hebron Hospital Universitari, Barcelona, Spain. ARADyAL research network, Barcelona, Spain, and Vall d'Hebron Barcelona Hospital Campus
Subjects: Aplicacions mòbils, Diagnosis::Diagnostic Techniques and Procedures::Symptom Assessment [ANALYTICAL, DIAGNOSTIC AND THERAPEUTIC TECHNIQUES, AND EQUIPMENT], Assistència sanitària - Avaluació, Respiratory Tract Diseases::Nose Diseases::Rhinitis::Rhinitis, Allergic [DISEASES], diagnóstico::técnicas y procedimientos diagnósticos::evaluación de síntomas [TÉCNICAS Y EQUIPOS ANALÍTICOS, DIAGNÓSTICOS Y TERAPÉUTICOS], Rinitis - Tractament, enfermedades respiratorias::enfermedades nasales::rinitis::rinitis alérgica [ENFERMEDADES], Ciencias de la información::metodologías computacionales::soporte lógico (informática)::aplicaciones en aparatos electrónicos portátiles [CIENCIA DE LA INFORMACIÓN], Information Science::Computing Methodologies::Software::Mobile Applications [INFORMATION SCIENCE]
Abstract: Rinitis alérgica; Salud móvil; Escalas analógicas visuales Rinitis al·lèrgica; Salut mòbil; Escales analògiques visuals Allergic rhinitis; Mobile health Visual analog scales Background MASK-air® is an app that supports allergic rhinitis patients in disease control. Users register daily allergy symptoms and their impact on activities using visual analog scales (VASs). We aimed to assess the concurrent validity, reliability, and responsiveness of these daily VASs. Methods Daily monitoring VAS data were assessed in MASK-air® users with allergic rhinitis. Concurrent validity was assessed by correlating daily VAS values with those of the EuroQol-5 Dimensions (EQ-5D) VAS, the Control of Allergic Rhinitis and Asthma Test (CARAT) score, and the Work Productivity and Activity Impairment Allergic Specific (WPAI-AS) Questionnaire (work and activity impairment scores). Intra-rater reliability was assessed in users providing multiple daily VASs within the same day. Test–retest reliability was tested in clinically stable users, as defined by the EQ-5D VAS, CARAT, or “VAS Work” (i.e., VAS assessing the impact of allergy on work). Responsiveness was determined in users with two consecutive measurements of EQ-5D-VAS or “VAS Work” indicating clinical change. Results A total of 17,780 MASK-air® users, with 317,176 VAS days, were assessed. Concurrent validity was moderate–high (Spearman correlation coefficient range: 0.437–0.716). Intra-rater reliability intraclass correlation coefficients (ICCs) ranged between 0.870 (VAS assessing global allergy symptoms) and 0.937 (VAS assessing allergy symptoms on sleep). Test–retest reliability ICCs ranged between 0.604 and 0.878—“VAS Work” and “VAS asthma” presented the highest ICCs. Moderate/large responsiveness effect sizes were observed—the sleep VAS was associated with lower responsiveness, while the global allergy symptoms VAS demonstrated higher responsiveness. Conclusion In MASK-air®, daily monitoring VASs have high intra-rater reliability and moderate–high validity, reliability, and responsiveness, pointing to a reliable measure of symptom loads. The study was funded by ARIA. Open access funding enabled and organized by Projekt DEAL.
Published: 2021

50. 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

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

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

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Publication Type

Journal

Region

Database

Publisher

4,693 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