Matching Items (1,194)
Filtering by
- All Subjects: Computer Science
- Creators: Arizona State University
Description
Currently Java is making its way into the embedded systems and mobile devices like androids. The programs written in Java are compiled into machine independent binary class byte codes. A Java Virtual Machine (JVM) executes these classes. The Java platform additionally specifies the Java Native Interface (JNI). JNI allows Java code that runs within a JVM to interoperate with applications or libraries that are written in other languages and compiled to the host CPU ISA. JNI plays an important role in embedded system as it provides a mechanism to interact with libraries specific to the platform. This thesis addresses the overhead incurred in the JNI due to reflection and serialization when objects are accessed on android based mobile devices. It provides techniques to reduce this overhead. It also provides an API to access objects through its reference through pinning its memory location. The Android emulator was used to evaluate the performance of these techniques and we observed that there was 5 - 10 % performance gain in the new Java Native Interface.
ContributorsChandrian, Preetham (Author) / Lee, Yann-Hang (Thesis advisor) / Davulcu, Hasan (Committee member) / Li, Baoxin (Committee member) / Arizona State University (Publisher)
Created2011
Description
As pointed out in the keynote speech by H. V. Jagadish in SIGMOD'07, and also commonly agreed in the database community, the usability of structured data by casual users is as important as the data management systems' functionalities. A major hardness of using structured data is the problem of easily retrieving information from them given a user's information needs. Learning and using a structured query language (e.g., SQL and XQuery) is overwhelmingly burdensome for most users, as not only are these languages sophisticated, but the users need to know the data schema. Keyword search provides us with opportunities to conveniently access structured data and potentially significantly enhances the usability of structured data. However, processing keyword search on structured data is challenging due to various types of ambiguities such as structural ambiguity (keyword queries have no structure), keyword ambiguity (the keywords may not be accurate), user preference ambiguity (the user may have implicit preferences that are not indicated in the query), as well as the efficiency challenges due to large search space. This dissertation performs an expansive study on keyword search processing techniques as a gateway for users to access structured data and retrieve desired information. The key issues addressed include: (1) Resolving structural ambiguities in keyword queries by generating meaningful query results, which involves identifying relevant keyword matches, identifying return information, composing query results based on relevant matches and return information. (2) Resolving structural, keyword and user preference ambiguities through result analysis, including snippet generation, result differentiation, result clustering, result summarization/query expansion, etc. (3) Resolving the efficiency challenge in processing keyword search on structured data by utilizing and efficiently maintaining materialized views. These works deliver significant technical contributions towards building a full-fledged search engine for structured data.
ContributorsLiu, Ziyang (Author) / Chen, Yi (Thesis advisor) / Candan, Kasim S (Committee member) / Davulcu, Hasan (Committee member) / Jagadish, H V (Committee member) / Arizona State University (Publisher)
Created2011
Description
Reliable extraction of human pose features that are invariant to view angle and body shape changes is critical for advancing human movement analysis. In this dissertation, the multifactor analysis techniques, including the multilinear analysis and the multifactor Gaussian process methods, have been exploited to extract such invariant pose features from video data by decomposing various key contributing factors, such as pose, view angle, and body shape, in the generation of the image observations. Experimental results have shown that the resulting pose features extracted using the proposed methods exhibit excellent invariance properties to changes in view angles and body shapes. Furthermore, using the proposed invariant multifactor pose features, a suite of simple while effective algorithms have been developed to solve the movement recognition and pose estimation problems. Using these proposed algorithms, excellent human movement analysis results have been obtained, and most of them are superior to those obtained from state-of-the-art algorithms on the same testing datasets. Moreover, a number of key movement analysis challenges, including robust online gesture spotting and multi-camera gesture recognition, have also been addressed in this research. To this end, an online gesture spotting framework has been developed to automatically detect and learn non-gesture movement patterns to improve gesture localization and recognition from continuous data streams using a hidden Markov network. In addition, the optimal data fusion scheme has been investigated for multicamera gesture recognition, and the decision-level camera fusion scheme using the product rule has been found to be optimal for gesture recognition using multiple uncalibrated cameras. Furthermore, the challenge of optimal camera selection in multi-camera gesture recognition has also been tackled. A measure to quantify the complementary strength across cameras has been proposed. Experimental results obtained from a real-life gesture recognition dataset have shown that the optimal camera combinations identified according to the proposed complementary measure always lead to the best gesture recognition results.
ContributorsPeng, Bo (Author) / Qian, Gang (Thesis advisor) / Ye, Jieping (Committee member) / Li, Baoxin (Committee member) / Spanias, Andreas (Committee member) / Arizona State University (Publisher)
Created2011
Description
The elaborate signals of animals are often costly to produce and maintain, thus communicating reliable information about the quality of an individual to potential mates or competitors. The properties of the sensory systems that receive signals can drive the evolution of these signals and shape their form and function. However, relatively little is known about the ecological and physiological constraints that may influence the development and maintenance of sensory systems. In the house finch (Carpodacus mexicanus) and many other bird species, carotenoid pigments are used to create colorful sexually selected displays, and their expression is limited by health and dietary access to carotenoids. Carotenoids also accumulate in the avian retina, protecting it from photodamage and tuning color vision. Analogous to plumage carotenoid accumulation, I hypothesized that avian vision is subject to environmental and physiological constraints imposed by the acquisition and allocation of carotenoids. To test this hypothesis, I carried out a series of field and captive studies of the house finch to assess natural variation in and correlates of retinal carotenoid accumulation and to experimentally investigate the effects of dietary carotenoid availability, immune activation, and light exposure on retinal carotenoid accumulation. Moreover, through dietary manipulations of retinal carotenoid accumulation, I tested the impacts of carotenoid accumulation on visually mediated foraging and mate choice behaviors. My results indicate that avian retinal carotenoid accumulation is variable and significantly influenced by dietary carotenoid availability and immune system activity. Behavioral studies suggest that retinal carotenoid accumulation influences visual foraging performance and mediates a trade-off between color discrimination and photoreceptor sensitivity under dim-light conditions. Retinal accumulation did not influence female choice for male carotenoid-based coloration, indicating that a direct link between retinal accumulation and sexual selection for coloration is unlikely. However, retinal carotenoid accumulation in males was positively correlated with their plumage coloration. Thus, carotenoid-mediated visual health and performance or may be part of the information encoded in sexually selected coloration.
ContributorsToomey, Matthew (Author) / McGraw, Kevin J. (Thesis advisor) / Deviche, Pierre (Committee member) / Smith, Brian (Committee member) / Rutowski, Ronald (Committee member) / Verrelli, Brian (Committee member) / Arizona State University (Publisher)
Created2011
Description
Molecular dynamics (MD) simulations provide a particularly useful approach to understanding conformational change in biomolecular systems. MD simulations provide an atomistic, physics-based description of the motions accessible to biomolecular systems on the pico- to micro-second timescale, yielding important insight into the free energy of the system, the dynamical stability of contacts and the role of correlated motions in directing the motions of the system. In this thesis, I use molecular dynamics simulations to provide molecular mechanisms that rationalize structural, thermodynamic, and mutation data on the interactions between the lac repressor headpiece and its O1 operator DNA as well as the ERK2 protein kinase. I performed molecular dynamics simulations of the lac repressor headpiece - O1 operator complex at the natural angle as well as at under- and overbent angles to assess the factors that determine the natural DNA bending angle. I find both energetic and entropic factors contribute to recognition of the natural angle. At the natural angle the energy of the system is minimized by optimization of protein-DNA contacts and the entropy of the system is maximized by release of water from the protein-DNA interface and decorrelation of protein motions. To identify the mechanism by which mutations lead to auto-activation of ERK2, I performed a series of molecular dynamics simulations of ERK1/2 in various stages of activation as well as the constitutively active Q103A, I84A, L73P and R65S ERK2 mutants. My simulations indicate the importance of domain closure for auto-activation and activity regulation. My results enable me to predict two loss-of-function mutants of ERK2, G83A and Q64C, that have been confirmed in experiments by collaborators. One of the powerful capabilities of MD simulations in biochemistry is the ability to find low free energy pathways that connect and explain disparate structural data on biomolecular systems. An extention of the targeted molecular dynamics technique using constraints on internal coordinates will be presented and evaluated. The method gives good results for the alanine dipeptide, but breaks down when applied to study conformational changes in GroEL and adenylate kinase.
ContributorsBarr, Daniel Alan (Author) / van der Vaart, Arjan (Thesis advisor) / Matyushov, Dmitry (Committee member) / Wolf, George (Committee member) / Shumway, John (Committee member) / Arizona State University (Publisher)
Created2011
Description
This thesis describes a synthetic task environment, CyberCog, created for the purposes of 1) understanding and measuring individual and team situation awareness in the context of a cyber security defense task and 2) providing a context for evaluating algorithms, visualizations, and other interventions that are intended to improve cyber situation awareness. CyberCog provides an interactive environment for conducting human-in-loop experiments in which the participants of the experiment perform the tasks of a cyber security defense analyst in response to a cyber-attack scenario. CyberCog generates the necessary performance measures and interaction logs needed for measuring individual and team cyber situation awareness. Moreover, the CyberCog environment provides good experimental control for conducting effective situation awareness studies while retaining realism in the scenario and in the tasks performed.
ContributorsRajivan, Prashanth (Author) / Femiani, John (Thesis advisor) / Cooke, Nancy J. (Thesis advisor) / Lindquist, Timothy (Committee member) / Gary, Kevin (Committee member) / Arizona State University (Publisher)
Created2011
Description
With the introduction of compressed sensing and sparse representation,many image processing and computer vision problems have been looked at in a new way. Recent trends indicate that many challenging computer vision and image processing problems are being solved using compressive sensing and sparse representation algorithms. This thesis assays some applications of compressive sensing and sparse representation with regards to image enhancement, restoration and classication. The first application deals with image Super-Resolution through compressive sensing based sparse representation. A novel framework is developed for understanding and analyzing some of the implications of compressive sensing in reconstruction and recovery of an image through raw-sampled and trained dictionaries. Properties of the projection operator and the dictionary are examined and the corresponding results presented. In the second application a novel technique for representing image classes uniquely in a high-dimensional space for image classification is presented. In this method, design and implementation strategy of the image classification system through unique affine sparse codes is presented, which leads to state of the art results. This further leads to analysis of some of the properties attributed to these unique sparse codes. In addition to obtaining these codes, a strong classier is designed and implemented to boost the results obtained. Evaluation with publicly available datasets shows that the proposed method outperforms other state of the art results in image classication. The final part of the thesis deals with image denoising with a novel approach towards obtaining high quality denoised image patches using only a single image. A new technique is proposed to obtain highly correlated image patches through sparse representation, which are then subjected to matrix completion to obtain high quality image patches. Experiments suggest that there may exist a structure within a noisy image which can be exploited for denoising through a low-rank constraint.
ContributorsKulkarni, Naveen (Author) / Li, Baoxin (Thesis advisor) / Ye, Jieping (Committee member) / Sen, Arunabha (Committee member) / Arizona State University (Publisher)
Created2011
Description
A synbody is a newly developed protein binding peptide which can be rapidly produced by chemical methods. The advantages of the synbody producing process make it a potential human proteome binding reagent. Most of the synbodies are designed to bind to specific proteins. The peptides incorporated in a synbody are discovered with peptide microarray technology. Nevertheless, the targets for unknown synbodies can also be discovered by searching through a protein mixture. The first part of this thesis mainly focuses on the process of target searching, which was performed with immunoprecipitation assays and mass spectrometry analysis. Proteins are pulled down from the cell lysate by certain synbodies, and then these proteins are identified using mass spectrometry. After excluding non-specific bindings, the interaction between a synbody and its real target(s) can be verified with affinity measurements. As a specific example, the binding between 1-4-KCap synbody and actin was discovered. This result proved the feasibility of the mass spectrometry based method and also suggested that a high throughput synbody discovery platform for the human proteome could be developed. Besides the application of synbody development, the peptide microarray technology can also be used for immunosignatures. The composition of all types of antibodies existing in one's blood is related to an individual's health condition. A method, called immunosignaturing, has been developed for early disease diagnosis based on this principle. CIM10K microarray slides work as a platform for blood antibody detection in immunosignaturing. During the analysis of an immunosignature, the data from these slides needs to be validated by using landing light peptides. The second part of this thesis focuses on the validation of the data. A biotinylated peptide was used as a landing light on the new CIM10K slides. The data was collected in several rounds of tests and indicated that the variation among landing lights was significantly reduced by using the newly prepared biotinylated peptide compared with old peptide mixture. Several suggestions for further landing light improvement are proposed based on the results.
ContributorsSun, Minyao (Author) / Johnston, Stephen Albert (Thesis advisor) / Diehnelt, Chris Wayne (Committee member) / Stafford, Phillip (Committee member) / Arizona State University (Publisher)
Created2011
Description
In the 1970s James Watson recognized the inability of conventional DNA replication machinery to replicate the extreme termini of chromosomes known as telomeres. This inability is due to the requirement of a building block primer and was termed the end replication problem. Telomerase is nature's answer to the end replication problem. Telomerase is a ribonucleoprotein which extends telomeres through reverse transcriptase activity by reiteratively copying a short intrinsic RNA sequence to generate 3' telomeric extensions. Telomeres protect chromosomes from erosion of coding genes during replication, as well as differentiate native chromosome ends from double stranded breaks. However, controlled erosion of telomeres functions as a naturally occurring molecular clock limiting the replicative capacity of cells. Telomerase is over activated in many cancers, while inactivation leads to multiple lifespan limiting human diseases. In order to further study the interaction between telomerase RNA (TR) and telomerase reverse transcriptase protein (TERT), vertebrate TERT fragments were screened for solubility and purity following bacterial expression. Soluble fragments of medaka TERT including the RNA binding domain (TRBD) were identified. Recombinant medaka TRBD binds specifically to telomerase RNA CR4/CR5 region. Ribonucleotide and amino acid pairs in close proximity within the medaka telomerase RNA-protein complex were identified using photo-activated cross-linking in conjunction with mass spectrometry. The identified cross-linking amino acids were mapped on known crystal structures of TERTs to reveal the RNA interaction interface of TRBD. The identification of this RNA TERT interaction interface furthers the understanding of the telomerase complex at a molecular level and could be used for the targeted interruption of the telomerase complex as a potential cancer treatment.
ContributorsBley, Christopher James (Author) / Chen, Julian (Thesis advisor) / Allen, James (Committee member) / Ghirlanda, Giovanna (Committee member) / Arizona State University (Publisher)
Created2011
Description
Genes have widely different pertinences to the etiology and pathology of diseases. Thus, they can be ranked according to their disease-significance on a genomic scale, which is the subject of gene prioritization. Given a set of genes known to be related to a disease, it is reasonable to use them as a basis to determine the significance of other candidate genes, which will then be ranked based on the association they exhibit with respect to the given set of known genes. Experimental and computational data of various kinds have different reliability and relevance to a disease under study. This work presents a gene prioritization method based on integrated biological networks that incorporates and models the various levels of relevance and reliability of diverse sources. The method is shown to achieve significantly higher performance as compared to two well-known gene prioritization algorithms. Essentially, no bias in the performance was seen as it was applied to diseases of diverse ethnology, e.g., monogenic, polygenic and cancer. The method was highly stable and robust against significant levels of noise in the data. Biological networks are often sparse, which can impede the operation of associationbased gene prioritization algorithms such as the one presented here from a computational perspective. As a potential approach to overcome this limitation, we explore the value that transcription factor binding sites can have in elucidating suitable targets. Transcription factors are needed for the expression of most genes, especially in higher organisms and hence genes can be associated via their genetic regulatory properties. While each transcription factor recognizes specific DNA sequence patterns, such patterns are mostly unknown for many transcription factors. Even those that are known are inconsistently reported in the literature, implying a potentially high level of inaccuracy. We developed computational methods for prediction and improvement of transcription factor binding patterns. Tests performed on the improvement method by employing synthetic patterns under various conditions showed that the method is very robust and the patterns produced invariably converge to nearly identical series of patterns. Preliminary tests were conducted to incorporate knowledge from transcription factor binding sites into our networkbased model for prioritization, with encouraging results. Genes have widely different pertinences to the etiology and pathology of diseases. Thus, they can be ranked according to their disease-significance on a genomic scale, which is the subject of gene prioritization. Given a set of genes known to be related to a disease, it is reasonable to use them as a basis to determine the significance of other candidate genes, which will then be ranked based on the association they exhibit with respect to the given set of known genes. Experimental and computational data of various kinds have different reliability and relevance to a disease under study. This work presents a gene prioritization method based on integrated biological networks that incorporates and models the various levels of relevance and reliability of diverse sources. The method is shown to achieve significantly higher performance as compared to two well-known gene prioritization algorithms. Essentially, no bias in the performance was seen as it was applied to diseases of diverse ethnology, e.g., monogenic, polygenic and cancer. The method was highly stable and robust against significant levels of noise in the data. Biological networks are often sparse, which can impede the operation of associationbased gene prioritization algorithms such as the one presented here from a computational perspective. As a potential approach to overcome this limitation, we explore the value that transcription factor binding sites can have in elucidating suitable targets. Transcription factors are needed for the expression of most genes, especially in higher organisms and hence genes can be associated via their genetic regulatory properties. While each transcription factor recognizes specific DNA sequence patterns, such patterns are mostly unknown for many transcription factors. Even those that are known are inconsistently reported in the literature, implying a potentially high level of inaccuracy. We developed computational methods for prediction and improvement of transcription factor binding patterns. Tests performed on the improvement method by employing synthetic patterns under various conditions showed that the method is very robust and the patterns produced invariably converge to nearly identical series of patterns. Preliminary tests were conducted to incorporate knowledge from transcription factor binding sites into our networkbased model for prioritization, with encouraging results. To validate these approaches in a disease-specific context, we built a schizophreniaspecific network based on the inferred associations and performed a comprehensive prioritization of human genes with respect to the disease. These results are expected to be validated empirically, but computational validation using known targets are very positive.
ContributorsLee, Jang (Author) / Gonzalez, Graciela (Thesis advisor) / Ye, Jieping (Committee member) / Davulcu, Hasan (Committee member) / Gallitano-Mendel, Amelia (Committee member) / Arizona State University (Publisher)
Created2011