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.

The significance of bruising in the pre-mobile infant

The majority of children in our society are loved andcherished. The occasional cases of intentional injury to a childresulting in death or significant harm evoke powerful anduncomfortable feelings (Devaney et al, 2013), and the publicoutcry may result in health and social workers facing criticism.Identifying whether an infant is at risk of abuse is a challengefor practitioners, and can be a source of stress and anxiety(Brandon et al, 2011). Bruising is a strong indicator of childabuse involving intentional injury (Kemp et al, 2014). Theincidence of bruising correlates to developmental stage, withnon-mobile infants least likely to incur bruising. Therefore, itspresence in pre-mobile infants requires immediate assessment.A search of the literature around bruising in pre-mobile infantsrevealed themes of missed opportunities for early intervention,the role of the father in the family and the significance of childdevelopment. Sharing of knowledge and expertise within themultidisciplinary team is key to safeguarding infants.

Footprints in the sand: a persistent spatial impression of fishing in a mobile groundfish assemblage

Fishing is well known to curtail the size distribution of fish populations. This paper reports the discovery of small-scale spatial patterns in length appearing in several exploited species of Celtic Sea demersal 'groundfish'. These patterns match well with spatial distributions of fishing activity, estimated from vessel monitoring records taken over a period of 6 years, suggesting that this 'mobile' fish community retains a persistent impression of local-scale fishing pressure. An individual random-walk model of fish movement best matched these exploitation 'footprints' with individual movement rates set to <35 km per year. We propose that Celtic Sea groundfish may have surprisingly low movement rates for much of the year, such that fishing impact is spatially heterogeneous and related to local fishing intensity.

Towards a Mobile Assistive Technology for Monitoring and Assessing Cognitive Fatigue in Individuals with Acquired Brain Injury

Those living with an acquired brain injury often have issues with fatigue due to factors resulting from the injury. Cognitive impairments such as lack of memory, concentration and planning have a great impact on an individual’s ability to carry out general everyday tasks, which subsequently has the effect of inducing cognitive fatigue. Moreover, there is difficulty in assessing cognitive fatigue, as there are no real biological markers that can be measured. Rather, it is a very subjective effect that can only be diagnosed by the individual. Consequently, the traditional way of assessing cognitive fatigue is to use a self-assessment questionnaire that is able to determine contributing factors. State of the art methods to evaluate cognitive! fa tigue employ cognitive tests in order to analyse performance on predefined tasks. However, one primary issue with such tests is that they are typically carried out in a clinical environment, therefore do not have the ability to be utilized in situ within everyday life. This paper presents a smartphone application for the evaluation of fatigue, which can be used daily to track cognitive performance in order to assess the influence of fatigue.

A Fast Algorithm for Sparse Support Vector Machines for Mobile Computing Applications

This research presents a fast algorithm for projected support vector machines (PSVM) by selecting a basis vector set (BVS) for the kernel-induced feature space, the training points are projected onto the subspace spanned by the selected BVS. A standard linear support vector machine (SVM) is then produced in the subspace with the projected training points. As the dimension of the subspace is determined by the size of the selected basis vector set, the size of the produced SVM expansion can be specified. A two-stage algorithm is derived which selects and refines the basis vector set achieving a locally optimal model. The model expansion coefficients and bias are updated recursively for increase and decrease in the basis set and support vector set. The condition for a point to be classed as outside the current basis vector and selected as a new basis vector is derived and embedded in the recursive procedure. This guarantees the linear independence of the produced basis set. The proposed algorithm is tested and compared with an existing sparse primal SVM (SpSVM) and a standard SVM (LibSVM) on seven public benchmark classification problems. Our new algorithm is designed for use in the application area of human activity recognition using smart devices and embedded sensors where their sometimes limited memory and processing resources must be exploited to the full and the more robust and accurate the classification the more satisfied the user. Experimental results demonstrate the effectiveness and efficiency of the proposed algorithm. This work builds upon a previously published algorithm specifically created for activity recognition within mobile applications for the EU Haptimap project [1]. The algorithms detailed in this paper are more memory and resource efficient making them suitable for use with bigger data sets and more easily trained SVMs.

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.

Event-driven implicit authentication for mobile access control

In order to protect user privacy on mobile devices, an event-driven implicit authentication scheme is proposed in this paper. Several methods of utilizing the scheme for recognizing legitimate user behavior are investigated. The investigated methods compute an aggregate score and a threshold in real-time to determine the trust level of the current user using real data derived from user interaction with the device. The proposed scheme is designed to: operate completely in the background, require minimal training period, enable high user recognition rate for implicit authentication, and prompt detection of abnormal activity that can be used to trigger explicitly authenticated access control. In this paper, we investigate threshold computation through standard deviation and EWMA (exponentially weighted moving average) based algorithms. The result of extensive experiments on user data collected over a period of several weeks from an Android phone indicates that our proposed approach is feasible and effective for lightweight real-time implicit authentication on mobile smartphones.

Effective collision strengths for election impact excitation of Cl III

Effective collision strengths for electron-impact excitation of the phosphorus-like ion Cl III are presented for all fine-structure transitions among the levels arising from the lowest 23 LS states. The collisional cross sections are computed in the multichannel close-coupling R-matrix approximation, where sophisticated configuration-interaction wave functions are used to represent the target states. The 23 LS states are formed from the basis configurations 3s²3p³, 3s3p⁴, 3s²3p²3d, and 3s²3p²4s, and correspond to 49 fine-structure levels, leading to a total possible 1176 fine-structure transitions. The effective collision strengths, obtained by averaging the electron collision strengths over a Maxwellian distribution of electron velocities, are tabulated in this paper for all 1176 transitions and for electron temperatures in the ranges T(K)=7500-25,000 and log T(K)=4.4-5.4. The former range encompasses the temperatures of particular importance for application to gaseous nebulae, while the latter range is more applicable to the study of solar and laboratory-type plasmas. © 2001 Academic Press.