20,826 research outputs found
An evaluation of planarity of the spatial QRS loop by three dimensional vectorcardiography: its emergence and loss
Aims:
To objectively characterize and mathematically justify the observation that vectorcardiographic QRS loops in normal individuals are more planar than those from patients with ST elevation myocardial infarction (STEMI).
Methods:
Vectorcardiograms (VCGs) were constructed from three simultaneously recorded quasi-orthogonal leads, I, aVF and V2 (sampled at 1000 samples/s). The planarity of these QRS loops was determined by fitting a surface to each loop. Goodness of fit was expressed in numerical terms.
Results:
15 healthy individuals aged 35–65 years (73% male) and 15 patients aged 45–70 years (80% male) with diagnosed acute STEMI were recruited. The spatial-QRS loop was found to lie in a plane in normal controls. In STEMI patients, this planarity was lost. Calculation of goodness of fit supported these visual observations.
Conclusions:
The degree of planarity of the VCG loop can differentiate healthy individuals from patients with STEMI. This observation is compatible with our basic understanding of the electrophysiology of the human heart
Optimization Model for Planning Precision Grasps with Multi-Fingered Hands
Precision grasps with multi-fingered hands are important for precise
placement and in-hand manipulation tasks. Searching precision grasps on the
object represented by point cloud, is challenging due to the complex object
shape, high-dimensionality, collision and undesired properties of the sensing
and positioning. This paper proposes an optimization model to search for
precision grasps with multi-fingered hands. The model takes noisy point cloud
of the object as input and optimizes the grasp quality by iteratively searching
for the palm pose and finger joints positions. The collision between the hand
and the object is approximated and penalized by a series of least-squares. The
collision approximation is able to handle the point cloud representation of the
objects with complex shapes. The proposed optimization model is able to locate
collision-free optimal precision grasps efficiently. The average computation
time is 0.50 sec/grasp. The searching is robust to the incompleteness and noise
of the point cloud. The effectiveness of the algorithm is demonstrated by
experiments.Comment: Submitted to IROS2019, experiment on BarrettHand, 8 page
Peptide mass fingerprinting using field-programmable gate arrays
The reconfigurable computing paradigm, which exploits the flexibility and versatility of field-programmable gate arrays (FPGAs), has emerged as a powerful solution for speeding up time-critical algorithms. This paper describes a reconfigurable computing solution for processing raw mass spectrometric data generated by MALDI-TOF instruments. The hardware-implemented algorithms for denoising, baseline correction, peak identification, and deisotoping, running on a Xilinx Virtex-2 FPGA at 180 MHz, generate a mass fingerprint that is over 100 times faster than an equivalent algorithm written in C, running on a Dual 3-GHz Xeon server. The results obtained using the FPGA implementation are virtually identical to those generated by a commercial software package MassLynx
Cluster-based feedback control of turbulent post-stall separated flows
We propose a novel model-free self-learning cluster-based control strategy
for general nonlinear feedback flow control technique, benchmarked for
high-fidelity simulations of post-stall separated flows over an airfoil. The
present approach partitions the flow trajectories (force measurements) into
clusters, which correspond to characteristic coarse-grained phases in a
low-dimensional feature space. A feedback control law is then sought for each
cluster state through iterative evaluation and downhill simplex search to
minimize power consumption in flight. Unsupervised clustering of the flow
trajectories for in-situ learning and optimization of coarse-grained control
laws are implemented in an automated manner as key enablers. Re-routing the
flow trajectories, the optimized control laws shift the cluster populations to
the aerodynamically favorable states. Utilizing limited number of sensor
measurements for both clustering and optimization, these feedback laws were
determined in only iterations. The objective of the present work is not
necessarily to suppress flow separation but to minimize the desired cost
function to achieve enhanced aerodynamic performance. The present control
approach is applied to the control of two and three-dimensional separated flows
over a NACA 0012 airfoil with large-eddy simulations at an angle of attack of
, Reynolds number and free-stream Mach number . The optimized control laws effectively minimize the flight power
consumption enabling the flows to reach a low-drag state. The present work aims
to address the challenges associated with adaptive feedback control design for
turbulent separated flows at moderate Reynolds number.Comment: 32 pages, 18 figure
Partition Around Medoids Clustering on the Intel Xeon Phi Many-Core Coprocessor
Abstract. The paper touches upon the problem of implementation Partition Around Medoids (PAM) clustering algorithm for the Intel Many Integrated Core architecture. PAM is a form of well-known k-Medoids clustering algorithm and is applied in various subject domains, e.g. bioinformatics, text analysis, intelligent transportation systems, etc. An optimized version of PAM for the Intel Xeon Phi coprocessor is introduced where OpenMP parallelizing technology, loop vectorization, tiling technique and efficient distance matrix computation for Euclidean metric are used. Experimental results for different data sets confirm the efficiency of the proposed algorithm
Mixing multi-core CPUs and GPUs for scientific simulation software
Recent technological and economic developments have led to widespread availability of
multi-core CPUs and specialist accelerator processors such as graphical processing units
(GPUs). The accelerated computational performance possible from these devices can be very
high for some applications paradigms. Software languages and systems such as NVIDIA's
CUDA and Khronos consortium's open compute language (OpenCL) support a number of
individual parallel application programming paradigms. To scale up the performance of some
complex systems simulations, a hybrid of multi-core CPUs for coarse-grained parallelism and
very many core GPUs for data parallelism is necessary. We describe our use of hybrid applica-
tions using threading approaches and multi-core CPUs to control independent GPU devices.
We present speed-up data and discuss multi-threading software issues for the applications
level programmer and o er some suggested areas for language development and integration
between coarse-grained and ne-grained multi-thread systems. We discuss results from three
common simulation algorithmic areas including: partial di erential equations; graph cluster
metric calculations and random number generation. We report on programming experiences
and selected performance for these algorithms on: single and multiple GPUs; multi-core CPUs;
a CellBE; and using OpenCL. We discuss programmer usability issues and the outlook and
trends in multi-core programming for scienti c applications developers
- …