Anticipation of a non-aversive reaction time task facilitates the blink startle reflex

The conditions under which blink startle facilitation can be found in anticipation of a reaction time task were investigated to resolve inconsistent findings across previous studies. Four groups of participants (n = 64) were presented with two visual stimuli, one predicting a reaction time task (S+) and the second presented alone (S-). Participants were asked to make a speeded response to the offset of the S+ (S1 paradigm) or were asked to respond to a tactile stimulus presented at the offset of the S+ (S1-S2 paradigm). Half of the participants in each paradigm condition received performance feedback. Overall, blink latency shortening and magnitude facilitation were larger during S+ than during S-. More detailed analyses, however, found these differences to be reliable only in the Feedback conditions. Ratings of S+ pleasantness did not change across the experiment. Electrodermal responses to S+ were larger than to S- in all groups with differential electrodermal responding emerging earlier in the S1 paradigm. Taken together, the data support the notion that startle facilitation can occur during non-aversive Pavlovian conditioning. (C) 2002 Elsevier Science B.V. All rights reserved.

Do expertise and the degree of perception-action coupling affect natural anticipatory performance?

Two experiments using a temporal occlusion paradigm (the first with expert and novice participants and the second with participants of intermediate skill) were conducted to examine the capability of tennis players to predict the direction of an opponent's service in situ. In both experiments two different response conditions, reflecting differing degrees of perception-action coupling, were employed. In a coupled condition players were required to make a movement-based response identical to that which they would use to hit a return of service in a game situation, whereas in an uncoupled condition a verbal prediction of service direction was required. Experiment 1 provided clear evidence of superior prediction accuracy under the coupled response condition when ball flight was available, plus some limited evidence to suggest that superior prediction accuracy under uncoupled response conditions might hold true if only advance (pre-contact) information was available. Experiment 2 showed the former finding to be a robust one, but was unable to reveal any support for the latter. Experiment 1 also revealed that expert superiority is more apparent for predictions made under natural (coupled) than uncoupled response-mode conditions. Collectively, these findings suggest that different perceptual processes may be in operation in anticipatory tasks which depend on skill level, the type of information presented, and degree of perception-action coupling inherent in the task requirements.

The use of quantitative performance information by local elected politicians in top managers’ performance evaluation: case studies

This paper studies the use of results oriented performance information (outputs and outcomes) by local elected politicians (aldermen) in top managers’ performance evaluation. The main goal is to understand the top managers’ performance evaluation process conducted by Portuguese aldermen and to identify the dominant evaluation style. In line with Bogt (2001), an exploratory field research was developed in three large municipalities: Porto, Braga and Matosinhos. We intend to answer the following research questions: to what extent are local politicians (aldermen) 1 using results information (about outputs and outcomes) to evaluate top managers’ performance? Do aldermen give any importance to quantitative output information and report them on current planning and control documents? Will the output performance information be used on performance evaluation in a different way concerning policy field (task orientation)? Based on the Hopwood evaluation styles (adapted from the private to the public sector by Bogt, 2001), we have found that the performance evaluation process of top managers is more featured by the ‘operations-conscious styles’ (or ‘implicit style’). Portuguese aldermen recognize the importance to quantify outputs and outcomes, but these days they focus on the information about activities and the realized operations when they evaluate performance. We haven´t found significant differences between different tasks (some exceptions for culture and environment areas). However, the municipality of Matosinhos paid more attention on quantitative performance information. This finding is reinforced by the quality of quantitative data on outputs reported on its management report. Generally speaking, aldermen are aware that more attention should be paid to quantitative information about results and performance, taking into account recent reforms introduced in Portuguese municipalities (PLG) on this field, but the ‘implicit’ style is dominant.

Assessment of Laparoscopic Skills Performance: 2D Versus 3D Vision and Classic Instrument Versus New Hand-Held Robotic Device for Laparoscopy

Introduction and Objectives. Laparoscopic surgery has undeniable advantages, such as reduced postoperative pain, smaller incisions, and faster recovery. However, to improve surgeons’ performance, ergonomic adaptations of the laparoscopic instruments and introduction of robotic technology are needed. The aim of this study was to ascertain the influence of a new hand-held robotic device for laparoscopy (HHRDL) and 3D vision on laparoscopic skills performance of 2 different groups, naïve and expert. Materials and Methods. Each participant performed 3 laparoscopic tasks—Peg transfer, Wire chaser, Knot—in 4 different ways. With random sequencing we assigned the execution order of the tasks based on the first type of visualization and laparoscopic instrument. Time to complete each laparoscopic task was recorded and analyzed with one-way analysis of variance. Results. Eleven experts and 15 naïve participants were included. Three-dimensional video helps the naïve group to get better performance in Peg transfer, Wire chaser 2 hands, and Knot; the new device improved the execution of all laparoscopic tasks (P < .05). For expert group, the 3D video system benefited them in Peg transfer and Wire chaser 1 hand, and the robotic device in Peg transfer, Wire chaser 1 hand, and Wire chaser 2 hands (P < .05). Conclusion. The HHRDL helps the execution of difficult laparoscopic tasks, such as Knot, in the naïve group. Three-dimensional vision makes the laparoscopic performance of the participants without laparoscopic experience easier, unlike those with experience in laparoscopic procedures.

A comparative benchmarking analysis of main Iberian container terminals: a DEA approach

Benchmarking is an important tool to organisations to improve their productivity, product quality, process efficiency or services. From Benchmarking the organisations could compare their performance with competitors and identify their strengths and weaknesses. This study intends to do a benchmarking analysis on the main Iberian Sea ports with a special focus on their container terminals efficiency. To attain this, the DEA (data envelopment analysis) is used since it is considered by several researchers as the most effective method to quantify a set of key performance indicators. In order to reach a more reliable diagnosis tool the DEA is used together with the data mining in comparing the sea ports operational data of container terminals during 2007.Taking into account that sea ports are global logistics networks the performance evaluation is essential to an effective decision making in order to improve their efficiency and, therefore, their competitiveness.

Supporting intra-task parallelism in real-time multiprocessor systems

Os sistemas de tempo real modernos geram, cada vez mais, cargas computacionais pesadas e dinâmicas, começando-se a tornar pouco expectável que sejam implementados em sistemas uniprocessador. Na verdade, a mudança de sistemas com um único processador para sistemas multi- processador pode ser vista, tanto no domínio geral, como no de sistemas embebidos, como uma forma eficiente, em termos energéticos, de melhorar a performance das aplicações. Simultaneamente, a proliferação das plataformas multi-processador transformaram a programação paralela num tópico de elevado interesse, levando o paralelismo dinâmico a ganhar rapidamente popularidade como um modelo de programação. A ideia, por detrás deste modelo, é encorajar os programadores a exporem todas as oportunidades de paralelismo através da simples indicação de potenciais regiões paralelas dentro das aplicações. Todas estas anotações são encaradas pelo sistema unicamente como sugestões, podendo estas serem ignoradas e substituídas, por construtores sequenciais equivalentes, pela própria linguagem. Assim, o modo como a computação é na realidade subdividida, e mapeada nos vários processadores, é da responsabilidade do compilador e do sistema computacional subjacente. Ao retirar este fardo do programador, a complexidade da programação é consideravelmente reduzida, o que normalmente se traduz num aumento de produtividade. Todavia, se o mecanismo de escalonamento subjacente não for simples e rápido, de modo a manter o overhead geral em níveis reduzidos, os benefícios da geração de um paralelismo com uma granularidade tão fina serão meramente hipotéticos. Nesta perspetiva de escalonamento, os algoritmos que empregam uma política de workstealing são cada vez mais populares, com uma eficiência comprovada em termos de tempo, espaço e necessidades de comunicação. Contudo, estes algoritmos não contemplam restrições temporais, nem outra qualquer forma de atribuição de prioridades às tarefas, o que impossibilita que sejam diretamente aplicados a sistemas de tempo real. Além disso, são tradicionalmente implementados no runtime da linguagem, criando assim um sistema de escalonamento com dois níveis, onde a previsibilidade, essencial a um sistema de tempo real, não pode ser assegurada. Nesta tese, é descrita a forma como a abordagem de work-stealing pode ser resenhada para cumprir os requisitos de tempo real, mantendo, ao mesmo tempo, os seus princípios fundamentais que tão bons resultados têm demonstrado. Muito resumidamente, a única fila de gestão de processos convencional (deque) é substituída por uma fila de deques, ordenada de forma crescente por prioridade das tarefas. De seguida, aplicamos por cima o conhecido algoritmo de escalonamento dinâmico G-EDF, misturamos as regras de ambos, e assim nasce a nossa proposta: o algoritmo de escalonamento RTWS. Tirando partido da modularidade oferecida pelo escalonador do Linux, o RTWS é adicionado como uma nova classe de escalonamento, de forma a avaliar na prática se o algoritmo proposto é viável, ou seja, se garante a eficiência e escalonabilidade desejadas. Modificar o núcleo do Linux é uma tarefa complicada, devido à complexidade das suas funções internas e às fortes interdependências entre os vários subsistemas. Não obstante, um dos objetivos desta tese era ter a certeza que o RTWS é mais do que um conceito interessante. Assim, uma parte significativa deste documento é dedicada à discussão sobre a implementação do RTWS e à exposição de situações problemáticas, muitas delas não consideradas em teoria, como é o caso do desfasamento entre vários mecanismo de sincronização. Os resultados experimentais mostram que o RTWS, em comparação com outro trabalho prático de escalonamento dinâmico de tarefas com restrições temporais, reduz significativamente o overhead de escalonamento através de um controlo de migrações, e mudanças de contexto, eficiente e escalável (pelo menos até 8 CPUs), ao mesmo tempo que alcança um bom balanceamento dinâmico da carga do sistema, até mesmo de uma forma não custosa. Contudo, durante a avaliação realizada foi detetada uma falha na implementação do RTWS, pela forma como facilmente desiste de roubar trabalho, o que origina períodos de inatividade, no CPU em questão, quando a utilização geral do sistema é baixa. Embora o trabalho realizado se tenha focado em manter o custo de escalonamento baixo e em alcançar boa localidade dos dados, a escalonabilidade do sistema nunca foi negligenciada. Na verdade, o algoritmo de escalonamento proposto provou ser bastante robusto, não falhando qualquer meta temporal nas experiências realizadas. Portanto, podemos afirmar que alguma inversão de prioridades, causada pela sub-política de roubo BAS, não compromete os objetivos de escalonabilidade, e até ajuda a reduzir a contenção nas estruturas de dados. Mesmo assim, o RTWS também suporta uma sub-política de roubo determinística: PAS. A avaliação experimental, porém, não ajudou a ter uma noção clara do impacto de uma e de outra. No entanto, de uma maneira geral, podemos concluir que o RTWS é uma solução promissora para um escalonamento eficiente de tarefas paralelas com restrições temporais.

Preparação para a performance instrumental: problemáticas e estratégias: relatório de estágio

Resumo I (Prática Pedagógica) - Nesta seção do relatório de estágio pretende-se caraterizar e apresentar todos os elementos referentes à prática pedagógica, que fizeram parte do estágio do ensino especializado da música, realizado na Escola de Música do Orfeão de Leiria no ano letivo de 2013/2014. De uma forma geral, o relatório de estágio pretende colocar em evidência aspetos pedagógicos como metodologias de ensino, questões motivacionais, estilos de aprendizagem, entre outros. Durante um ano letivo completo foram analisados, com especial atenção, três alunos que foram envolvidos no estágio, construindo e modelando os seus processos de aprendizagem. Para cada um deles foi realizado, ao longo do ano letivo, 30 planos de aula, uma planificação anual e três gravações vídeo/áudio em contexto de aula. Não foi uma tarefa nada fácil de realizar, mas que trouxe inúmeros conhecimentos não só de caráter pedagógico mas também de caráter pessoal. A parte inicial desta seção será dedicada à descrição e caraterização da escola onde foi realizado o estágio, a Escola de Música do Orfeão de Leiria/Conservatório de Artes. Será feita uma pequena abordagem histórica da instituição, bem como do seu projeto educativo, dacomunidade escolar, do seu contexto sociocultural e da classe de saxofone. Será apresentada também uma caraterização dos alunos, segundo vários parâmetros. Posteriormente, serão descritas algumas das práticas educativas desenvolvidas, com os alunos, em contexto de estágio. Para tal, serão utilizados como instrumentos, não só a experiência ativa do docente/estagiário, mas também todas as gravações, planos de aulas e planificações anuais, realizados em contexto de estágio do ensino especializado. Por fim, será realizada uma reflexão crítica do desempenho como docente de saxofone no âmbito do estágio e uma conclusão de toda a seção da prática pedagógica.

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.

Ansiedade na performance: causas e possíveis curas

I - Este relatório pretende descrever o estágio especializado em ensino de música realizado no âmbito do mestrado em Ensino de Música na Escola Superior de Música de Lisboa. Este estágio decorreu no Instituto Gregoriano de Lisboa e no Conservatório de Música, de Dança e de Arte Dramática de Lisboa, duas escolas de ensino oficial especializado. Sendo a primeira pública e a segunda privada, estas escolas apresentam realidades muito diferentes do ponto de vista organizacional e de gestão, que resultam em situações heterogéneas e dependentes de vários factores que serão mencionados ao longo deste relatório. A análise SWOT efectuada para cada uma destas organizações descreve mais objectivamente os factores e variáveis que permitiram construir este relatório. Foram caracterizados três alunos, um de cada curso: preparatório, básico e secundário. A Maria M. é a aluna do 2º ano do curso preparatório, o Pedro R. é aluno de 3º grau do curso básico de instrumento e o Diego M. é aluno de 7º grau. Foram aprofundadas as práticas pedagógicas desenvolvidas com cada um dos alunos e os avanços e metas atingidas por cada um destes alunos. Este estágio resulta numa reflexão sobre a prática pedagógica aplicada e as suas motivações.

A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast. We illustrate this with an example.

Provably good task assignment on heterogeneous multiprocessor platforms for a restricted case but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We consider a restricted case where the maximum utilization of any task on any processor in the system is no greater than one. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee for this restricted case but for a stronger adversary. We show that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast.

Demo abstract: RadiaLE: a framework for benchmarking link quality estimators

Link quality estimation is a fundamental building block for the design of several different mechanisms and protocols in wireless sensor networks (WSN). A thorough experimental evaluation of link quality estimators (LQEs) is thus mandatory. Several WSN experimental testbeds have been designed ([1–4]) but only [3] and [2] targeted link quality measurements. However, these were exploited for analyzing low-power links characteristics rather than the performance of LQEs. Despite its importance, the experimental performance evaluation of LQEs remains an open problem, mainly due to the difficulty to provide a quantitative evaluation of their accuracy. This motivated us to build a benchmarking testbed for LQE - RadiaLE, which we present here as a demo. It includes (i.) hardware components that represent the WSN under test and (ii.) a software tool for the set up and control of the experiments and also for analyzing the collected data, allowing for LQEs evaluation.

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.

Dynamic QoS adaptation of inter- dependent task sets in cooperative embedded systems

Due to the growing complexity and dynamism of many embedded application domains (including consumer electronics, robotics, automotive and telecommunications), it is increasingly difficult to react to load variations and adapt the system's performance in a controlled fashion within an useful and bounded time. This is particularly noticeable when intending to benefit from the full potential of an open distributed cooperating environment, where service characteristics are not known beforehand and tasks may exhibit unrestricted QoS inter-dependencies. This paper proposes a novel anytime adaptive QoS control policy in which the online search for the best set of QoS levels is combined with each user's personal preferences on their services' adaptation behaviour. 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.

Dynamic peripheral visual performance relates to alpha activity in soccer players

Many studies have demonstrated the relationship between the alpha activity and the central visual ability, in which the visual ability is usually assessed through static stimuli. Besides static circumstance, however in the real environment there are often dynamic changes and the peripheral visual ability in a dynamic environment (i.e., dynamic peripheral visual ability) is important for all people. So far, no work has reported whether there is a relationship between the dynamic peripheral visual ability and the alpha activity. Thus, the objective of this study was to investigate their relationship. Sixty-two soccer players performed a newly designed peripheral vision task in which the visual stimuli were dynamic, while their EEG signals were recorded from Cz, O1, and O2 locations. The relationship between the dynamic peripheral visual performance and the alpha activity was examined by the percentage-bend correlation test. The results indicated no significant correlation between the dynamic peripheral visual performance and the alpha amplitudes in the eyes-open and eyes-closed resting condition. However, it was not the case for the alpha activity during the peripheral vision task: the dynamic peripheral visual performance showed significant positive inter-individual correlations with the amplitudes in the alpha band (8-12 Hz) and the individual alpha band (IAB) during the peripheral vision task. A potential application of this finding is to improve the dynamic peripheral visual performance by up-regulating alpha activity using neuromodulation techniques.