Shiftworking families: parents' working schedule and sleep patterns of adolescents attending school in two shifts

OBJECTIVE: To explore whether parents' engagement in shift work affects the sleep habits of their adolescent children who attend school in two shifts. METHODS: The data were drawn from an extensive survey of sleep and daytime functioning of adolescents attending school one week in the morning and the other in the afternoon. The participants were 1,386 elementary and high school students (11-18 years old) whose parents were both employed. The data were analyzed using MANOVA, with parents' work schedule, adolescents' gender and type of school as between-subject factors. RESULTS: Parents' working schedule significantly affected the sleep patterns of high school adolescents. When attending school in the morning, adolescents whose parents were both day workers woke up somewhat later than adolescents with one shiftworking parent. In addition, they slept longer than adolescents whose parents were both shift workers. On weekends, adolescents whose parents both worked during the day went to bed earlier than adolescents whose parents were both shiftworkers. They also had smaller bedtime delay on weekends with respect to both morning and afternoon shifts than adolescents for whom one or both parents worked shifts. A significant interaction between parents' working schedule, adolescents' gender and type of school was found for sleep extension on weekends after afternoon shift school. CONCLUSIONS: Parental involvement in shift work has negative effects on the sleep of high school adolescents. It contributes to earlier wake-up time and shorter sleep in a week when adolescents attend school in the morning, as well as to greater bedtime irregularity.

On the use of IEEE 802.15.4/Zigbee for time-sensitive wireless sensor network applications

Mestrado em Engenharia Electrotécnica e de Computadores

Bi-Dimensional Characterization of a Wimax Radio Channel at 3.5GHz

This paper presents the characterization of an indoor Wimax radio channel using the Finite-Difference Time-Domain (FDTD) [1] method complemented with the Convolutional Perfect Matched Layer (CPML) technique [2]. An indoor 2D scenario is simulated in the 3.5GHz band (IEEE 802.16d-2004 and IEEE 802.16e-2005 [3]). In this study, we used two complementary techniques in both analysis, technique A and B for fading based on delay spread and technique C and D for fading based on Doppler spread. Both techniques converge to the same result. Simulated results define the channel as flat, slow and without inter-symbolic interference (ISI), making the application of the spatial diversity the most appropriate scheme.

Maintenance and destrcution of R&D leadership

In the standard Schumpeterian-growth models only follower firms invest in R&D activities and larger economies grow faster. Since these results are counterfactual, this paper reveals that leader firms often support R&D activities and economic growth can be independent of the market size. In particular, the maintenance of R&D leadership increases with: (i) the technological-knowledge gap between leader and followers, since a firm-specific learning effect of accumulated technological knowledge from past R&D is considered, (ii) the leaders’ strategies that delay the next successful R&D supported by some follower firm, (iii) the market size, and (iv) the up-grade of each innovation.

Stability of fractional order systems

The theory and applications of fractional calculus (FC) had a considerable progress during the last years. Dynamical systems and control are one of the most active areas, and several authors focused on the stability of fractional order systems. Nevertheless, due to the multitude of efforts in a short period of time, contributions are scattered along the literature, and it becomes difficult for researchers to have a complete and systematic picture of the present day knowledge. This paper is an attempt to overcome this situation by reviewing the state of the art and putting this topic in a systematic form. While the problem is formulated with rigour, from the mathematical point of view, the exposition intends to be easy to read by the applied researchers. Different types of systems are considered, namely, linear/nonlinear, positive, with delay, distributed, and continuous/discrete. Several possible routes of future progress that emerge are also tackled.

Evaluating the duration of message transactions in broadcast wired/wireless fieldbus networks

Determining the response time of message transactions is one of the major concerns in the design of any distributed computer-controlled system. Such response time is mainly dependent on the medium access delay, the message length and the transmission delay. While the medium access delay in fieldbus networks has been thoroughly studied in the last few years, the transmission delay has been almost ignored as it is considered that it can be neglected when compared to the length of the message itself. Nevertheless, this assumption is no longer valid when considering the case of hybrid wired/wireless fieldbus networks, where the transmission delay through a series of different mediums can be several orders of magnitude longer than the length of the message itself. In this paper, we show how to compute the duration of message transactions in hybrid wired/wireless fieldbus networks. This duration is mainly dependent on the duration of the request and response frames and on the number and type of physical mediums that the frames must cross between initiator and responder. A case study of a hybrid wired/wireless fieldbus network is also presented, where it becomes clear the interest of the proposed approach

An analysis of the impact of bus contention on the WCET in multicores

The use of multicores is becoming widespread inthe field of embedded systems, many of which have real-time requirements. Hence, ensuring that real-time applications meet their timing constraints is a pre-requisite before deploying them on these systems. This necessitates the consideration of the impact of the contention due to shared lowlevel hardware resources like the front-side bus (FSB) on the Worst-CaseExecution Time (WCET) of the tasks. Towards this aim, this paper proposes a method to determine an upper bound on the number of bus requests that tasks executing on a core can generate in a given time interval. We show that our method yields tighter upper bounds in comparison with the state of-the-art. We then apply our method to compute the extra contention delay incurred by tasks, when they are co-scheduled on different cores and access the shared main memory, using a shared bus, access to which is granted using a round-robin arbitration (RR) protocol.

Preemption delay analysis for floating non-preemptive region scheduling

In real-time systems, there are two distinct trends for scheduling task sets on unicore systems: non-preemptive and preemptive scheduling. Non-preemptive scheduling is obviously not subject to any preemption delay but its schedulability may be quite poor, whereas fully preemptive scheduling is subject to preemption delay, but benefits from a higher flexibility in the scheduling decisions. The time-delay involved by task preemptions is a major source of pessimism in the analysis of the task Worst-Case Execution Time (WCET) in real-time systems. Preemptive scheduling policies including non-preemptive regions are a hybrid solution between non-preemptive and fully preemptive scheduling paradigms, which enables to conjugate both world's benefits. In this paper, we exploit the connection between the progression of a task in its operations, and the knowledge of the preemption delays as a function of its progression. The pessimism in the preemption delay estimation is then reduced in comparison to state of the art methods, due to the increase in information available in the analysis.

An improved preemption delay upper bound for floating non-preemptive region

In embedded systems, the timing behaviour of the control mechanisms are sometimes of critical importance for the operational safety. These high criticality systems require strict compliance with the offline predicted task execution time. The execution of a task when subject to preemption may vary significantly in comparison to its non-preemptive execution. Hence, when preemptive scheduling is required to operate the workload, preemption delay estimation is of paramount importance. In this paper a preemption delay estimation method for floating non-preemptive scheduling policies is presented. This work builds on [1], extending the model and optimising it considerably. The preemption delay function is subject to a major tightness improvement, considering the WCET analysis context. Moreover more information is provided as well in the form of an extrinsic cache misses function, which enables the method to provide a solution in situations where the non-preemptive regions sizes are small. Finally experimental results from the implementation of the proposed solutions in Heptane are provided for real benchmarks which validate the significance of this work.

Dynamic analysis of earthquake phenomena by means of pseudo phase plane

This paper analyses earthquake data in the perspective of dynamical systems and its Pseudo Phase Plane representation. The seismic data is collected from the Bulletin of the International Seismological Centre. The geological events are characterised by their magnitude and geographical location and described by means of time series of sequences of Dirac impulses. Fifty groups of data series are considered, according to the Flinn-Engdahl seismic regions of Earth. For each region, Pearson’s correlation coefficient is used to find the optimal time delay for reconstructing the Pseudo Phase Plane. The Pseudo Phase Plane plots are then analysed and characterised.

Analysis of the respiratory dynamics during normal breathing by means of pseudo phase plots and pressure-volume loops

This paper reports on the analysis of tidal breathing patterns measured during noninvasive forced oscillation lung function tests in six individual groups. The three adult groups were healthy, with prediagnosed chronic obstructive pulmonary disease, and with prediagnosed kyphoscoliosis, respectively. The three children groups were healthy, with prediagnosed asthma, and with prediagnosed cystic fibrosis, respectively. The analysis is applied to the pressure–volume curves and the pseudophaseplane loop by means of the box-counting method, which gives a measure of the area within each loop. The objective was to verify if there exists a link between the area of the loops, power-law patterns, and alterations in the respiratory structure with disease. We obtained statistically significant variations between the data sets corresponding to the six groups of patients, showing also the existence of power-law patterns. Our findings support the idea that the respiratory system changes with disease in terms of airway geometry and tissue parameters, leading, in turn, to variations in the fractal dimension of the respiratory tree and its dynamics.

Quality-of-service in wireless sensor networks: state-of-the-art and future directions

Wireless sensor networks (WSNs) are one of today’s most prominent instantiations of the ubiquituous computing paradigm. In order to achieve high levels of integration, WSNs need to be conceived considering requirements beyond the mere system’s functionality. While Quality-of-Service (QoS) is traditionally associated with bit/data rate, network throughput, message delay and bit/packet error rate, we believe that this concept is too strict, in the sense that these properties alone do not reflect the overall quality-ofservice provided to the user/application. Other non-functional properties such as scalability, security or energy sustainability must also be considered in the system design. This paper identifies the most important non-functional properties that affect the overall quality of the service provided to the users, outlining their relevance, state-of-the-art and future research directions.

Simulation study of energy efficient scheduling for IEEE 802.15.4/ZigBee cluster-treeWireless Sensor Networks with time-bounded data flows

The simulation analysis is important approach to developing and evaluating the systems in terms of development time and cost. This paper demonstrates the application of Time Division Cluster Scheduling (TDCS) tool for the configuration of IEEE 802.15.4/ZigBee beaconenabled cluster-tree WSNs using the simulation analysis, as an illustrative example that confirms the practical applicability of the tool. The simulation study analyses how the number of retransmissions impacts the reliability of data transmission, the energy consumption of the nodes and the end-to-end communication delay, based on the simulation model that was implemented in the Opnet Modeler. The configuration parameters of the network are obtained directly from the TDCS tool. The simulation results show that the number of retransmissions impacts the reliability, the energy consumption and the end-to-end delay, in a way that improving the one may degrade the others.

Delay-bounded medium access for unidirectional wireless links

Consider a wireless network where links may be unidirectional, that is, a computer node A can broadcast a message and computer node B will receive this message but if B broadcasts then A will not receive it. Assume that messages have deadlines. We propose a medium access control (MAC) protocol which replicates a message in time with carefully selected pauses between replicas, and in this way it guarantees that for every message at least one replica of that message is transmitted without collision. The protocol ensures this with no knowledge of the network topology and it requires neither synchronized clocks nor carrier sensing capabilities. We believe this result is significant because it is the only MAC protocol that offers an upper bound on the message queuing delay for unidirectional links without relying on synchronized clocks.

Modeling and worst-case dimensioning of cluster-tree wireless sensor networks

Time-sensitive Wireless Sensor Network (WSN) applications require finite delay bounds in critical situations. This paper provides a methodology for the modeling and the worst-case dimensioning of cluster-tree WSNs. We provide a fine model of the worst-case cluster-tree topology characterized by its depth, the maximum number of child routers and the maximum number of child nodes for each parent router. Using Network Calculus, we derive “plug-and-play” expressions for the endto- end delay bounds, buffering and bandwidth requirements as a function of the WSN cluster-tree characteristics and traffic specifications. The cluster-tree topology has been adopted by many cluster-based solutions for WSNs. We demonstrate how to apply our general results for dimensioning IEEE 802.15.4/Zigbee cluster-tree WSNs. We believe that this paper shows the fundamental performance limits of cluster-tree wireless sensor networks by the provision of a simple and effective methodology for the design of such WSNs.