ASU Electronic Theses and Dissertations
This collection includes most of the ASU Theses and Dissertations from 2011 to present. ASU Theses and Dissertations are available in downloadable PDF format; however, a small percentage of items are under embargo. Information about the dissertations/theses includes degree information, committee members, an abstract, supporting data or media.
In addition to the electronic theses found in the ASU Digital Repository, ASU Theses and Dissertations can be found in the ASU Library Catalog.
Dissertations and Theses granted by Arizona State University are archived and made available through a joint effort of the ASU Graduate College and the ASU Libraries. For more information or questions about this collection contact or visit the Digital Repository ETD Library Guide or contact the ASU Graduate College at gradformat@asu.edu.
Displaying 1 - 10 of 305
Filtering by
- Creators: Davulcu, Hasan
- Creators: Johnston, Carol
- Creators: Zhang, Wenlong
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
Dietary self-monitoring has been shown to be a predictor of weight loss success and is a prevalent part of behavioral weight control programs. As more weight loss applications have become available on smartphones, this feasibility study investigated whether the use of a smartphone application, or a smartphone memo feature would improve dietary self-monitoring over the traditional paper-and-pencil method. The study also looked at whether the difference in methods would affect weight loss. Forty-seven adults (BMI 25 to 40 kg/m2) completed an 8-week study focused on tracking the difference in adherence to a self-monitoring protocol and subsequent weight loss. Participants owning iPhones (n=17) used the 'Lose It' application (AP) for diet and exercise tracking and were compared to smartphone participants who recorded dietary intake using a memo (ME) feature (n=15) on their phone and participants using the traditional paper-and-pencil (PA) method (n=15). There was no significant difference in completion rates between groups with an overall completion rate of 85.5%. The overall mean adherence to self-monitoring for the 8-week period was better in the AP group than the PA group (p = .024). No significant difference was found between the AP group and ME group (p = .148), or the ME group and the PA group (p = .457). Weight loss for the 8 week study was significant for all groups (p = .028). There was no significant difference in weight loss between groups. Number of days recorded regardless of group assignment showed a weak correlation to weight loss success (p = .068). Smartphone owners seeking to lose weight should be encouraged by the potential success associated with dietary tracking using a smartphone app as opposed to the traditional paper-and-pencil method.
ContributorsCunningham, Barbara (Author) / Wharton, Christopher (Christopher Mack), 1977- (Thesis advisor) / Johnston, Carol (Committee member) / Hall, Richard (Committee member) / Arizona State University (Publisher)
Created2012
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
Nut consumption, specifically almonds, have been shown to help maintain weight and influence disease risk factors in adult populations. Limited studies have been conducted examining the effect of a small dose of almonds on energy intake and body weight. The objective of this study was to determine the influence of pre-meal almond consumption on energy intake and weight in overweight and obese adults. In this study included 21, overweight or obese, participants who were considered healthy or had a controlled disease state. This 8-week parallel arm study, participants were randomized to consume an isocaloric amount of almonds, (1 oz) serving, or two (2 oz) cheese stick serving, 30 minutes before the dinner meal, 5 times per week. Anthropometric measurements including weight, waist circumference, and body fat percentage were recorded at baseline, week 1, 4, and 8. Measurement of energy intake was self-reported for two consecutive days at week 1, 4 and 8 using the ASA24 automated dietary program. The energy intake after 8 weeks of almond consumption was not significantly different when compared to the control group (p=0.965). In addition, body weight was not significantly reduced after 8 weeks of the almond intervention (p=0.562). Other parameters measured in this 8-week trial did not differ between the intervention and the control group. These data presented are underpowered and therefore inconclusive on the effects that 1 oz of almonds, in the diet, 5 per week has on energy intake and bodyweight.
ContributorsMcBride, Lindsey (Author) / Johnston, Carol (Thesis advisor) / Swan, Pamela (Committee member) / Mayol-Kreiser, Sandra (Committee member) / Arizona State University (Publisher)
Created2011
Description
ABSTRACT Epidemiological studies have suggested a link between nut consumption and weight. The possible effects of regular nut consumption as a method of weight loss has shown minimal results with 2-3 servings of nut products per day. This 8 week study sought to investigate the effect of more modest nut consumption (1 oz./day, 5 days/week) on dietary compensation in healthy overweight individuals. Overweight and obese participants (n = 28) were recruited from the local community and were randomly assigned to either almond (NUT) or control (CON) group in this randomized, parallel-arm study. Subjects were instructed to eat their respective foods 30 minutes before the dinner meal. 24 hour diet recalls were completed pre-trial and at study weeks 1, 4 and 8. Self-reported satiety data were completed at study weeks 1, 4, and 8. Attrition was unexpectedly high, with 13 participants completing 24 dietary recall data through study week 8. High attrition limited statistical analyses. Results suggested a lack of effect for time or interaction for satiety data (within groups p = 0.997, between groups p = 0.367). Homogeneity of of inter-correlations could not be tested for 24-hour recall data as there were fewer than 2 nonsingular cell covariance matrices. In conclusion, this study was unable to prove or disprove the effectiveness of almonds to induce dietary compensation.
ContributorsJahns, Marshall (Author) / Johnston, Carol (Thesis advisor) / Hall, Richard (Committee member) / Wharton, Christopher (Christopher Mack), 1977- (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
Description
ABSTRACT This study evaluated the LoseIt Smart Phone app by Fit Now Inc. for nutritional quality among users during an 8 week behavioral modification weight loss protocol. All participants owned smart phones and were cluster randomized to either a control group using paper and pencil record keeping, a memo group using a memo function on their smart phones, or the LoseIt app group which was composed of the participants who owned iPhones. Thirty one participants completed the study protocol: 10 participants from the LoseIt app group, 10 participants from the memo group, and 11 participants from the paper and pencil group. Food records were analyzed using Food Processor by ESHA and the nutritional quality was scored using the Healthy Eating Index - 2005 (HEI-2005). Scores were compared using One-Way ANOVA with no significant changes in any category across all groups. Non-parametric statistics were then used to determine changes between combined memo and paper and pencil groups and the LoseIt app group as the memo and paper and pencil group received live counseling at biweekly intervals and the LoseIt group did not. No significant difference was found in HEI scores across all categories, however a trend was noted for total HEI score with higher scores among the memo and paper and pencil group participants p=0.091. Conclusion, no significant difference was detected between users of the smart phone app LoseIt and memo and paper and pencil groups. More research is needed to determine the impact of in-person counseling versus user feedback provided with the LoseIt smart phone app.
ContributorsCowan, David Kevin (Author) / Johnston, Carol (Thesis advisor) / Wharton, Christopher (Christopher Mack), 1977- (Committee member) / Mayol-Kreiser, Sandra (Committee member) / Arizona State University (Publisher)
Created2011
Description
Most existing approaches to complex event processing over streaming data rely on the assumption that the matches to the queries are rare and that the goal of the system is to identify these few matches within the incoming deluge of data. In many applications, such as stock market analysis and user credit card purchase pattern monitoring, however the matches to the user queries are in fact plentiful and the system has to efficiently sift through these many matches to locate only the few most preferable matches. In this work, we propose a complex pattern ranking (CPR) framework for specifying top-k pattern queries over streaming data, present new algorithms to support top-k pattern queries in data streaming environments, and verify the effectiveness and efficiency of the proposed algorithms. The developed algorithms identify top-k matching results satisfying both patterns as well as additional criteria. To support real-time processing of the data streams, instead of computing top-k results from scratch for each time window, we maintain top-k results dynamically as new events come and old ones expire. We also develop new top-k join execution strategies that are able to adapt to the changing situations (e.g., sorted and random access costs, join rates) without having to assume a priori presence of data statistics. Experiments show significant improvements over existing approaches.
ContributorsWang, Xinxin (Author) / Candan, K. Selcuk (Thesis advisor) / Chen, Yi (Committee member) / Davulcu, Hasan (Committee member) / Arizona State University (Publisher)
Created2011
Description
Data-driven applications are becoming increasingly complex with support for processing events and data streams in a loosely-coupled distributed environment, providing integrated access to heterogeneous data sources such as relational databases and XML documents. This dissertation explores the use of materialized views over structured heterogeneous data sources to support multiple query optimization in a distributed event stream processing framework that supports such applications involving various query expressions for detecting events, monitoring conditions, handling data streams, and querying data. Materialized views store the results of the computed view so that subsequent access to the view retrieves the materialized results, avoiding the cost of recomputing the entire view from base data sources. Using a service-based metadata repository that provides metadata level access to the various language components in the system, a heuristics-based algorithm detects the common subexpressions from the queries represented in a mixed multigraph model over relational and structured XML data sources. These common subexpressions can be relational, XML or a hybrid join over the heterogeneous data sources. This research examines the challenges in the definition and materialization of views when the heterogeneous data sources are retained in their native format, instead of converting the data to a common model. LINQ serves as the materialized view definition language for creating the view definitions. An algorithm is introduced that uses LINQ to create a data structure for the persistence of these hybrid views. Any changes to base data sources used to materialize views are captured and mapped to a delta structure. The deltas are then streamed within the framework for use in the incremental update of the materialized view. Algorithms are presented that use the magic sets query optimization approach to both efficiently materialize the views and to propagate the relevant changes to the views for incremental maintenance. Using representative scenarios over structured heterogeneous data sources, an evaluation of the framework demonstrates an improvement in performance. Thus, defining the LINQ-based materialized views over heterogeneous structured data sources using the detected common subexpressions and incrementally maintaining the views by using magic sets enhances the efficiency of the distributed event stream processing environment.
ContributorsChaudhari, Mahesh Balkrishna (Author) / Dietrich, Suzanne W (Thesis advisor) / Urban, Susan D (Committee member) / Davulcu, Hasan (Committee member) / Chen, Yi (Committee member) / Arizona State University (Publisher)
Created2011
Description
This thesis addresses the problem of online schema updates where the goal is to be able to update relational database schemas without reducing the database system's availability. Unlike some other work in this area, this thesis presents an approach which is completely client-driven and does not require specialized database management systems (DBMS). Also, unlike other client-driven work, this approach provides support for a richer set of schema updates including vertical split (normalization), horizontal split, vertical and horizontal merge (union), difference and intersection. The update process automatically generates a runtime update client from a mapping between the old the new schemas. The solution has been validated by testing it on a relatively small database of around 300,000 records per table and less than 1 Gb, but with limited memory buffer size of 24 Mb. This thesis presents the study of the overhead of the update process as a function of the transaction rates and the batch size used to copy data from the old to the new schema. It shows that the overhead introduced is minimal for medium size applications and that the update can be achieved with no more than one minute of downtime.
ContributorsTyagi, Preetika (Author) / Bazzi, Rida (Thesis advisor) / Candan, Kasim S (Committee member) / Davulcu, Hasan (Committee member) / Arizona State University (Publisher)
Created2011