Cluster de volatilidade no mercado de taxas de câmbio USD/GBP

Mestrado em Controlo de Gestão e dos Negócios

The AIDS epidemic in the Amazon region: a spatial case-control study in Rondonia, Brazil

OBJECTIVE To analyze spatial changes in the risk of AIDS and the relationship between AIDS incidence and socioeconomic variables in the state of Rondonia, Amazon region. METHODS A spatial, population case-control study in Rondonia, Brazil, based on 1,780 cases reported to the Epidemiological Surveillance System and controls based on demographic data from 1987 to 2006. The cases were grouped into five consecutive four-year periods. A generalized additive model was adjusted to the data; the dependent variable was the status of the individuals (case or control), and the independent variables were a bi-dimensional spline of the geographic coordinates and some municipality-level socioeconomic variables. The observed values of the Moran’s I test were compared to a reference distribution of values generated under conditions of spatial randomness. RESULTS AIDS risk shows a marked spatial and temporal pattern. The disease incidence is related to socioeconomic variables at the municipal level in Rondônia, such as urbanization and human capital. The highest incidence rates of AIDS are in municipalities along the BR-364 highway and calculations of the Moran’s I test show positive spatial correlation associated with proximity of the municipality to the highway in the third and fourth periods (p = 0.05). CONCLUSIONS Incidence of the disease is higher in municipalities of greater economic wealth and urbanization, and in those municipalities bisected by Rondônia’s main roads. The rapid development associated with the opening up of once remote regions may be accompanied by an increase in these risks to health.

Optimal virtual cluster-based multiprocessor scheduling

Scheduling of constrained deadline sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal scheduler is hard, and therefore most studies have focused on developing algorithms with good processor utilization bounds. These algorithms can be broadly classified into two categories: partitioned scheduling in which tasks are statically assigned to individual processors, and global scheduling in which each task is allowed to execute on any processor in the platform. In this paper we consider a third, more general, approach called cluster-based scheduling. In this approach each task is statically assigned to a processor cluster, tasks in each cluster are globally scheduled among themselves, and clusters in turn are scheduled on the multiprocessor platform. We develop techniques to support such cluster-based scheduling algorithms, and also consider properties that minimize total processor utilization of individual clusters. In the last part of this paper, we develop new virtual cluster-based scheduling algorithms. For implicit deadline sporadic task systems, we develop an optimal scheduling algorithm that is neither Pfair nor ERfair. We also show that the processor utilization bound of us-edf{m/(2m−1)} can be improved by using virtual clustering. Since neither partitioned nor global strategies dominate over the other, cluster-based scheduling is a natural direction for research towards achieving improved processor utilization bounds.

Dimensioning and worst-case analysis of cluster-tree sensor networks

Modeling the fundamental performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand their behavior under the worst-case conditions and to make the appropriate design choices. This is particular relevant for time-sensitive WSN applications, where the timing behavior of the network protocols (message transmission must respect deadlines) impacts on the correct operation of these applications. In that direction this paper contributes with a methodology based on Network Calculus, which enables quick and efficient worst-case dimensioning of static or even dynamically changing cluster-tree WSNs where the data sink can either be static or mobile. We propose closed-form recurrent expressions for computing the worst-case end-to-end delays, buffering and bandwidth requirements across any source-destination path in a cluster-tree WSN. We show how to apply our methodology to the case of IEEE 802.15.4/ZigBee cluster-tree WSNs. Finally, we demonstrate the validity and analyze the accuracy of our methodology through a comprehensive experimental study using commercially available technology, namely TelosB motes running TinyOS.

Energy efficient scheduling for cluster-tree wireless sensor networks with time-bounded data flows: application to IEEE 802.15.4/ZigBee

Cluster scheduling and collision avoidance are crucial issues in large-scale cluster-tree Wireless Sensor Networks (WSNs). The paper presents a methodology that provides a Time Division Cluster Scheduling (TDCS) mechanism based on the cyclic extension of RCPS/TC (Resource Constrained Project Scheduling with Temporal Constraints) problem for a cluster-tree WSN, assuming bounded communication errors. The objective is to meet all end-to-end deadlines of a predefined set of time-bounded data flows while minimizing the energy consumption of the nodes by setting the TDCS period as long as possible. Sinceeach cluster is active only once during the period, the end-to-end delay of a given flow may span over several periods when there are the flows with opposite direction. The scheduling tool enables system designers to efficiently configure all required parameters of the IEEE 802.15.4/ZigBee beaconenabled cluster-tree WSNs in the network design time. The performance evaluation of thescheduling tool shows that the problems with dozens of nodes can be solved while using optimal solvers.

On the capacity of cluster-tree ZigBee networks

Modeling the fundamental performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand their behavior under worst-case conditions and to make the appropriate design choices. In that direction this paper contributes with an analytical methodology for modeling cluster-tree WSNs where the data sink can either be static or mobile. We assess the validity and pessimism of analytical model by comparing the worst-case results with the values measured through an experimental test-bed based on Commercial-Off- The-Shelf (COTS) technologies, namely TelosB motes running TinyOS.

TDBS: a time division beacon scheduling mechanism for ZigBee cluster-tree wireless sensor networks

Synchronization is a challenging and important issue for time-sensitive Wireless Sensor Networks (WSN) since it requires a mutual spatiotemporal coordination between the nodes. In that concern, the IEEE 802.15.4/ZigBee protocols embody promising technologies for WSNs, but are still ambiguous on how to efficiently build synchronized multiple-cluster networks, specifically for the case of cluster-tree topologies. In fact, the current IEEE 802.15.4/ZigBee specifications restrict the synchronization to beacon-enabled (by the generation of periodic beacon frames) star networks, while they support multi-hop networking in mesh topologies, but with no synchronization. Even though both specifications mention the possible use of cluster-tree topologies, which combine multi-hop and synchronization features, the description on how to effectively construct such a network topology is missing. This paper tackles this issue by unveiling the ambiguities regarding the use of the cluster-tree topology and proposing a synchronization mechanism based on Time Division Beacon Scheduling (TDBS) to build cluster-tree WSNs. In addition, we propose a methodology for efficiently managing duty-cycles in every cluster, ensuring the fairest use of bandwidth resources. The feasibility of the TDBS mechanism is clearly demonstrated through an experimental test-bed based on our open-source implementation of the IEEE 802.15.4/ZigBee protocols.

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.

A time division beacon scheduling mechanism for IEEE 802.15.4/Zigbee cluster-tree wireless sensor networks

While the IEEE 802.15.4/Zigbee protocol stack is being considered as a promising technology for low-cost low-power Wireless Sensor Networks (WSNs), several issues in the standard specifications are still open. One of those ambiguous issues is how to build a synchronized multi-hop cluster-tree network, which is quite suitable for ensuring QoS support in WSNs. In fact, the current IEEE 802.15.4/Zigbee specifications restrict the synchronization in the beacon-enabled mode (by the generation of periodic beacon frames) to star-based networks, while it supports multi-hop networking using the peer-to-peer mesh topology, but with no synchronization. Even though both specifications mention the possible use of cluster-tree topologies, which combine multihop and synchronization features, the description on how to effectively construct such a network topology is missing. This paper tackles this problem, unveils the ambiguities regarding the use of the cluster-tree topology and proposes a synchronization mechanism based on Time Division Beacon Scheduling to construct cluster-tree WSNs. We also propose a methodology for an efficient duty cycle management in each router (cluster-head) of a cluster-tree WSN that ensures the fairest use of bandwidth resources. The feasibility of the proposal is clearly demonstrated through an experimental test bed based on our own implementation of the IEEE 802.15.4/Zigbee protocol.

Collision-free beacon scheduling mechanisms for IEEE 802.15.4/Zigbee cluster-tree wireless sensor networks

The recently standardized IEEE 802.15.4/Zigbee protocol stack offers great potentials for ubiquitous and pervasive computing, namely for Wireless Sensor Networks (WSNs). However, there are still some open and ambiguous issues that turn its practical use a challenging task. One of those issues is how to build a synchronized multi-hop cluster-tree network, which is quite suitable for QoS support in WSNs. In fact, the current IEEE 802.15.4/Zigbee specifications restrict the synchronization in the beacon-enabled mode (by the generation of periodic beacon frames) to star-based networks, while it supports multi-hop networking using the peer-to-peer mesh topology, but with no synchronization. Even though both specifications mention the possible use of cluster-tree topologies, which combine multi-hop and synchronization features, the description on how to effectively construct such a network topology is missing. This paper tackles this problem, unveils the ambiguities regarding the use of the cluster-tree topology and proposes two collision-free beacon frame scheduling schemes. We strongly believe that the results provided in this paper trigger a significant step towards the practical and efficient use of IEEE 802.15.4/Zigbee cluster-tree networks.

Implementation details of the time division beacon scheduling approach for ZigBee cluster-tree networks

This technical report describes the implementation details of the Time Division Beacon Scheduling Approach in IEEE 802.15.4/ZigBee Cluster-Tree Networks. In this technical report we describe the implementation details, focusing on some aspects of the ZigBee Network Layer and the Time Division Beacon Scheduling mechanism. This report demonstrates the feasibility of our approach based on the evaluation of the experimental results. We also present an overview of the ZigBee address and tree-routing scheme.

Real-time communications over cluster-tree sensor networks with mobile sink behaviour

Modelling the fundamental performance limits of wireless sensor networks (WSNs) is of paramount importance to understand the behaviour of WSN under worst case conditions and to make the appropriate design choices. In that direction, this paper contributes with a methodology for modelling cluster tree WSNs with a mobile sink. We propose closed form recurrent expressions for computing the worst case end to end delays, buffering and bandwidth requirements across any source-destination path in the cluster tree assuming error free channel. We show how to apply our theoretical results to the specific case of IEEE 802.15.4/ZigBee WSNs. Finally, we demonstrate the validity and analyze the accuracy of our methodology through a comprehensive experimental study, therefore validating the theoretical results through experimentation.

Temporal trends and spatial distribution of unsafe abortion in Brazil, 1996-2012

OBJECTIVE To analyze temporal trends and distribution patterns of unsafe abortion in Brazil. METHODS Ecological study based on records of hospital admissions of women due to abortion in Brazil between 1996 and 2012, obtained from the Hospital Information System of the Ministry of Health. We estimated the number of unsafe abortions stratified by place of residence, using indirect estimate techniques. The following indicators were calculated: ratio of unsafe abortions/100 live births and rate of unsafe abortion/1,000 women of childbearing age. We analyzed temporal trends through polynomial regression and spatial distribution using municipalities as the unit of analysis. RESULTS In the study period, a total of 4,007,327 hospital admissions due to abortions were recorded in Brazil. We estimated a total of 16,905,911 unsafe abortions in the country, with an annual mean of 994,465 abortions (mean unsafe abortion rate: 17.0 abortions/1,000 women of childbearing age; ratio of unsafe abortions: 33.2/100 live births). Unsafe abortion presented a declining trend at national level (R2: 94.0%, p < 0.001), with unequal patterns between regions. There was a significant reduction of unsafe abortion in the Northeast (R2: 93.0%, p < 0.001), Southeast (R2: 92.0%, p < 0.001) and Central-West regions (R2: 64.0%, p < 0.001), whereas the North (R2: 39.0%, p = 0.030) presented an increase, and the South (R2: 22.0%, p = 0.340) remained stable. Spatial analysis identified the presence of clusters of municipalities with high values for unsafe abortion, located mainly in states of the North, Northeast and Southeast Regions. CONCLUSIONS Unsafe abortion remains a public health problem in Brazil, with marked regional differences, mainly concentrated in the socioeconomically disadvantaged regions of the country. Qualification of attention to women’s health, especially to reproductive aspects and attention to pre- and post-abortion processes, are necessary and urgent strategies to be implemented in the country.

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.

Temporal evolution and spatial distribution of maternal death

OBJECTIVE To analyze the temporal evolution of maternal mortality and its spatial distribution.METHODS Ecological study with a sample made up of 845 maternal deaths in women between 10 and 49 years, registered from 1999 to 2008 in the state of Rio Grande do Sul, Southern Brazil. Data were obtained from Information System on Mortality of Ministry of Health. The maternal mortality ratio and the specific maternal mortality ratio were calculated from records, and analyzed by the Poisson regression model. In the spatial distribution, three maps of the state were built with the rates in the geographical macro-regions, in 1999, 2003, and 2008.RESULTS There was an increase of 2.0% in the period of ten years (95%CI 1.00;1.04; p = 0.01), with no significant change in the magnitude of the maternal mortality ratio. The Serra macro-region presented the highest maternal mortality ratio (1.15, 95%CI 1.08;1.21; p < 0.001). Most deaths in Rio Grande do Sul were of white women over 40 years, with a lower level of education. The time of delivery/abortion and postpartum are times of increased maternal risk, with a greater negative impact of direct causes such as hypertension and bleeding.CONCLUSIONS The lack of improvement in maternal mortality ratio indicates that public policies had no impact on women’s reproductive and maternal health. It is needed to qualify the attention to women’s health, especially in the prenatal period, seeking to identify and prevent risk factors, as a strategy of reducing maternal death.