Search results for "D algorithm"
showing 10 items of 327 documents
Topology design to reduce energy consumption of distributed graph filtering in WSN
2017
The large number of nodes forming current sensor networks has made essential to introduce distributed mechanisms in many traditional applications. In the emerging field of graph signal processing, the distributed mechanism of information potentials constitutes a distributed graph filtering process that can be used to solve many different problems. An important limitation of this algorithm is that it is inherently iterative, which implies that the nodes incur in a repeated communication cost along the exchange periods of the filtering process. Since sensor nodes are battery powered and radio communications are one of the most energy demanding operations, in this work, we propose to redesign …
Towards adaptive localization in wireless sensor networks
2012
It is often useful or even indispensable to know the locations of the nodes in a wireless sensor network (WSN), from both network functionality and applications point of view. A potential yet one of the most challenging method is to utilize received signal strength indicator (RSSI) for distance estimation. Albeit easily adopted, using of RSSI is notorious for imprecise distance estimates which can lead to inaccuracies in location estimates. In this paper, we study RSSI-based localization in WSNs through simulation experiments. We evaluate and compare a hybrid algorithm and its modifications with well-known range-based and range-free localization algorithms. Simulation results indicate that …
Fitting linear models and generalized linear models with large data sets in R
2009
We present an estimating algorithm to fit linear and generalized linear models not involving the QR decomposition. Some new R functions are presented and discussed. For large data sets, comparisons with respect to the well-known lm() and glm(), as well as to biglm() and bigglm() from the package biglm, show that the proposed functions speed up computation while preserving numerical stability and accuracy
Integrated Production and Predictive Maintenance Planning based on Prognostic Information
2019
International audience; This paper address the problem of scheduling production and maintenance operation in predictive maintenance context. It proposes a contribution in the decision making phase of the prognostic and health management framework. Theprognostics and decision processes are merged and an ant colony optimization approach for finding the sequence of decisions that optimizes the benefits of a production system is developed. A case study on a single machine composed of several components where machine can have several usage profiles. The results show thatour approach surpasses classical condition based maintenance policy.
Reliable Coverage with Circumferential WMSNs
2021
This work tackles the closed peripheral coverage issue. Such circumferential surveillance is essential in numerous realistic applications where the goal is to ensure rapid detection of any unauthorized entry/exit of the monitored area. To respond to these requirements, peripheral WMSNs can be rapidly deployed around areas of interest (e.g., temporary military camps, natural or nuclear disasters, etc.). While it seems simple, this solution raises two major challenging issues. First, checking whether the deployed peripheral WMSN forms a closed shape around the monitored region. That is, any object trying to leave or access this area must be instantaneously detected by at least one multimedia …
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,…
A Study on scale factor in distributed differential evolution.
2011
This paper proposes the employment of multiple scale factor values within distributed differential evolution structures. Four different scale factor schemes are proposed, tested, compared and analyzed. Two schemes simply employ multiple scale factor values and two also include an update logic during the evolution. The four schemes have been integrated for comparison within three recently proposed distributed differential evolution structures and tested on several various test problems. Numerical results show that, on average, the employment of multiple scale factors is beneficial since in most cases it leads to significant improvements in performance with respect to standard distributed alg…
A Harris-based Region Detector on a Computational Grid
2007
This paper introduces a new Harris-based feature detector algorithm, characterized by no parameters tuning to detect region of interest. Preliminary results show that the proposed methodology returns good results with respect to standard detectors which need a set of parameters. An uncommon parallel implementation of the proposed algorithm is presented to support the high computational workload which is required to avoid the approximation of the results. Our parallel approach differs from the conventional one because an internal scheduler, based on the expected running time, is used to balance the data distribution on a client-server model. The aim of this paper is also to underline the adv…
A New Class of Searchable and Provably Highly Compressible String Transformations
2019
The Burrows-Wheeler Transform is a string transformation that plays a fundamental role for the design of self-indexing compressed data structures. Over the years, researchers have successfully extended this transformation outside the domains of strings. However, efforts to find non-trivial alternatives of the original, now 25 years old, Burrows-Wheeler string transformation have met limited success. In this paper we bring new lymph to this area by introducing a whole new family of transformations that have all the "myriad virtues" of the BWT: they can be computed and inverted in linear time, they produce provably highly compressible strings, and they support linear time pattern search direc…
A Simulation Software for the Evaluation of Vulnerabilities in Reputation Management Systems
2019
Multi-agent distributed systems are characterized by autonomous entities that interact with each other to provide, and/or request, different kinds of services. In several contexts, especially when a reward is offered according to the quality of service, individual agents (or coordinated groups) may act in a selfish way. To prevent such behaviours, distributed Reputation Management Systems (RMSs) provide every agent with the capability of computing the reputation of the others according to direct past interactions, as well as indirect opinions reported by their neighbourhood. This last point introduces a weakness on gossiped information that makes RMSs vulnerable to malicious agents’ intent …