Movement-related potentials in Huntington's disease: movement preparation and execution

Movement-related potentials (MRPs) reflect increasing cortical activity related to the preparation and execution of voluntary movement. Execution and preparatory components may be separated by comparing MRPs recorded from actual and imagined movement. Imagined movement initiates preparatory processes, but not motor execution activity. MRPs are maximal over the supplementary motor area (SMA), an area of the cortex involved in the planning and preparation of movement. The SMA receives input from the basal ganglia, which are affected in Huntington's disease (HD), a hyperkinetic movement disorder. In order to further elucidate the effects of the disorder upon the cortical activity relating to movement, MRPs were recorded from ten HD patients, and ten age-matched controls, whilst they performed and imagined performing a sequential button-pressing task. HD patients produced MRPs of significantly reduced size both for performed and imagined movement. The component relating to movement execution was obtained by subtracting the MRP for imagined movement from the MRP for performed movement, and was found to be normal in HD. The movement preparation component was found by subtracting the MRP found for a control condition of watching the visual cues from the MRP for imagined movement. This preparation component in HD was reduced in early slope, peak amplitude, and post-peak slope. This study therefore reported abnormal MRPs in HD. particularly in terms of the components relating to movement preparation, and this finding may further explain the movement deficits reported in the disease.

Equalisation of time variant multipath channels using amplitude banded LMS algorithms

For the purpose of equalisation of rapidly time variant multipath channels, we derive a novel adaptive algorithm, the amplitude banded LMS (ABLMS); which implements a nonlinear adaptation based on a coefficient matrix. Then we develop the: ABLMS algorithm as the adaptation procedure for a linear transversal equaliser (LTE) and a decision feedback equaliser (DFE) where a parallel adaptation scheme is deployed. Computer simulations demonstrate that with a small increase of computational complexity, the ABLMS based parallel equalisers provide a significant improvement related to the conventional LMS DFE and the LMS LTE in the case of a second order Markov communication channel model.

Bit error rate performance enhancement of a retrodirective array over a conventional fixed beam array in a dynamic multipath environment

In this paper, we provide experimental evidence to show that enhanced bit error rate (BER) performance is possible using a retrodirective array operating in a dynamically varying multipath environment. The operation of such a system will be compared to that obtained by a conventional nonretrodirective array. The ability of the array to recover amplitude shift keyed encoded data transmitted from a remote location whose position is not known a priori is described. In addition, its ability to retransmit data inserted at the retrodirective array back to a spatially remote beacon location whose position is also not known beforehand is also demonstrated. Comparison with an equivalent conventional fixed beam antenna array utilizing an identical radiating aperture arrangement to that of the retrodirective array are given. These show that the retrodirective array can effectively exploit the presence of time varying multipath in order to give significant reductions in BER over what can be otherwise achieved. Additionally, the retrodirective system is shown to be able to deliver low BER regardless of whether line of sight is present or absent.

Effect of environmental multipath on line of sight body to body communication at 2.45 GHz

Body to body links are the most scenario dependent form of body centric communications with performance highly dependent on the users' movements, relative positioning and the local operating environment. This paper focuses on line of sight cases which although they should be the most dependent, still have considerable variability depending on local propagation conditions. The results presented in the paper also raise important questions about the statistical characterisation of such links and the effect of different approaches to local mean averaging on fading characteristics. © 2012 IEEE.

Analysis of Dependence Tracking Algorithms for Task Dataflow Execution

Processor architectures has taken a turn towards many-core processors, which integrate multiple processing cores on a single chip to increase overall performance, and there are no signs that this trend will stop in the near future. Many-core processors are harder to program than multi-core and single-core processors due to the need of writing parallel or concurrent programs with high degrees of parallelism. Moreover, many-cores have to operate in a mode of strong scaling because of memory bandwidth constraints. In strong scaling increasingly finer-grain parallelism must be extracted in order to keep all processing cores busy.

Task dataflow programming models have a high potential to simplify parallel program- ming because they alleviate the programmer from identifying precisely all inter-task de- pendences when writing programs. Instead, the task dataflow runtime system detects and enforces inter-task dependences during execution based on the description of memory each task accesses. The runtime constructs a task dataflow graph that captures all tasks and their dependences. Tasks are scheduled to execute in parallel taking into account dependences specified in the task graph.

Several papers report important overheads for task dataflow systems, which severely limits the scalability and usability of such systems. In this paper we study efficient schemes to manage task graphs and analyze their scalability. We assume a programming model that supports input, output and in/out annotations on task arguments, as well as commutative in/out and reductions. We analyze the structure of task graphs and identify versions and generations as key concepts for efficient management of task graphs. Then, we present three schemes to manage task graphs building on graph representations, hypergraphs and lists. We also consider a fourth edge-less scheme that synchronizes tasks using integers. Analysis using micro-benchmarks shows that the graph representation is not always scalable and that the edge-less scheme introduces least overhead in nearly all situations.