Predicting sprint running times from isokinetic and squat lift tests: A regression analysis

This study examined the relationship between isokinetic hip extensor/hip flexor strength, 1-RM squat strength, and sprint running performance for both a sprint-trained and non-sprint-trained group. Eleven male sprinters and 8 male controls volunteered for the study. On the same day subjects ran 20-m sprints from both a stationary start and with a 50-m acceleration distance, completed isokinetic hip extension/flexion exercises at 1.05, 4.74, and 8.42 rad.s(-1), and had their squat strength estimated. Stepwise multiple regression analysis showed that equations for predicting both 20-m maximum velocity nm time and 20-m acceleration time may be calculated with an error of less than 0.05 sec using only isokinetic and squat strength data. However, a single regression equation for predicting both 20-m acceleration and maximum velocity run times from isokinetic or squat tests was not found. The regression analysis indicated that hip flexor strength at all test velocities was a better predictor of sprint running performance than hip extensor strength.

Real-time detection of pneumothorax using electrical impedance tomogyaphy

Objectives: Pneumothorax is a frequent complication during mechanical ventilation. Electrical impedance tomography (EIT) is a noninvasive tool that allows real-time imaging of regional ventilation. The purpose of this study was to 1) identify characteristic changes in the EIT signals associated with pneumothoraces; 2) develop and fine-tune an algorithm for their automatic detection; and 3) prospectively evaluate this algorithm for its sensitivity and specificity in detecting pneumothoraces in real time. Design: Prospective controlled laboratory animal investigation. Setting: Experimental Pulmonology Laboratory of the University of Sao Paulo. Subjects: Thirty-nine anesthetized mechanically ventilated supine pigs (31.0 +/- 3.2 kg, mean +/- SD). Interventions. In a first group of 18 animals monitored by EIT, we either injected progressive amounts of air (from 20 to 500 mL) through chest tubes or applied large positive end-expiratory pressure (PEEP) increments to simulate extreme lung overdistension. This first data set was used to calibrate an EIT-based pneumothorax detection algorithm. Subsequently, we evaluated the real-time performance of the detection algorithm in 21 additional animals (with normal or preinjured lungs), submitted to multiple ventilatory interventions or traumatic punctures of the lung. Measurements and Main Results: Primary EIT relative images were acquired online (50 images/sec) and processed according to a few imaging-analysis routines running automatically and in parallel. Pneumothoraces as small as 20 mL could be detected with a sensitivity of 100% and specificity 95% and could be easily distinguished from parenchymal overdistension induced by PEEP or recruiting maneuvers, Their location was correctly identified in all cases, with a total delay of only three respiratory cycles. Conclusions. We created an EIT-based algorithm capable of detecting early signs of pneumothoraces in high-risk situations, which also identifies its location. It requires that the pneumothorax occurs or enlarges at least minimally during the monitoring period. Such detection was operator-free and in quasi real-time, opening opportunities for improving patient safety during mechanical ventilation.

In-shoe plantar pressure distribution during running on natural grass and asphalt in recreational runners

The type of surface used for running can influence the load that the locomotor apparatus will absorb and the load distribution could be related to the incidence of chronic injuries. As there is no consensus on how the locomotor apparatus adapts to loads originating from running Surfaces with different compliance, the objective of this study was to investigate how loads are distributed over the plantar surface while running on natural grass and on a rigid surface-asphalt. Forty-four adult runners with 4 3 years of running experience were evaluated while running at 12 km/h for 40 m wearing standardised running shoes and Pedar insoles (Novel). Peak pressure, contact time and contact area were measured in six regions: lateral, central and medial rearfoot, midfoot, lateral and media] forefoot. The Surfaces and regions were compared by three ANOVAS (2 x 6). Asphalt and natural grass were statistically different in all variables. Higher peak pressures were observed on asphalt at the central (p < 0.001) [grass: 303.8(66.7) kPa; asphalt: 342.3(76.3) kPa] and lateral rearfoot (p < 0.001) [grass: 312.7(75.8) kPa: asphalt: 350.9(98.3) kPa] and lateral forefoot (p < 0.001) [grass: 221.5(42.9) kPa asphalt: 245.3(55.5) kPa]. For natural grass, contact time and contact area were significantly greater at the central rearfoot (p < 0.001). These results suggest that natural grass may be a Surface that provokes lighter loads on the rearfoot and forefoot in recreational runners. (C) 2008 Sports Medicine Australia. Published by Elsevier Ltd. All rights reserved.

Sitting time and work patterns as indicators of overweight and obesity in Australian adults

BACKGROUND: Increasing levels of physical inactivity and sedentariness are contributing to the current overweight and obesity epidemic. In this paper, the findings of two recent studies are used to explore the relationships between sitting time ( in transport, work and leisure), physical activity and body mass index (BMI) in two contrasting samples of adult Australians. METHODS: Data on sitting time, physical activity, BMI and a number of demographic characteristics were compared for participants in two studies-529 women who were participants in a preschool health promotion project ('mothers'), and 185 men and women who were involved in a workplace pedometer study ('workers'). Relationships between age, number of children, physical activity, sitting time, BMI, gender and work patterns were explored. Logistic regression was used to predict the likelihood of being overweight or obese, among participants with different physical activity, sitting time and work patterns. RESULTS: The total reported time spent sitting per day ( across all domains) was almost 6 h less among the mothers than the workers (P

Health, sleep and lack of time: relations to domestic and paid work in nurses

OBJECTIVE: To assess whether reported morbidity and complaints of lack of time and sleep are associated with the burden of professional work and housework among nurses. METHODS: A cross-sectional exploratory study was carried out among female nurses and nurse assistants (N=206) of a public hospital in Rio de Janeiro, Brazil. Data were collected by means of a questionnaire. The prevalence ratio and 95% confidence intervals were estimated. RESULTS: Mean duration of professional work and housework time was 40.4 and 31.6 hours/week, respectively. Long professional working time (over 44 hours/week) were associated with mild emotional disorders (PR=1.37; 95% CI: 1.05-1.80), complaints of lack of time for resting/leisure (PR=1.61; 95% CI: 1.31-1.97), housework (PR=1.48; 95% CI: 1.12-1.97), and childcare (PR=1.99; 95% CI: 1.51-2.63). Long housework time (over 28 hours/week) was associated with lower prevalence of lack of time for childcare (PR=0.62; 95% CI: 0.46-0.84). High housework load was associated with lack of personal time and complaints of varicose veins (PR=1.31; 95% CI: 1.14-1.50 and PR=1.31; 95% CI: 1.08-1.58, respectively). Complaints of varicose veins were also frequent among female nurses with a total work load above 84 hours (PR=1.30; 95% CI: 1.05-1.61), though this group has shown a lower prevalence of arterial hypertension and recurrent headaches (PR=0.35; 95% CI: 0.15-0.83 and PR=0.53; 95% CI: 0.32-0.89, respectively). CONCLUSIONS: Results suggest that both professional and home environments are relevant in the evaluation of work overload on nurses' health and their family and social life. It is stressed the need for instruments for analyzing total workload among female populations.

Code offloading on real-time multimedia systems: a framework for handling code mobility and code offloading in a QoS aware environment

Actualmente, os smartphones e outros dispositivos móveis têm vindo a ser dotados com cada vez maior poder computacional, sendo capazes de executar um vasto conjunto de aplicações desde simples programas de para tirar notas até sofisticados programas de navegação. Porém, mesmo com a evolução do seu hardware, os actuais dispositivos móveis ainda não possuem as mesmas capacidades que os computadores de mesa ou portáteis. Uma possível solução para este problema é distribuir a aplicação, executando partes dela no dispositivo local e o resto em outros dispositivos ligados à rede. Adicionalmente, alguns tipos de aplicações como aplicações multimédia, jogos electrónicos ou aplicações de ambiente imersivos possuem requisitos em termos de Qualidade de Serviço, particularmente de tempo real. Ao longo desta tese é proposto um sistema de execução de código remota para sistemas distribuídos com restrições de tempo-real. A arquitectura proposta adapta-se a sistemas que necessitem de executar periodicamente e em paralelo mesmo conjunto de funções com garantias de tempo real, mesmo desconhecendo os tempos de execução das referidas funções. A plataforma proposta foi desenvolvida para sistemas móveis capazes de executar o Sistema Operativo Android.

Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

A preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Symposium, 2010, pp. 239–248.

Fieldbus networks: real-time from the perspective of the application tasks

Fieldbus communication networks aim to interconnect sensors, actuators and controllers within distributed computer-controlled systems. Therefore they constitute the foundation upon which real-time applications are to be implemented. A potential leap towards the use of fieldbus in such time-critical applications lies in the evaluation of its temporal behaviour. In the past few years several research works have been performed on a number of fieldbuses. However, these have mostly focused on the message passing mechanisms, without taking into account the communicating application tasks running in those distributed systems. The main contribution of this paper is to provide an approach for engineering real-time fieldbus systems where the schedulability analysis of the distributed system integrates both the characteristics of the application tasks and the characteristics of the message transactions performed by these tasks. In particular, we address the case of system where the Process-Pascal multitasking language is used to develop P-NET based distributed applications

Makespan computation for GPU threads running on a single streaming multiprocessor

Graphics processors were originally developed for rendering graphics but have recently evolved towards being an architecture for general-purpose computations. They are also expected to become important parts of embedded systems hardware -- not just for graphics. However, this necessitates the development of appropriate timing analysis techniques which would be required because techniques developed for CPU scheduling are not applicable. The reason is that we are not interested in how long it takes for any given GPU thread to complete, but rather how long it takes for all of them to complete. We therefore develop a simple method for finding an upper bound on the makespan of a group of GPU threads executing the same program and competing for the resources of a single streaming multiprocessor (whose architecture is based on NVIDIA Fermi, with some simplifying assunptions). We then build upon this method to formulate the derivation of the exact worst-case makespan (and corresponding schedule) as an optimization problem. Addressing the issue of tractability, we also present a technique for efficiently computing a safe estimate of the worstcase makespan with minimal pessimism, which may be used when finding an exact value would take too long.

Real time mobile system for support in firefighting environments

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

On-line defragmentation for run-time partially reconfigurable FPGAs

Dynamically reconfigurable systems have benefited from a new class of FPGAs recently introduced into the market, which allow partial and dynamic reconfiguration at run-time, enabling multiple independent functions from different applications to share the same device, swapping resources as needed. When the sequence of tasks to be performed is not predictable, resource allocation decisions have to be made on-line, fragmenting the FPGA logic space. A rearrangement may be necessary to get enough contiguous space to efficiently implement incoming functions, to avoid spreading their components and, as a result, degrading their performance. This paper presents a novel active replication mechanism for configurable logic blocks (CLBs), able to implement on-line rearrangements, defragmenting the available FPGA resources without disturbing those functions that are currently running.

Run-time defragmentation for dynamically reconfigurable hardware

Reconfigurable computing experienced a considerable expansion in the last few years, due in part to the fast run-time partial reconfiguration features offered by recent SRAM-based Field Programmable Gate Arrays (FPGAs), which allowed the implementation in real-time of dynamic resource allocation strategies, with multiple independent functions from different applications sharing the same logic resources in the space and temporal domains. However, when the sequence of reconfigurations to be performed is not predictable, the efficient management of the logic space available becomes the greatest challenge posed to these systems. Resource allocation decisions have to be made concurrently with system operation, taking into account function priorities and optimizing the space currently available. As a consequence of the unpredictability of this allocation procedure, the logic space becomes fragmented, with many small areas of free resources failing to satisfy most requests and so remaining unused. A rearrangement of the currently running functions is therefore necessary, so as to obtain enough contiguous space to implement incoming functions, avoiding the spreading of their components and the resulting degradation of system performance. A novel active relocation procedure for Configurable Logic Blocks (CLBs) is herein presented, able to carry out online rearrangements, defragmenting the available FPGA resources without disturbing functions currently running.

Efficient schedulability tests for real-time embedded systems with urgent routines

Task scheduling is one of the key mechanisms to ensure timeliness in embedded real-time systems. Such systems have often the need to execute not only application tasks but also some urgent routines (e.g. error-detection actions, consistency checkers, interrupt handlers) with minimum latency. Although fixed-priority schedulers such as Rate-Monotonic (RM) are in line with this need, they usually make a low processor utilization available to the system. Moreover, this availability usually decreases with the number of considered tasks. If dynamic-priority schedulers such as Earliest Deadline First (EDF) are applied instead, high system utilization can be guaranteed but the minimum latency for executing urgent routines may not be ensured. In this paper we describe a scheduling model according to which urgent routines are executed at the highest priority level and all other system tasks are scheduled by EDF. We show that the guaranteed processor utilization for the assumed scheduling model is at least as high as the one provided by RM for two tasks, namely 2(2√−1). Seven polynomial time tests for checking the system timeliness are derived and proved correct. The proposed tests are compared against each other and to an exact but exponential running time test.

Generalized Extraction of Real-Time Parameters for Homogeneous Synchronous Dataflow Graphs

23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP 2015). 4 to 6, Mar, 2015. Turku, Finland.

How realistic is the mixed-criticality real-time system model?

23rd International Conference on Real-Time Networks and Systems (RTNS 2015). 4 to 6, Nov, 2015, Main Track. Lille, France. Best Paper Award Nominee