As technology scaling slows down in the nanometer CMOS regime and mobile computing becomes more ubiquitous, designing energy-efficient hardware for mobile systems is becoming increasingly critical and challenging. Although various approaches like near-threshold computing (NTC), aggressive voltage scaling with shadow latches, etc. have been proposed to get the most out of limited battery life, there is still no “silver bullet” to increasing power-performance demands of the mobile systems. Moreover, given that a mobile system could operate in a variety of environmental conditions, like different temperatures, have varying performance requirements, etc., there is a growing need for designing tunable/reconfigurable systems in order to achieve energy-efficient operation. In this work we propose to address the energy- efficiency problem of mobile systems using two different approaches: circuit tunability and distributed adaptive algorithms. Inspired by the communication systems, we developed feedback equalization based digital logic that changes the threshold of its gates based on the input pattern. We showed that feedback equalization in static complementary CMOS logic enabled up to 20% reduction in energy dissipation while maintaining the performance metrics. We also achieved 30% reduction in energy dissipation for pass-transistor digital logic (PTL) with equalization while maintaining performance. In addition, we proposed a mechanism that leverages feedback equalization techniques to achieve near optimal operation of static complementary CMOS logic blocks over the entire voltage range from near threshold supply voltage to nominal supply voltage. Using energy-delay product (EDP) as a metric we analyzed the use of the feedback equalizer as part of various sequential computational blocks. Our analysis shows that for near-threshold voltage operation, when equalization was used, we can improve the operating frequency by up to 30%, while the energy increase was less than 15%, with an overall EDP reduction of ≈10%. We also observe an EDP reduction of close to 5% across entire above-threshold voltage range. On the distributed adaptive algorithm front, we explored energy-efficient hardware implementation of machine learning algorithms. We proposed an adaptive classifier that leverages the wide variability in data complexity to enable energy-efficient data classification operations for mobile systems. Our approach takes advantage of varying classification hardness across data to dynamically allocate resources and improve energy efficiency. On average, our adaptive classifier is ≈100× more energy efficient but has ≈1% higher error rate than a complex radial basis function classifier and is ≈10× less energy efficient but has ≈40% lower error rate than a simple linear classifier across a wide range of classification data sets. We also developed a field of groves (FoG) implementation of random forests (RF) that achieves an accuracy comparable to Convolutional Neural Networks (CNN) and Support Vector Machines (SVM) under tight energy budgets. The FoG architecture takes advantage of the fact that in random forests a small portion of the weak classifiers (decision trees) might be sufficient to achieve high statistical performance. By dividing the random forest into smaller forests (Groves), and conditionally executing the rest of the forest, FoG is able to achieve much higher energy efficiency levels for comparable error rates. We also take advantage of the distributed nature of the FoG to achieve high level of parallelism. Our evaluation shows that at maximum achievable accuracies FoG consumes ≈1.48×, ≈24×, ≈2.5×, and ≈34.7× lower energy per classification compared to conventional RF, SVM-RBF , Multi-Layer Perceptron Network (MLP), and CNN, respectively. FoG is 6.5× less energy efficient than SVM-LR, but achieves 18% higher accuracy on average across all considered datasets.

Neutrosophic logic is a relatively new logic that is a generalization of fuzzy logic. In this dissertation, for the first time, neutrosophic logic is applied to the field of classifiers where a support vector machine (SVM) is adopted as the example to validate the feasibility and effectiveness of neutrosophic logic. The proposed neutrosophic set is integrated into a reformulated SVM, and the performance of the achieved classifier N-SVM is evaluated under an image categorization system. Image categorization is an important yet challenging research topic in computer vision. In this dissertation, images are first segmented by a hierarchical two-stage self organizing map (HSOM), using color and texture features. A novel approach is proposed to select the training samples of HSOM based on homogeneity properties. A diverse density support vector machine (DD-SVM) framework that extends the multiple-instance learning (MIL) technique is then applied to the image categorization problem by viewing an image as a bag of instances corresponding to the regions obtained from the image segmentation. Using the instance prototype, every bag is mapped to a point in the new bag space, and the categorization is transformed to a classification problem. Then, the proposed N-SVM based on the neutrosophic set is used as the classifier in the new bag space. N-SVM treats samples differently according to the weighting function, and it helps reduce the effects of outliers. Experimental results on a COREL dataset of 1000 general purpose images and a Caltech 101 dataset of 9000 images demonstrate the validity and effectiveness of the proposed method.

We compare Naive Bayes and Support Vector Machines on the task of multiclass text classification. Using a variety of approaches to combine the underlying binary classifiers, we find that SVMs substantially outperform Naive Bayes. We present full multiclass results on two well-known text data sets, including the lowest error to date on both data sets. We develop a new indicator of binary performance to show that the SVM's lower multiclass error is a result of its improved binary performance. Furthermore, we demonstrate and explore the surprising result that one-vs-all classification performs favorably compared to other approaches even though it has no error-correcting properties.

Given a protein sequence and the C£\ coordinates on its backbone, the all-atom protein backbone reconstruction problem (PBRP) is to reconstruct the backbone by its 3D coordinates of N, C and O atoms. In the past few decades, many methods have been proposed for solving PBRP, such as ab initio, homology modeling, SABBAC, Wang¡¦s method, Chang¡¦s method, BBQ (Backbone Building from Quadrilaterals) and Chen¡¦s method. Chen found that, if they can choose the correct prediction tool to build the 3D coordinates of the desired atoms, the RMSD may be improved. In this thesis, we propose a method for solving PBRP based on Chen¡¦s method. We use tool preference classification on each atom of the residue, where the classification model is generated by SVM (Support Vector Machine). We rebuild the backbone by combing the prediction results of all atoms in all residues. The data sets used in our experiments are CASP7, CASP8 and CASP9, which have 65, 52 and 63 proteins, respectively. These data sets contain nonstandard amino acids as well as standard ones. We improve the average RMSDs of Chen¡¦s results in some cases. The average RMSDs of our method are 0.3496 in CASP7, 0.3084 in CASP8 and 0.3286 in CASP9.

Ribonucleic acid (RNA) sometimes occurs in a complex structure called pseudoknots. Prediction of RNA secondary structures has drawn much attention from both biologists and computer scientists. Consequently, many useful tools have been developed for RNA secondary structure prediction, with or without pseudoknots. These tools have their individual strength and weakness. As a result, we propose a hybrid feature extraction method which integrates two prediction tools pknotsRG and NUPACK with a support vector machine (SVM). We first extract some useful features from the target RNA sequence, and then decide its prediction tool preference with SVM classification. Our test data set contains 723 RNA sequences, where 202 pseudoknotted RNA sequences are obtained from PseudoBase, and 521 nested RNA sequences are obtained from RNA SSTRAND. Experimental results show that our method improves not only the overall accuracy but also the sensitivity and the selectivity of the target sequences. Our method serves as a preprocessing process in analyzing RNA sequences before employing the RNA secondary structure prediction tools. The ability to combine the existing methods and make the prediction tools more accurate is our main contribution.

The field of metagenomics has shown great promise in the ability to recover microbial DNA from communities whose members resist traditional cultivation techniques, although in most instances the recovered material comprises short anonymous genomic fragments rather than complete genome sequences. In order to effectively assess the microbial diversity and ecology represented in such samples, accurate methods for DNA classification capable of assigning metagenomic fragments into their most likely taxonomic unit are required. Existing DNA classification methods have shown high levels of accuracy in attempting to classify sequences derived from low-complexity communities, however genome distinguishability generally deteriorates for complex communities or those containing closely related organisms. The goal of this thesis was to identify factors both intrinsic or external to the genome that may lead to the improvement of existing DNA classification methods and to probe the fundamental limitations of composition-based genome distinguishability. To assess the suite of factors affecting the distinguishability of genomes, support vector machine classifiers were trained to discriminate between pairs of microbial genomes using the relative frequencies of oligonucleotide patterns calculated from orthologous genes or short genomic fragments, and the resulting classification accuracy scores used as the measure of genomic distinguishability. Models were generated in order to relate distinguishability to several measures of genomic and taxonomic similarity, and interesting outlier genome pairs were identified by large residuals to the fitted models. Examination of the outlier pairs identified numerous factors that influence genome distinguishability, including genome reduction, extreme G+C composition, lateral gene transfer, and habitat-induced genome convergence. Fragments containing multiple protein-coding and non-coding sequences showed an increased tendency for misclassification, except in cases where the genomes were very closely related. Analysis of the biological function annotations associated with each fragment demonstrated that certain functional role categories showed increased or decreased tendency for misclassification. The use of pre-processing steps including DNA recoding, unsupervised clustering, 'symmetrization' of oligonucleotide frequencies, and correction for G+C content did not improve distinguishability. Existing composition-based DNA classifiers will benefit from the results reported in this thesis. Sequence-segmentation approaches will improve genome distinguishability by decreasing fragment heterogeneity, while factors such as habitat, lifestyle, extreme G+C composition, genome reduction, and biological role annotations may be used to express confidence in the classification of individual fragments. Although genome distinguishability tends to be proportional to genomic and taxonomic relatedness, these trends can be violated for closely related genome pairs that have undergone rapid compositional divergence, or unrelated genome pairs that have converged in composition due to similar habitats or unusual selective pressures. Additionally, there are fundamental limits to the resolution of composition-based classifiers when applied to genomic fragments typical of current metagenomic studies.

No description available.

Understanding biochemical reactions inside cells of individual organisms is a key factor for improving our biological knowledge. Signaling pathways provide a road map for a wide range of these chemical reactions that convert one signal or stimulus into another. In general, each signaling pathway in a cell involves many different proteins, each with one or more specific roles that help to amplify a relatively small stimulus into an effective response. Since proteins are essential components of a cells activities, it is important to understand how they work and in particular, to determine which of species proteins participate in each role. Experimentally determining this mapping of proteins to roles is difficult and time consuming. Fortunately, many individual pathways have been annotated for some species, and the pathways of other species can often be inferred using protein homology and the protein properties.

Thesis (M.S.)--Auburn University, 2008. / Abstract. Includes bibliographical references (p. 26-29).

Over the past years early detection and intervention in schizophrenia have become a major objective in psychiatry. Early intervention strategies are intended to identify and treat psychosis prior to fulfilling diagnostic criteria for the disorder. To this aim, reliable early diagnostic biomarkers are needed in order to identify a high-risk state for psychosis and also predict transition to frank psychosis in those high-risk individuals destined to develop the disorder. Recently, machine learning methods have been successfully applied in the diagnostic classification of schizophrenia and in predicting transition to psychosis at an individual level based on magnetic resonance imaging (MRI) data and also neurocognitive variables. This work investigates the application of machine learning methods for the early identification of schizophrenia in subjects at high risk for developing the disorder. The dataset used in this work involves data from the Edinburgh High Risk Study (EHRS), which examined individuals at a heightened risk for developing schizophrenia for familial reasons, and the FePsy (Fruherkennung von Psychosen) study that was conducted in Basel and involves subjects at a clinical high-risk state for psychosis. The overriding aim of this thesis was to use machine learning, and specifically Support Vector Machine (SVM), in order to identify predictors of transition to psychosis in high-risk individuals, using baseline structural MRI data. There are three aims pertaining to this main one. (i) Firstly, our aim was to examine the feasibility of distinguishing at baseline those individuals who later developed schizophrenia from those who did not, yet had psychotic symptoms using SVM and baseline data from the EHRS study. (ii) Secondly, we intended to examine if our classification approach could generalize to clinical high-risk cohorts, using neuroanatomical data from the FePsy study. (iii) In a more exploratory context, we have also examined the diagnostic performance of our classifier by pooling the two datasets together. With regards to the first aim, our findings suggest that the early prediction of schizophrenia is feasible using a MRI-based linear SVM classifier operating at the single-subject level. Additionally, we have shown that the combination of baseline neuroanatomical data with measures of neurocognitive functioning and schizotypal cognition can improve predictive performance. The application of our pattern classification approach to baseline structural MRI data from the FePsy study highly replicated our previous findings. Our classification method identified spatially distributed networks that discriminate at baseline between subjects that later developed schizophrenia and other related psychoses and those that did not. Finally, a preliminary classification analysis using pooled datasets from the EHRS and the FePsy study supports the existence of a neuroanatomical pattern that differentiates between groups of high-risk subjects that develop psychosis against those who do not across research sites and despite any between-sites differences. Taken together, our findings suggest that machine learning is capable of distinguishing between cohorts of high risk subjects that later convert to psychosis and those that do not based on patterns of structural abnormalities that are present before disease onset. Our findings have some clinical implications in that machine learning-based approaches could advise or complement clinical decision-making in early intervention strategies in schizophrenia and related psychoses. Future work will be, however, required to tackle issues of reproducibility of early diagnostic biomarkers across research sites, where different assessment criteria and imaging equipment and protocols are used. In addition, future projects may also examine the diagnostic and prognostic value of multimodal neuroimaging data, possibly combined with other clinical, neurocognitive, genetic information.