Influences on sleep-wake behaviour in older adults and community dementia care: Light exposure and partner impact

This project described sleep-wake behaviour in community-dwelling older adults and in community dementia care. It examined the applicability of a newly presented conceptual model (the Multifactorial Influences on Sleep Health model) to evaluate factors influencing sleep in ageing, with a particular focus on the importance of daytime light exposure and the impact of partners.

Optimal sleep-wake scheduling for quickest intrusion detection using sensor networks

We consider the problem of quickest detection of an intrusion using a sensor network, keeping only a minimal number of sensors active. By using a minimal number of sensor devices, we ensure that the energy expenditure for sensing, computation and communication is minimized (and the lifetime of the network is maximized). We model the intrusion detection (or change detection) problem as a Markov decision process (MDP). Based on the theory of MDP, we develop the following closed loop sleep/wake scheduling algorithms: (1) optimal control of Mk+1, the number of sensors in the wake state in time slot k + 1, (2) optimal control of qk+1, the probability of a sensor in the wake state in time slot k + 1, and an open loop sleep/wake scheduling algorithm which (3) computes q, the optimal probability of a sensor in the wake state (which does not vary with time), based on the sensor observations obtained until time slot k. Our results show that an optimum closed loop control on Mk+1 significantly decreases the cost compared to keeping any number of sensors active all the time. Also, among the three algorithms described, we observe that the total cost is minimum for the optimum control on Mk+1 and is maximum for the optimum open loop control on q.

Flap‐Lag Damping in Hover and Forward Flight with a Three‐Dimensional Wake

Prediction of lag damping is difficult owing to the delicate balance of drag, induced drag and Coriolis forces in the in‐plane direction. Moreover, induced drag” is sensitive to dynamic wake, bath shed and trailing components, and thus its prediction requires adequate unsteady‐wake representation. Accordingly, rigid‐blade flap‐lag equations are coupled with a three‐dimensional finite‐state wake model; three isolatcd rotor canfigurations with three, four and five blades are treated over a range of thrust levels, tack numbers, lag frequencies and advance ratios. The investigation includes convergence characteristics of damping with respect to the number of radial shape functions and harmonics of the wake model for multiblade modes of low frequency (< 1/ rev.) to high frequency (> 1/rev.). Predicted flap and lag damping levels are then compared with similar predictions with 1) rigid wake (no unsteady induced now), 2) Loewy lift deficiency and 3) dynamic inflow. The coverage also includes correlations with the measured lag regressive‐mode damping in hover and forward flight and comparisons with similar correlations with dynamic inflow. Lag‐damping predictions with the dynamic wake model are consistently higher than the predictions with the dynamic inflow model; even for the low frequency lag regressive mode, the number of wake harmonics should at least be equal to twice the number of blades.

Tunable Locally-Optimal Geographical Forwarding in Wireless Sensor Networks with Sleep-Wake Cycling Nodes

We consider a wireless sensor network whose main function is to detect certain infrequent alarm events, and to forward alarm packets to a base station, using geographical forwarding. The nodes know their locations, and they sleep-wake cycle, waking up periodically but not synchronously. In this situation, when a node has a packet to forward to the sink, there is a trade-off between how long this node waits for a suitable neighbor to wake up and the progress the packet makes towards the sink once it is forwarded to this neighbor. Hence, in choosing a relay node, we consider the problem of minimizing average delay subject to a constraint on the average progress. By constraint relaxation, we formulate this next hop relay selection problem as a Markov decision process (MDP). The exact optimal solution (BF (Best Forward)) can be found, but is computationally intensive. Next, we consider a mathematically simplified model for which the optimal policy (SF (Simplified Forward)) turns out to be a simple one-step-look-ahead rule. Simulations show that SF is very close in performance to BF, even for reasonably small node density. We then study the end-to-end performance of SF in comparison with two extremal policies: Max Forward (MF) and First Forward (FF), and an end-to-end delay minimising policy proposed by Kim et al. 1]. We find that, with appropriate choice of one hop average progress constraint, SF can be tuned to provide a favorable trade-off between end-to-end packet delay and the number of hops in the forwarding path.

Turbulent near-wake studies behind an infinitely swept wing

The three-dimensional asymmetric turbulent near-Rake behind an infinitely swept wing with GAW(2) airfoil has been investigated at low speeds. The near-wake in the present study is asymmetric because the boundary layers on the top and bottom surfaces of the model develop under different streamwise pressure gradients. Distributions of mean velocity, three turbulent normal stresses, and two important Reynolds shear stresses have been measured using hot-wire anemometry. The profiles of mean velocity and Reynolds shear stress exhibit asymmetry near the trailing edge and seem to have become symmetric within a short distance of 6 trailing edge momentum thicknesses. Results of computation using K-epsilon turbulence model with a simple scheme to predict the near-wake behind the swept wing have also been presented and compared with the experimental data. The agreement of the predicted mean How development with the experiment is fair considering the simplicity of the scheme.

Optimal Sleep-Wake Scheduling for Quickest Intrusion Detection using wireless sensor Networks

We consider the problem of quickest detection of an intrusion using a sensor network, keeping only a minimal number of sensors active. By using a minimal number of sensor devices,we ensure that the energy expenditure for sensing, computation and communication is minimized (and the lifetime of the network is maximized). We model the intrusion detection (or change detection) problem as a Markov decision process (MDP). Based on the theory of MDP, we develop the following closed loop sleep/wake scheduling algorithms: 1) optimal control of Mk+1, the number of sensors in the wake state in time slot k + 1, 2) optimal control of qk+1, the probability of a sensor in the wake state in time slot k + 1, and an open loop sleep/wake scheduling algorithm which 3) computes q, the optimal probability of a sensor in the wake state (which does not vary with time),based on the sensor observations obtained until time slot k.Our results show that an optimum closed loop control onMk+1 significantly decreases the cost compared to keeping any number of sensors active all the time. Also, among the three algorithms described, we observe that the total cost is minimum for the optimum control on Mk+1 and is maximum for the optimum open loop control on q.

A Simple Charge Model for Symmetric Double-Gate MOSFETs Adapted to Gate-Oxide-Thickness Asymmetry

Surface-potential-based compact charge models for symmetric double-gate metal-oxide-semiconductor field-effect transistors (SDG-MOSFETs) are based on the fundamental assumption of having equal oxide thicknesses for both gates. However, for practical devices, there will always be some amount of asymmetry between the gate oxide thicknesses due to process variations and uncertainties, which can affect device performance significantly. In this paper, we propose a simple surface-potential-based charge model, which is applicable for tied double-gate MOSFETs having same gate work function but could have any difference in gate oxide thickness. The proposed model utilizes the unique so-far-unexplored quasi-linear relationship between the surface potentials along the channel. In this model, the terminal charges could be computed by basic arithmetic operations from the surface potentials and applied biases, and thus, it could be implemented in any circuit simulator very easily and extendable to short-channel devices. We also propose a simple physics-based perturbation technique by which the surface potentials of an asymmetric device could be obtained just by solving the input voltage equation of SDG devices for small asymmetry cases. The proposed model, which shows excellent agreement with numerical and TCAD simulations, is implemented in a professional circuit simulator through the Verilog-A interface and demonstrated for a 101-stage ring oscillator simulation. It is also shown that the proposed model preserves the source/drain symmetry, which is essential for RF circuit design.

Relay Selection for Geographical Forwarding in Sleep-Wake Cycling Wireless Sensor Networks

Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. We seek to develop local forwarding algorithms that can be tuned so as to tradeoff the end-to-end delay against a total cost, such as the hop count or total energy. Our approach is to solve, at each forwarding node enroute to the sink, the local forwarding problem of minimizing one-hop waiting delay subject to a lower bound constraint on a suitable reward offered by the next-hop relay; the constraint serves to tune the tradeoff. The reward metric used for the local problem is based on the end-to-end total cost objective (for instance, when the total cost is hop count, we choose to use the progress toward sink made by a relay as the reward). The forwarding node, to begin with, is uncertain about the number of relays, their wake-up times, and the reward values, but knows the probability distributions of these quantities. At each relay wake-up instant, when a relay reveals its reward value, the forwarding node's problem is to forward the packet or to wait for further relays to wake-up. In terms of the operations research literature, our work can be considered as a variant of the asset selling problem. We formulate our local forwarding problem as a partially observable Markov decision process (POMDP) and obtain inner and outer bounds for the optimal policy. Motivated by the computational complexity involved in the policies derived out of these bounds, we formulate an alternate simplified model, the optimal policy for which is a simple threshold rule. We provide simulation results to compare the performance of the inner and outer bound policies against the simple policy, and also against the optimal policy when the source knows the exact number of relays. Observing the good performance and the ease of implementation of the simple policy, we apply it to our motivating problem, i.e., local geographical routing of sporadic alarm packets in a large WSN. We compare the end-to-end performance (i.e., average total delay and average total cost) obtained by the simple policy, when used for local geographical forwarding, against that obtained by the globally optimal forwarding algorithm proposed by Kim et al. 1].

A model for the classification and survey of clock synchronization protocols in WSNs

Clock synchronization in wireless sensor networks (WSNs) assures that sensor nodes have the same reference clock time. This is necessary not only for various WSN applications but also for many system level protocols for WSNs such as MAC protocols, and protocols for sleep scheduling of sensor nodes. Clock value of a node at a particular instant of time depends on its initial value and the frequency of the crystal oscillator used in the sensor node. The frequency of the crystal oscillator varies from node to node, and may also change over time depending upon many factors like temperature, humidity, etc. As a result, clock values of different sensor nodes diverge from each other and also from the real time clock, and hence, there is a requirement for clock synchronization in WSNs. Consequently, many clock synchronization protocols for WSNs have been proposed in the recent past. These protocols differ from each other considerably, and so, there is a need to understand them using a common platform. Towards this goal, this survey paper categorizes the features of clock synchronization protocols for WSNs into three types, viz, structural features, technical features, and global objective features. Each of these categories has different options to further segregate the features for better understanding. The features of clock synchronization protocols that have been used in this survey include all the features which have been used in existing surveys as well as new features such as how the clock value is propagated, when the clock value is propagated, and when the physical clock is updated, which are required for better understanding of the clock synchronization protocols in WSNs in a systematic way. This paper also gives a brief description of a few basic clock synchronization protocols for WSNs, and shows how these protocols fit into the above classification criteria. In addition, the recent clock synchronization protocols for WSNs, which are based on the above basic clock synchronization protocols, are also given alongside the corresponding basic clock synchronization protocols. Indeed, the proposed model for characterizing the clock synchronization protocols in WSNs can be used not only for analyzing the existing protocols but also for designing new clock synchronization protocols. (C) 2014 Elsevier B.V. All rights reserved.

Adaptive Sleep-Wake Control using Reinforcement Learning in Sensor Networks

The aim in this paper is to allocate the `sleep time' of the individual sensors in an intrusion detection application so that the energy consumption from the sensors is reduced, while keeping the tracking error to a minimum. We propose two novel reinforcement learning (RL) based algorithms that attempt to minimize a certain long-run average cost objective. Both our algorithms incorporate feature-based representations to handle the curse of dimensionality associated with the underlying partially-observable Markov decision process (POMDP). Further, the feature selection scheme used in our algorithms intelligently manages the energy cost and tracking cost factors, which in turn assists the search for the optimal sleeping policy. We also extend these algorithms to a setting where the intruder's mobility model is not known by incorporating a stochastic iterative scheme for estimating the mobility model. The simulation results on a synthetic 2-d network setting are encouraging.

The circadian oscillator gene GIGANTEA mediates a long-term response of the Arabidopsis thaliana circadian clock to sucrose.

Circadian clocks are 24-h timing devices that phase cellular responses; coordinate growth, physiology, and metabolism; and anticipate the day-night cycle. Here we report sensitivity of the Arabidopsis thaliana circadian oscillator to sucrose, providing evidence that plant metabolism can regulate circadian function. We found that the Arabidopsis circadian system is particularly sensitive to sucrose in the dark. These data suggest that there is a feedback between the molecular components that comprise the circadian oscillator and plant metabolism, with the circadian clock both regulating and being regulated by metabolism. We used also simulations within a three-loop mathematical model of the Arabidopsis circadian oscillator to identify components of the circadian clock sensitive to sucrose. The mathematical studies identified GIGANTEA (GI) as being associated with sucrose sensing. Experimental validation of this prediction demonstrated that GI is required for the full response of the circadian clock to sucrose. We demonstrate that GI acts as part of the sucrose-signaling network and propose this role permits metabolic input into circadian timing in Arabidopsis.

The wave model of mesothermal plasma near wakes and Korteweg-de Vries equation

The stationary two-dimensional (x, z) near wakes behind a flat-based projectile which moves at a constant mesothermal speed (V∞) along a z-axis in a rarefied, fully ionized, plasma is studied using the wave model previously proposed by one of the authors (VCL). One-fluid theory is used to depict the free expansion of ambient plasma into the vacuum produced behind a fast-moving projectile. This nonstationary, one-dimensional (x, t) flow which is approximated by the K-dV equation can be transformed, through substitution, t=z/V∞, into a stationary two-dimensional (x, z) near wake flow seen by an observer moving with the body velocity (V∞). The initial value problem of the K-dV equation in (x, t) variables is solved by a specially devised numerical method. Comparisons of the present numerical solution for the asymptotically small and large times with available analytical solutions are made and found in satisfactory agreements.

Generalization of the JTZ model to open plane wakes

The JTZ model [C. Jung, T. T¶el and E. Ziemniak, Chaos 3, (1993) 555], as a theoretical model of a plane wake behind a circular cylinder in a narrow channel at a moderate Reynolds number, has previously been employed to analyze phenomena of chaotic scattering. It is ex- tended here to describe an open plane wake without the con¯ned nar- row channel by incorporating a double row of shedding vortices into the intermediate and far wake. The extended JTZ model is found in qualitative agreement with both direct numerical simulations and ex- perimental results in describing streamlines and vorticity contours. To further validate its applications to particle transport processes, the in- teraction between small spherical particles and vortices in an extended JTZ model °ow is studied. It is shown that the particle size has signif- icant in°uences on the features of particle trajectories, which have two characteristic patterns: one is rotating around the vortex centers and the other accumulating in the exterior of vortices. Numerical results based on the extended JTZ model are found in qualitative agreement with experimental ones in the normal range of particle sizes.

Laser-driven coherent betatron oscillation in a laser-wakefield cavity

The origin of beam disparity in emittance and betatron oscillation orbits, in and out of the polarization plane of the drive laser of laser-plasma accelerators, is explained in terms of betatron oscillations driven by the laser field. As trapped electrons accelerate, they move forward and interact with the laser pulse. For the bubble regime, a simple model is presented to describe this interaction in terms of a harmonic oscillator with a driving force from the laser and a restoring force from the plasma wake field. The resulting beam oscillations in the polarization plane, with period approximately the wavelength of the driving laser, increase emittance in that plane and cause microbunching of the beam. These effects are observed directly in 3D particle-in-cell simulations.

Phase noise analysis of a mechanical autonomous impact oscillator with a MEMS resonator

In this paper, phase noise analysis of a mechanical autonomous impact oscillator with a MEMS resonator is performed. Since the circuit considered belongs to the class of hybrid systems, methods based on the variational model for the evaluation of either phase noise or steady state solutions cannot be directly applied. As a matter of fact, the monodromy matrix is not defined at impact events in these systems. By introducing saltation matrices, this limit is overcome and the aforementioned methods are extended. In particular, the unified theory developed by Demir is used to analyze the phase noise after evaluating the asymptotically stable periodic solution of the system by resorting to the shooting method. Numerical results are presented to show how noise sources affect the phase noise performances. © 2011 IEEE.