Matching Items (380)
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
147842-Thumbnail Image.png
Description

Motor learning is the process of improving task execution according to some measure of performance. This can be divided into skill learning, a model-free process, and adaptation, a model-based process. Prior studies have indicated that adaptation results from two complementary learning systems with parallel organization. This report attempted to answer

Motor learning is the process of improving task execution according to some measure of performance. This can be divided into skill learning, a model-free process, and adaptation, a model-based process. Prior studies have indicated that adaptation results from two complementary learning systems with parallel organization. This report attempted to answer the question of whether a similar interaction leads to savings, a model-free process that is described as faster relearning when experiencing something familiar. This was tested in a two-week reaching task conducted on a robotic arm capable of perturbing movements. The task was designed so that the two sessions differed in their history of errors. By measuring the change in the learning rate, the savings was determined at various points. The results showed that the history of errors successfully modulated savings. Thus, this supports the notion that the two complementary systems interact to develop savings. Additionally, this report was part of a larger study that will explore the organizational structure of the complementary systems as well as the neural basis of this motor learning.

ContributorsRuta, Michael (Author) / Santello, Marco (Thesis director) / Blais, Chris (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / School of Molecular Sciences (Contributor) / School of Human Evolution & Social Change (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
147979-Thumbnail Image.png
Description

Traumatic brain injury involves a primary mechanical injury that is followed by a secondary<br/>inflammatory cascade. The inflammatory cascade in the CNS releases cytokines which are<br/>associated with leukocytosis and a systemic immune response. Acute changes to peripheral<br/>immune cell populations post-TBI include a 4.5-fold increase of neutrophils 3 hours post-injury,<br/>and 2.7-fold or

Traumatic brain injury involves a primary mechanical injury that is followed by a secondary<br/>inflammatory cascade. The inflammatory cascade in the CNS releases cytokines which are<br/>associated with leukocytosis and a systemic immune response. Acute changes to peripheral<br/>immune cell populations post-TBI include a 4.5-fold increase of neutrophils 3 hours post-injury,<br/>and 2.7-fold or higher increase of monocytes 24 hours post-injury. Flow Cytometry is a<br/>technique that integrates fluidics, optics, and electronics to characterize cells based on their light<br/>scatter and antigen expression via monoclonal antibodies conjugated to fluorochromes. Flow<br/>cytometry is a valuable tool in cell characterization however the standard technique for data<br/>analysis, manual gating, is associated with inefficiency, subjectivity, and irreproducibility.<br/>Unsupervised analysis that uses algorithms packaged as plug-ins for flow cytometry analysis<br/>software has been discussed as a solution to the limits of manual gating and as an alternative<br/>method of data visualization and exploration. This investigation evaluated the use of tSNE<br/>(dimensionality reduction algorithm) and FlowSOM (population clustering algorithm)<br/>unsupervised flow cytometry analysis of immune cell population changes in female mice that<br/>have been exposed to a LPS-induced systemic inflammatory challenge, results were compared to<br/>those of manual gating. Flow cytometry data was obtained from blood samples taken prior to and<br/>24 hours after LPS injection. Unsupervised analysis was able to identify populations of<br/>neutrophils and pro-inflammatory/anti-inflammatory monocytes, it also identified several more<br/>populations however further inquiry with a more specific fluorescent panel would be required to<br/>establish the specificity and validity of these populations. Unsupervised analysis with tSNE and<br/>FlowSOM demonstrated the efficient and intuitive nature of the technique, however it also<br/>illustrated the importance of the investigator in preparing data and modulating plug-in settings.

ContributorsDudic, Ahmed (Author) / Stabenfeldt, Sarah (Thesis director) / Lifshitz, Jonathan (Committee member) / Rojas, Luisa (Committee member) / School of Life Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
148068-Thumbnail Image.png
Description

Traumatic brain injury (TBI) is a widespread health issue that affects approximately 1.7 million lives per year. The effects of TBI go past the incident of primary injury, as chronic damage can follow for years and cause irreversible neurodegeneration. A potential strategy for repair that has been studied is cell

Traumatic brain injury (TBI) is a widespread health issue that affects approximately 1.7 million lives per year. The effects of TBI go past the incident of primary injury, as chronic damage can follow for years and cause irreversible neurodegeneration. A potential strategy for repair that has been studied is cell transplantation, as neural stem cells improve neurological function. While promising, neural stem cell transplantation presents challenges due to a relatively low survival rate post-implantation and issues with determining the optimal method of transplantation. Shear-thinning hydrogels are a type of hydrogel whose linkages break when under shear stress, exhibiting viscous flow, but reform and recover upon relaxation. Such properties allow them to be easily injected for minimally invasive delivery, while also shielding encapsulated cells from high shear forces, which would normally degrade the function and viability of such cells. As such, it is salient to research whether shear-thinning hydrogels are feasible candidates in neural cell transplantation applications for neuroregenerative medicine. In this honors thesis, shear-thinning hydrogels were formed through guest-host interactions of adamantane modified HA (guest ad-HA) and beta-cyclodextrin modified HA (host CD-HA). The purpose of the study was to characterize the injection force profile of different weight percentages of the HA shear-thinning hydrogel. The break force and average glide force were also compared between the differing weight percentages. By understanding the force exerted on the hydrogel when being injected, we could characterize how neural cells may respond to encapsulation and injection within HA shear-thinning hydrogels. We identified that 5% weight HA hydrogel required greater injection force than 4% weight HA hydrogel to be fully delivered. Such contexts are valuable, as this implies that higher weight percentage gels impart higher shear forces on encapsulated cells than lower weight gels. Further study is required to optimize our injection force system’s sensitivity and to investigate if cell encapsulation increases the force required for injection.

ContributorsZhang, Irene (Author) / Stabenfeldt, Sarah (Thesis director) / Holloway, Julianne (Committee member) / Harrington Bioengineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
149903-Thumbnail Image.png
Description
Neurostimulation methods currently include deep brain stimulation (DBS), optogenetic, transcranial direct-current stimulation (tDCS), and transcranial magnetic stimulation (TMS). TMS and tDCS are noninvasive techniques whereas DBS and optogenetic require surgical implantation of electrodes or light emitting devices. All approaches, except for optogenetic, have been implemented in clinical settings because they

Neurostimulation methods currently include deep brain stimulation (DBS), optogenetic, transcranial direct-current stimulation (tDCS), and transcranial magnetic stimulation (TMS). TMS and tDCS are noninvasive techniques whereas DBS and optogenetic require surgical implantation of electrodes or light emitting devices. All approaches, except for optogenetic, have been implemented in clinical settings because they have demonstrated therapeutic utility and clinical efficacy for neurological and psychiatric disorders. When applied for therapeutic applications, these techniques suffer from limitations that hinder the progression of its intended use to treat compromised brain function. DBS requires an invasive surgical procedure that surfaces complications from infection, longevity of electrical components, and immune responses to foreign materials. Both TMS and tDCS circumvent the problems seen with DBS as they are noninvasive procedures, but they fail to produce the spatial resolution required to target specific brain structures. Realizing these restrictions, we sought out to use ultrasound as a neurostimulation modality. Ultrasound is capable of achieving greater resolution than TMS and tDCS, as we have demonstrated a ~2mm lateral resolution, which can be delivered noninvasively. These characteristics place ultrasound superior to current neurostimulation methods. For these reasons, this dissertation provides a developed protocol to use transcranial pulsed ultrasound (TPU) as a neurostimulation technique. These investigations implement electrophysiological, optophysiological, immunohistological, and behavioral methods to elucidate the effects of ultrasound on the central nervous system and raise questions about the functional consequences. Intriguingly, we showed that TPU was also capable of stimulating intact sub-cortical circuits in the anesthetized mouse. These data reveal that TPU can evoke synchronous oscillations in the hippocampus in addition to increasing expression of brain-derived neurotrophic factor (BDNF). Considering these observations, and the ability to noninvasively stimulate neuronal activity on a mesoscale resolution, reveals a potential avenue to be effective in clinical settings where current brain stimulation techniques have shown to be beneficial. Thus, the results explained by this dissertation help to pronounce the significance for these protocols to gain translational recognition.
ContributorsTufail, Yusuf Zahid (Author) / Tyler, William J (Thesis advisor) / Duch, Carsten (Committee member) / Muthuswamy, Jitendran (Committee member) / Santello, Marco (Committee member) / Tillery, Stephen H (Committee member) / Arizona State University (Publisher)
Created2011
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
149908-Thumbnail Image.png
Description
Programmable Metallization Cell (PMC) is a technology platform which utilizes mass transport in solid or liquid electrolyte coupled with electrochemical (redox) reactions to form or remove nanoscale metallic electrodeposits on or in the electrolyte. The ability to redistribute metal mass and form metallic nanostructure in or on a structure in

Programmable Metallization Cell (PMC) is a technology platform which utilizes mass transport in solid or liquid electrolyte coupled with electrochemical (redox) reactions to form or remove nanoscale metallic electrodeposits on or in the electrolyte. The ability to redistribute metal mass and form metallic nanostructure in or on a structure in situ, via the application of a bias on laterally placed electrodes, creates a large number of promising applications. A novel PMC-based lateral microwave switch was fabricated and characterized for use in microwave systems. It has demonstrated low insertion loss, high isolation, low voltage operation, low power and low energy consumption, and excellent linearity. Due to its non-volatile nature the switch operates with fewer biases and its simple planar geometry makes possible innovative device structures which can be potentially integrated into microwave power distribution circuits. PMC technology is also used to develop lateral dendritic metal electrodes. A lateral metallic dendritic network can be grown in a solid electrolyte (GeSe) or electrodeposited on SiO2 or Si using a water-mediated method. These dendritic electrodes grown in a solid electrolyte (GeSe) can be used to lower resistances for applications like self-healing interconnects despite its relatively low light transparency; while the dendritic electrodes grown using water-mediated method can be potentially integrated into solar cell applications, like replacing conventional Ag screen-printed top electrodes as they not only reduce resistances but also are highly transparent. This research effort also laid a solid foundation for developing dendritic plasmonic structures. A PMC-based lateral dendritic plasmonic structure is a device that has metallic dendritic networks grown electrochemically on SiO2 with a thin layer of surface metal nanoparticles in liquid electrolyte. These structures increase the distribution of particle sizes by connecting pre-deposited Ag nanoparticles into fractal structures and result in three significant effects, resonance red-shift, resonance broadening and resonance enhancement, on surface plasmon resonance for light trapping simultaneously, which can potentially enhance thin film solar cells' performance at longer wavelengths.
ContributorsRen, Minghan (Author) / Kozicki, Michael (Thesis advisor) / Schroder, Dieter (Committee member) / Roedel, Ronald (Committee member) / Barnaby, Hugh (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