This paper presents a protocol for leader election in complete networks with a sense of direction. Sense of direction provides nodes the capability of distinguishing between their incident links according to a global scheme. We propose a protocol for leader election which requires O(N) messages and O(log N) time. The protocol is message optimal and the time complexity is a signiicant improvemen...

We resolve a conjecture proposed by D.E. Knuth concerning a recurrence arising in the satisfiability problem. Knuth’s recurrence resembles recurrences arising in the analysis of tries, in particular PATRICIA tries, and asymmetric leader election. We solve Knuth’s recurrence exactly and asymptotically, using analytic techniques such as the Mellin transform and analytic depoissonization.

Spend your few moment to read a book even only few pages. Reading book is not obligation and force for everybody. When you don't want to read, you can get punishment from the publisher. Read a book becomes a choice of your different characteristics. Many people with reading habit will always be enjoyable to read, or on the contrary. For some reasons, this dissemination of information in communi...

In [3], Barrière et al. consider a qualitative model of distributed computing, where the labels of the entities are distinct but mutually incomparable. They study the leader election problem in a distributed mobile environment and they wonder whether there exists an algorithm such that for each distributed mobile environment, it either states that the problem cannot be solved in this environmen...

Many reliable distributed services rely on an eventual leader election to coordinate actions. The eventual leader detector has been proposed as a way to implement such an abstraction. It ensures that, eventually, each process in the system will be provided by an unique leader, elected among the set of correct processes in spite of crashes and uncertainties. A number of eventual leader election ...

We report on our experiences and lessons learned using Scantegrity II in a mock election held April 11, 2009, in Takoma Park, Maryland. Ninety-five members of the community participated in our test of this voting system proposed for the November 2009 municipal election. Results helped improve the system for the November binding election.

Leader election protocols are a fundamental building block for replicated distributed services. They ease the design of leader-based coordination protocols that tolerate failures. In partially synchronous systems, designing a leader election algorithm, that does not permit multiple leaders while the system is unstable, is a complex task. As a result many production systems use third-party distr...

The current study considered the influence of the 2008 presidential election on the racial identity of African American college students (M(age) = 19.3 years; 26.3% male). The design of the study consisted of 2 components: longitudinal and daily. The longitudinal component assessed 3 dimensions of racial identity (centrality, private regard, and public regard) 2 weeks before and 5 months after ...

We study committee election models where voters' approvals over candidates are collected and the election outcome is determined according to a predetermined voting rule, in particular issue-wise majority rule. The properties of these models are investigated with a special attention to representativeness of the election outcomes, where representativeness relates to the way they are consistent wi...

| We deene the highly available local leader election problem, a generalization of the leader election problem for partitionable systems. We propose a protocol that solves the problem eeciently and give some performance measurements of our implementation. The local leader election service has been proven useful in the design and implementation of several fail-aware services for partitionable sy...