Movement Kinematics and their Relationship with Performance in Target Acquisition Task Using a Mouse

Movement kinematics has been shown useful for characterizing the process of aiming movement in target acquisition tasks. There are multiple kinematic measures reported in the literature, but their relationship to eventual performance is not well documented. To determine the relationship between various kinematic measures and movement performance, data were collected from participants aged 21 to 90 years with a wide range of psychomotor ability. When computed across age groups, time to peak velocity (TPV), time to peak acceleration (TPA), and time from peak velocity until the end of movement (TPVEND) were found to correlate with movement performance. However, the relationships diminished when the correlations were computed within age groups (except for TPVEND). More interestingly, despite the extensive report, certain kinematic measures such as peak velocity were found to be uncorrelated with performance. Thus, when performance is the focus, improvement should be made to reduce TPV, TPA, and TPVEND.Yeshttps://us.sagepub.com/en-us/nam/manuscript-submission-guideline

Optimizing the Performance of Streaming Numerical Kernels on the IBM Blue Gene/P PowerPC 450 Processor

Several emerging petascale architectures use energy-efficient processors with vectorized computational units and in-order thread processing. On these architectures the sustained performance of streaming numerical kernels, ubiquitous in the solution of partial differential equations, represents a challenge despite the regularity of memory access. Sophisticated optimization techniques are required to fully utilize the Central Processing Unit (CPU). We propose a new method for constructing streaming numerical kernels using a high-level assembly synthesis and optimization framework. We describe an implementation of this method in Python targeting the IBM Blue Gene/P supercomputer's PowerPC 450 core. This paper details the high-level design, construction, simulation, verification, and analysis of these kernels utilizing a subset of the CPU's instruction set. We demonstrate the effectiveness of our approach by implementing several three-dimensional stencil kernels over a variety of cached memory scenarios and analyzing the mechanically scheduled variants, including a 27-point stencil achieving a 1.7x speedup over the best previously published results

CBESW: Sequence Alignment on the Playstation 3

<p>Abstract</p> <p>Background</p> <p>The exponential growth of available biological data has caused bioinformatics to be rapidly moving towards a data-intensive, computational science. As a result, the computational power needed by bioinformatics applications is growing exponentially as well. The recent emergence of accelerator technologies has made it possible to achieve an excellent improvement in execution time for many bioinformatics applications, compared to current general-purpose platforms. In this paper, we demonstrate how the PlayStation^®3, powered by the Cell Broadband Engine, can be used as a computational platform to accelerate the Smith-Waterman algorithm.</p> <p>Results</p> <p>For large datasets, our implementation on the PlayStation^®3 provides a significant improvement in running time compared to other implementations such as SSEARCH, Striped Smith-Waterman and CUDA. Our implementation achieves a peak performance of up to 3,646 MCUPS.</p> <p>Conclusion</p> <p>The results from our experiments demonstrate that the PlayStation^®3 console can be used as an efficient low cost computational platform for high performance sequence alignment applications.</p

IBM-Crosspad on-line handwriting database in STK format - donated exclusively to University of Groningen

This data was donated to AI Dept. RuG by IBM in 2007 It contains *.STK files (ASCII) containing on-line handwriting pen-tip coordinates (x,y). The format can be converted to unipen. For internal use at RuG only. You may request access to the files in this upload, provided that you fulfil the conditions below. The decision whether to grant/deny access is solely under the responsibility of the record owner