Search results for " distributed"

showing 10 items of 235 documents

Data offloading and task allocation for cloudlet-assisted ad hoc mobile clouds

2016

Nowadays, although the data processing capabilities of the modern mobile devices are developed in a fast speed, the resources are still limited in terms of processing capacity and battery lifetime. Some applications, in particular the computationally intensive ones, such as multimedia and gaming, often require more computational resources than a mobile device can afford. One way to address such a problem is that the mobile device can offload those tasks to the centralized cloud with data centers, the nearby cloudlet or ad hoc mobile cloud. In this paper, we propose a data offloading and task allocation scheme for a cloudlet-assisted ad hoc mobile cloud in which the master device (MD) who ha…

Computer Networks and CommunicationsComputer sciencemobile cloud computingDistributed computingMobile computingCloud computing02 engineering and technologyad hoc mobile cloudoffloading0202 electrical engineering electronic engineering information engineeringStackelberg competitionCloudletElectrical and Electronic Engineering020203 distributed computingbusiness.industrycloud computing020206 networking & telecommunicationsEnergy consumptionMobile ad hoc networkstackelberg gameMobile cloud computingTask (computing)businessMobile deviceInformation SystemsComputer networkcloudlet
researchProduct

DRESS: A Distributed RMS Evaluation Simulation Software

2020

Distributed environments consist of a huge number of entities that cooperate to achieve complex goals. When interactions occur between unknown parties, intelligent techniques for estimating agent reputations are required. Reputation management systems (RMS's) allow agents to perform such estimation in a cooperative way. In particular, distributed RMS's exploit feedbacks provided after each interaction and allow prediction of future behaviors of agents. Such systems, in contrast to centralized RMSs, are sensitive to fake information injected by malicious users; thus, predicting the performance of a distributed RMS is a very challenging task. Although many existing works have addressed some c…

Computer architectureComputer scienceAgent-based Simulation Multi-agent Systems Distributed RMSs020204 information systemsMulti-agent system0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingDecision Sciences (miscellaneous)02 engineering and technologycomputer.software_genrecomputerInformation SystemsSimulation softwareInternational Journal of Intelligent Information Technologies
researchProduct

Touch or touchless?:Evaluating usability of interactive displays for persons with autistic spectrum disorders

2019

Interactive public displays have been exploited and studied for engaging interaction in several previous studies. In this context, applications have been focused on supporting learning or entertainment activities, specifically designed for people with special needs. This includes, for example, those with Autism Spectrum Disorders (ASD). In this paper, we present a comparison study aimed at understanding the difference in terms of usability, effectiveness, and enjoyment perceived by users with ASD between two interaction modalities usually supported by interactive displays: touch-based and touchless gestural interaction. We present the outcomes of a within-subject setup involving 8 ASD users…

Computer scienceAutismInteractive displaysSpecial needsContext (language use)02 engineering and technologyInteractive displaystouchless interfaces mid-air gestures touch autism usability evaluation interactive displaysHuman–computer interaction0202 electrical engineering electronic engineering information engineeringmedicine0501 psychology and cognitive sciencesUsability evaluation050107 human factorsSettore ING-INF/05 - Sistemi Di Elaborazione Delle Informazioni020203 distributed computingModalitiesModality (human–computer interaction)Settore INF/01 - Informaticabusiness.industry05 social sciencesUsabilitymedicine.diseaseMid-air gesturesTouchTouchless interfacesAutismUser interfacebusiness
researchProduct

The Holonic Production System: a Multi Agent Simulation Approach

2010

Today’s turbulent markets are facing unpredictable and sudden variations in demand. In this context, the Holonic Production System (HPS) seems to be able to overcome the operational and economic problems of traditional production systems. The HPS’ ability to adapt and react to business environment changes, whilst maintaining systemic synergies and coordination, leverage on its network organizational structure, assuring both flexibility and profitability. In this paper we study HPS experimentally, modeling holon-firms as agents. In our simulation, holon-firms interact both with each other and with the external environment without predetermined hierarchies and following their own aims and int…

Computer scienceMulti-agent systemmedia_common.quotation_subjectControl reconfigurationDecision ruleAdaptabilitySupply and demandHolonic Production System (HPS) Multi Agent System (MAS) Distributed Enterprise NetworkNegotiationRisk analysis (engineering)Organizational structureProfitability indexSettore SECS-P/08 - Economia E Gestione Delle ImpreseSimulationmedia_common
researchProduct

Performance analysis of selfish access strategies on WiFi infrastructure networks

2009

In this paper we propose a game-theoretic approach for characterizing WiFi network performance in presence of intelligent nodes employing cognitive functionalities. We assume that a cognitive WiFi node is aware of its application requirements and is able to dynamically estimate the network status, in order to dynamically change its access strategy by tuning the contention window settings. We prove that, for infrastructure networks with bidirectional traffic and homogeneous application requirements, selfish access strategies are able to reach equilibrium conditions, which are also Pareto optimal. Indeed, we show that the station strategies converge toward values which maximize a per-node uti…

Computer sciencebusiness.industryBidirectional trafficSettore ING-INF/03 - Telecomunicazionimedia_common.quotation_subjectDistributed computingNode (networking)Physical layerThroughputGame theory distributed wifi networksGame theory; distributed; wifi networksSettore ING-INF/04 - AutomaticaWireless lanTelecommunications linkdistributedFunction (engineering)businessGame theoryGame theorywifi networksmedia_commonComputer network
researchProduct

The Stability-Plasticity Dilemma: Investigating the Continuum from Catastrophic Forgetting to Age-Limited Learning Effects

2013

The stability-plasticity dilemma is a well-know constraint for artificial and biological neural systems. The basic idea is that learning in a parallel and distributed system requires plasticity for the integration of new knowledge, but also stability in order to prevent the forgetting of previous knowledge. Too much plasticity will result in previously encoded data being constantly forgotten, whereas too much stability will impede the efficient coding of this data at the level of the synapses. However, for the most part, neural computation has addressed the problems related to excessive plasticity or excessive stability as two different fields in the literature.

Computer sciencelcsh:BF1-990Catastrophic Forgetting02 engineering and technologyPlasticity050105 experimental psychologyPsycholinguisticsLearning effectModels of neural computationConnectionismneural computation0202 electrical engineering electronic engineering information engineeringPsychology0501 psychology and cognitive sciencesGeneral PsychologyComputingMilieux_MISCELLANEOUSCognitive scienceForgettingPsycholinguisticsParallel Distributed Processingbusiness.industryAge of Acquisition05 social sciencesOpinion ArticleDilemmalcsh:Psychology[ SDV.NEU ] Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC]020201 artificial intelligence & image processing[SDV.NEU]Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC]Artificial intelligencebusinessCoding (social sciences)Frontiers in Psychology
researchProduct

A Generic Approach to Scheduling and Checkpointing Workflows

2018

This work deals with scheduling and checkpointing strategies to execute scientific workflows on failure-prone large-scale platforms. To the best of our knowledge, this work is the first to target fail-stop errors for arbitrary workflows. Most previous work addresses soft errors, which corrupt the task being executed by a processor but do not cause the entire memory of that processor to be lost, contrarily to fail-stop errors. We revisit classical mapping heuristics such as HEFT and MinMin and complement them with several checkpointing strategies. The objective is to derive an efficient trade-off between checkpointing every task (CkptAll), which is an overkill when failures are rare events, …

Computer scienceworkflowDistributed computing02 engineering and technologyTheoretical Computer ScienceScheduling (computing)résiliencecheckpointfail-stop error0202 electrical engineering electronic engineering information engineeringRare eventsOverhead (computing)[INFO]Computer Science [cs]Resilience (network)resilienceComplement (set theory)020203 distributed computing020206 networking & telecommunications020202 computer hardware & architecture[INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF]Task (computing)WorkflowHardware and Architectureerreur fatale[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]HeuristicsSoftware
researchProduct

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…

Consensus algorithmTheoretical computer scienceComputer scienceDistributed computingVisibility (geometry)Binary numberValue (computer science)Topology (electrical circuits)Computer Science::Multiagent SystemsSettore ING-INF/04 - AutomaticaControl and Systems EngineeringConsensus distributed algorithms intrusion detection security.Bounded functionConvergence (routing)Electrical and Electronic EngineeringVector-valued function
researchProduct

Decentralized Coordination System for Multiple AGVs in a Structured Environment

2011

Abstract In this paper, we propose a decentralized coordination algorithm for safe and efficient management of a group of mobile robots following predefined paths in a dynamic industrial environment. The proposed algorithm is based on shared resources and proved to guarantee ordered traffic flows avoiding collisions and deadlocks. In consistency with the model of distributed robotic systems (DRS), no centralized mechanism, synchronized clock, shared memory or ground support is needed. A local inter-robot communication is required among a small number of spatially adjacent robotic units.

Coordination algorithms0209 industrial biotechnologyEngineeringbusiness.industryDistributed computingMobile robot0102 computer and information sciences02 engineering and technologyGround support01 natural sciencesComputer Science::RoboticsConsistency (database systems)020901 industrial engineering & automationRobotic systemsShared memorySettore ING-INF/04 - Automatica010201 computation theory & mathematicsCollision avoidance distributed control autonomous vehiclesbusiness
researchProduct

Analyzing big datasets of genomic sequences: fast and scalable collection of k-mer statistics

2019

Abstract Background Distributed approaches based on the MapReduce programming paradigm have started to be proposed in the Bioinformatics domain, due to the large amount of data produced by the next-generation sequencing techniques. However, the use of MapReduce and related Big Data technologies and frameworks (e.g., Apache Hadoop and Spark) does not necessarily produce satisfactory results, in terms of both efficiency and effectiveness. We discuss how the development of distributed and Big Data management technologies has affected the analysis of large datasets of biological sequences. Moreover, we show how the choice of different parameter configurations and the careful engineering of the …

Data AnalysisFOS: Computer and information sciencesTime FactorsTime FactorComputer scienceStatistics as TopicBig dataApache Spark; distributed computing; performance evaluation; k-mer countinglcsh:Computer applications to medicine. Medical informaticsBiochemistryDomain (software engineering)Databases03 medical and health sciences0302 clinical medicineStructural BiologyComputer clusterStatisticsSpark (mathematics)Molecular Biologylcsh:QH301-705.5030304 developmental biology0303 health sciencesGenomeSettore INF/01 - InformaticaBase SequenceNucleic AcidApache Sparkbusiness.industryResearchApache Spark; Distributed computing; k-mer counting; Performance evaluation; Algorithms; Base Sequence; Software; Time Factors; Data Analysis; Databases Nucleic Acid; Genome; Statistics as TopicApplied Mathematicsk-mer countingDistributed computingComputer Science ApplicationsAlgorithmData AnalysiComputer Science - Distributed Parallel and Cluster Computinglcsh:Biology (General)030220 oncology & carcinogenesisScalabilityPerformance evaluationlcsh:R858-859.7Algorithm designDistributed Parallel and Cluster Computing (cs.DC)Databases Nucleic AcidbusinessAlgorithmsSoftware
researchProduct