Search results for "Multia"

showing 10 items of 159 documents

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…

Risk analysis (engineering)010201 computation theory & mathematicsComputer science[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]020204 information systemsMulti-agent system0202 electrical engineering electronic engineering information engineering0102 computer and information sciences02 engineering and technology[INFO.INFO-MA] Computer Science [cs]/Multiagent Systems [cs.MA]Disaster response01 natural sciencesComputingMilieux_MISCELLANEOUS
researchProduct

Particle Characterization Using Multiple Scattering Decorrelation Methods. Part 1: Standard Latex Particles

1999

ScatteringChemistrybusiness.industryMultiangle light scatteringGeneral ChemistryCondensed Matter PhysicsLight scatteringOpticsAnalytical light scatteringParticleGeneral Materials ScienceStatic light scatteringBiological small-angle scatteringbusinessDecorrelationParticle & Particle Systems Characterization
researchProduct

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,…

ScheduleComputer scienceworkflowDistributed computing[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]010103 numerical & computational mathematics02 engineering and technologyParallel computing[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]01 natural sciencesTheoretical Computer Science[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]checkpointfail-stop error0202 electrical engineering electronic engineering information engineeringOverhead (computing)[INFO]Computer Science [cs]0101 mathematicsresilienceClass (computer programming)020203 distributed computingJob shop schedulingProbabilistic logic020206 networking & telecommunications[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationDynamic programmingTask (computing)[INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF]WorkflowComputational Theory and MathematicsHardware and Architecture[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Task analysis[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Software
researchProduct

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…

ScheduleVisual sensor networkbusiness.industryComputer science020206 networking & telecommunications02 engineering and technology[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE][INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation020202 computer hardware & architectureSerial memory processing[INFO.INFO-IU]Computer Science [cs]/Ubiquitous ComputingKey distribution in wireless sensor networks[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR][INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Sensor nodeScalability0202 electrical engineering electronic engineering information engineeringMobile wireless sensor network[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]businessWireless sensor networkComputer network
researchProduct

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.

Segmentation-based object categorizationbusiness.industryComputer scienceMulti-agent systemCrossoverComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONChaoticScale-space segmentationImage segmentationComputingMethodologies_ARTIFICIALINTELLIGENCENonlinear Sciences::Chaotic DynamicsComputer Science::Multiagent SystemsComputerSystemsOrganization_MISCELLANEOUSComputer Science::Computer Vision and Pattern RecognitionIterated conditional modesSegmentationComputer visionArtificial intelligencebusinessISPA 2005. Proceedings of the 4th International Symposium on Image and Signal Processing and Analysis, 2005.
researchProduct

PROLISEAN: A New Security Protocol for Programmable Matter

2021

The vision for programmable matter is to create a material that can be reprogrammed to have different shapes and to change its physical properties on demand. They are autonomous systems composed of a huge number of independent connected elements called particles. The connections to one another form the overall shape of the system. These particles are capable of interacting with each other and take decisions based on their environment. Beyond sensing, processing, and communication capabilities, programmable matter includes actuation and motion capabilities. It could be deployed in different domains and will constitute an intelligent component of the IoT. A lot of applications can derive fro…

Self-reconfiguring modular robot0209 industrial biotechnologySecurity AlgorithmsComputer Networks and CommunicationsComputer scienceDistributed computingHash functionSecurity Protocol02 engineering and technology[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]EncryptionLightweight Cryptography[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]020901 industrial engineering & automationComponent (UML)0202 electrical engineering electronic engineering information engineeringModular RobotsProgrammable MatterProtocol (object-oriented programming)IOTbusiness.industry020206 networking & telecommunicationsCryptographic protocolSupercomputer[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationProgrammable matter[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA][INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]Amoebots[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]businessDistributed Computing
researchProduct

A note on validity in law and regulatory systems (position paper)

2012

This is position paper is located at the theoretical crossroads of several projects: CAPER, EU Grant Agreement 261712; CROWDSOURCING DER2012-39492-C02-0, SINTELNET FP7-ICT-2009-C-286380; CONSUMEDIA INNPACTO IPT-2011-1015-430000; CROWD-CRISSCONTROL IPT-2012-0968-390000. The notion of validity fulfils a crucial role in legal theory. The emerging Web 3.0 opens a new landscape where Semantic Web languages, legal ontologies, and the construction of Normative Multiagent Systems are built up to cover new regulatory needs. Conceptual models for complex regulatory systems shape the characteristic features of rules, norms and principles in different ways. This position paper outlines one of such mult…

Semantic Web (SW)HumanidadesComputingMilieux_LEGALASPECTSOFCOMPUTINGHª y Fª de la CienciaOntologiaFilosofía. EticaValidityLegal ontologiesNormative Multiagent Systems (nMAS)Regulatory systemsDret TeoriaCiencias básicas y experimentalesUNESCO::FILOSOFÍALegal theory:FILOSOFÍA [UNESCO]
researchProduct

UN'EFFICIENTE PROCEDURA DI CALCOLO PER L'ANALISI DI FATICA MULTIASSIALE MEDIANTE I CRITERI BASATI SULL'APPROCCIO DI PIANO CRITICO

2014

In multiaxial fatigue analysis using the critical plane approach, the shear stress amplitude has to be evaluate using proper numerical procedures that elaborate the points of the curve described by the tip of the shear stress vector acting in the analyzed plane. The calculation has to be carried out in several planes centred in the analyzed material plane; furthermore, in the analysis of a component, it has to be repeated in several points. In this paper a procedure that allows to noticeably reduce both the number of planes and the number of points in which it is necessary to evaluate by means of the onerous procedures, with a considerable reduction of the computational times.

Settore ING-IND/14 - Progettazione Meccanica E Costruzione Di Macchinefatica multiassiale cerchio circoscritto rettangolo circoscritto
researchProduct

UN NUOVO METODO PER LA DETERMINAZIONE DELL’AMPIEZZADELLA TENSIONE TANGENZIALE NEI CRITERI DI FATICA MULTIASSIALE BASATI SULL'APPROCCIO DI PIANO CRITI…

2013

Nel caso di sollecitazioni di fatica multiassiale di tipo non proporzionale il vettore della tensione tangenziale varia sia in modulo che in direzione e la sua punta descrive una curva definita percorso di carico. In questi casi l’ampiezza della tensione tangenziale alternata τ a viene valutata mediante apposite procedure, quali quella del Minimo CerchioCircoscritto e la più recente ed apparentemente più efficace, relativa al Massimo Rettangolo Circoscritto. Entrambe le procedure presentano tuttavia dei difetti che fanno ritenere che la definizione da cui si originano non sia del tutto corretta. In questo lavoro viene proposta una nuova definizione di tensione tangenziale alternata. Essa no…

Settore ING-IND/14 - Progettazione Meccanica E Costruzione Di Macchinefatica multiassiale tensione tangenziale alternata cerchio rettangolo circoscritto.
researchProduct

UN NUOVO ALGORITMO PER LA DETERMINAZIONE DELL’AMPIEZZA DELLA TENSIONE TANGENZIALE NEI CRITERI DI FATICA BASATI SUL PIANO CRITICO

2010

I criteri di fatica multiassiale ad alto numero di cicli basati sull’approccio di piano critico richiedono la determinazione dell’ampiezza delle tensioni tangenziali di fatica a agenti sui diversi piani passanti per il punto del materiale analizzato. Tipicamente la determinazione di a viene effettuata considerando il Minimo Cerchio Circoscritto alla curva descritta dalla punta del vettore  agente nel piano nel periodo di sollecitazione. In genere tale determinazione richiede un certo sforzo computazionale. In questo lavoro viene descritta una procedura numerica per la determinazione Minimo Cerchio Circoscritto ad una curva nota per punti caratterizzato da velocità di esecuzione superiore…

Settore ING-IND/14 - Progettazione Meccanica E Costruzione Di Macchinefatica multiassialetensione tangenziale alternatacerchio circoscritto
researchProduct