We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities. All protocols have polynomial complexity and require private channels and a simultaneous broadcast channel. Our first protocol is a basic voting scheme which allows voters to interact in order to compute the tally. ...

In this work we analyze the class prediction of parallel randomized ensembles by majority voting as an urn model. For a given test instance, the ensemble can be viewed as an urn of marbles of different colors. A marble represents an individual classifier. Its color represents the class label prediction of the corresponding classifier. The sequential querying of classifiers in the ensemble can b...

We analyse and evaluate three decision rules for the Council of Ministers of the EU, which are prescribed by the ‘definitive form’ of the Treaty of Nice. The first will apply from 2005 to the present 15-member EU, if it will not have been enlarged by then. The second or third will apply to an enlarged 27-member EU. We conclude that the first of these is an improvement on the current decision ru...

Crowdsourcing has become an effective and popular tool for human-powered computation to label large datasets. Since the workers can be unreliable, it is common in crowdsourcing to assign multiple workers to one task, and to aggregate the labels in order to obtain results of high quality. In this paper, we provide finite-sample exponential bounds on the error rate (in probability and in expectat...

In this paper we propose a method for locating the optic disc (OD) in retinal images automatically using a generalization of majority voting scheme. Applying more different optic disc detectors for voting we can achieve better performance for the automatic detection system than for each individual algorithm. The location with maximum number of OD center candidates falling within a radius predef...

majority voting, plurality voting, expert combination, fault-tolerance Voting is a well-known technique used to combine decisions of peer experts. It has wide application in many domains. Voting is used in fault tolerant applications to mask errors from one or more experts using N-Modular Redundancy (NMR) and N-version Programming. It is also used in pattern recognition applications where decis...

Current majority voting mechanism usually used in intrusion tolerant system have some limits. To solve this problem, a novel adaptive probability voting mechanism based on double threshold values is proposed. The intrusion tolerance system based on this voting mechanism can provide correct and reliable services continually in case of existing fault or intrusion and detect the faulty server repl...

Protein secondary structure prediction is one of the central topics in proteome analysis. Computational methods, developed for the prediction (classification) of protein secondary structures, have been improved substantially since 1990s, allowing us to investigate some of the computational classifiers and attempt to integrate them through voting. The study tries to evaluate whether and how much...

Voting systems aggregate preferences efficiently and are often used for deciding conservation priorities. Desirable characteristics of voting systems include transitivity, completeness, and Pareto optimality, among others. Voting systems that are common and potentially useful for environmental decision making include simple majority, approval, and preferential voting. Unfortunately, no voting s...

based on a meta-theoretical analysis of voting, the present paper is an attempt to present a theoretical model encompassing all the possible aspects of voting in an election action system, proposing four sub-systems of voting as follows: economic voting, political voting, cultural voting and moral voting. having distinguished among these sub-systems, the writer describes the constitutive elemen...