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

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

2010
Ben Smyth Mark Ryan

Electronic voting systems are being introduced, or trialled, in several countries to provide more efficient voting procedures with an increased level of security. However, current deployment has resulted in catastrophic failure due to unrealistic trust assumptions. In particular, the trustworthiness of hardware/software and election officials has been assumed. In practice, it is very difficult ...

1998
Jianping Mei

This paper examines the impact of political uncertainty on the recent financial crises in emerging markets. By examining political election cycles, we find that eight out of nine of the recent financial crises happened during periods of political election and transition. Using a combination of probit and switching regression analysis, we find that there is a significant relationship between pol...

2007
Marisa A. Abrajano R. Michael Alvarez Jonathan Nagler

This paper examines Hispanic voting behavior in the 2004 Presidential election. Our research makes a significant contribution to the literature on Hispanic politics, as this is the first study to apply theories of issue and economic voting to a nationwide sample of Hispanic voters. We demonstrate that, similar to Anglos, issues and ideology were highly influential in the vote choice of Hispanic...

2013
Leslie E. Roos Sophie Lebrecht James W. Tanaka Michael J. Tarr

Implicit attitudes about social groups persist independently of explicit beliefs and can influence not only social behavior, but also medical and legal practices. Although examples presented in the laboratory can alter such implicit attitudes, it is unclear whether the same influence is exerted by real-world exemplars. Following the 2008 US election, Plant et al. reported that the Implicit Asso...

2016
Houshmand Shirani-Mehr David Rothschild Sharad Goel Andrew Gelman

It is well known among researchers and practitioners that election polls su↵er from a variety of sampling and non-sampling errors, often collectively referred to as total survey error. Reported margins of error typically only capture sampling variability, and in particular, generally ignore non-sampling errors in defining the target population (e.g., errors due to uncertainty in who will vote)....

2003
Sudarshan Vasudevan Brian DeCleene Neil Immerman James F. Kurose Donald F. Towsley

We consider the problem of secure leader election and propose two cheat-proof election algorithms : Secure Extrema Finding Algorithm (SEFA) and Secure Preference-based Leader Election Algorithm (SPLEA). Both algorithms assume a synchronous distributed system in which the various rounds of election proceed in a lock-step fashion. SEFA assumes that all elector-nodes share a single common evaluati...

Journal: :Computers in Human Behavior 2011
Patrick M. Markey Charlotte Markey

The current study examined a prediction derived from the challenge hypothesis; individuals who viciously win a competition of rank order will seek out pornography relatively more often than individuals who viciously lose a competition. By examining Google keyword searches during the 2006 and 2010 midterm elections in the United States, the relative popularity of various pornography keyword sear...

2010

This article examines the 2006 Berlin Land election, including the election campaigns of the main parties, the results, and the process of post-election coalition formation. While few doubted that the SPD would emerge as the largest party, and that the highly popular Klaus Wowereit would continue as Berlin’s governing mayor; the big questions were what coalition he would lead and whether Berlin...

2015
Patrick Liu Dan Wagner

With more data becoming publicly available, strategical data-mining has become en vogue. Most notably, public figures with strong analytical sense such as Dan Silver and Dan Wagner have been able to use data to make accurate election and voter predictions, with the former gaining notice for accuracy in predicting the state votes of the 2008 presidential election, and the latter being brought on...

2000
Stefan Dobrev

We consider the problem of leader election in asynchronous oriented N-node complete networks. We present a leader election algorithm with O(N) message and O(log log N) time complexity. The message complexity is optimal and the time complexity is the best possible under the assumption of message optimality. The best previous leader election algorithm for asynchronous oriented complete networks b...

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

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