Partial Covering Arrays: Algorithms and Asymptotics

A covering array $\mathsf{CA}(N;t,k,v)$ is an $N\times k$ array with entries in $\{1, 2, \ldots , v\}$, for which every $N\times t$ subarray contains each $t$-tuple of $\{1, 2, \ldots , v\}^t$ among its rows. Covering arrays find application in interaction testing, including software and hardware testing, advanced materials development, and biological systems. A central question is to determine or bound $\mathsf{CAN}(t,k,v)$, the minimum number $N$ of rows of a $\mathsf{CA}(N;t,k,v)$. The well known bound $\mathsf{CAN}(t,k,v)=O((t-1)v^t\log k)$ is not too far from being asymptotically optimal. Sensible relaxations of the covering requirement arise when (1) the set $\{1, 2, \ldots , v\}^t$ need only be contained among the rows of at least $(1-\epsilon)\binom{k}{t}$ of the $N\times t$ subarrays and (2) the rows of every $N\times t$ subarray need only contain a (large) subset of $\{1, 2, \ldots , v\}^t$. In this paper, using probabilistic methods, significant improvements on the covering array upper bound are established for both relaxations, and for the conjunction of the two. In each case, a randomized algorithm constructs such arrays in expected polynomial time

A verified algorithm enumerating event structures

An event structure is a mathematical abstraction modeling concepts as causality, conflict and concurrency between events. While many other mathematical structures, including groups, topological spaces, rings, abound with algorithms and formulas to generate, enumerate and count particular sets of their members, no algorithm or formulas are known to generate or count all the possible event structures over af inite set of events. We present an algorithm to generate such a family, along with a functional implementation verified using Isabelle/HOL. As byproducts, we obtain a verified enumeration of all possible preorders and partial orders. While the integer sequences counting preorders and partial orders are already listed on OEIS (On-line Encyclopedia of Integer Sequences), the one counting event structures is not. We therefore used our algorithm to submit a formally verified addition, which has been successfully reviewed and is now part of the OEIS.Postprin

Translating promising strategies for bowel and bladder management in spinal cord injury

Loss of control over voiding following spinal cord injury (SCI) impacts autonomy, participation and dignity, and can cause life-threatening complications. The importance of SCI bowel and bladder dysfunction warrants significantly more attention from researchers in the field. To address this gap, key SCI clinicians, researchers, government and private funding organizations met to share knowledge and examine emerging approaches. This report reviews recommendations from this effort to identify and prioritize near-term treatment, investigational and translational approaches to addressing the pressing needs of people with SCI

Optimal Fair Computation

A computation scheme among n parties is fair if no party obtains the computation result unless all other n-1 parties obtain the same result. A fair computation scheme is optimistic if n honest parties can obtain the computation result without resorting to a trusted third party. We prove, for the first time, a tight lower bound on the message complexity of optimistic fair computation for n parties among which n-1 can be malicious in an asynchronous network. We do so by relating the optimal message complexity of optimistic fair computation to the length of the shortest permutation sequence in combinatorics

Rhythmicity in Mice Selected for Extremes in Stress Reactivity: Behavioural, Endocrine and Sleep Changes Resembling Endophenotypes of Major Depression

Dysregulation of the hypothalamic-pituitary-adrenal (HPA) axis, including hyper- or hypo-activity of the stress hormone system, plays a critical role in the pathophysiology of mood disorders such as major depression (MD). Further biological hallmarks of MD are disturbances in circadian rhythms and sleep architecture. Applying a translational approach, an animal model has recently been developed, focusing on the deviation in sensitivity to stressful encounters. This so-called 'stress reactivity' (SR) mouse model consists of three separate breeding lines selected for either high (HR), intermediate (IR), or low (LR) corticosterone increase in response to stressors.In order to contribute to the validation of the SR mouse model, our study combined the analysis of behavioural and HPA axis rhythmicity with sleep-EEG recordings in the HR/IR/LR mouse lines. We found that hyper-responsiveness to stressors was associated with psychomotor alterations (increased locomotor activity and exploration towards the end of the resting period), resembling symptoms like restlessness, sleep continuity disturbances and early awakenings that are commonly observed in melancholic depression. Additionally, HR mice also showed neuroendocrine abnormalities similar to symptoms of MD patients such as reduced amplitude of the circadian glucocorticoid rhythm and elevated trough levels. The sleep-EEG analyses, furthermore, revealed changes in rapid eye movement (REM) and non-REM sleep as well as slow wave activity, indicative of reduced sleep efficacy and REM sleep disinhibition in HR mice.Thus, we could show that by selectively breeding mice for extremes in stress reactivity, clinically relevant endophenotypes of MD can be modelled. Given the importance of rhythmicity and sleep disturbances as biomarkers of MD, both animal and clinical studies on the interaction of behavioural, neuroendocrine and sleep parameters may reveal molecular pathways that ultimately lead to the discovery of new targets for antidepressant drugs tailored to match specific pathologies within MD

Daily rhythms of the sleep-wake cycle

The amount and timing of sleep and sleep architecture (sleep stages) are determined by several factors, important among which are the environment, circadian rhythms and time awake. Separating the roles played by these factors requires specific protocols, including the constant routine and altered sleep-wake schedules. Results from such protocols have led to the discovery of the factors that determine the amounts and distribution of slow wave and rapid eye movement sleep as well as to the development of models to determine the amount and timing of sleep. One successful model postulates two processes. The first is process S, which is due to sleep pressure (and increases with time awake) and is attributed to a 'sleep homeostat'. Process S reverses during slow wave sleep (when it is called process S'). The second is process C, which shows a daily rhythm that is parallel to the rhythm of core temperature. Processes S and C combine approximately additively to determine the times of sleep onset and waking. The model has proved useful in describing normal sleep in adults. Current work aims to identify the detailed nature of processes S and C. The model can also be applied to circumstances when the sleep-wake cycle is different from the norm in some way. These circumstances include: those who are poor sleepers or short sleepers; the role an individual's chronotype (a measure of how the timing of the individual's preferred sleep-wake cycle compares with the average for a population); and changes in the sleep-wake cycle with age, particularly in adolescence and aging, since individuals tend to prefer to go to sleep later during adolescence and earlier in old age. In all circumstances, the evidence that sleep times and architecture are altered and the possible causes of these changes (including altered S, S' and C processes) are examined

Sleep and circadian rhythms in mood disorders

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/65629/1/j.1600-0447.2007.00968.x.pd

The early bee catches the flower - circadian rhythmicity influences learning performance in honey bees, Apis mellifera

Circadian rhythmicity plays an important role for many aspects of honey bees’ lives. However, the question whether it also affects learning and memory remained unanswered. To address this question, we studied the effect of circadian timing on olfactory learning and memory in honey bees Apis mellifera using the olfactory conditioning of the proboscis extension reflex paradigm. Bees were differentially conditioned to odours and tested for their odour learning at four different “Zeitgeber” time points. We show that learning behaviour is influenced by circadian timing. Honey bees perform best in the morning compared to the other times of day. Additionally, we found influences of the light condition bees were trained at on the olfactory learning. This circadian-mediated learning is independent from feeding times bees were entrained to, indicating an inherited and not acquired mechanism. We hypothesise that a co-evolutionary mechanism between the honey bee as a pollinator and plants might be the driving force for the evolution of the time-dependent learning abilities of bees