3239171
Nonlinear Kernel MSE Methods for Cancer Classification
Combination of kernel PLS (KPLS) and kernel SVD (KSVD) with minimum-squared-error (MSE) criteria has created new machine learning methods for cancer classification and has been successfully applied to seven publicly available cancer datasets. Besides the high accuracy of the new methods, very fast training speed is also obtained because the matrix inversion in the original MSE procedure is avoided. Although the KPLS-MSE and the KSVD-MSE methods have equivalent accuracies, the KPLS achieves the same results using significantly less but more qualitative components.
45019016
A Simplified Algorithm for Testing Microprocessors
Abstract In this paper, we present a number of algorithms to test the instruction decoding function of microprocessors. The algorithms are based on the knowledge of some timing and control information available to users through microprocessor manuals and data sheets. The tests are functional in nature. We also establish the order of complexity of the algorithms presented in this paper. As an example, the test complexity for a microprocessor is computed and the results are compared with a known algorithm.
19415028
Unified model in identity subspace for face recognition
Human faces have two important characteristics: (1) They are similar objects and the specific, variations of each face are similar to each other; (2) They are nearly bilateral symmetric. Exploiting the two important properties, we build a unified model in identity subspace (UMIS) as a novel technique for face recognition from only one example image per person. An identity subspace spanned by bilateral symmetric bases, which compactly encodes identity information. is presented. The unified model, trained on an obtained training set with multiple samples per class from a known people groupA, can be generalized well to facial images of unknown individuals, and can be used to recognize facial images from an unknown people groupB with only one sample per subject. Extensive experimental results on two public databases (the Yale database and the Bern database) and our own database (the ICT-JDL database) demonstrate that the UMIS approach is significantly effective and robust for face recognition.
74980
PLS and SVD based penalized logistic regression for cancer classification using microarray data
Accurate cancer prediction is important for treatment of cancers. The combination of two dimension reduction methods, partial least squares (PLS) and singular value decomposition (SVD), with the penalized logistic regression (PLR) has created powerful classifiers for cancer prediction using microarray data. Comparing with support vector machine (SVM) on seven publicly available cancer datasets, the new algorithms can achieve very good performance and run much faster. They also have the advantage that the probabilities of predictions can be directly given. PLS based PLR is also combined with recursive feature elimination (RFE) to select a 16-gene subset for acute leukemia cancer classification. The testing error on this subset of genes is empirically zero.
43366543
VLSI functional testing using critical path traces at hardware description language level
A new approach for testing VLSI circuits is presented. Through backward critical path tracing, a test and all faults detectable by the test are generated simultaneously. Therefore, the expensive fault simulation is completely eliminated. We present a critical path test generation procedure for digital systems described by hardware description language (HDL). A multiplication circuit described by a HDL is utilized for demonstrating the test generation method.
62074016
Dimension Reduction-Based Penalized Logistic Regression for Cancer Classification Using Microarray Data
The use of penalized logistic regression for cancer classification using microarray expression data is presented. Two dimension reduction methods are respectively combined with the penalized logistic regression so that both the classification accuracy and computational speed are enhanced. Two other machine-learning methods, support vector machines and least-squares regression, have been chosen for comparison. It is shown that our methods have achieved at least equal or better results. They also have the advantage that the output probability can be explicitly given and the regression coefficients are easier to interpret. Several other aspects, such as the selection of penalty parameters and components, pertinent to the application of our methods for cancer classification are also discussed.
6802677
A surface-based approach for classification of 3D neuroanatomic structures
We present a new framework for 3D surface object classification that combines a powerful shape description method with suitable pattern classification techniques. Spherical harmonic parameterization and normalization techniques are used to describe a surface shape and derive a dual high dimensional landmark representation. A point distribution model is applied to reduce the dimensionality. Fisher's linear discriminants and support vector machines are used for classification. Several feature selection schemes are proposed for learning better classifiers. After showing the effectiveness of this framework using simulated shape data, we apply it to real hippocampal data in schizophrenia and perform extensive experimental studies by examining different combinations of techniques. We achieve best leave-one-out cross-validation accuracies of 93% (whole set, N = 56) and 90% (right-handed males, N = 39), respectively, which are competitive with the best results in previous studies using different techniques on similar types of data. Furthermore, to help medical diagnosis in practice, we employ a threshold-free receiver operating characteristic (ROC) approach as an alternative evaluation of classification results as well as propose a new method for visualizing discriminative patterns.
33440658
A New Technique for Program Code Compression in Embedded Microprocessor
Program code compression has become a critical technology nowadays, and it can promote the performance of microprocessor systems. But compression techniques nowadays can hardly achieve both satisfactory compression ratio and low hardware complexity. A new program code compression method is proposed in this paper. Experiment results show that the code sizes of ARM and OR1200 microprocessor can be efficiently reduced by 32.2% and 36.9% individually with this algorithm, resulting to a sharp decrease in memory traffic. A hardware decompressing prototype is also presented, revealing its advantage in ultra high speed decompression and low hardware complexity.
17743882
Morphometric Analysis of Brain Structures for Improved Discrimination
We perform discriminative analysis of brain structures using morphometric information. Spherical harmonics technique and point distribution model are used for shape description. Classification is performed using linear discriminants and support vector machines with several feature selection approaches. We consider both inclusion and exclusion of volume information in the discrimination. We perform extensive experimental studies by applying different combinations of techniques to hippocampal data in schizophrenia and achieve best jackknife classification accuracies of 95% (whole set) and 90% (right-handed males), respectively. Our results find that the left hippocampus is a better predictor than the right in the complete dataset, but that the right hippocampus is a stronger predictor than the left in the right-handed male subset. We also propose a new method for visualization of discriminative patterns.
35408245
A quick method for synthesizing photorealistic color images under various illumination conditions
We propose a fast method to synthesize realistic images under novel lighting directions using three color images. In the method, we use a look-up table procedure to estimate the surface orientations, instead of complex computations. Moreover, we explain a way to separate the diffuse and specular reflection components from the three color images.
27674470
Application of Software Fault Tree Analysis to an Airport Ground Control System
With the ever increasing role of software in our day-to-day life, and even more important the criticality of their role in safety and reliability of the applications, it is important to find techniques that helps with identifying and balancing risks. One such technique is Fault Tree Analysis, which has proven to be powerful in other domains such as systems and processes. This paper, describes the results of application of the fault tree analysis to software requirement specification for an airport ground control system. In addition, this paper proposes a set of guidelines on how to apply SFTA to software requirement specification.