Physical Activity, Obesity Status, and Blood Pressure in Preschool Children

Objective To examine the combined effects of physical activity and weight status on blood pressure (BP) in preschool-aged children. Study design The sample included 733 preschool-aged children (49% female). Physical activity was objectively assessed on 7 consecutive days by accelerometry. Children were categorized as sufficiently active if they met the recommendation of at least 60 minutes daily of moderate-to-vigorous physical activity (MVPA). Body mass index was used to categorize children as nonoverweight or overweight/obese, according to the International Obesity Task Force benchmarks. BP was measured using an automated BP monitor and categorized as elevated or normal using BP percentile-based cut-points for age, sex, and height. Results The prevalence of elevated systolic BP (SBP) and diastolic BP was 7.7% and 3.0%, respectively. The prevalence of overweight/obese was 32%, and about 15% of children did not accomplish the recommended 60 minutes of daily MVPA. After controlling for age and sex, overweight/obese children who did not meet the daily MVPA recommendation were 3 times more likely (OR 3.8; CI 1.6-8.6) to have elevated SBP than nonoverweight children who met the daily MVPA recommendation. Conclusions Overweight or obese preschool-aged children with insufficient levels of MVPA are at significantly greater risk for elevated SBP than their non overweight and sufficiently active counterparts. (J Pediatr 2015;167:98-102).

Branqueamento de capitais

Dissertação de Mestrado apresentada ao Instituto de Contabilidade e Administração do Porto para a obtenção do grau de Mestre em Contabilidade e Finanças, sob orientação do Doutor José Amorim

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning real-time tasks on a heterogeneous multiprocessor platform comprising two different types of processors — such a platform is referred to as two-type platform. We present two linearithmic timecomplexity algorithms, SA and SA-P, each providing the follow- ing guarantee. For a given two-type platform and a given task set, if there exists a feasible task-to-processor-type assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type, then (i) using SA, it is guaranteed to find such a feasible task-to- processor-type assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding 2 a feasible task-to-processor assignment where tasks are not allowed to migrate between processors but given a platform in which processors are 1+α/times faster, where 0<α≤1. The parameter α is a property of the task set — it is the maximum utilization of any task which is less than or equal to 1.

Scheduling arbitrary-deadline sporadic task systems on multiprocessors

A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon multiprocessor platforms, with interprocessor migration permitted. This algorithm is based on a task-splitting approach - while most tasks are entirely assigned to specific processors, a few tasks (fewer than the number of processors) may be split across two processors. This algorithm can be used for two distinct purposes: for actually scheduling specific sporadic task systems, and for feasibility analysis. Simulation- based evaluation indicates that this algorithm offers a significant improvement on the ability to schedule arbitrary- deadline sporadic task systems as compared to the contemporary state-of-art. With regard to feasibility analysis, the new algorithm is proved to offer superior performance guarantees in comparison to prior feasibility tests.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.

CPMD-mindful task assignment for NPS-F

The multiprocessor scheduling scheme NPS-F for sporadic tasks has a high utilisation bound and an overall number of preemptions bounded at design time. NPS-F binpacks tasks offline to as many servers as needed. At runtime, the scheduler ensures that each server is mapped to at most one of the m processors, at any instant. When scheduled, servers use EDF to select which of their tasks to run. Yet, unlike the overall number of preemptions, the migrations per se are not tightly bounded. Moreover, we cannot know a priori which task a server will be currently executing at the instant when it migrates. This uncertainty complicates the estimation of cache-related preemption and migration costs (CPMD), potentially resulting in their overestimation. Therefore, to simplify the CPMD estimation, we propose an amended bin-packing scheme for NPS-F allowing us (i) to identify at design time, which task migrates at which instant and (ii) bound a priori the number of migrating tasks, while preserving the utilisation bound of NPS-F.

Influence of dual-task on sit-to-stand-to-sit postural control in Parkinson's disease

Postural control deficits are the most disabling aspects of Parkinson's disease (PD), resulting in decreased mobility and functional independence. The aim of this study was to assess the postural control stability, revealed by variables based on the centre of pressure (CoP), in individuals with PD while performing a sit-to-stand-to-sit sequence under single- and dual-task conditions. An observational, analytical and cross-sectional study was performed. The sample consisted of 9 individuals with PD and 9 healthy controls. A force platform was used to measure the CoP displacement and velocity during the sit-to-stand-to-sit sequence. The results were statistically analysed. Individuals with PD required greater durations for the sit-to-stand-to-sit sequence than the controls (p < 0.05). The anteroposterior and mediolateral CoP displacement were higher in the individuals with PD (p < 0.05). However, only the anteroposterior CoP velocity in the stand-to-sit phase (p = 0.006) was lower in the same individuals. Comparing the single- and dual-task conditions in both groups, the duration, the anteroposterior CoP displacement and velocity were higher in the dual-task condition (p < 0.05). The individuals with PD presented reduced postural control stability during the sit-to-stand-to-sit sequence, especially when under the dual-task condition. These individuals have deficits not only in motor performance, but also in cognitive performance when performing the sit-to-stand-to-sit sequence in their daily life tasks. Moreover, both deficits tend to be intensified when two tasks are performed simultaneously.