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.

Universal tight binding model for chemical reactions in solution and at surfaces. II. Water

A revised water model intended for use in condensed phase simulations in the framework of the self consistent polarizable ion tight binding theory is constructed. The model is applied to water monomer, dimer, hexamers, ice, and liquid, where it demonstrates good agreement with theoretical results obtained by more accurate methods, such as DFT and CCSD(T), and with experiment. In particular, the temperature dependence of the self diffusion coefficient in liquid water predicted by the model, closely reproduces experimental curves in the temperature interval between 230 K and 350 K. In addition, and in contrast to standard DFT, the model properly orders the relative densities of liquid water and ice. A notable, but inevitable, shortcoming of the model is underestimation of the static dielectric constant by a factor of two. We demonstrate that the description of inter and intramolecular forces embodied in the tight binding approximation in quantum mechanics leads to a number of valuable insights which can be missing from ab initio quantum chemistry and classical force fields. These include a discussion of the origin of the enhanced molecular electric dipole moment in the condensed phases, and a detailed explanation for the increase of coordination number in liquid water as a function of temperature and compared with ice-leading to insights into the anomalous expansion on freezing. The theory holds out the prospect of an understanding of the currently unexplained density maximum of water near the freezing point. 

Universal tight binding model for chemical reactions in solution and at surfaces. III. Stoichiometric and reduced surfaces of titania and the adsorption of water

We demonstrate a model for stoichiometric and reduced titanium dioxide intended for use in molecular dynamics and other atomistic simulations and based in the polarizable ion tight binding theory. This extends the model introduced in two previous papers from molecular and liquid applications into the solid state, thus completing the task of providing a comprehensive and unified scheme for studying chemical reactions, particularly aimed at problems in catalysis and electrochemistry. As before, experimental results are given priority over theoretical ones in selecting targets for model fitting, for which we used crystal parameters and band gaps of titania bulk polymorphs, rutile and anatase. The model is applied to six low index titania surfaces, with and without oxygen vacancies and adsorbed water molecules, both in dissociated and non-dissociated states. Finally, we present the results of molecular dynamics simulation of an anatase cluster with a number of adsorbed water molecules and discuss the role of edge and corner atoms of the cluster. (C) 2014 AIP Publishing LLC.

Universal tight binding model for chemical reactions in solution and at surfaces. I. Organic molecules

As is now well established, a first order expansion of the Hohenberg-Kohn total energy density functional about a trial input density, namely, the Harris-Foulkes functional, can be used to rationalize a non self consistent tight binding model. If the expansion is taken to second order then the energy and electron density matrix need to be calculated self consistently and from this functional one can derive a charge self consistent tight binding theory. In this paper we have used this to describe a polarizable ion tight binding model which has the benefit of treating charge transfer in point multipoles. This admits a ready description of ionic polarizability and crystal field splitting. It is necessary in constructing such a model to find a number of parameters that mimic their more exact counterparts in the density functional theory. We describe in detail how this is done using a combination of intuition, exact analytical fitting, and a genetic optimization algorithm. Having obtained model parameters we show that this constitutes a transferable scheme that can be applied rather universally to small and medium sized organic molecules. We have shown that the model gives a good account of static structural and dynamic vibrational properties of a library of molecules, and finally we demonstrate the model's capability by showing a real time simulation of an enolization reaction in aqueous solution. In two subsequent papers, we show that the model is a great deal more general in that it will describe solvents and solid substrates and that therefore we have created a self consistent quantum mechanical scheme that may be applied to simulations in heterogeneous catalysis.

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 article 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. In particular, the seemingly obvious lower bounds of Ω(m) messages, where m is the number of edges in the network, and Ω(D) time, where D is the network diameter, are nontrivial to show for randomized (Monte Carlo) algorithms. (Recent results, showing that even Ω(n), where 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 restricted case of comparison algorithms, where it was also required that nodes may not wake up spontaneously and that D and n were not known. We establish these fundamental lower bounds in this article 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 (namely, algorithms that 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 any use of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time leader election algorithm is known. A slight adaptation of our lower bound technique gives rise to an Ω(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 tradeoff messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

Microneedle characterisation: the need for universal acceptance criteria and GMP specifications when moving towards commercialisation

With interest in microneedles as a novel drug transdermal delivery system increasing rapidly since the late 1990s (Margetts and Sawyer Contin Educ Anaesthesia Crit Care Pain. 7(5):171-76, 2007), a diverse range of microneedle systems have been fabricated with varying designs and dimensions. However, there are still very few commercially available microneedle products. One major issue regarding microneedle manufacture on an industrial scale is the lack of specific quality standards for this novel dosage form in the context of Good Manufacturing Practice (GMP). A range of mechanical characterisation tests and microneedle insertion analysis techniques are used by researchers working on microneedle systems to assess the safety and performance profiles of their various designs. The lack of standardised tests and equipment used to demonstrate microneedle mechanical properties and insertion capability makes it difficult to directly compare the in use performance of candidate systems. This review highlights the mechanical tests and insertion analytical techniques used by various groups to characterise microneedles. This in turn exposes the urgent need for consistency across the range of microneedle systems in order to promote innovation and the successful commercialisation of microneedle products.

The United Kingdom, the United Nations Human Rights Council and the first cycle of the Universal Periodic Review

The introduction of the Universal Periodic Review (UPR) mechanism as an innovative component of the new Human Rights Council in 2006 has suffered little academic scrutiny. This is partly because it holds as its objective an improvement in human rights situations on the ground, a goal that is difficult to test amongst so many possible causal factors attributable to law reform and policy change, and partly due to the fact that the mechanism has only completed one full cycle of review. This article seeks to remedy this absence of analysis by examining the experience of the United Kingdom during its first review. In doing so, the article first considers the conception of the UPR, before progressing to examine the procedure and recommendations made to the UK by its peers. Finally, the article considers the five year review of the UPR which occurred as a subset of the Human Rights Council Review in 2011 and the resulting changes to the process modalities.

Reclaiming the Radical in Universal Human Rights: Universality as Universalisation

The universality of human rights has been a fiercely contested issue throughout their history. This article contributes to scholarly engagements with the universality of human rights by proposing a re-engagement with this concept in a way that is compatible with the aims of radical politics. Instead of a static attribute or characteristic of rights this article proposes that universality can be thought of as, drawing from Judith Butler, an ongoing process of universalisation. Universality accordingly emerges as a site of powerful contest between competing ideas of what human rights should mean, do or say, and universal concepts are continually reworked through political activity. This leads to a differing conception of rights politics than traditional liberal approaches but, moreover, challenges such approaches. This understanding of universality allows human rights to come into view as potentially of use in interrupting liberal regimes and, crucially, opens possibilities to reclaim the radical in rights.

The Casimir effect in the presence of compactified universal extra dimensions

The Casimir force in a system consisting of two parallel conducting plates in the presence of compactified universal extra dimensions (UXD) is analyzed. The Casimir force with UXDs differs from the force obtained without extra dimensions. A new power law for the Casimir force is derived. By comparison to experimental data the size R of the universal extra dimensions can be restricted to R⩽10 nm for one extra dimension.