Politicians, elections and catastrophe: the general election of 1847

Over the last decade, much new research has appeared on the subject of the Great Irish Famine but, remarkably, a major political event during the famine - the 1847 general election - has received virtually no mention. Recent work on politics in this period has tended to concentrate on political reaction in Britain rather than Ireland. The aim of this article is to examine the response of Irish politicians to the famine during the general election of 1847. The main source has been the political addresses and nomination speeches of most of the 140 candidates. The evidence from this material shows that, although the famine was an important matter in many constituencies, it was not the dominant issue countrywide. Various proposals to deal with the famine emerged, but there was an absence of agreed, practical measures to deal with immediate problems. The parties in Ireland failed to create a common platform to challenge the government over its efforts. Ideological constraints played an important part in these failures. The general election of 1847 represents a lost opportunity to tackle some of the effects of the famine.

After Housing Policy: Housing and the UK General Election 2001

This paper describes the results of a review of the housing content of UK General Election 2001 manifestos. Housing policy was of little importance during the election campaign. The main British political parties had, essentially, a shared housing agenda - to promote and facilitate home ownership, support area and community regeneration, tackle homelessness, improve the private rented sector, and prevent building on greenfield sites. Many issues of importance to housing specialists received little or no attention, most notably that of low demand. Some policy variations within the UK were evident, for example in attitudes towards greenfield development, home ownership and stock transfer. The paper concludes that differences in housing policy are emerging within the UK as part of a new politics of devolution and that the days of a single housing policy approach for the UK are over.

Consociationalism and its critics: Evidence from the historic Northern Ireland Assembly Election of 2007:

Critics of consociational power-sharing institutional arrangements in deeply divided societies argue that such arrangements solidify the underlying conflict cleavage and render it all-important for party competition and voter behaviour. I find evidence to the contrary in the case of voter behaviour at the historic 2007 Assembly election in Northern Ireland. At least in the unionist bloc, I find the effective disappearance of the ethno-national conflict cleavage as a determinant of voter choice. This suggests that consociational arrangements have led to both inclusion and moderation, rather than polarisation and ‘ethnic outbidding’

Multilevel election timing - A comparative overview

This article investigates the link between regionalization of the structure of government, regional elections and regionalism on the one hand, and the organization of state-wide political parties in Spain and the UK on the other. It particularly looks at two aspects of the relations between the central and regional levels of party organization: integration of the regional branches in central decision making and autonomy of the regional branches. It argues that the party factors are the most crucial elements explaining party change and that party leaders mediate between environmental changes and party organization. The parties' history and beliefs and the strength of the central leadership condition their ability or willingness to facilitate the emergence of meso-level elites. The institutional and electoral factors are facilitating factors that constitute additional motives for or against internal party decentralization.

Risk assessment of potentially toxic elements in agricultural soils and maize tissues from selected districts in Tanzania

A field survey was conducted to investigate the contamination of potentially toxic elements (PTEs) arsenic (As), lead (Pb), chromium (Cr), and nickel (Ni) in Tanzanian agricultural soils and to evaluate their uptake and translocation in maize as proxy to the safety of maize used for human and animal consumption. Soils and maize tissues were sampled from 40 farms in Tanzania and analyzed using inductively coupled plasma-mass spectrometry in the United Kingdom. The results showed high levels of PTEs in both soils and maize tissues above the recommended limits. Nickel levels of up to 34.4 and 56.9mgkg(-1) respectively were found in some maize shoots and grains from several districts. Also, high Pb levels >0.2mgkg(-1) were found in some grains. The grains and shoots with high levels of Ni and Pb are unfit for human and animal consumption. Concentrations of individual elements in maize tissues and soils did not correlate and showed differences in uptake and translocation. However, Ni showed a more efficient transfer from soils to shoots than As, Pb and Cr. Transfer of Cr and Ni from shoots to grains was higher than other elements, implying that whatever amount is assimilated in maize shoots is efficiently mobilized and transferred to grains. Thus, the study recommended to the public to stop consuming and feeding their animals maize with high levels of PTEs for their safety.

Kingship by Descent or Kingship by Election? The Contested Title of James VI and I

Throughout the reign of Elizabeth I, a steady stream of tracts appeared in English print to vindicate the succession of the most prominent contenders, Mary and James Stuart of Scotland. This article offers a comprehensive account of the polemical battle between the supporters and opponents of the Stuarts, and further identifies various theories of English kingship, most notably the theory of corporate kingship, developed by the Stuart polemicists to defend the Scottish succession. James's accession to the English throne in March 1603 marked the protracted end of the debate over the succession. The article concludes by suggesting that, while powerfully renouncing the opposition to his succession, over the course of his attempt to unify his two kingdoms, James and his supporters ultimately departed from the polemic of corporate kingship, for a more assertive language of kingship by natural and divine law.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. The "obvious" lower bounds of O(m) messages (m is the number of edges in the network) and O(D) time (D is the network diameter) are non-trivial to show for randomized (Monte Carlo) algorithms. (Recent results that show that even O(n) (n is the number of nodes in the network) is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms (except for the limited case of comparison algorithms, where it was also required that some nodes may not wake up spontaneously, and that D and n were not known).

We establish these fundamental lower bounds in this paper for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (such algorithms should work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make anyuse of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time algorithm is known. A slight adaptation of our lower bound technique gives rise to an O(m) message lower bound for randomized broadcast algorithms.

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. (The answer is known to be negative in the deterministic setting). We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that trade-off messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

Sublinear Bounds for Randomized Leader Election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) takes only O(n-vlog3/2n) messages to elect a unique leader (with high probability). This algorithm is then extended to solve leader election on any connected non-bipartiten-node graph G in O(t(G)) time and O(t(G)n-vlog3/2n) messages, where t(G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficientdeterministic leader election algorithms. Finally, an almost-tight lower bound is presented for randomized leader election, showing that O(n-v) messages are needed for any O(1) time leader election algorithm which succeeds with high probability. It is also shown that O(n 1/3) messages are needed by any leader election algorithm that succeeds with high probability, regardless of the number of the rounds. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

Sublinear bounds for randomized leader election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O(√ √nlog^3/2n) messages to elect a unique leader (with high probability). When considering the "explicit" variant of leader election where eventually every node knows the identity of the leader, our algorithm yields the asymptotically optimal bounds of O(1) rounds and O(. n) messages. This algorithm is then extended to one solving leader election on any connected non-bipartite n-node graph G in O(τ(. G)) time and O(τ(G)n√log^3/2n) messages, where τ(. G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficient deterministic leader election algorithms. Finally, we present an almost matching lower bound for randomized leader election, showing that Ω(n) messages are needed for any leader election algorithm that succeeds with probability at least 1/. e+. ε, for any small constant ε. >. 0. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.