Programa de educação para a saúde desenvolvimento e estimulação infantil

Introdução: A participação activa dos pais e outros cuidadores está relacionada com o conhecimento que estes têm, sendo por isso importante traçar estratégias que promovam a aquisição de conhecimentos. A triagem e detecção precoce de alterações do desenvolvimento infantil são de uma importância premente fazendo o Fisioterapeuta parte da equipa multidisciplinar responsável por tal. Objectivos: Aumentar o grau de conhecimento dos pais e funcionários da instituição, sobre desenvolvimento infantil, da criança dos 0 aos 3 anos e detectar alterações e/ou atrasos no desenvolvimento infantil, presentes e até então não diagnosticados. Amostra: A amostra deste estudo foi constituída por 45 pais com filhos a frequentar a creche do Abrigo, 39 crianças e 11 funcionários. Pais e funcionários responderam a um questionário de levantamento de necessidades e de caracterização sociodemográfica. Houve ainda reuniões com os pais para informação dos resultados das avaliações e uma sessão educativa para pais e funcionários da creche onde foram avaliados conhecimentos antes e depois da sessão. As 39 crianças foram avaliadas através do Teste de Triagem de Desenvolvimento de Denver II. Resultados: A grande maioria dos pais e funcionários querem ter acções de formação na área do desenvolvimento infantil. Das 39 crianças avaliadas, 2 atrasos de desenvolvimento detectados e encaminhados. Relativamente aos pais foi possível observar um aumento de aquisição de conhecimentos na primeira sessão educativa não se tendo observado o mesmo na 2ª sessão. Nos funcionários verificou-se uma aquisição de conhecimentos. Conclusão: A educação para a saúde é primordial nas instituições com crianças sendo o papel do fisioterapeuta integrado na equipa destas instituições, muito importante

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

Mestrado em Engenharia Electrotécnica e de Computadores

Estudo e análise de soluções de acessos Wimax partilhados em cenários residenciais

Mestrado em Engenharia Electrotécnica e de Computadores

The impact of safety politics in the current globalization context

The globalization is a process of economical, social, cultural and political integration motivated by the needs generated by a consumption-orientated society and a set of factors that have led to its development, such as reducing transport costs, the technological advancement and the development of communication networks. However, the phenomenon of globalization has been accompanied by increasing levels of insecurity as a result of various types of threats and transnational crimes that the International Community seeks to control and minimize. Throughout this work, we examined how the globalization process has been developing and how nations are able to maintain security levels consistent with their economical status and social development, without disturbing the normal course of organizations’ economical activity and the well-being of people. From the investigation developed we concluded that, besides the confirmation that economic integration and the opening of markets have influence on internal consumption, market globalization and migrations have been causing modifications in the consumption habits. We also concluded that the security measures implemented by States or by the International Community affect international trade, but do not imply disproportionate costs or significant delays in transactions. Likewise, we concluded that the control measures implemented in international trade are sufficient to ensure the safety of the people and nations, enabling us to confirm two of the three conjectures raised in this study.

Forest fires in Northern region of Portugal: impact on PM levels

Every year European citizens become victims of devastating fires, which are especially disastrous for Southern European countries. Apart from the numerous health and economic consequences, fires generate hazardous pollutants that are introduced into the environment, thus representing serious risks for public health. In that regard, particulate matter (PM) is of amajor concern. Thus, the objectives of thisworkwere to characterize the trend of forest fire occurrences and burnt area during the period of 2005 and 2010 and to study the influence of forest fires on levels of particulatematter PM10 and PM2.5. In 2010, 22,026 forest fires occurred in Portugal. The northern region was the most affected by forest fires, with 27% of occurrences in Oporto district. The annual means of PM10 and PM2.5 concentrations at two urban background sites were 25±14 μg m−3 and 8.2±4.9 μg m−3, and 17±13 μg m−3 and 7.3±5.9 μg m−3, respectively. At both sites the highest levels of PMfractionswere observed during July and August of 2010, corresponding to the periods when majority (66%) of forest fires occurred. Furthermore, PM10 daily limit at the two sites was exceeded during 20 and 5 days, respectively; 56%, and respectively 60% of those exceedances occurred during the forest fire season. Considering that the risks of forest fire ignition and severity are enhanced with elevated temperatures, the climate change might increase the environmental impacts of forest fires.

Supporting real-time distributed computer-controlled systems with multi-hop P-NET networks

Fieldbus communication networks aim to interconnect sensors, actuators and controllers within process control applications. Therefore, they constitute the foundation upon which real-time distributed computer-controlled systems can be implemented. P-NET is a fieldbus communication standard, which uses a virtual token-passing medium-access-control mechanism. In this paper pre-run-time schedulability conditions for supporting real-time traffic with P-NET networks are established. Essentially, formulae to evaluate the upper bound of the end-to-end communication delay in P-NET messages are provided. Using this upper bound, a feasibility test is then provided to check the timing requirements for accessing remote process variables. This paper also shows how P-NET network segmentation can significantly reduce the end-to-end communication delays for messages with stringent timing requirements.

Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems

It is generally challenging to determine end-to-end delays of applications for maximizing the aggregate system utility subject to timing constraints. Many practical approaches suggest the use of intermediate deadline of tasks in order to control and upper-bound their end-to-end delays. This paper proposes a unified framework for different time-sensitive, global optimization problems, and solves them in a distributed manner using Lagrangian duality. The framework uses global viewpoints to assign intermediate deadlines, taking resource contention among tasks into consideration. For soft real-time tasks, the proposed framework effectively addresses the deadline assignment problem while maximizing the aggregate quality of service. For hard real-time tasks, we show that existing heuristic solutions to the deadline assignment problem can be incorporated into the proposed framework, enriching their mathematical interpretation.

A communication support for real-time distributed computer controlled systems

In this paper, we analyse the ability of P-NET [1] fieldbus to cope with the timing requirements of a Distributed Computer Control System (DCCS), where messages associated to discrete events should be made available within a maximum bound time. The main objective of this work is to analyse how the network access and queueing delays, imposed by P-NET’s virtual token Medium Access Control (MAC) mechanism, affect the realtime behaviour of the supported DCCS.

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.

Smart-HOP: a reliable handoff mechanism for mobile wireless sensor networks

Handoff processes, the events where mobile nodes select the best access point available to transfer data, have been well studied in cellular and WiFi networks. However, wireless sensor networks (WSN) pose a new set of challenges due to their simple low-power radio transceivers and constrained resources. This paper proposes smart-HOP, a handoff mechanism tailored for mobile WSN applications. This work provides two important contributions. First, it demonstrates the intrinsic relationship between handoffs and the transitional region. The evaluation shows that handoffs perform the best when operating in the transitional region, as opposed to operating in the more reliable connected region. Second, the results reveal that a proper fine tuning of the parameters, in the transitional region, can reduce handoff delays by two orders of magnitude, from seconds to tens of milliseconds.

Software transactional memory as a building block for parallel embedded realtime systems

The recent trends of chip architectures with higher number of heterogeneous cores, and non-uniform memory/non-coherent caches, brings renewed attention to the use of Software Transactional Memory (STM) as a fundamental building block for developing parallel applications. Nevertheless, although STM promises to ease concurrent and parallel software development, it relies on the possibility of aborting conflicting transactions to maintain data consistency, which impacts on the responsiveness and timing guarantees required by embedded real-time systems. In these systems, contention delays must be (efficiently) limited so that the response times of tasks executing transactions are upper-bounded and task sets can be feasibly scheduled. In this paper we assess the use of STM in the development of embedded real-time software, defending that the amount of contention can be reduced if read-only transactions access recent consistent data snapshots, progressing in a wait-free manner. We show how the required number of versions of a shared object can be calculated for a set of tasks. We also outline an algorithm to manage conflicts between update transactions that prevents starvation.

Improving quality-of-service in wireless sensor networks by mitigating “Hidden-Node Collisions”

Wireless sensor networks (WSNs) emerge as underlying infrastructures for new classes of large-scale networked embedded systems. However, WSNs system designers must fulfill the quality-of-service (QoS) requirements imposed by the applications (and users). Very harsh and dynamic physical environments and extremely limited energy/computing/memory/communication node resources are major obstacles for satisfying QoS metrics such as reliability, timeliness, and system lifetime. The limited communication range of WSN nodes, link asymmetry, and the characteristics of the physical environment lead to a major source of QoS degradation in WSNs-the ldquohidden node problem.rdquo In wireless contention-based medium access control (MAC) protocols, when two nodes that are not visible to each other transmit to a third node that is visible to the former, there will be a collision-called hidden-node or blind collision. This problem greatly impacts network throughput, energy-efficiency and message transfer delays, and the problem dramatically increases with the number of nodes. This paper proposes H-NAMe, a very simple yet extremely efficient hidden-node avoidance mechanism for WSNs. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-hidden nodes that scales to multiple clusters via a cluster grouping strategy that guarantees no interference between overlapping clusters. Importantly, H-NAMe is instantiated in IEEE 802.15.4/ZigBee, which currently are the most widespread communication technologies for WSNs, with only minor add-ons and ensuring backward compatibility with their protocols standards. H-NAMe was implemented and exhaustively tested using an experimental test-bed based on ldquooff-the-shelfrdquo technology, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. H-NAMe effectiveness was also demonstrated in a target tracking application with mobile robots - over a WSN deployment.

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.

Managing contention of software transactional memory in real-time systems

The foreseen evolution of chip architectures to higher number of, heterogeneous, cores, with non-uniform memory and non-coherent caches, brings renewed attention to the use of Software Transactional Memory (STM) as an alternative to lock-based synchronisation. However, STM relies on the possibility of aborting conflicting transactions to maintain data consistency, which impacts on the responsiveness and timing guarantees required by real-time systems. In these systems, contention delays must be (efficiently) limited so that the response times of tasks executing transactions are upperbounded and task sets can be feasibly scheduled. In this paper we defend the role of the transaction contention manager to reduce the number of transaction retries and to help the real-time scheduler assuring schedulability. For such purpose, the contention management policy should be aware of on-line scheduling information.

A traffic differentiation add-on to the IEEE 802.15.4 protocol: implementation and experimental validation over a real-time operating system

The IEEE 802.15.4 is the most widespread used protocol for Wireless Sensor Networks (WSNs) and it is being used as a baseline for several higher layer protocols such as ZigBee, 6LoWPAN or WirelessHART. Its MAC (Medium Access Control) supports both contention-free (CFP, based on the reservation of guaranteed time-slots GTS) and contention based (CAP, ruled by CSMA/CA) access, when operating in beacon-enabled mode. Thus, it enables the differentiation between real-time and best-effort traffic. However, some WSN applications and higher layer protocols may strongly benefit from the possibility of supporting more traffic classes. This happens, for instance, for dense WSNs used in time-sensitive industrial applications. In this context, we propose to differentiate traffic classes within the CAP, enabling lower transmission delays and higher success probability to timecritical messages, such as for event detection, GTS reservation and network management. Building upon a previously proposed methodology (TRADIF), in this paper we outline its implementation and experimental validation over a real-time operating system. Importantly, TRADIF is fully backward compatible with the IEEE 802.15.4 standard, enabling to create different traffic classes just by tuning some MAC parameters.