Search results for "Multiagent Systems"
showing 10 items of 104 documents
Deciding properties of integral relational automata
1994
This paper investigates automated model checking possibilities for CTL* formulae over infinite transition systems represented by relational automata (RA). The general model checking problem for CTL* formulae over RA is shown undecidable, the undecidability being observed already on the class of Restricted CTL formulae. The decidability result, however, is obtained for another substantial subset of the logic, called A-CTL*+, which includes all ”linear time” formulae.
Ontology-based multiagent systems using Inductive Recommendations - A new approach to qualify building use during the Design phase
2012
International audience; In this paper we propose a new metamodel to represent data for mutliagent-based simulations. Using this model, we also propose a method to perform the qualification of a building as soon as it is designed. The metamodel relies on semantic structures and allows representing both agents and environment. The representation of the environment use two kind of data: semantic and geometry. The qualification relies, for its part, on reasoning systems.
Stock markets and quantum dynamics: A second quantized description
2009
In this paper we continue our description of stock markets in terms of some non-abelian operators which are used to describe the portfolio of the various traders and other observable quantities. After a first prototype model with only two traders, we discuss a more realistic model of market involving an arbitrary number of traders. For both models we find approximated solutions for the time evolution of the portfolio of each trader. In particular, for the more realistic model, we use the stochastic limit approach and a fixed point like approximation. © 2007 Elsevier B.V. All rights reserved
On the collision property of chaotic iterations based post-treatments over cryptographic pseudorandom number generators
2018
International audience; There is not a proper mathematical definition of chaos, we have instead a quite big amount of definitions, each of one describes chaos in a more or less general context. Taking in account this, it is clear why it is hard to design an algorithm that produce random numbers, a kind of algorithm that could have plenty of concrete appliceautifat (anul)d bions. However we must use a finite state machine (e.g. a laptop) to produce such a sequence of random numbers, thus it is convenient, for obvious reasons, to redefine those aimed sequences as pseudorandom; also problems arise with floating point arithmetic if one wants to recover some real chaotic property (i.e. propertie…
Energy-Efficiency and Coverage Quality Management for Reliable Diagnostics in Wireless Sensor Networks
2020
International audience; The processing of data and signals provided by sensors aims at extracting rnrelevant features which can be used to assess and diagnose the health state rnof the monitored targets. Nevertheless, Wireless Sensor Networks (WSNs) present rna number of shortcomings that have an impact on the quality of the gathered rndata at the sink level, leading to imprecise diagnostics rnof the observed targets. To improve data accuracy, two main critical and related issues, namely the energy consumption and coverage quality, need to be considered. The goal is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. Unfortunately, these performance…
On Analytical vs . Schizophrenic Procedures for Computing Music
2009
The authors present a perspective on computer music, which is based on some particular definitions of music in relation to oral culture and cybernetics. They describe some experiments with different models of neural architectures which generate original music, and then suggest that if such neural systems are rich, effective and intuitive enough to produce ‘live’ music, the understanding of their behaviour may require the development of some ‘schizophrenic’ procedures, as well as analytical ones.
A Framework to Improve the Disaster Response Through a Knowledge-Based Multi-Agent System
2017
The disaster response still faces problems of collaboration due to lack of policies concerning the information exchange during the response. Moreover, plans are prepared to respond to a disaster, but drills to apply them are limited and do not allow to determine their efficiency and conflicts with other organizations. This paper presents a framework allowing for different organizations involving in the disaster response to assess their collaboration through its simulation using an explicit representation of their knowledge. This framework is based on a multi-agent system composed of three generic agent models to represent the organizational structure of disaster response. The decision-makin…
Checkpointing Workflows for Fail-Stop Errors
2017
International audience; We consider the problem of orchestrating the exe- cution of workflow applications structured as Directed Acyclic Graphs (DAGs) on parallel computing platforms that are subject to fail-stop failures. The objective is to minimize expected overall execution time, or makespan. A solution to this problem consists of a schedule of the workflow tasks on the available processors and of a decision of which application data to checkpoint to stable storage, so as to mitigate the impact of processor failures. For general DAGs this problem is hopelessly intractable. In fact, given a solution, computing its expected makespan is still a difficult problem. To address this challenge,…
Serial In-network Processing for Large Stationary Wireless Sensor Networks
2017
International audience; In wireless sensor networks, a serial processing algorithm browses nodes one by one and can perform different tasks such as: creating a schedule among nodes, querying or gathering data from nodes, supplying nodes with data, etc. Apart from the fact thatserial algorithms totally avoid collisions, numerous recent works have confirmed that these algorithms reduce communications andconsiderably save energy and time in large-dense networks. Yet, due to the path construction complexity, the proposed algorithmsare not optimal and their performances can be further enhanced. To do so, in the present paper, we propose a new serial processing algorithm that, in most of the case…
Chaotic multiagent system approach for MRF-based image segmentation
2005
In this paper, we propose a new chaotic approach for image segmentation based on multiagent system (MAS). We consider a set of segmentation agents organized around a coordinator agent. Each segmentation agent performs iterated conditional modes (ICM) starting from its own initial image created using a chaotic mapping. The coordinator agent diversifies the initial images using a crossover and a chaotic mutation operators. The efficiency of our chaotic MAS approach is shown through some experimental results.