Cardiorespiratory fitness is negatively associated with metabolic risk factors independently of the adherence to a healthy dietary pattern

Background and aim: Cardiorespiratory fitness (CRF) and diet have been involved as significant factors towards the prevention of cardio-metabolic diseases. This study aimed to assess the impact of the combined associations of CRF and adherence to the Southern European Atlantic Diet (SEADiet) on the clustering of metabolic risk factors in adolescents. Methods and Results: A cross-sectional school-based study was conducted on 468 adolescents aged 15-18, from the Azorean Islands, Portugal. We measured fasting glucose, insulin, total cholesterol (TC), HDL-cholesterol, triglycerides, systolic blood pressure, waits circumference and height. HOMA, TC/HDL-C ratio and waist-to-height ratio were calculated. For each of these variables, a Z-score was computed by age and sex. A metabolic risk score (MRS) was constructed by summing the Z scores of all individual risk factors. High risk was considered when the individual had 1SD of this score. CRF was measured with the 20 m-Shuttle-Run- Test. Adherence to SEADiet was assessed with a semi-quantitative food frequency questionnaire. Logistic regression showed that, after adjusting for potential confounders, unfit adolescents with low adherence to SEADiet had the highest odds of having MRS (OR Z 9.4; 95%CI:2.6e33.3) followed by the unfit ones with high adherence to the SEADiet (OR Z 6.6; 95% CI: 1.9e22.5) when compared to those who were fit and had higher adherence to SEADiet.

Implementing slot-based task-splitting multiprocessor scheduling

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task-splitting scheduling algorithm. Task-splitting (also called semi-partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A particular type of task-splitting algorithms, called slot-based task-splitting dispatching, is of particular interest because of its ability to schedule tasks with high processor utilizations. Unfortunately, no slot-based task-splitting algorithm has been implemented in a real operating system so far. In this paper we discuss and propose some modifications to the slot-based task-splitting algorithm driven by implementation concerns, and we report the first implementation of this family of algorithms in a real operating system running Linux kernel version 2.6.34. We have also conducted an extensive range of experiments on a 4-core multicore desktop PC running task-sets with utilizations of up to 88%. The results show that the behavior of our implementation is in line with the theoretical framework behind it.

Practical aspects of slot-based task- splitting dispatching in its schedulability analysis

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.

Fractional central pattern generators for bipedal locomotion

Locomotion has been a major research issue in the last few years. Many models for the locomotion rhythms of quadrupeds, hexapods, bipeds and other animals have been proposed. This study has also been extended to the control of rhythmic movements of adaptive legged robots. In this paper, we consider a fractional version of a central pattern generator (CPG) model for locomotion in bipeds. A fractional derivative D α f(x), with α non-integer, is a generalization of the concept of an integer derivative, where α=1. The integer CPG model has been proposed by Golubitsky, Stewart, Buono and Collins, and studied later by Pinto and Golubitsky. It is a network of four coupled identical oscillators which has dihedral symmetry. We study parameter regions where periodic solutions, identified with legs’ rhythms in bipeds, occur, for 0<α≤1. We find that the amplitude and the period of the periodic solutions, identified with biped rhythms, increase as α varies from near 0 to values close to unity.

Unified overhead-aware schedulability analysis for slot-based task-splitting

Hard real- time multiprocessor scheduling has seen, in recent years, the flourishing of semi-partitioned scheduling algorithms. This category of scheduling schemes combines elements of partitioned and global scheduling for the purposes of achieving efficient utilization of the system’s processing resources with strong schedulability guarantees and with low dispatching overheads. The sub-class of slot-based “task-splitting” scheduling algorithms, in particular, offers very good trade-offs between schedulability guarantees (in the form of high utilization bounds) and the number of preemptions/migrations involved. However, so far there did not exist unified scheduling theory for such algorithms; each one was formulated in its own accompanying analysis. This article changes this fragmented landscape by formulating a more unified schedulability theory covering the two state-of-the-art slot-based semi-partitioned algorithms, S-EKG and NPS-F (both fixed job-priority based). This new theory is based on exact schedulability tests, thus also overcoming many sources of pessimism in existing analysis. In turn, since schedulability testing guides the task assignment under the schemes in consideration, we also formulate an improved task assignment procedure. As the other main contribution of this article, and as a response to the fact that many unrealistic assumptions, present in the original theory, tend to undermine the theoretical potential of such scheduling schemes, we identified and modelled into the new analysis all overheads incurred by the algorithms in consideration. The outcome is a new overhead-aware schedulability analysis that permits increased efficiency and reliability. The merits of this new theory are evaluated by an extensive set of experiments.

Dynamic Analysis and Pattern Visualization of Forest Fires

This paper analyses forest fires in the perspective of dynamical systems. Forest fires exhibit complex correlations in size, space and time, revealing features often present in complex systems, such as the absence of a characteristic length-scale, or the emergence of long range correlations and persistent memory. This study addresses a public domain forest fires catalogue, containing information of events for Portugal, during the period from 1980 up to 2012. The data is analysed in an annual basis, modelling the occurrences as sequences of Dirac impulses with amplitude proportional to the burnt area. First, we consider mutual information to correlate annual patterns. We use visualization trees, generated by hierarchical clustering algorithms, in order to compare and to extract relationships among the data. Second, we adopt the Multidimensional Scaling (MDS) visualization tool. MDS generates maps where each object corresponds to a point. Objects that are perceived to be similar to each other are placed on the map forming clusters. The results are analysed in order to extract relationships among the data and to identify forest fire patterns.

Dynamic Analysis and Pattern Visualization of Forest Fires

This paper analyses forest fires in the perspective of dynamical systems. Forest fires exhibit complex correlations in size, space and time, revealing features often present in complex systems, such as the absence of a characteristic length-scale, or the emergence of long range correlations and persistent memory. This study addresses a public domain forest fires catalogue, containing information of events for Portugal, during the period from 1980 up to 2012. The data is analysed in an annual basis, modelling the occurrences as sequences of Dirac impulses with amplitude proportional to the burnt area. First, we consider mutual information to correlate annual patterns. We use visualization trees, generated by hierarchical clustering algorithms, in order to compare and to extract relationships among the data. Second, we adopt the Multidimensional Scaling (MDS) visualization tool. MDS generates maps where each object corresponds to a point. Objects that are perceived to be similar to each other are placed on the map forming clusters. The results are analysed in order to extract relationships among the data and to identify forest fire patterns.