An improved practical Byzantine fault tolerance (Practical Fault Tolerant consensus algorithm based on reputation, RPBFT) grouping and reputation value voting is proposed for the problems of high communication complexity, poor scalability, random selection master nodes (PBFT) consortium chain. First, consistency process optimized to take response speed each group leader as basis grouping, intra...

Applicant: Svetlana Obraztsova Home institution: Hebrew University of Jerusalem Home country: Israel Host:Edith Elkind Host institution: University of Oxford Host country: United Kingdom Dates: 09-03-2016 to 20-03-2016 During my visit to University of Oxford I closely worked with my host, Prof. Elkind. Our main discussion was about Trembling Hand equilibria for Voting games, precisely, to Votin...

Data size plays a significant role in the design and performance of data mining models. A good feature selection algorithm reduces problems big noise due to redundancy. Features algorithms aim at selecting best features eliminating unnecessary ones, which turn simplifies structure model as well increases its performance. This paper introduces robust algorithm, named Ranking Voting Algorithm FRV...

in this article despite of emphasis on the role of political cultural and religious factors to making political behavior and decision of society we try to explaining the relation between social and economical dissatisfaction and voting to political factions in iran.(in this article our concern is about voting to second khordad faction under the leadership of khatamy). in this theory we want to ...

Mutual exclusion as one of the main problems associated with distributed systems requires that at any time t, only one site can access the common copies of file f. As a result of node or link failures, distributed system may be partitioned into two or more groups of nodes which cannot communicate each other anymore; meanwhile they must be able to update their copies of file f consistently, in o...

Mobile and loosely-coupled environments call for decentralized optimistic replication protocols that provide highly available access to shared objects. A fundamental property of most optimistic protocols is to guarantee an eventual consensus on a commit order among the set of tentatively issued updates. In this paper we propose a replicated object protocol that employs a novel epidemic weighted...

There is a long standing hypothesis in Developmental Psychology that children use statistical information to segment acoustic speech streams into words. Additionally, several experiments have demonstrated that infants are able to find word breaks using distributional cues. In this paper we propose an algorithm for the unsupervised segmentation of audio speech, based on the Voting Experts (VE) a...

In this paper, we provide an algorithm to compute the equilibrium payoffs in the coalitional bargaining model of Eraslan-McLennan (Journal of Economic Theory, 2013) by using recent developments in methods of numerical algebraic geometry. The Eraslan-McLennan model is a legislative bargaining model that studies weighted voting games with players that are potentially heterogeneous in probabilitie...