Testes de endurance do tronco: diferenças entre indivíduos com e sem dor lombo-pélvica e o efeito de programas de exercício de controlo motor

Introdução: em indivíduos com dor lombo-pélvica (LPP), parece existir uma alteração de controlo motor e diminuição da endurance dos músculos do tronco. A realização de exercícios de controlo motor pode melhorar a endurance dessa musculatura e consequentemente o controlo motor. Objetivos: detetar diferenças nos tempos e rácios de endurance dos músculos do tronco em indivíduos com e sem dor lombo-pélvica e avaliar o efeito de dois programas de exercícios de controlo motor (segundo Richardson e segundo McGill) nos mesmos outcomes em indivíduos com LPP. Métodos: estudo transversal com uma amostra de 111 indivíduos, 52 para o grupo sem dor (NLPP) e 59 para o com LPP e estudo experimental, constituído pelos indivíduos LPP (59), alocados nos grupos de Pilates (20), McGill (20) ou no grupo controlo (19). Avaliaramse os tempos obtidos nos testes de endurance para os músculos extensores, flexores, flexores laterais direitos e esquerdos do tronco e respetivos rácios, tendo em conta o modelo de McGill. As avaliações dos grupos do estudo experimental realizaram-se antes e após as 8 semanas de exercício. Resultados: os indivíduos com LPP apresentaram tempos e rácios de endurance significativamente inferiores aos indivíduos NLPP (p<0.001). Após as 8 semanas de exercício, registaram-se diferenças estatisticamente significativas entre os grupos em todos os testes de endurance, sendo que o grupo de McGill apresentou tempos significativamente superiores aos do grupo de Pilates para os músculos flexores (p=0.001), flexores laterais direitos (p=0.002) e esquerdos (p=0.009). Quanto aos rácios de endurance, não se detetaram apenas diferenças estatisticamente significativas no rácio flexão lateral esquerda/extensão. Conclusão: os indivíduos com LPP apresentaram tempos e rácios de endurance do tronco inferiores aos dos indivíduos sem dor. Ambos os programas de exercícios melhoraram os tempos e os rácios de endurance, tendo existido uma tendência para melhores resultados na abordagem segundo McGill

LNT: a logical neighbor tree secure group communication scheme for wireless sensor networks

Secure group communication is a paradigm that primarily designates one-to-many communication security. The proposed works relevant to secure group communication have predominantly considered the whole network as being a single group managed by a central powerful node capable of supporting heavy communication, computation and storage cost. However, a typical Wireless Sensor Network (WSN) may contain several groups, and each one is maintained by a sensor node (the group controller) with constrained resources. Moreover, the previously proposed schemes require a multicast routing support to deliver the rekeying messages. Nevertheless, multicast routing can incur heavy storage and communication overheads in the case of a wireless sensor network. Due to these two major limitations, we have reckoned it necessary to propose a new secure group communication with a lightweight rekeying process. Our proposal overcomes the two limitations mentioned above, and can be applied to a homogeneous WSN with resource-constrained nodes with no need for a multicast routing support. Actually, the analysis and simulation results have clearly demonstrated that our scheme outperforms the previous well-known solutions.

The influence of inter-domain mobility on message stream response time in wired/wireless PROFIBUS-based networks

In previous works we have proposed a hybrid wired/wireless PROFIBUS solution where the interconnection between the heterogeneous media was accomplished through bridge-like devices with wireless stations being able to move between different wireless cells. Additionally, we had also proposed a worst-case timing analysis assuming that stations were stationary. In this paper we advance these previous works by proposing a worst-case timing analysis for the system’s message streams considering the effect of inter-cell mobility.

Capacity sharing and stealing in serverbased real-time systems

A dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers is proposed. Overloads are handled by an efficient reclaiming of residual capacities originated by early completions as well as by allowing reserved capacity stealing of non-guaranteed bandwidth servers. The proposed dynamic budget accounting mechanism ensures that at a particular time the currently executing server is using a residual capacity, its own capacity or is stealing some reserved capacity, eliminating the need of additional server states or unbounded queues. The server to which the budget accounting is going to be performed is dynamically determined at the time instant when a capacity is needed. This paper describes and evaluates the proposed scheduling algorithm, showing that it can efficiently reduce the mean tardiness of periodic jobs. The achieved results become even more significant when tasks’ computation times have a large variance.

Caracterização molecular da resistência a antimicrobianos em Escherichia coli produtoras de β-lactamases de espectro alargado isoladas em cães e estudo da partilha de clones bacterianos entre animais de companhia e coabitantes humanos

A pressão seletiva originada pelo uso excessivo de antimicrobianos na medicina humana e veterinária tem contribuído para a emergência de estirpes bacterianas multirresistentes, sendo os estudos mais escassos relativamente à sua presença nos animais de companhia. Porque os animais e os seus proprietários partilham o mesmo espaço habitacional, apresentando comportamentos de contacto próximo, existe uma hipótese elevada de transferência microbiana inter-espécie. Ante esta possibilidade é importante escrutinar o papel dos animais de companhia enquanto reservatórios de estirpes e de genes de resistência, bem como a sua envolvência na disseminação de estirpes bacterianas multirresistentes. Importa também, investigar o papel das superfícies e objetos domésticos partilhados por ambos, como potenciadores deste fenómeno. O objetivo deste trabalho foi, identificar o filogrupo e fazer a caracterização molecular dos genes que conferem resistência aos β-lactâmicos e às quinolonas, em quarenta isolados de Escherichia coli produtoras de β-lactamases de espectro alargado (ESBL), obtidas em zaragatoas fecais de cães consultados no Hospital Veterinário do ICBAS-UP. Complementarmente pretendeu-se inferir sobre a partilha de clones de Escherichia coli e Enterococcus spp. com elevadas resistências, em cinco agregados familiares (humanos e seus animais de companhia) assim como avaliar a potencial disseminação de estirpes multirresistentes no ambiente doméstico. Previamente foram recolhidas zaragatoas de fezes, pelo e mucosa oral dos animais e em alguns casos, dos seus proprietários, e ainda do ambiente doméstico. As zaragatoas foram processadas e as estirpes isoladas com base em meios seletivos. Foram realizados testes de suscetibilidade antimicrobiana de modo a estabelecer o fenótipo de resistência de cada isolado. O DNA foi extraído por varias metodologias e técnicas de PCR foram utilizadas para caracterização de filogrupos (Escherichia coli) e identificação da espécie (Enterococcus spp.). A avaliação da proximidade filogenética entre isolados foi efetuada por ERIC PCR e PFGE. No conjunto de quarenta isolados produtores de ESBL e/ou resistentes a quinolonas verificou-se que 47,5% pertenciam ao filogrupo A, havendo uma menor prevalência do filogrupo D (25,0%), B1 (17,5%), e B2 (10,0%).A frequência de resistência nestes isolados é factualmente elevada, sendo reveladora de uma elevada pressão seletiva. Com exceção de dois isolados, os fenótipos foram justificados pela presença de β-lactamases. A frequência da presença de genes foi: 47% blaTEM, 34% blaSHV, 24% blaOXA , 18% blaCTX-M-15, 8% blaCTX-M-2, 3% blaCTX-M-9. Nos isolados resistentes às quinolonas verificou-se maioritariamente a presença de mutações nos genes cromossomais gyrA e parC, e em alguns casos a presença de um determinante de resistência mediado por plasmídeo – qnrS. Nos cinco “agregados familiares” (humanos e animais) estudados foi observada uma partilha frequente de clones de E. coli e Enterococcus faecalis com múltiplas resistências, isolados em fezes e mucosa oral de cães e gatos e fezes e mãos dos respetivos proprietários, evidenciando-se assim uma possível transferência direta entre coabitantes (agregados A, C, D, E). Ficou também comprovado com percentagens de similaridade genotípica superiores a 94% que essa disseminação também ocorre para o ambiente doméstico, envolvendo objetos dos animais e de uso comum (agregados A, E). Os resultados obtidos reforçam a necessidade de um uso prudente dos antimicrobianos, pois elevados padrões de resistências terão um impacto não só na qualidade de vida dos animais mas também na saúde humana. Adicionalmente importa sensibilizar os proprietários para a necessidade de uma maior vigilância relativamente às formas de interação com os animais, bem como para a adoção de medidas higiénicas cautelares após essa mesma interação.

Timing analysis of an inter-cell mobility procedure for a wired/wireless PROFIBUS network

Recently, there have been a few research efforts towards extending the capabilities of fieldbus networks to encompass wireless support. In previous works we have proposed a hybrid wired/wireless PROFIBUS network solution where the interconnection between the heterogeneous communication media was accomplished through bridge-like interconnecting devices. The resulting networking architecture embraced a Multiple Logical Ring (MLR) approach, thus with multiple independent tokens, where the communication between different domains was supported by the Inter-Domain Protocol (IDP). The proposed architecture also supports mobility of stations between different wireless cells. To that hybrid wired/wireless networking architecture we have proposed a worst-case response timing analysis of the IDP, without considering inter-cell mobility (or handoff) of stations. In this paper, we advance that previous work by proposing a worst-case timing analysis of the mobility procedure.

Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of |R| shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3Cvpr also meets deadlines if given processors 4+6*ceil(|R|/min(m1,m2)) times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance.

A capacity sharing and stealing strategy for open real-time systems

This paper focuses on the scheduling of tasks with hard and soft real-time constraints in open and dynamic real-time systems. It starts by presenting a capacity sharing and stealing (CSS) strategy that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) reclaiming unused reserved capacity when jobs complete in less than their budgeted execution time and (ii) stealing reserved capacity from inactive non-isolated servers used to schedule best-effort jobs. CSS is then combined with the concept of bandwidth inheritance to efficiently exchange reserved bandwidth among sets of inter-dependent tasks which share resources and exhibit precedence constraints, assuming no previous information on critical sections and computation times is available. The proposed Capacity Exchange Protocol (CXP) has a better performance and a lower overhead when compared against other available solutions and introduces a novel approach to integrate precedence constraints among tasks of open real-time systems.

On the capacity of cluster-tree ZigBee networks

Modeling the fundamental performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand their behavior under worst-case conditions and to make the appropriate design choices. In that direction this paper contributes with an analytical methodology for modeling cluster-tree WSNs where the data sink can either be static or mobile. We assess the validity and pessimism of analytical model by comparing the worst-case results with the values measured through an experimental test-bed based on Commercial-Off- The-Shelf (COTS) technologies, namely TelosB motes running TinyOS.

Optimising and adapting the QoS of a dynamic set of inter-dependent tasks

Due to the growing complexity and adaptability requirements of real-time systems, which often exhibit unrestricted Quality of Service (QoS) inter-dependencies among supported services and user-imposed quality constraints, it is increasingly difficult to optimise the level of service of a dynamic task set within an useful and bounded time. This is even more difficult when intending to benefit from the full potential of an open distributed cooperating environment, where service characteristics are not known beforehand and tasks may be inter-dependent. This paper focuses on optimising a dynamic local set of inter-dependent tasks that can be executed at varying levels of QoS to achieve an efficient resource usage that is constantly adapted to the specific constraints of devices and users, nature of executing tasks and dynamically changing system conditions. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves as the algorithms are given more time to run, with a minimum overhead when compared against their traditional versions.

Collision-free beacon scheduling mechanisms for IEEE 802.15.4/Zigbee cluster-tree wireless sensor networks

The recently standardized IEEE 802.15.4/Zigbee protocol stack offers great potentials for ubiquitous and pervasive computing, namely for Wireless Sensor Networks (WSNs). However, there are still some open and ambiguous issues that turn its practical use a challenging task. One of those issues is how to build a synchronized multi-hop cluster-tree network, which is quite suitable for QoS support in WSNs. In fact, the current IEEE 802.15.4/Zigbee specifications restrict the synchronization in the beacon-enabled mode (by the generation of periodic beacon frames) to star-based networks, while it supports multi-hop networking using the peer-to-peer mesh topology, but with no synchronization. Even though both specifications mention the possible use of cluster-tree topologies, which combine multi-hop and synchronization features, the description on how to effectively construct such a network topology is missing. This paper tackles this problem, unveils the ambiguities regarding the use of the cluster-tree topology and proposes two collision-free beacon frame scheduling schemes. We strongly believe that the results provided in this paper trigger a significant step towards the practical and efficient use of IEEE 802.15.4/Zigbee cluster-tree networks.

Implementation details of the time division beacon scheduling approach for ZigBee cluster-tree networks

This technical report describes the implementation details of the Time Division Beacon Scheduling Approach in IEEE 802.15.4/ZigBee Cluster-Tree Networks. In this technical report we describe the implementation details, focusing on some aspects of the ZigBee Network Layer and the Time Division Beacon Scheduling mechanism. This report demonstrates the feasibility of our approach based on the evaluation of the experimental results. We also present an overview of the ZigBee address and tree-routing scheme.

The capacity exchange protocol

This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a capacity sharing and stealing mechanism to efficiently exchange bandwidth among tasks to minimise the degree of deviation from the ideal system’s behaviour caused by inter-application blocking. The proposed Capacity Exchange Protocol (CXP) is simpler than other proposed solutions for sharing resources in open real-time systems since it does not attempt to return the inherited capacity in the same exact amount to blocked servers. This loss of optimality is worth the reduced complexity as the protocol’s behaviour nevertheless tends to be fair and outperforms the previous solutions in highly dynamic scenarios as demonstrated by extensive simulations. A formal analysis of CXP is presented and the conditions under which it is possible to guarantee hard real-time tasks are discussed.

Shared resources and precedence constraints with capacity sharing and stealing

This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a greedy capacity sharing and stealing policy to efficiently exchange bandwidth among tasks, minimising the degree of deviation from the ideal system's behaviour caused by inter-application blocking. The proposed capacity exchange protocol (CXP) focus on exchanging extra capacities as early, and not necessarily as fairly, as possible. This loss of optimality is worth the reduced complexity as the protocol's behaviour nevertheless tends to be fair in the long run and outperforms other solutions in highly dynamic scenarios, as demonstrated by extensive simulations.

Beacon scheduling in cluster-tree IEEE 802.15.4/ZigBee wireless sensor networks

The recently standardized IEEE 802.15.4/Zigbee protocol stack offers great potentials for ubiquitous and pervasive computing, namely for Wireless Sensor Networks (WSNs). However, there are still some open and ambiguous issues that turn its practical use a challenging task. One of those issues is how to build a synchronized multi-hop cluster-tree network, which is quite suitable for QoS support in WSNs. In fact, the current IEEE 802.15.4/Zigbee specifications restrict the synchronization in the beacon-enabled mode (by the generation of periodic beacon frames) to star-based networks, while it supports multi-hop networking using the peer-to-peer mesh topology, but with no synchronization. Even though both specifications mention the possible use of cluster-tree topologies, which combine multi-hop and synchronization features, the description on how to effectively construct such a network topology is missing. This report tackles this problem, unveils the ambiguities regarding the use of the cluster-tree topology and proposes two collisionfree beacon frame scheduling schemes.