Boson pairs in a one-dimensional split trap

We describe the properties of a pair of ultracold bosonic atoms in a one-dimensional harmonic trapping potential with a tunable zero-ranged barrier at the trap center. The full characterization of the ground state is done by calculating the reduced single-particle density, the momentum distribution, and the two-particle entanglement. We derive several analytical expressions in the limit of infinite repulsion (Tonks-Girardeau limit) and extend the treatment to finite interparticle interactions by numerical solution. As pair interactions in double wells form a fundamental building block for many-body systems in periodic potentials, our results have implications for a wide range of problems.

Sequential C-H and C-Ru bond formation and cleavage during the thermally induced rearrangement of aryl ruthenium(II) complexes with [C6H3(CH2NMe2)(2)-2,6](-) as a bidentate eta(2)-C,N coordinated ligand. The crystal structures of the isomeric pairs [RuCl{eta(6)-C10H14}{eta(2)-C,N-C6H3(CH2NMe2)(2)-2,n}] (n = 4 or 6) and [Ru(eta(5)-C5H5){(eta(2)-C,N-C6H3(CH2NMe2)(2)-2,n} (PPH3)] (n = 4 or 6)

New air-stable ruthenium(II) complexes that contain the aryldiamine ligand [C6H3(CH2-NMe2)(2)-2,6](-) (NCN) are described. These complexes are [RuCl{eta(2)-C,N-C6H3(CH2NMe2)(2)-2,6}(eta(6)-C10H14)] (2; C10H14 = p-cymene = C6H4Me-Pr-i-4), [Ru{eta(2)-C,N-C6H3(CH2NMe2)(2)-2,6}(eta(5)-C5H5)(PPh3)] (5), and their isomeric forms [RuCl{eta(2)-C,N-C6H3(CH2NMe2)(2)-2,4}(eta(6)-C10H14)] (3) and [Ru{eta(2)-C,N-C6H3(CH2NMe2)(2)-2,4}(eta(5)-C5H5)(PPh3)] (6), respectively. Complex 2 has been prepared from the reaction of [Li(NCN)](2) with [RuCl2(eta(6)-C10H14)](2), whereas complex 5 has been prepared by the treatment of [RuCl{eta(3)-N,C,N-C6H3(CH2NMe2)(2)-2,6}(PPh3)] (4) with [Na(C5H5)](n). Both 2 and 5 are formally 18-electron ruthenium(II) complexes in which the monoanionic potentially tridentate coordinating ligand NCN is eta(2)-C,N-bonded, In solution (halocarbon solvent at room temperature or in aromatic solvents at elevated temperature), the intramolecular rearrangements of 2 and 5 afford complexes 3 and 6, respectively. This is a result of a shift of the metal-C-aryl bond from position-1 to position-3 on the aromatic ring of the NCN ligand. The mechanism of the isomerization is proposed to involve a sequence of intramolecular oxidative addition and reductive elimination reactions of both aromatic and aliphatic C-H bonds. This is based on results from deuterium labeling, spectroscopic studies, and some kinetic experiments. The mechanism is proposed to contain fully reversible steps in the case of 5, but a nonreversible step involving oxidative addition of a methyl NCH2-H bond in the case of 2. The solid-state structures of complexes 2, 3, 5, and 6 have been determined by single-crystal X-ray diffraction. A new dinuclear 1,4-phenylene-bridged bisruthenium(II) complex, [1,4-{RuCl(eta(6)-C10H14)}(2){C-6(CH2NMe2)(4)-2,3,5,6-C,N,C',N'}] (9) has also been prepared from the dianionic ligand [C-6(CH2NMe2)(4)-2,3,5,6](2-) (C2N4). The C2N4 ligand is in an eta(2)-C,N-eta(2)-C',N'-bis(bidentate) bonding mode. Compound 9 does not isomerize in solution (halocarbon solvent), presumably because of the absence of an accessible C-aryl-H bond. Complex 9 could not be isolated in an analytically pure form, probably because of its high sensitivity to air and very low solubility, which precludes recrystallization.

“A Labour Leader in a Frothy Scoundrel”: Farce and Social Justice in the Popular Dramaturgy of George Shiels

In the financially precarious period which followed the partition of Ireland (1922) the Northern Irish playwright George Shiels kept The Abbey Theatre, Dublin, open for business with a series of ‘box-office’ successes. Literary Dublin was not so appreciative of his work as the Abbey audiences dubbing his popular dramaturgy mere ‘kitchen comedy’. However, recent analysts of Irish theatre are beginning to recognise that Shiels used popular theatre methods to illuminate and interrogate instances of social injustice both north and south of the Irish border. In doing so, such commentators have set up a hierarchy between the playwright’s early ‘inferior’ comedies and his later ‘superior’ works of Irish Realism. This article rejects this binary by suggesting that in this early work Shiels’s intent is equally socially critical and that in the plays Paul Twyning, Professor Tim and The Retrievers he is actively engaging with the farcical tradition in order to expose the marginalisation of the landless classes in Ireland in the post-colonial jurisdictions.

Convergent evolutionary processes driven by foraging opportunity in two sympatric morph pairs of Arctic charr with contrasting post-glacial origins

The expression of two or more discrete phenotypes amongst individuals within a species (morphs) provides multiple modes upon which selection can act semi-independently, and thus may be an important stage in speciation. In the present study, we compared two sympatric morph systems aiming to address hypotheses related to their evolutionary origin. Arctic charr in sympatry in Loch Tay, Scotland, exhibit one of two discrete, alternative body size phenotypes at maturity (large or small body size). Arctic charr in Loch Awe segregate into two temporally segregated spawning groups (breeding in either spring or autumn). Mitochondrial DNA restriction fragment length polymorphism analysis showed that the morph pairs in both lakes comprise separate gene pools, although segregation of the Loch Awe morphs is more subtle than that of Loch Tay. We conclude that the Loch Awe morphs diverged in situ (within the lake), whereas Loch Tay morphs most likely arose through multiple invasions by different ancestral groups that segregated before post-glacial invasion (i.e. in allopatry). Both morph pairs showed clear trophic segregation between planktonic and benthic resources (measured by stable isotope analysis) but this was significantly less distinct in Loch Tay than in Loch Awe. By contrast, both inter-morph morphological and life-history differences were more subtle in Loch Awe than in Loch Tay. The strong ecological but relatively weak morphological and life-history divergence of the in situ derived morphs compared to morphs with allopatric origins indicates a strong link between early ecological and subsequent genetic divergence of sympatric origin emerging species pairs. The emergence of parallel specialisms despite distinct genetic origins of these morph pairs suggests that the effect of available foraging opportunities may be at least as important as genetic origin in structuring sympatric divergence in post-glacial fishes with high levels of phenotypic plasticity. (c) 2012 The Linnean Society of London, Biological Journal of the Linnean Society, 2012, , .

Voices from higher up the ladder:Exploring the team leader role in call centres

This paper focuses on an under-researched employee category in the call centre literature-the team leader. The paper, drawing on data from nine Australian call centres, finds that the team leader role is integral to the effectiveness of call centres, yet it is a role that consists of considerable complexity and contradictions. The research demonstrates the critical role performed by team leaders: coach, mentor, trainer, performance evaluator, communicator and supervisor. It also shows team leaders as being far more positive about many of the features of the call centre work environment compared with those on the front line. However, there does appear to be a need for greater acknowledgement of their challenging role, the contradictions that are inherent in the job and the need, in many cases, for increased support being made available to assist. © 2013 John Wiley & Sons Ltd.

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.

Resemblance of psychotic symptoms and syndromes in affected sibling pairs from the Irish Study of High-Density Schizophrenia Families:evidence for possible etiologic heterogeneity

The authors sought to determine whether the clinical manifestations of schizophrenia and other psychotic disorders are correlated in affected sibling pairs.

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.

Optical Spectroscopy of Unbound Asteroid Pairs

The recently discovered unbound asteroid pairs have been suggested to be the result of the decoupling of binary asteroids formed either through collision processes or, more likely, rotational fission of a rubble-pile asteroid after spin-up (Vokrouhlicky et al. 2008, AJ 136, 280; Pravec et al., 2010, Nature, 466, 1085). Much of the evidence for linkage of the asteroids in each pair relies solely on the backwards integrations of their orbits. We report new results from our continuing spectroscopic survey of the unbound asteroid pairs, including the youngest known pair, (6070) Rhineland - (54827) 2001 NQ8. The survey goal is to determine whether the asteroids in each unbound pair have similar spectra and therefore composition, expected if they have formed from a common parent body. Low-resolution spectroscopy covering the range 0.4-0.95 microns was conducted using the 3.6m ESO NTT+EFOSC2 during 2011-2012 and the 4.2m WHT+ACAM. We have attempted to maintain a high level of consistency between the observations of the components in each pair to ensure that differences in the asteroid spectra are not the result of the observing method or data reduction, but purely caused by compositional differences. Our WHT data indicates that the asteroids of unbound pair 17198 - 229056 exhibit different spectra and have been assigned different taxonomies, A and R respectively. Initial analysis of our data from the NTT suggests that the asteroids in unbound pairs 6070 - 54827 and 38707 - 32957 are likely silicate-dominated asteroids. The components of pair 23998 - 205383 are potentially X-type asteroids. We present final taxonomic classifications and the likelihood of spectral similarity in each pair.