Matching Items (396)
Filtering by

Clear all filters

150019-Thumbnail Image.png
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

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
150026-Thumbnail Image.png
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

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
149794-Thumbnail Image.png
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

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
147844-Thumbnail Image.png
Description

"No civil discourse, no cooperation; misinformation, mistruth." These were the words of former Facebook Vice President Chamath Palihapitiya who publicly expressed his regret in a 2017 interview over his role in co-creating Facebook. Palihapitiya shared that social media is ripping apart the social fabric of society and he also sounded

"No civil discourse, no cooperation; misinformation, mistruth." These were the words of former Facebook Vice President Chamath Palihapitiya who publicly expressed his regret in a 2017 interview over his role in co-creating Facebook. Palihapitiya shared that social media is ripping apart the social fabric of society and he also sounded the alarm regarding social media’s unavoidable global impact. He is only one of social media’s countless critics. The more disturbing issue resides in the empirical evidence supporting such notions. At least 95% of adolescents own a smartphone and spend an average time of two to four hours a day on social media. Moreover, 91% of 16-24-year-olds use social media, yet youth rate Instagram, Facebook, and Twitter as the worst social media platforms. However, the social, clinical, and neurodevelopment ramifications of using social media regularly are only beginning to emerge in research. Early research findings show that social media platforms trigger anxiety, depression, low self-esteem, and other negative mental health effects. These negative mental health symptoms are commonly reported by individuals from of 18-25-years old, a unique period of human development known as emerging adulthood. Although emerging adulthood is characterized by identity exploration, unbounded optimism, and freedom from most responsibilities, it also serves as a high-risk period for the onset of most psychological disorders. Despite social media’s adverse impacts, it retains its utility as it facilitates identity exploration and virtual socialization for emerging adults. Investigating the “user-centered” design and neuroscience underlying social media platforms can help reveal, and potentially mitigate, the onset of negative mental health consequences among emerging adults. Effectively deconstructing the Facebook, Twitter, and Instagram (i.e., hereafter referred to as “The Big Three”) will require an extensive analysis into common features across platforms. A few examples of these design features include: like and reaction counters, perpetual news feeds, and omnipresent banners and notifications surrounding the user’s viewport. Such social media features are inherently designed to stimulate specific neurotransmitters and hormones such as dopamine, serotonin, and cortisol. Identifying such predacious social media features that unknowingly manipulate and highjack emerging adults’ brain chemistry will serve as a first step in mitigating the negative mental health effects of today’s social media platforms. A second concrete step will involve altering or eliminating said features by creating a social media platform that supports and even enhances mental well-being.

ContributorsGupta, Anay (Author) / Flores, Valerie (Thesis director) / Carrasquilla, Christina (Committee member) / Barnett, Jessica (Committee member) / The Sidney Poitier New American Film School (Contributor) / Computer Science and Engineering Program (Contributor, Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
148094-Thumbnail Image.png
Description

Americans today face an age of information overload. With the evolution of Media 3.0, the internet, and the rise of Media 3.5—i.e., social media—relatively new communication technologies present pressing challenges for the First Amendment in American society. Twentieth century law defined freedom of expression, but in an information-limited world. By

Americans today face an age of information overload. With the evolution of Media 3.0, the internet, and the rise of Media 3.5—i.e., social media—relatively new communication technologies present pressing challenges for the First Amendment in American society. Twentieth century law defined freedom of expression, but in an information-limited world. By contrast, the twenty-first century is seeing the emergence of a world that is overloaded with information, largely shaped by an “unintentional press”—social media. Americans today rely on just a small concentration of private technology powerhouses exercising both economic and social influence over American society. This raises questions about censorship, access, and misinformation. While the First Amendment protects speech from government censorship only, First Amendment ideology is largely ingrained across American culture, including on social media. Technological advances arguably have made entry into the marketplace of ideas—a fundamental First Amendment doctrine—more accessible, but also more problematic for the average American, increasing his/her potential exposure to misinformation. <br/><br/>This thesis uses political and judicial frameworks to evaluate modern misinformation trends, social media platforms and current misinformation efforts, against the background of two misinformation accelerants in 2020, the COVID-19 pandemic and U.S. presidential election. Throughout history, times of hardship and intense fear have contributed to the shaping of First Amendment jurisprudence. Thus, this thesis looks at how fear can intensify the spread of misinformation and influence free speech values. Extensive research was conducted to provide the historical context behind relevant modern literature. This thesis then concludes with three solutions to misinformation that are supported by critical American free speech theory.

ContributorsCochrane, Kylie Marie (Author) / Russomanno, Joseph (Thesis director) / Roschke, Kristy (Committee member) / School of Public Affairs (Contributor) / Walter Cronkite School of Journalism and Mass Comm (Contributor, Contributor) / Watts College of Public Service & Community Solut (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
147896-Thumbnail Image.png
Description

This research covers the landscape of influencer marketing and combines it with the knowledge of 11 content creators and one social media specialist, ultimately producing an actionable handbook. Participants were asked questions that were intended to discover key strategies, level of difficulty, and overall insight into the content creator world.

This research covers the landscape of influencer marketing and combines it with the knowledge of 11 content creators and one social media specialist, ultimately producing an actionable handbook. Participants were asked questions that were intended to discover key strategies, level of difficulty, and overall insight into the content creator world. Best practices and key findings are identified in the research paper, and outlined into four parts in the handbook. The handbook serves as a compilation framework derived from my primary and secondary sources designed to provide anyone interested in becoming a content creator or social media influencer on steps they may take given what their predecessors have done to successfully launch their careers in the space.

ContributorsEsparza, Alexa (Author) / Giles, Charles (Thesis director) / Schlacter, John (Committee member) / Department of Marketing (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
148212-Thumbnail Image.png
Description

Developed a business product with a team of CS students.

ContributorsPerri, Cole Thomas (Co-author) / Hernandez, Maximilliano (Co-author) / Schneider, Kaitlin (Co-author) / Call, Andy (Thesis director) / Hunt, Neil (Committee member) / School of Accountancy (Contributor) / Watts College of Public Service & Community Solut (Contributor) / WPC Graduate Programs (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
149907-Thumbnail Image.png
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

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
149695-Thumbnail Image.png
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

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
150212-Thumbnail Image.png
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

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