Padrão de ativação de músculos do core abdominal e tilt pélvico no teste de extensão da anca, em indivíduos com e sem dor lombo- pélvica

Introdução: Os padrões de movimento podem sofrer alterações por atraso no timing de ativação e/ou modificações na sequência de recrutamento muscular, predispondo o indivíduo a disfunções, nomeadamente a dor lombo-pélvica. Objetivo: Investigar o timing e o padrão de ativação de músculos do core abdominal, durante o movimento de extensão da anca, do membro dominante, em indivíduos com e sem dor lombo- pélvica crónica inespecífica. Pretende-se, também, pesquisar a existência do padrão de ativação considerado “normal“ e verificar a relação entre o padrão de ativação e o tilt pélvico, em ambos os indivíduos. Métodos: Estudo transversal, com 64 estudantes universitários, divididos em dois grupos: 31 sem e 33 com dor lombo-pélvica. Através de eletromiografia de superfície foi recolhida a atividade muscular dos Eretores da Espinha ipsilateral e contralateral, Glúteo Máximo e Bicípite Femoral ipsilaterais. Foi analisado o timing de ativação muscular e as respetivas ordens de ativação. Adicionalmente foi medido o tilt pélvico. Resultados: O grupo com dor lombo-pélvica apresentou um atraso significativo no timing de ativação dos músculos Glúteo Máximo ipsilateral (t=-3,171;p=0,002) e Bicípite Femoral ipsilateral (t=-2,092;p=0,041), em comparação com o grupo sem dor. Verificou-se uma associação significativa entre as 5 ordens de ativação mais frequentes e a presença de dor lombo-pélvica (xf2=11,54;p=0,015). A ordem de ativação "normal" – Glúteo Máximo ipsilateral>Bicípite Femoral ipsilateral>Eretor da Espinha contralateral>Eretor da Espinha ipsilateral – não foi utilizada. Verificou-se que o Bicípite Femoral ipsilateral foi maioritariamente o primeiro a ativar-se e o Glúteo Máximo ipsilateral o último em ambos os grupos. Verificou-se um tilt pélvico significativamente superior nos indivíduos que ativam primeiro o Bicípite Femoral ipsilateral nos grupos com (U=51;p=0,001) e sem dor (U=41p=0,001). Conclusão: Os indivíduos com dor lombo-pélvica apresentaram um atraso no timing de ativação dos músculos do core abdominal. Os resultados parecem refutar a ordem de ativação "normal" que tem sido proposta. Não foi possível apoiar nem contestar a teoria de que um atraso na ativação do Glúteo Máximo está associado com dor lombo-pélvica.

Satisfação de agentes afectivos no processo de tomada de decisão em grupo

Um dos factores mais determinantes para o sucesso de uma organização é a qualidade das decisões tomadas. Para que as decisões tomadas sejam melhores e potenciem a competitividade das organizações, sistemas como os Sistemas de Apoio à Tomada de Decisão em Grupo (SADG) têm sido fortemente desenvolvidos e estudados nas últimas décadas. Cada vez mais, estes sistemas são populados com um maior número de dados, com o objectivo de serem mais assertivos. Considera-se que com determinados dados seja possível que o sistema possa aferir a satisfação dos participantes com as decisões tomadas, tendencialmente de forma automática. Hoje em dia, as análises de satisfação com as decisões não contemplam na sua maioria factores imprescindíveis, como os emocionais e de personalidade, sendo que os modelos existentes tendem a ser incompletos. Nesta dissertação propõe-se uma metodologia que permite a um SADG aferir a satisfação do participante com a decisão, considerando aspectos como a personalidade, as emoções e as expectativas. A metodologia desenvolvida foi implementada num SADG (ArgEmotionsAgents) com uma arquitectura multiagente, composto por agentes que reflectem participantes reais e que estão modelados com a sua personalidade. De acordo com a sua personalidade, esses agentes trocam argumentos persuasivos de forma a obterem uma decisão consensual. No processo de troca de argumentos os agentes geram emoções que afectam o seu humor. A implementação da metodologia no ArgEmotionsAgents permite que, no final de uma reunião, seja possível aferir a satisfação dos agentes participantes com a decisão final e com o processo que levou à tomada de decisão. De forma a validar a metodologia proposta bem como a implementação que foi desenvolvida, foram realizadas quatro experiências em diferentes cenários. Numa primeira experiência, foi aferida a satisfação dos quatro agentes participantes. Nas experiências seguintes, um dos agentes participantes foi usado como referência e foram alteradas configurações (expectativas, personalidade e reavaliação das alternativas) para perceber de que forma os vários factores afectam a satisfação. Com o estudo concluiu-se que todos os factores considerados no modelo afectam a satisfação. A forma como a satisfação é afectada por cada um dos factores vai ao encontro da lógica apresentada no estado da arte. Os resultados de satisfação aferidos pelo modelo são congruentes.

Quais os motivos do insucesso de algumas crianças na aprendizagem musical? Motivação e Flow Theory

Este artigo aborda a natureza da motivação na sua relação com a aprendizagem musical. Um dos objectivos principais é problematizar a questão das diferenças no sucesso da aprendizagem musical quando nos encontramos perante indivíduos com níveis aparentemente semelhantes de capacidade e potencial musicais. Começa por apresentar um conjunto de modelos teóricos que oferecem uma visão acerca das razões que podem explicar as variações e mudanças na motivação. Refere-se investigação recente que sugere que os processos motivacionais não são pré-determinados mas podem ser aprendidos e que os indivíduos, para atingir níveis elevados de sucesso, necessitam de uma focagem no processo por oposição a uma focagem no produto. São introduzidos e explorados processos cognitivos fundamentais relacionados com a aprendizagem musical (por exemplo, comportamento au to-regulado, papel da motivação intrínseca e extrínseca) . Como conclusão, sugerem-se algumas práticas específicas para que os professores possam reflectir acerca da melhor forma de encorajar e aumentar a motivação dos seus alunos para aprender música.

Metacognitive and social cognition training (MSCT) in schizophrenia: a preliminary efficacy study

Psychosocial interventions have proven to be effective in treating social cognition in people with psychotic disorders. The current study aimed to determine the effects of a metacognitive and social cognition training (MSCT) program, designed to both remediate deficits and correct biases in social cognition. Thirty-five clinically stable outpatients were recruited and assigned to the MSCT program (n = 19) for 10 weeks (18 sessions) or to the TAU group (n = 16), and they all completed pre- and post-treatment assessments of social cognition, cognitive biases, functioning and symptoms. The MSCT group demonstrated a significant improvement in theory of mind, social perception, emotion recognition and social functioning. Additionally, the tendency to jump to conclusions was significantly reduced among the MSCT group after training. There were no differential benefits regarding clinical symptoms except for one trend group effect for general psychopathology. The results support the efficacy of the MSCT format, but further development of the training program is required to increase the benefits related to attributional style.

Strategic bidding in electricity markets: an agent-based simulator with game theory for scenario analysis

Electricity markets are complex environments, involving a large number of different entities, with specific characteristics and objectives, making their decisions and interacting in a dynamic scene. Game-theory has been widely used to support decisions in competitive environments; therefore its application in electricity markets can prove to be a high potential tool. This paper proposes a new scenario analysis algorithm, which includes the application of game-theory, to evaluate and preview different scenarios and provide players with the ability to strategically react in order to exhibit the behavior that better fits their objectives. This model includes forecasts of competitor players’ actions, to build models of their behavior, in order to define the most probable expected scenarios. Once the scenarios are defined, game theory is applied to support the choice of the action to be performed. Our use of game theory is intended for supporting one specific agent and not for achieving the equilibrium in the market. MASCEM (Multi-Agent System for Competitive Electricity Markets) is a multi-agent electricity market simulator that models market players and simulates their operation in the market. The scenario analysis algorithm has been tested within MASCEM and our experimental findings with a case study based on real data from the Iberian Electricity Market are presented and discussed.

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.

Supporting real-time parallel task models with work-stealing

Dynamic parallel scheduling using work-stealing has gained popularity in academia and industry for its good performance, ease of implementation and theoretical bounds on space and time. Cores treat their own double-ended queues (deques) as a stack, pushing and popping threads from the bottom, but treat the deque of another randomly selected busy core as a queue, stealing threads only from the top, whenever they are idle. However, this standard approach cannot be directly applied to real-time systems, where the importance of parallelising tasks is increasing due to the limitations of multiprocessor scheduling theory regarding parallelism. Using one deque per core is obviously a source of priority inversion since high priority tasks may eventually be enqueued after lower priority tasks, possibly leading to deadline misses as in this case the lower priority tasks are the candidates when a stealing operation occurs. Our proposal is to replace the single non-priority deque of work-stealing with ordered per-processor priority deques of ready threads. The scheduling algorithm starts with a single deque per-core, but unlike traditional work-stealing, the total number of deques in the system may now exceed the number of processors. Instead of stealing randomly, cores steal from the highest priority deque.

RiSeG: a ring based secure group communication protocol for resource-constrained wireless sensor networks

Securing group communication in wireless sensor networks has recently been extensively investigated. Many works have addressed this issue, and they have considered the grouping concept differently. In this paper, we consider a group as being a set of nodes sensing the same data type, and we alternatively propose an efficient secure group communication scheme guaranteeing secure group management and secure group key distribution. The proposed scheme (RiSeG) is based on a logical ring architecture, which permits to alleviate the group controller’s task in updating the group key. The proposed scheme also provides backward and forward secrecy, addresses the node compromise attack, and gives a solution to detect and eliminate the compromised nodes. The security analysis and performance evaluation show that the proposed scheme is secure, highly efficient, and lightweight. A comparison with the logical key hierarchy is preformed to prove the rekeying process efficiency of RiSeG. Finally, we present the implementation details of RiSeG on top of TelosB sensor nodes to demonstrate its feasibility.

Slotted wiDom: schedulability analysis and its experimental validation

WiDom is a wireless prioritized medium access control protocol which offers a very large number of priority levels. Hence, it brings the potential to employ non-preemptive static-priority scheduling and schedulability analysis for a wireless channel assuming that the overhead of WiDom is modeled properly. One schedulability analysis for WiDom has already been proposed but recent research has created a new version of WiDom (we call it: Slotted WiDom) with lower overhead and for this version of WiDom no schedulability analysis exists. In this paper we propose a new schedulability analysis for slotted WiDom and extend it to work also for message streams with release jitter. We have performed experiments with an implementation of slotted WiDom on a real-world platform (MicaZ). We find that for each message stream, the maximum observed response time never exceeds the calculated response time and hence this corroborates our belief that our new scheduling theory is applicable in practice.

Sporadic multiprocessor Linux scheduler

The advent of multicore systems has renewed the interest of research community on real-time scheduling on multiprocessor systems. Real-time scheduling theory for uniprocessors is considered a mature research field, but real-time scheduling theory for multiprocessors is an emerging research field. Being part of this research community I have decided to implement the Sporadic Multiprocessor Linux Scheduler that implements a new real-time scheduling algorithm, which was designed to schedule real-time sporadic tasks on multiprocessor systems. This technical reports describes the implementation of the SMLS.

Two protocols without periodicity for the global and preemptive scheduling problem of multi-mode real-time systems upon multiprocessor Platforms

We consider the problem of scheduling a multi-mode real-time system upon identical multiprocessor platforms. Since it is a multi-mode system, the system can change from one mode to another such that the current task set is replaced with a new task set. Ensuring that deadlines are met requires not only that a schedulability test is performed on tasks in each mode but also that (i) a protocol for transitioning from one mode to another is specified and (ii) a schedulability test for each transition is performed. We propose two protocols which ensure that all the expected requirements are met during every transition between every pair of operating modes of the system. Moreover, we prove the correctness of our proposed algorithms by extending the theory about the makespan determination problem.

Relatório de estágio em Educação Pré-Escolar

Mestrado em Educação Pré-Escolar

Calculating an upper bound on the finishing time of a group of threads executing on a GPU: a preliminary case study

Graphics processor units (GPUs) today can be used for computations that go beyond graphics and such use can attain a performance that is orders of magnitude greater than a normal processor. The software executing on a graphics processor is composed of a set of (often thousands of) threads which operate on different parts of the data and thereby jointly compute a result which is delivered to another thread executing on the main processor. Hence the response time of a thread executing on the main processor is dependent on the finishing time of the execution of threads executing on the GPU. Therefore, we present a simple method for calculating an upper bound on the finishing time of threads executing on a GPU, in particular NVIDIA Fermi. Developing such a method is nontrivial because threads executing on a GPU share hardware resources at very fine granularity.

An implicit GTS allocation mechanism in IEEE 802.15.4 for time-sensitive wireless sensor networks: theory and practice

Timeliness guarantee is an important feature of the recently standardized IEEE 802.15.4 protocol, turning it quite appealing for Wireless Sensor Network (WSN) applications under timing constraints. When operating in beacon-enabled mode, this protocol allows nodes with real-time requirements to allocate Guaranteed Time Slots (GTS) in the contention-free period. The protocol natively supports explicit GTS allocation, i.e. a node allocates a number of time slots in each superframe for exclusive use. The limitation of this explicit GTS allocation is that GTS resources may quickly disappear, since a maximum of seven GTSs can be allocated in each superframe, preventing other nodes to benefit from guaranteed service. Moreover, the GTS may be underutilized, resulting in wasted bandwidth. To overcome these limitations, this paper proposes i-GAME, an implicit GTS Allocation Mechanism in beacon-enabled IEEE 802.15.4 networks. The allocation is based on implicit GTS allocation requests, taking into account the traffic specifications and the delay requirements of the flows. The i-GAME approach enables the use of one GTS by multiple nodes, still guaranteeing that all their (delay, bandwidth) requirements are satisfied. For that purpose, we propose an admission control algorithm that enables to decide whether to accept a new GTS allocation request or not, based not only on the remaining time slots, but also on the traffic specifications of the flows, their delay requirements and the available bandwidth resources. We show that our approach improves the bandwidth utilization as compared to the native explicit allocation mechanism defined in the IEEE 802.15.4 standard. We also present some practical considerations for the implementation of i-GAME, ensuring backward compatibility with the IEEE 801.5.4 standard with only minor add-ons. Finally, an experimental evaluation on a real system that validates our theoretical analysis and demonstrates the implementation of i-GAME is also presented

Object transportation by multiple mobile robots controlled by attractor dynamics: theory and implementation

Dynamical systems theory is used as a theoretical language and tool to design a distributed control architecture for teams of mobile robots, that must transport a large object and simultaneously avoid collisions with (either static or dynamic) obstacles. Here we demonstrate in simulations and implementations in real robots that it is possible to simplify the architectures presented in previous work and to extend the approach to teams of n robots. The robots have no prior knowledge of the environment. The motion of each robot is controlled by a time series of asymptotical stable states. The attractor dynamics permits the integration of information from various sources in a graded manner. As a result, the robots show a strikingly smooth an stable team behaviour.