Solubility of carbon dioxide, ethane, methane, oxygen, nitrogen, hydrogen, argon, and carbon monoxide in 1-butyl-3-methylimidazolium tetrafluoroborate between temperatures 283 K and 343 K and at pressures close to atmospheric

Experimental values for the solubility of carbon dioxide, ethane, methane, oxygen, nitrogen, hydrogen, argon and carbon monoxide in 1-butyl-3- methylimidazolium tetrafluoroborate, [bmim][BF4] - a room temperature ionic liquid - are reported as a function of temperature between 283 K and 343 K and at pressures close to atmospheric. Carbon dioxide is the most soluble gas with mole fraction solubilities of the order of 10-2. Ethane and methane are one order of magnitude more soluble than the other five gases that have mole fraction solubilities of the order of 10-4. Hydrogen is the less soluble of the gaseous solutes studied. From the variation of solubility, expressed as Henry's law constants, with temperature, the partial molar thermodynamic functions of solvation such as the standard Gibbs energy, the enthalpy, and the entropy are calculated. The precision of the experimental data, considered as the average absolute deviation of the Henry's law constants from appropriate smoothing equations is of 1%. © 2005 Elsevier Ltd. All rights reserved.

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.

WASP-52b, WASP-58b, WASP-59b, and WASP-60b: Four new transiting close-in giant planets

We present the discovery of four new transiting hot jupiters, detected mainly from SuperWASP-North and SOPHIE observations. These new planets, WASP-52b, WASP-58b, WASP-59b, and WASP-60b, have orbital periods ranging from 1.7 to 7.9 days, masses between 0.46 and 0.94 M_Jup, and radii between 0.73 and 1.49 R_Jup. Their G1 to K5 dwarf host stars have V magnitudes in the range 11.7-13.0. The depths of the transits are between 0.6 and 2.7%, depending on the target. With their large radii, WASP-52b and 58b are new cases of low-density, inflated planets, whereas WASP-59b is likely to have a large, dense core. WASP-60 shows shallow transits. In the case of WASP-52 we also detected the Rossiter-McLaughlin anomaly via time-resolved spectroscopy of a transit. We measured the sky-projected obliquity lambda = 24 (+17/-9) degrees, indicating that WASP-52b orbits in the same direction as its host star is rotating and that this prograde orbit is slightly misaligned with the stellar equator. These four new planetary systems increase our statistics on hot jupiters, and provide new targets for follow-up studies.

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.

Using macroscopic entanglement to close the detection loophole in Bell-inequality tests

We consider a Bell-like inequality performed using various instances of multiphoton entangled states to demonstrate that losses occurring after the unitary transformations used in the nonlocality test can be counteracted by enhancing the size of such entangled states. In turn, this feature can be used to overcome detection inefficiencies affecting the test itself: a slight increase in the size of such states, pushing them towards a more macroscopic form of entanglement, significantly improves the state robustness against detection inefficiency, thus easing the closing of the detection loophole. Differently, losses before the unitary transformations cause decoherence effects that cannot be compensated using macroscopic entanglement.

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.

Creating an Inclusive Society… How Close are We in Relation to Autism Spectrum Disorder? A General Population Survey

BackgroundChildren with autism spectrum disorder are increasingly educated in mainstream classrooms in the United Kingdom (Wilkinson & Twist, Autism and Educational Assessment: UK Policy and Practice. NFER, Slough, 2010), and some employers are now specifically seeking out staff on the autism spectrum. Does that mean that we are living in an inclusive society' [United Nations Department of Economic and Social Affairs (UNDESA), Creating an Inclusive Society: Practical Strategies to Promote Social Integration 2008], in the sense that inequalities are reduced and full economic, social and cultural participation is advanced for individuals with autism?

MethodsA general population survey was conducted to assess how close we, as a society, are to an inclusive society for individuals with autism in Northern Ireland. Public attitudes were examined to (i) visibility and social interaction, (ii) aetiology, needs and interventions, and (iii) rights and resources.

ResultsA stratified, representative sample of 1204 adults took part in the survey; of these, 989 were aware of autism and their attitudes and behavioural projections reflected a mix of acceptance and denunciation. The level of confusion with regard to interventions reflected the general uncertainty within UK policy regarding meeting the needs of individuals on the autism spectrum (International Journal of Disability, Development and Education 61, 134, 2014a).

ConclusionTherefore, it seems that inclusion is working to an extent, but more clarity is needed with regard to adequate education, intervention and support for individuals with autism.

Long-range multipartite entanglement close to a first-order quantum phase transition

We provide insight into the quantum correlations structure present in strongly correlated systems beyond the standard framework of bipartite entanglement. To this aim we first exploit rotationally invariant states as a test bed to detect genuine tripartite entanglement beyond the nearest neighbor in spin-1/2 models. Then we construct in a closed analytical form a family of entanglement witnesses which provides a sufficient condition to determine if a state of a many-body system formed by an arbitrary number of spin-1/2 particles possesses genuine tripartite entanglement, independently of the details of the model. We illustrate our method by analyzing in detail the anisotropic XXZ spin chain close to its phase transitions, where we demonstrate the presence of long-range multipartite entanglement near the critical point and the breaking of the symmetries associated with the quantum phase transition.

A Close Comparison

Despite clear differences, Uganda and the UK share striking similarities in the issues their maternity services face, say Michelle Henry and Shirley Stronge.