Comparative analysis of the ground reaction forces, during the support phase, in a group of pregnant women on their 3rd trimester of pregnancy and in a group of not pregnant women

PURPOSE: To analyze and compare the Ground Reaction Forces (GRF), during the stance phase of walking in pregnant women in the 3rd trimester of pregnancy, and non pregnant women. METHODS: 20 women, 10 pregnant and 10 non pregnant, voluntarily took part in this study. GRF were measured (1000 Hz) using a force platform (BERTEC 4060-15), an amplifier (BERTEC AM 6300) and an analogical-digital converter of 16 Bits (Biopac). RESULTS: The study showed that there were significant differences among the two groups concerning absolute values of time of the stance phase. In what concerns to the normalized values the most significant differences were verified in the maximums values of vertical force (Fz3, Fz1) and in the impulse of the antero-posterior force (Fy2), taxes of growth of the vertical force, and in the period of time for the antero-posterior force (Fy) be null. CONCLUSIONS: It is easier for the pregnant to continue forward movement (push-off phase). O smaller growth rates in what concerns to the maximum of the vertical force (Fz1) for the pregnant, can be associated with a slower speed of gait, as an adaptation strategy to maintain the balance, to compensate the alterations in the position of her center of gravity due to the load increase. The data related to the antero-posterior component of the force (Fy), shows that there is a significant difference between the pregnant woman’s left foot and right foot, which accuses a different functional behavior in each one of the feet, during the propulsion phase (TS).

Influência do tipo de chuteira em variáveis preditoras do risco de entorse lateral do tornozelo

Introdução: No futebol, a entorse lateral do tornozelo (ELT) destaca-se como sendo a lesão mais prevalente. Potenciada pela variedade de chuteiras disponíveis no mercado e pela crescente utilização de relvados sintéticos, a interação entre o terreno e o calçado tem assumido elevada relevância como fator de risco para a ELT. A maior incidência de lesões na 2ª parte do jogo traduz a necessidade do estudo dessa interação durante tarefas que envolvam fadiga. Objetivo: Estudar a influência das chuteiras em variáveis preditoras do risco de ELT em relvado sintético sob duas condições: sem e com fadiga dos músculos eversores do tornozelo Métodos: Foi utilizada uma amostra de atletas saudáveis. Todos os indivíduos realizaram 3 séries de 5 saltos médio-laterais uni-podálicos, cada uma com 1 de 3 modelos de chuteiras (Turf, Hard e Firm ground) em duas condições: sem e com fadiga induzida pelo dinamómetro isocinético. Durante a tarefa, a atividade eletromiográfica do longo e curto peroniais, o valor das forças de reação do solo e o movimento do retro-pé (plano frontal), foram recolhidos e usados para calcular variáveis cinemáticas (eversão/inversão do tornozelo, o deslocamento e velocidade do centro de pressão), cinéticas (taxa de crescimento das forças de reação do solo) e neuromusculares (tempo de ativação muscular dos peroniais). Resultados: À exceção do tempo de ativação do curto peronial com o modelo Hard ground (sem fadiga vs com fadiga (p=0,050), não foram identificadas diferenças estatisticamente significativas nas variáveis preditoras de lesão, entre chuteiras, nem entre as duas condições avaliadas. Conclusão: Para o teste funcional escolhido e executado por atletas saudáveis em sintético de 3ª geração, nenhuma das chuteiras apresenta maior risco de lesão (com e sem fadiga), tendo em conta as variáveis em estudo.

PPO Reaction Scale-up

O óxido de polifenileno com a marca comercial PPO® é uma das resinas principais produzidas na SABIC IP e o ingrediente principal do plástico de engenharia com a marca registada, Noryl®. A equipa de tecnologia de processo de PPO® desenvolve uma série de novos produtos em reactores de pequena escala, tanto em Selkirk como em Bergen op Zoom. Para se efectuar uma transição rápida da escala laboratorial para a fábrica, é necessário um conhecimento completo do reactor. O objectivo deste projecto consiste em esboçar linhas gerais para o scale-up de novos produtos de PPO1, do laboratório para a escala industrial, baseado no estudo de um tipo de PPO, PPO 803. Este estudo pode ser dividido em duas fases. Numa primeira fase, as receitas e os perfis da reacção são comparados, de onde se retiram as primeiras conclusões. Posteriormente, com base nestas conclusões, é realizado um planeamento experimental. O estudo inicial sugeriu que a receita, a temperatura inicial do reactor e a velocidade do agitador poderiam influenciar o tempo da reacção bem como a queda da velocidade intrínseca do polímero (IV drop). As reacções experimentais mostraram que a receita é o principal factor que influencia, tanto o tempo de reacção, como a queda de viscosidade intrínseca. O tempo de reacção será tanto maior quanto menor a agitação devido à má dispersão do oxigénio na mistura. O uso de temperaturas iniciais elevadas conduz a uma queda maior da viscosidade intrínseca devido à desactivação do catalisador. O método experimental utilizado no laboratório de Bergen op Zoom é um bom exemplo, simulador, do procedimento utilizado na fábrica.

Estudo comparativo entre criança com e sem joelhos valgos praticantes de hóquei em patins utilizando diferentes sistemas de análise

O presente estudo tem como objetivo comparar experimentalmente duas crianças praticantes de Hóquei em Patins, uma normal e uma com a patologia dos joelhos valgos, avaliando qualitativamente as diferenças posturais, estáticas e dinâmicas, decorrentes da utilização dos patins específicos desta modalidade, através do sistema de análise da Força de Reação do Solo (FRS), de Eletromiografia (EMG), de captura de movimento, e de modelação e simulação. Para atingir o objetivo definiu-se um protocolo de ensaios com as seguintes tarefas: repouso com e sem patins, marcha, corrida, deslizar com os dois pés apoiados e deslizar com o pé esquerdo levantado. No repouso avaliou-se a variação do ponto de aplicação da FRS da criança normal e patológica, com e sem patins. Ainda na tarefa de repouso avaliou-se também as componentes médio-lateral, antero-posterior individualmente e a componente vertical da FRS, juntamente com a atividade muscular dos músculos Gastrocnémio Medial (GM), Recto Femoral (RF), Vasto Medial (VM), Vasto Lateral (VL), Bicípete Femoral (BF), Semitendinoso (ST), Tensor da Fascia Lata (TFL), Gastrocnémio Lateral (GL), de forma a comparar os valores de intensidade de FRS e da atividade muscular dos diferentes instantes de tempo desta tarefa. Para as restantes tarefas apenas se avaliou individualmente as componentes médio-lateral e antero-posterior da FRS e a componente vertical da FRS juntamente com a atividade muscular dos referidos músculos, salientando as diferenças evidentes entre as curvas da criança normal e as curvas da criança patológica durante os diferentes instantes do movimento. Todas as tarefas referidas, exceto a tarefa de repouso com patins, foram ainda simuladas recorrendo a modelos músculo-esqueléticos. A partir destas simulações do movimento obtiveram-se os ângulos articulares e efetuou-se a respetiva análise. No final dos resultados obtidos apresentou-se uma tabela de resumo com o cálculo dos coeficientes de variação de cada grandeza, exceto nos gráficos da posição no espaço da FRS, onde se constatou que existe uma grande variabilidade inter-individuo em cada tarefa. A análise dos resultados de cada tarefa permite concluir que a utilização de patins pode trazer uma maior ativação muscular para a criança patológica, embora se verifique instabilidade articular. Apesar dessa instabilidade pode-se inferir que, uma maior ativação muscular decorrente da utilização de patins, tal como acontece na prática do hóquei em patins, pode trazer uma melhoria, a longo prazo, na estabilidade da articulação do joelho e na sustentação corporal, proporcionada pelo fortalecimento muscular.

Replication management in reliable real-time systems

Building reliable real-time applications on top of commercial off-the-shelf (COTS) components is not a straightforward task. Thus, it is essential to provide a simple and transparent programming model, in order to abstract programmers from the low-level implementation details of distribution and replication. However, the recent trend for incorporating pre-emptive multitasking applications in reliable real-time systems inherently increases its complexity. It is therefore important to provide a transparent programming model, enabling pre-emptive multitasking applications to be implemented without resorting to simultaneously dealing with both system requirements and distribution and replication issues. The distributed embedded architecture using COTS components (DEAR-COTS) architecture has been previously proposed as an architecture to support real-time and reliable distributed computer-controlled systems (DCCS) using COTS components. Within the DEAR-COTS architecture, the hard real-time subsystem provides a framework for the development of reliable real-time applications, which are the core of DCCS applications. This paper presents the proposed framework, and demonstrates how it can be used to support the transparent replication of software components.

From task scheduling in single processor environments to message scheduling in a PROFIBUS fieldbus network

In this paper we survey the most relevant results for the prioritybased schedulability analysis of real-time tasks, both for the fixed and dynamic priority assignment schemes. We give emphasis to the worst-case response time analysis in non-preemptive contexts, which is fundamental for the communication schedulability analysis. We define an architecture to support priority-based scheduling of messages at the application process level of a specific fieldbus communication network, the PROFIBUS. The proposed architecture improves the worst-case messages’ response time, overcoming the limitation of the first-come-first-served (FCFS) PROFIBUS queue implementations.

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.

A feedback-based decentralised coordination model for distributed open real-time systems

Moving towards autonomous operation and management of increasingly complex open distributed real-time systems poses very significant challenges. This is particularly true when reaction to events must be done in a timely and predictable manner while guaranteeing Quality of Service (QoS) constraints imposed by users, the environment, or applications. In these scenarios, the system should be able to maintain a global feasible QoS level while allowing individual nodes to autonomously adapt under different constraints of resource availability and input quality. This paper shows how decentralised coordination of a group of autonomous interdependent nodes can emerge with little communication, based on the robust self-organising principles of feedback. Positive feedback is used to reinforce the selection of the new desired global service solution, while negative feedback discourages nodes to act in a greedy fashion as this adversely impacts on the provided service levels at neighbouring nodes. The proposed protocol is general enough to be used in a wide range of scenarios characterised by a high degree of openness and dynamism where coordination tasks need to be time dependent. As the reported results demonstrate, it requires less messages to be exchanged and it is faster to achieve a globally acceptable near-optimal solution than other available approaches.

Real-time scheduling of parallel tasks in the Linux Kernel

This paper proposes a global multiprocessor scheduling algorithm for the Linux kernel that combines the global EDF scheduler with a priority-aware work-stealing load balancing scheme, enabling parallel real-time tasks to be executed on more than one processor at a given time instant. We state that some priority inversion may actually be acceptable, provided it helps reduce contention, communication, synchronisation and coordination between parallel threads, while still guaranteeing the expected system’s predictability. Experimental results demonstrate the low scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Device power management for real-time embedded systems

A large part of power dissipation in a system is generated by I/O devices. Increasingly these devices provide power saving mechanisms to inter alia enhance battery life. While I/O device scheduling has been studied in the past for realtime systems, the use of energy resources by these scheduling algorithms may be improved. These approaches are crafted considering a huge overhead of device transition. The technology enhancement has allowed the hardware vendors to reduce the device transition overhead and energy consumption. We propose an intra-task device scheduling algorithm for real time systems that allows to shut-down devices while ensuring the system schedulability. Our results show an energy gain of up to 90% in the best case when compared to the state-of-the-art.

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.

Real-time scheduling with resource sharing on uniform multiprocessors

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a uniform multiprocessor platform where each task may access at most one of |R| shared resources and at most once by each job of that task. The resources have to be accessed in a mutually exclusive manner. We propose an algorithm, GIS-vpr, which offers the guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that allows a task to migrate only when it accesses or releases a resource, then our algorithm also meets the deadlines with the same restriction on the task migration, if given processors 4 + 6|R| times as fast. The proposed algorithm, by design, limits the number of migrations per job to at most two. To the best of our knowledge, this is the first result for resource sharing on uniform multiprocessors with proven performance guarantee.

Server-based scheduling of parallel real-time tasks

Multicore platforms have transformed parallelism into a main concern. Parallel programming models are being put forward to provide a better approach for application programmers to expose the opportunities for parallelism by pointing out potentially parallel regions within tasks, leaving the actual and dynamic scheduling of these regions onto processors to be performed at runtime, exploiting the maximum amount of parallelism. It is in this context that this paper proposes a scheduling approach that combines the constant-bandwidth server abstraction with a priority-aware work-stealing load balancing scheme which, while ensuring isolation among tasks, enables parallel tasks to be executed on more than one processor at a given time instant.

Extending fixed task-priority schedulability by interference limitation

While the earliest deadline first algorithm is known to be optimal as a uniprocessor scheduling policy, the implementation comes at a cost in terms of complexity. Fixed taskpriority algorithms on the other hand have lower complexity but higher likelihood of task sets being declared unschedulable, when compared to earliest deadline first (EDF). Various attempts have been undertaken to increase the chances of proving a task set schedulable with similar low complexity. In some cases, this was achieved by modifying applications to limit preemptions, at the cost of flexibility. In this work, we explore several variants of a concept to limit interference by locking down the ready queue at certain instances. The aim is to increase the prospects of schedulability of a given task system, without compromising on complexity or flexibility, when compared to the regular fixed task-priority algorithm. As a final contribution, a new preemption threshold assignment algorithm is provided which is less complex and more straightforward than the previous method available in the literature.

Enhancing the real-time capabilities of the Linux Kernel

The mainline Linux Kernel is not designed forhard real-time systems; it only fits the requirements of soft realtimesystems. In recent years, a kernel developer communityhas been working on the PREEMPT-RT patch. This patch(that aims to get a fully preemptible kernel) adds some realtimecapabilities to the Linux kernel. However, in terms ofscheduling policies, the real-time scheduling class of Linux islimited to the First-In-First-Out (SCHED_FIFO) and Round-Robin (SCHED_RR) scheduling policies. These scheduling policiesare however quite limited in terms of realtime performance.Therefore, in this paper, we report one importantcontribution for adding more advanced real-time capabilitiesto the Linux Kernel. Specifically, we describe modificationsto the (PREEMPT-RT patched) Linux kernel to supportreal-time slot-based task-splitting scheduling algorithms. Ourpreliminary evaluation shows that our implementation exhibitsa real-time performance that is superior to the schedulingpolicies provided by the current version of PREMPT-RT. Thisis a significant add-on to a widely adopted operating system.