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.

High-performance FPGA implementation of DES using a novel method for implementing the key schedule

A generic, parameterisable key scheduling core is presented, which can be utilised in pipelinable private-key encryption algorithms. The data encryption standard (DES) algorithm, which lends itself readily to pipelining, is utilised to exemplify this novel key scheduling method and the broader applicability of the method to other encryption algorithms is illustrated. The DES design is implemented on Xilinx Virtex FPGA technology. Utilising the novel method, a 16-stage pipelined DES design is achieved, which can run at an encryption rate of 3.87 Gbit/s. This result is among the fastest hardware implementations and is a factor 28 times faster than software implementations.

Nana, Prostitution and the Textual Foundations of Zola’s 'Au Bonheur des Dames'

This article considers the textual forces operating in Au Bonheur des Dames, Zola's 1883 novel on modern commerce. It proposes that, with its echoes of the disorderly impulses that governed the infamous prostitute Nana earlier in the Rougon-Macquart cycle, coupled with its appreciation of the benefits of regulation, the dynamics of controlled and contained prostitution constitute the energy which fuels an efficient and successful business model in Au Bonheur des Dames. By closely analyzing both texts as well as Zola's preparatory documents, and borrowing from Genette's theories of intertextuality, this study reads Nana as a pre-historic hypotext, buried in the textual chantier from which the structure of Au Bonheur des Dames emerges.

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.

Devoir de mémoire contre droit à l'imagination?:La querelle des historiens et des romanciers et la Seconde Guerre mondiale

conference paper given in Maynooth (History conference 18th 20th October 2013)

Survivre après la Shoah: l’enjeu des Bagages de sable d’Anna Langfus

Society for French Studies conference
Liverpool, July 2008