Itai and Rodeh showed that, on the average, the communication of a leader election algorithm takes no more than $LN$ bits, where $L \simeq 2.441716$ and $N$ denotes the size of the ring. We give a precise asymptotic analysis of the average number of rounds M(n) required by the algorithm, proving for example that $\dis M(\infty) := \lim\_{n\to \infty} M(n) = 2.441715879...$, where $n$ is the num...

During the latest episode of general election held in Malaysia, it is observed that the FBMKLCI index was lifted 62.52 points in a day soon after the announcement of election outcome. Moreover, the index registered a highest gain of 96.29 points in the middle of the intra-day trade. This suggests that investors who had got the right direction could make profitable intra-day trading the next tra...

Introduction by the Clearinghouse This report is another in the series on Innovations in Election Administration being published by the FEC's National Clearinghouse on Election Administration. The purpose of this series is to acquaint State and local election officials with innovative election procedures and technologies that have been successfully implemented by their colleagues around the cou...

In this paper, we present an election prediction system (Crystal) based on web users’ opinions posted on an election prediction website. Given a prediction message, Crystal first identifies which party the message predicts to win and then aggregates prediction analysis results of a large amount of opinions to project the election results. We collect past election prediction messages from the We...

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.

A silent self-stabilizing asynchronous distributed algorithm, SSLE, for the leader election problem, in a connected unoriented network with unique IDs, is given. SSLE uses O(log n) space per process and stabilizes in O(n) rounds, where n is the number of processes in the network.

To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some property of interest. This violation leads to the conclusion that the lower bound on process replication is of the form n > bkt/bc, where t is the maximum number of process failures in any of these executions and k, b are positiv...

Formation of scatternet using Bluetooth devices increases device tractability thereby inviting new networking applications to be designed on it. In this paper we propose Bluetooth Scatternet Formation and Routing Protocol (BSFRP). It is a distributed protocol that handles node mobility and enables multi-hop communication. BSFRP defines rules for topology discovery, scatternet formation and rout...

We present a survey of formal speci cation techniques applied to the Tree Identify Protocol of the IEEE 1394 High Performance Serial Bus. Speci cations written in a variety of formalisms are compared with regard to a number of criteria including expressiveness, readability, standardisation, and level of analysis.