Up close and personal: A qualitative study exploring the lived experience of older carers. Mental Health and Learning Disabilities Research. 8 (1). Pp.15-29.

This study explored the experiences of informal carers who were aged 65 years and over. It has been estimated that 15 per cent of those aged 65 or over provide some form of informal care in England. Despite a growing literature on the involvement of older people in research, there is a paucity of literature on the involvement of older carers. In this study, older carers were identified via a General Practice (GP) register in one urban medical practice. Data was collected through a series of focus groups, which were transcribed and analysed using
thematic analysis. Every carer aged 55 or over and registered with the medical practice was invited to take part in the study. Four female carers and one male carer took part in the study (age range 65-83). Themes that emerged during data analysis included, 1) managing things in an emergency, 2) feeling valued because they took part in the research and 3) the day-to-day reality of living with social exclusion. GP registers provide a valuable tool for identifying older
carers who may otherwise be difficult to engage in research. However, persuading GPs to engage with qualitative research may be a challenge.

Holding parties responsible at election time: Multi-level, multi-party government and electoral accountability

This paper highlights the crucial role played by party-specific responsibility attributions in performance-based voting. Three models of electoral accountability, which make distinct assumptions regarding citizens' ability to attribute responsibility to distinct governing parties, are tested in the challenging Northern Ireland context - an exemplar case of multi-level multi-party government in which expectations of performance based voting are low. The paper demonstrates the operation of party-attribution based electoral accountability, using data from the 2011 Northern Ireland Assembly Election Study. However, the findings are asymmetric: accountability operates in the Protestant/unionist bloc but not in the Catholic/nationalist bloc. This asymmetry may be explained by the absence of clear ethno-national ideological distinctions between the unionist parties (hence providing political space for performance based accountability to operate) but the continued relevance in the nationalist bloc of ethno-national difference (which limits the scope for performance politics). The implications of the findings for our understanding of the role of party-specific responsibility attribution in performance based models of voting, and for our evaluation of the quality of democracy in post-conflict consociational polities, are discussed. 

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.

Michael Allen: Close Readings: Essays on Irish Poetry

The late Michael Allen was a member of the famous Belfast Group, and one of the most authoritative critical voices on poetry from Northern Ireland, intimately part of the North’s poetic movement since the early 1960s. He taught at Queen’s University, where he was a colleague of Seamus Heaney and tutor to poets such as Paul Muldoon and Medbh McGuckian. Seamus Heaney called him ‘the reader over my shoulder’. Close Readings brings together interlinked critical writings which have crucially influenced approaches to Irish poetry during the last forty years. The book ends with an extended essay, hitherto unpublished: ‘Doubles, Twins and the Feminine: Development in the Poetry of Michael Longley’.

Close Readings contains a Foreword by Fran Brearton, which relates Michael Allen’s essays to continuing critical and cultural debates. Edna Longley’s Afterword offers a personal view of Allen’s involvement with poetry in Belfast.

Fast Byzantine Leader Election in Dynamic Networks

We study the fundamental Byzantine leader election problem in dynamic networks where the topology can change from round to round and nodes can also experience heavy {\em churn} (i.e., nodes can join and leave the network continuously over time). We assume the full information model where the Byzantine nodes have complete knowledge about the entire state of the network at every round (including random choices made by all the nodes), have unbounded computational power and can deviate arbitrarily from the protocol. The churn is controlled by an adversary that has complete knowledge and control over which nodes join and leave and at what times and also may rewire the topology in every round and has unlimited computational power, but is oblivious to the random choices made by the algorithm. Our main contribution is an $O(\log^3 n)$ round algorithm that achieves Byzantine leader election under the presence of up to $O({n}^{1/2 - \epsilon})$ Byzantine nodes (for a small constant $\epsilon > 0$) and a churn of up to \\$O(\sqrt{n}/\poly\log(n))$ nodes per round (where $n$ is the stable network size).The algorithm elects a leader with probability at least $1-n^{-\Omega(1)}$ and guarantees that it is an honest node with probability at least $1-n^{-\Omega(1)}$; assuming the algorithm succeeds, the leader's identity will be known to a $1-o(1)$ fraction of the honest nodes. Our algorithm is fully-distributed, lightweight, and is simple to implement. It is also scalable, as it runs in polylogarithmic (in $n$) time and requires nodes to send and receive messages of only polylogarithmic size per round.To the best of our knowledge, our algorithm is the first scalable solution for Byzantine leader election in a dynamic network with a high rate of churn; our protocol can also be used to solve Byzantine agreement in a straightforward way.We also show how to implement an (almost-everywhere) public coin with constant bias in a dynamic network with Byzantine nodes and provide a mechanism for enabling honest nodes to store information reliably in the network, which might be of independent interest.

A Correlation Between Host Star Activity and Planet Mass for Close-in Extrasolar Planets?

The activity levels of stars are influenced by several stellar properties, such as stellar rotation, spectral type, and the presence of stellar companions. Analogous to binaries, planetary companions are also thought to be able to cause higher activity levels in their host stars, although at lower levels. Especially in X-rays, such influences are hard to detect because coronae of cool stars exhibit a considerable amount of intrinsic variability. Recently, a correlation between the mass of close-in exoplanets and their host star's X-ray luminosity has been detected, based on archival X-ray data from the ROSAT All-Sky Survey. This finding has been interpreted as evidence for star-planet interactions. We show in our analysis that this correlation is caused by selection effects due to the flux limit of the X-ray data used and due to the intrinsic planet detectability of the radial velocity method, and thus does not trace possible planet-induced effects. We also show that the correlation is not present in a corresponding complete sample derived from combined XMM-Newton and ROSAT data.

The Northern Ireland Assembly Election 2011

Following the first full term of regional government in the province since 1972, the Northern Ireland Assembly election held on 5 May 2011 saw the continuation of several trends. Foremost, the Democratic Unionist Party and Sinn Féin bolstered further their positions as leaders of their respective communities, with the Social Democratic and Labour Party and Ulster Unionist Party losing yet more ground. Building on their decision to enter power-sharing government together in 2007, the two largest parties framed themselves as the progressive choice for voters. As this was the first Assembly election since St Andrews (2006), much of the campaign dialogue centred on the prospect of a Sinn Féin First Minister, a concern highlighted by both unionist parties. The campaign also focused on ‘normal’ socio-economic political issues and possible institutional reform. The absence of inter-party conflict led to the campaign being perceived as the most mundane in living memory, with fears of a record low turnout realised.

The time-dependent close-coupling method for atomic and molecular collision processes

We review the development of the time-dependent close-coupling method to study atomic and molecular few body dynamics. Applications include electron and photon collisions with atoms, molecules, and their ions.