In this paper, we validate and analyze the ability of an agent-based metaheuristic to facilitate the negotiation of consensus among distributed, networked agents. Our metaheuristic is based on the process honeybees us...
详细信息
ISBN:
(纸本)9781479925049
In this paper, we validate and analyze the ability of an agent-based metaheuristic to facilitate the negotiation of consensus among distributed, networked agents. Our metaheuristic is based on the process honeybees use to achieve consensus in selecting a new nest site. We show that our metaheuristic successfully guides systems to a consensus in a high percentage of cases and that the quorum size parameter controls the trade-off between optimality of choice versus time to consensus and failure rate. Despite agents having communication with only their local neighbors and the absence of centralized data aggregation, coordination, or mediation, our metaheuristic frequently results in the same consensus as that which would be returned by one or more well-known voting algorithms that require global knowledge and centralized tallying to generate a solution;when it does not, the returned consensus is usually an alternative similar in quality to the globally-informed option.
The use of short interfering RNA (siRNA) is an emerging powerful method for gene silencing. siRNA is a short RNA sequence that targets mRNA and causes the sequence-specific degradation of the mRNA. Despite its importa...
详细信息
ISBN:
(纸本)9781457702921
The use of short interfering RNA (siRNA) is an emerging powerful method for gene silencing. siRNA is a short RNA sequence that targets mRNA and causes the sequence-specific degradation of the mRNA. Despite its importance, few efforts have been made to develop algorithms and computational tools to detect genes controlled by siRNA process. This paper introduces an algorithm that uses an intelligent technique based on voting to determine whether a specific gene can be endogenously controlled by the cell using a siRNA sequence. When applying the proposed algorithm;the experimental results show that it requires relatively small memory space (not more than 70 MB) and in less than 3 minutes to determine whether a human gene can endogenously controlled. This makes the proposed algorithm practical to run into large genomes, specially the Human genome, and its specificity for only single gene increases its medical benefit as a tool for detecting treatments for specific diseases.
In this paper we study the global localization problem in SLAM: the determination of the vehicle location in a previously mapped environment with no other prior information. We show that, using a grid sampling represe...
详细信息
ISBN:
(纸本)0780389123
In this paper we study the global localization problem in SLAM: the determination of the vehicle location in a previously mapped environment with no other prior information. We show that, using a grid sampling representation of the configuration space, it is possible to evaluate all vehicle location hypotheses in the environment (up to a certain resolution) with a computational cost that is bilinear: linear both in the number of map features and in the number of sensor measurements. We propose a pairing-driven algorithm that considers only individual measurement-feature pairings and thus, in contrast with current correspondence space algorithms, it avoids searching in the exponential correspondence space. It uses a voting strategy that accumulates evidence for each vehicle location hypothesis, assuring robustness to noise in the sensor measurements and environment models. The general nature of the proposed strategy allows the consideration of different types of features and sensor measurements. Using the popular Victoria Park dataset, we compare its performance with location-driven algorithms where the solution space is usually randomly sampled. We show that the proposed pairing-driven technique is computationally more efficient in proportion to the density of features in the environment.
In many industrial applications arbitration between redundant subsystems using voting algorithms is popular. Many voting strategies, implemented in hardware or software, have been proposed of which majority and median...
详细信息
In many industrial applications arbitration between redundant subsystems using voting algorithms is popular. Many voting strategies, implemented in hardware or software, have been proposed of which majority and median voters have been widely used in real applications. Component-oriented design and modeling is receiving increasing amounts of interest in the software engineering community. Detailed analysis of voters shows that they can also be considered as a combination of independent components, each performing a specific function. This article proposes a component-oriented model for voters. The model offers benefits such as reusability, flexibility, and extensibility to the system designer. Components and their families are introduced, categorised and simulated. The model is simulated and a Library of simulated components is provided. The generality of the model not only supports the analysis of a large number of voter permutations but also facilitates system design and implementation phases. The article presents the experimental results of selected component-oriented voters including majority, median, and linear predictor voters within a Triple Modular Redundant, TMR, system for a wide range of error scenarios. The correctness of the voter model is also proved by comparing the experimental results of selected component-oriented voters with those of the corresponding directly implemented voters. (C) 2001 Elsevier Science B.V. All rights reserved.
Data replication is often used to increase the availability of data in a database system. voting schemes can be used to manage this replicated data. In this paper we use a simple model to study the capacity of systems...
详细信息
Data replication is often used to increase the availability of data in a database system. voting schemes can be used to manage this replicated data. In this paper we use a simple model to study the capacity of systems using voting schemes for data management. Capacity of a system is defined as the number of operations the system can perform successfully, on an average, per unit time. We study the capacity of a system using voting and compare it with the capacity of a system using a single node. We show that the maximum increase in capacity by the use of majority voting is bounded by 1/p, where p is the steady-state probability of a node being alive. We also show that for a system employing majority voting, if the reliability of nodes is high, increasing the number of nodes to more than three gives only a marginal increase in capacity. We perform similar analysis for three other voting schemes.
We present a stochastic Petri net model of a replicated file system in a distributed environment where replicated files reside on different hosts and a voting algorithm is used to maintain consistency. Witnesses, whic...
详细信息
We present a stochastic Petri net model of a replicated file system in a distributed environment where replicated files reside on different hosts and a voting algorithm is used to maintain consistency. Witnesses, which simply record the status of the file but contain no data, may be used in addition to or in place of files to reduce overhead. We present a model sufficiently detailed to include file status (current or out-of-date) as well as failure and repair of hosts where copies or witnesses reside. The number of copies and witnesses is not fixed, but is a parameter of the model. Two different majority protocols are examined, one where a majority of all copies and witnesses is necessary to form a quorum, the other where only a majority of the copies and witnesses or operational hosts is needed. The latter, known as adaptive voting, is shown to increase file availability in most cases. We also investigate the process of selection of copies and witnesses to participate in an update when more than the majority is available and show the inherent performance/reliability tradeoffs. [ABSTRACT FROM AUTHOR]
暂无评论