نتایج جستجو برای: election and recoupment

تعداد نتایج: 16829350  

Journal: :journal of industrial strategic management 2013
a. seyedi s. taherkhani

nowadays, election is one of the important issues in all the countries that their political system is based on democracy. this study investigated the effectiveness of promotional tools on the behavior of voters in the eleventh round of iran's presidential election. in this study, media campaign tools were divided into two categories of media and non-media ones and the effect of each on the vote...

2016
Karine Altisen Ajoy Kumar Datta Stéphane Devismes Anaïs Durand Lawrence L. Larmore

We study leader election in unidirectional rings of homonym processes that have no a priori knowledge on the number of processes. We show that message-terminating leader election is impossible for any class of rings Kk with bounded multiplicity k ≥ 2. However, we show that process-terminating leader election is possible in the subclass U∗ ∩ Kk, where U ∗ is the class of rings which contain a pr...

2016
Bernhard Beckert Michael Kirsten Vladimir Klebanov Carsten Schürmann

A risk-limiting audit is a statistical method to create confidence in the correctness of an election result by checking samples of paper ballots. In order to perform an audit, one usually needs to know what the election margin is, i.e., the number of votes that would need to be changed in order to change the election outcome. In this paper, we present a fully automatic method for computing elec...

Journal: :IEEE Trans. Software Eng. 1999
Christof Fetzer Flaviu Cristian

We define 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 efficiently 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 s...

Journal: :Inf. Process. Lett. 1996
Sukumar Ghosh Arobinda Gupta

Self-stabilizing algorithms are designed to guarantee convergence to some desired stable state from arbitrary initial states arising out of an arbitrarily large number of faults. However, in a well-designed system, the simultaneous occurrence of a large number of faults is rare. It is therefore desirable to design algorithms that are not only self-stabilizing, but also have the ability to recov...

2015
Garrett Glasgow Roberto A. Weber Kevin Quinn Christina Fong Jesse James DuPree

Do individuals believe that an election victory by their favored candidate will improve their personal economic well-being? Previous work has either adopted an approach that is not well suited to determining this relationship, or ignored this question to focus on perceptions of macroeconomic conditions. In this paper we adopt a new approach that allows us to determine the relationship individua...

Journal: :Indian journal of experimental biology 2004
Sangeeta Shukla Monika Bhadauria Anjana Jadon

Ethanolic extract of propolis was administered to rats intoxicated by carbon tetrachloride. Administration of bolus dose of CCl4 (1.5 ml/kg, ip) resulted in elevation of serum transaminases and serum alkaline phosphatase activities. Levels of hepatic lipid peroxidation were significantly increased. On the contrary, there was significant decrease in hepatic reduced glutathione level. The propoli...

2009
Roland Wen Richard Buckland

To prevent bribery and coercion attacks on voters, current online election schemes rely on strong physical assumptions during the election. We introduce Masked Ballot, an online voting scheme that mitigates these attacks while using a more practical assumption: untappable channels are available but only before the election. During the election voters cast ballots over completely public channels...

1998
Alexander Russell David Zuckerman

In the leader election problem, n players wish to elect a random leader. The difficulty is that some coalition of players may conspire to elect one of its own members. We adopt the perfect information model: all communication is by broadcast, and the bad players have unlimited computational power. Protocols proceed in rounds: though players are synchronized between rounds, within each round the...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید