Search results for " Computer Science"
showing 10 items of 3983 documents
Optimization of flat area coverage under connectivity constraint in wireless sensor networks
2022
A wireless sensor network consists of a set of small autonomous units that interact via a network built by their communication modules. They observe their environment, capture information, then manage this information according to their computing and/or storage capacity. To effectively accomplish their task(s), they need to cover as much of the area of interest as possible. It is therefore essential to quantify the quality of their coverage. In this thesis, we therefore seek to best cover an area of interest, with a precise number of sensors. While taking into account the possible overlaps between sensors, we first deploy in a zone of regular dimensions and evaluate the exact coverage using…
On the Robust Synthesis of Logical Consensus Algorithms for Distributed Intrusion Detection
2013
We introduce a novel consensus mechanism by which the agents of a network can reach an agreement on the value of a shared logical vector function depending on binary input events. Based on results on the convergence of finite--state iteration systems, we provide a technique to design logical consensus systems that minimize the number of messages to be exchanged and the number of steps before consensus is reached, and that can tolerate a bounded number of failed or malicious agents. We provide sufficient joint conditions on the input visibility and the communication topology for the method's applicability. We describe the application of our method to two distributed network intrusion detecti…
Computation of travelling wave solutions of scalar conservation laws with a stiff source term
2003
Abstract In this paper we propose a nonoscillatory numerical technique to compute the travelling wave solution of scalar conservation laws with a stiff source term. This procedure is based on the dynamical behavior described by the associated stationary ODE and it reduces/avoids numerical errors usually encountered with these problems, i.e., spurious oscillations and incorrect wave propagation speed. We combine this treatment with either the first order Lax–Friedrichs scheme or the second order Nessyahu–Tadmor scheme. We have tested several model problems by LeVeque and Yee for which the stiffness coefficient can be increased. We have also tested a problem with a nonlinear flux and a discon…
Flux-gradient and source-term balancing for certain high resolution shock-capturing schemes
2009
Abstract We present an extension of Marquina’s flux formula, as introduced in Fedkiw et al. [Fedkiw RP, Merriman B, Donat R, Osher S. The penultimate scheme for systems of conservation laws: finite difference ENO with Marquina’s flux splitting. In: Hafez M, editor. Progress in numerical solutions of partial differential equations, Arcachon, France; July 1998], for the shallow water system. We show that the use of two different Jacobians at cell interfaces prevents the scheme from satisfying the exact C -property [Bermudez A, Vazquez ME. Upwind methods for hyperbolic conservation laws with source terms. Comput Fluids 1994;23(8):1049–71] while the approximate C -property is satisfied for high…
Applications of Harten’s Framework for Multiresolution: From Conservation Laws to Image Compression
2002
We briefly review Harten’s framework for multiresolution decompositions and describe two situations in which two different instances of the general framework have been used with success.
Action and Deontology
2015
This chapter is concerned with the deontology of actions. According to the presented approach, actions and not propositions are deontologically loaded. Norms direct actions and define the circumstances in which actions are permitted, prohibited, or mandated. Norms are therefore viewed as deontological rules of conduct. The definitions of permission, prohibition, and obligatoriness of an action are formulated in terms of the relation of transition of an action system. A typology of atomic norms is presented. To each atomic norm a proposition is associated and called the normative proposition corresponding to this norm. A logical system, the basic deontic logic, is defined and an adequate sem…
Editorial message
2006
Geometric Computing and Reasoning (GCR) is a new track of SAC and it is dedicated to the recent trends in the domain of geometric constraint solving and automated, or computer aided, deduction in geometry.
A Learning-Automata Based Solution for Non-equal Partitioning: Partitions with Common GCD Sizes
2021
The Object Migration Automata (OMA) has been used as a powerful tool to resolve real-life partitioning problems in random Environments. The virgin OMA has also been enhanced by incorporating the latest strategies in Learning Automata (LA), namely the Pursuit and Transitivity phenomena. However, the single major handicap that it possesses is the fact that the number of objects in each partition must be equal. Obviously, one does not always encounter problems with equally-sized groups (When the true underlying problem has non-equally-sized groups, the OMA reports the best equally-sized solution as the recommended partition.). This paper is the pioneering attempt to relax this constraint. It p…
Argumentation graphs with constraint-based reasoning for collaborative expertise
2018
International audience; Collaborative processes are very important in telemedicine domain since they allow for making right decisions in complex situations with multidisciplinary staff. When modelling these collaborative processes, some inconsistencies can appear. In semantic modelling (conceptual graphs), these inconsistencies are verified using constraints. In this work, collaborative processes are represented using an argumentation system modelled in a conceptual graph formalism where inconsistencies could be particular bad attack relation between arguments. To overcome these inconsistencies, two solutions are proposed. The first one is to weight the arguments evolving in the argumentati…
Towards human cell simulation
2019
The faithful reproduction and accurate prediction of the phe-notypes and emergent behaviors of complex cellular systems are among the most challenging goals in Systems Biology. Although mathematical models that describe the interactions among all biochemical processes in a cell are theoretically feasible, their simulation is generally hard because of a variety of reasons. For instance, many quantitative data (e.g., kinetic rates) are usually not available, a problem that hinders the execution of simulation algorithms as long as some parameter estimation methods are used. Though, even with a candidate parameterization, the simulation of mechanistic models could be challenging due to the extr…