2615609
EigenNail for Finger Force Direction Recognition
This paper presents a technique termed eigennails to classify fingertip force during contact based on the coloration patterns in the fingernail and surrounding skin. Fingertip force is classified into six directions: no force, normal force only, two directions (left/right) of lateral shear force, and two directions (forward/backward) of longitudinal shear forces. Based on the face recognition technique eigenfaces, a small number of eigennails are sufficient to express the color pattern features for shear force direction classification. Results show that 98% of 960 fingernail images of 8 different subjects are correctly classified. The lowest imaging resolution without sacrificing classification accuracy is found to be 10-by-10.
2008945
Finger Force Direction Recognition by Principal Component Analysis of Fingernail Coloration Pattern
A method based on principal component analysis of the fingernail coloration pattern is presented to infer fingertip force direction during planar contact. Images from 7 subjects were registered and normalized to each other. Results show that the fingernail coloration patterns are similar for the 7 subjects, but the feature centroids vary. It is concluded that there are common features for all people. But accurate detection of fingertip force direction requires individually calibrated centroids
12578633
High-level abstractions for message-passing parallel programming
9741409
VLSI Decoder Architecture for High Throughput, Variable Block-size and Multi-rate LDPC Codes
A low-density parity-check (LDPC) decoder architecture that supports variable block sizes and multiple code rates is presented. The proposed architecture is based on the structured quasi-cyclic (QC-LDPC) codes whose performance compares favorably with that of randomly constructed LDPC codes for short to moderate block sizes. The main contribution of this work is to address the variable block-size and multi-rate decoder hardware complexity that stems from the irregular LDPC codes. The overall decoder, which was synthesized, placed and routed on TSMC 0.13-micron CMOS technology with a core area of 4.5 square millimeters, supports variable code lengths from 360 to 4200 bits and multiple code rates between frac14 and 9/10. The average throughput can achieve 1 Gbps at 2.2 dB SNR.
16353382
Determining the size of spatial clusters in focused tests: Comparing two methods by means of simulation in a GIS
Abstract. Based on a four-point evaluation system consisting of accuracy, consistency, power, and chance to commit type I errors, this study compares Tango's minimum p (MinP) and Stone's maximum relative risk (MaxRR) methods for detecting focused cluster size through simulations in GIS. It reveals that the MinP method is more effective than the MaxRR method. The MinP method exhibits higher levels of accuracy and consistency; and its power and chance to commit type I errors are similar to the MinP method. The MaxRR method has a tendency to underestimate the cluster size, while the MinP method tends to overestimate the cluster size, particularly when the clusters are relatively big and have high relative risk levels. In addition, the MinP method seems to be most effective in revealing the size of clusters when clusters are neither too strong nor too weak. The lowest detection rates for clustering occur when the clustering signal is relatively weak, which is easily understandable. In practice, it might be useful to use both the methods to estimate a range of possible cluster sizes, where the MaxRR method indicates the lower estimate, while the MinP method gives the higher estimate of the cluster size.
11930112
Fast motion estimation using hierarchical motion intensity structure
The embedded motion compensation model of the new H.264/AVC video coding standard dramatically increases the computational complexity of motion estimation. We propose a fast motion estimation algorithm using a hierarchical motion intensity structure to lower the computational complexity of the motion estimation in H.264/AVC. The proposed algorithm is mainly based on a multi-level motion intensity structure. It determines the motion intensity at three levels and, accordingly, uses different motion estimation techniques to find a more accurate, and faster, motion vector (MV). Experimental results show that the proposed algorithm provides promising performance in terms of the computational speedup and video reconstruction quality.
12751111
A taxonomy of application scheduling tools for high performance cluster computing
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper presents a survey on the software tools for the graph-based scheduling on cluster systems with the focus on task scheduling. The tasks of a parallel or distributed application can be properly scheduled onto multi-processors in order to optimize the performance of the program (e.g., execution time or resource utilization). In general, scheduling algorithms are designed based on the notion of task graph that represents the relationship of parallel tasks. The scheduling algorithms map the nodes of a graph to the processors in order to minimize overall execution time. Although many scheduling algorithms have been proposed in the literature, surprisingly not many practical tools can be found in practical use. After discussing the fundamental scheduling techniques, we propose a framework and taxonomy for the scheduling tools on clusters. Using this framework, the features of existing scheduling tools are analyzed and compared. We also discuss the important issues in improving the usability of the scheduling tools.