Initial validation of the Behavioral Indicators of Infant Pain (BIIP)

Accurate pain assessment in preterm infants in the neonatal intensive care unit (NICU) is complex. Infants who are born at early gestational ages (GA), and who have had greater early pain exposure, have dampened facial responses which may lead to under-treatment. Since behavioral and physiological responses to pain in infants are often dissociated, using multidimensional scales which combine these indicators into a single score may limit our ability to determine the effects of interventions on each system. Our aim was to design a unidimensional scale which would combine the relatively most specific, individual, behavioral indicators for assessing acute pain in this population. The Behavioral Indicators of Infant Pain (BIIP) combines sleep/wake states, 5 facial actions and 2 hand actions. Ninety-two infants born between 23 and 32 weeks GA were assessed during 3, 1 min Phases of blood collection. Outcome measures included changes in BIIP and in Neonatal Infant Pain Scale (NIPS) scores coded in real time from continuous bedside video recordings; changes in heart rate (HR) were obtained using custom physiological processing software. Scores on the BIIP changed significantly across Phases of blood collection (p

Bedside application of the Neonatal Facial Coding System in pain assessment of premature neonates

Assessment of infant pain is a pressing concern, especially within the context of neonatal intensive care where infants may be exposed to prolonged and repeated pain during lengthy hospitalization. In the present study the feasibility of carrying out the complete Neonatal Facial Coding System (NFCS) in real time at bedside, specifically reliability, construct and concurrent validity, was evaluated in a tertiary level Neonatal Intensive Care Unit (NICU). Heel lance was used as a model of procedural pain, and observed with n = 40 infants at 32 weeks gestational age. Infant sleep/wake state, NFCS facial activity and specific hand movements were coded during baseline, unwrap, swab, heel lance, squeezing and recovery events. Heart rate was recorded continuously and digitally sampled using a custom designed computer system. Repeated measures analysis of variance (ANOVA) showed statistically significant differences across events for facial activity (P <0.0001) and heart rate (P <0.0001). Planned comparisons showed facial activity unchanged during baseline, swab and unwrap, then increased significantly during heel lance (P <0.0001), increased further during squeezing (P <0.003), then decreased during recovery (P <0.0001). Systematic shifts in sleep/wake state were apparent. Rise in facial activity was consistent with increased heart rate, except that facial activity more closely paralleled initiation of the invasive event. Thus facial display was more specific to tissue damage compared with heart rate. Inter-observer reliability was high. Construct validity of the NFCS at bedside was demonstrated as invasive procedures were distinguished from tactile. While bedside coding of behavior does not permit raters to be blind to events, mechanical recording of heart rate allowed for an independent source of concurrent validation for bedside application of the NFCS scale.

Effects of oscillatory flow on fertilization in the green sea urchin Strongylocentrotus droebachiensis

Broadcast spawning invertebrates that live in shallow, high-energy coastal habitats are subjected to oscillatory water motion that creates unsteady flow fields above the surface of animals. The frequency of the oscillatory fluctuations is driven by the wave period, which will influence the stability of local flow structures and may affect fertilization processes. Using an oscillatory water tunnel, we quantified the percentage of eggs fertilized on or near spawning green sea urchins, Strongylocentrotus droebachiensis. Eggs were sampled in the water column, wake eddy, substratum and aboral surface under a range of different periods (T = 4.5 – 12.7 s) and velocities of oscillatory flow. The root-mean-square wave velocity (rms(uw)) was a good predictor of fertilization in oscillatory flow, although the root-mean-square of total velocity (rms(u)), which incorporates all the components of flow (current, wave and turbulence), also provided significant predictions. The percentage of eggs fertilized varied between 50 – 85% at low flows (rms(uw) < 0.02 m s-1), depending on the location sampled, but declined to below 10% for most locations at higher rms(uw). The water column was an important location for fertilization with a relative contribution greater than that of the aboral surface, especially at medium and high rms(uw) categories. We conclude that gametes can be successfully fertilized on or near the parent under a range of oscillatory flow conditions.

Rhythm, Rhymes, and Pleasure: Mesostics on Ciaran Carson's The Star Factory

A set of 138 "mesostics" from Ciaran Carson's novel "The Star Factory" poems derived from the chance determination procedure devised by John Cage and set out in the score of his "Roaratorio: An Irish Circus on Finnegan's Wake," a musical realisation of James Joyce's novel 'Finnegan's Wake." The publication forms part of a portfolio on the project "Owenvarragh: A belfast Circus on The Star Factory", published in the special John Cage issue of this journal.

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.

Relative Effects of Gamete Compatibility and Hydrodynamics on Fertilization in the Green Sea Urchin Strongylocentrotus droebachiensis

Intraspecific variation in gamete compatibility among male/female pairs causes variation in the concentration of sperm required to achieve equivalent fertilization levels. Gamete compatibility is therefore potentially an important factor controlling mating success. Many broadcast-spawning marine invertebrates, however, also live in a dynamic environment where hydrodynamic conditions can affect the concentration of sperm reaching eggs during spawning. Thus flow conditions may moderate the effects of gamete compatibility on fertilization. Using the green sea urchin Strongylocentrotus droebachiensis as a model system, we assessed the relative effects of gamete compatibility (the concentration of sperm required to fertilize 50% of the eggs in specific male/female pairs; F50) and the root-mean-square of total velocity (urms; 0.01-0.11 m s(-1)) on fertilization in four locations near a spawning female (water column, wake eddy, substratum, and aboral surface) in both unidirectional and oscillatory flows. Percent fertilization decreased significantly with increasing urms at all locations and both flow regimes. However, although gamete compatibility varied by almost 1.5 orders of magnitude, it was not a significant predictor of fertilization for most combinations of position and flow. The notable exception was a significant effect of gamete compatibility on fertilization on the aboral surface under unidirectional flow. Our results suggest that selection on variation in gamete compatibility may be strongest in eggs fertilized on the aboral surface of sea urchins and that hydrodynamic conditions may add environmental noise to selection outcomes.

Decadent Conservatism: Politics and Aesthetics in The Senate

The relationship between late-Victorian Decadence and Aestheticism and politics has long been vexed. This article explores the hitherto under-explored confluence of conservatism and avant-garde literature in the period by introducing The Senate, a Tory-Decadent journal that ran from 1894-7. While Decadent authors occupied various political positions, this article argues that The Senate offers a crucial link between conservatism and Decadence The article presents the journal in its political and publishing context, outlining its editorial position on such issues as the Liberal Unionist-Conservative coalition governments, Britain's relationship with Europe and the threat of ‘State Socialism’, as well as its valorisation of Bollingbroke and eighteenth-century Toryism, and its relationship to, and difference from, key Decadent journals the Yellow Book and The Savoy. It then goes on to articulate its relationship to Decadence by focussing on the presence of Paul Verlaine in its pages and its vitriolic response to the press coverage of Oscar Wilde's trials. The article concludes by exploring the surprising wake of The Senate, briefly tracing the editors' influence in the development of Modernism and links with the journal BLAST.

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.

Transition Between Open and Closed Wake in 3D Linear Aerospike Nozzles

Linear aerospike nozzles are envisaged as a possible device able to improve launcher engine performance. One of the most interesting properties of these nozzles is the possibility of a good integration with the vehicle. Tb improve the knowledge of the flow-field and performance of aerospike nozzles, they are studied numerically, with particular attention to the differences between the basic two-dimensional nozzle, usually considered in the design phase, and the more realistic three-dimensional nozzle. The study considers different plug lengths and ambient pressures to assess the role of the linear plug side truncation on the base pressure behavior. Numerical tests are carried out at supersonic flight Mach number. Copyright © 2005 by M. Geron and R. Paciorri.F. Nasuti, F. Sabetta, E. Martelli.

Non-contact Pressure-based Sleep/Wake Discrimination

Poor sleep is increasingly being recognised as an important prognostic parameter of health. For those with suspected sleep disorders, patients are referred to sleep clinics which guide treatment. However, sleep clinics are not always a viable option due to their high cost, a lack of experienced practitioners, lengthy waiting lists and an unrepresentative sleeping environment. A home-based non-contact sleep/wake monitoring system may be used as a guide for treatment potentially stratifying patients by clinical need or highlighting longitudinal changes in sleep and nocturnal patterns. This paper presents the evaluation of an under-mattress sleep monitoring system for non-contact sleep/wake discrimination. A large dataset of sensor data with concomitant sleep/wake state was collected from both younger and older adults participating in a circadian sleep study. A thorough training/testing/validation procedure was configured and optimised feature extraction and sleep/wake discrimination algorithms evaluated both within and across the two cohorts. An accuracy, sensitivity and specificity of 74.3%, 95.5%, and 53.2% is reported over all subjects using an external validation
dataset (71.9%, 87.9% and 56%, and 77.5%, 98% and 57% is reported for younger and older subjects respectively). These results compare favourably with similar research, however this system provides an ambient alternative suitable for long term continuous sleep monitoring, particularly amongst vulnerable populations.