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 102
Description
Digital sound synthesis allows the creation of a great variety of sounds. Focusing on interesting or ecologically valid sounds for music, simulation, aesthetics, or other purposes limits the otherwise vast digital audio palette. Tools for creating such sounds vary from arbitrary methods of altering recordings to precise simulations of vibrating objects. In this work, methods of sound synthesis by re-sonification are considered. Re-sonification, herein, refers to the general process of analyzing, possibly transforming, and resynthesizing or reusing recorded sounds in meaningful ways, to convey information. Applied to soundscapes, re-sonification is presented as a means of conveying activity within an environment. Applied to the sounds of objects, this work examines modeling the perception of objects as well as their physical properties and the ability to simulate interactive events with such objects. To create soundscapes to re-sonify geographic environments, a method of automated soundscape design is presented. Using recorded sounds that are classified based on acoustic, social, semantic, and geographic information, this method produces stochastically generated soundscapes to re-sonify selected geographic areas. Drawing on prior knowledge, local sounds and those deemed similar comprise a locale's soundscape. In the context of re-sonifying events, this work examines processes for modeling and estimating the excitations of sounding objects. These include plucking, striking, rubbing, and any interaction that imparts energy into a system, affecting the resultant sound. A method of estimating a linear system's input, constrained to a signal-subspace, is presented and applied toward improving the estimation of percussive excitations for re-sonification. To work toward robust recording-based modeling and re-sonification of objects, new implementations of banded waveguide (BWG) models are proposed for object modeling and sound synthesis. Previous implementations of BWGs use arbitrary model parameters and may produce a range of simulations that do not match digital waveguide or modal models of the same design. Subject to linear excitations, some models proposed here behave identically to other equivalently designed physical models. Under nonlinear interactions, such as bowing, many of the proposed implementations exhibit improvements in the attack characteristics of synthesized sounds.
ContributorsFink, Alex M (Author) / Spanias, Andreas S (Thesis advisor) / Cook, Perry R. (Committee member) / Turaga, Pavan (Committee member) / Tsakalis, Konstantinos (Committee member) / Arizona State University (Publisher)
Created2013
Description
One of the main challenges in planetary robotics is to traverse the shortest path through a set of waypoints. The shortest distance between any two waypoints is a direct linear traversal. Often times, there are physical restrictions that prevent a rover form traversing straight to a waypoint. Thus, knowledge of the terrain is needed prior to traversal. The Digital Terrain Model (DTM) provides information about the terrain along with waypoints for the rover to traverse. However, traversing a set of waypoints linearly is burdensome, as the rovers would constantly need to modify their orientation as they successively approach waypoints. Although there are various solutions to this problem, this research paper proposes the smooth traversability of the rover using splines as a quick and easy implementation to traverse a set of waypoints. In addition, a rover was used to compare the smoothness of the linear traversal along with the spline interpolations. The data collected illustrated that spline traversals had a less rate of change in the velocity over time, indicating that the rover performed smoother than with linear paths.
ContributorsKamasamudram, Anurag (Author) / Saripalli, Srikanth (Thesis advisor) / Fainekos, Georgios (Thesis advisor) / Turaga, Pavan (Committee member) / Arizona State University (Publisher)
Created2013
Description
The ribosome is a ribozyme and central to the biosynthesis of proteins in all organisms. It has a strong bias against non-alpha-L-amino acids, such as alpha-D-amino acids and beta-amino acids. Additionally, the ribosome is only able to incorporate one amino acid in response to one codon. It has been demonstrated that reengineering of the peptidyltransferase center (PTC) of the ribosome enabled the incorporation of both alpha-D-amino acids and beta-amino acids into full length protein. Described in Chapter 2 are five modified ribosomes having modifications in the peptidyltrasnferase center in the 23S rRNA. These modified ribosomes successfully incorporated five different beta-amino acids (2.1 - 2.5) into E. coli dihydrofolate reductase (DHFR). The second project (Chapter 3) focused on the study of the modified ribosomes facilitating the incorporation of the dipeptide glycylphenylalanine (3.25) and fluorescent dipeptidomimetic 3.26 into DHFR. These ribosomes also had modifications in the peptidyltransferase center in the 23S rRNA of the 50S ribosomal subunit. The modified DHFRs having beta-amino acids 2.3 and 2.5, dipeptide glycylphenylalanine (3.25) and dipeptidomimetic 3.26 were successfully characterized by the MALDI-MS analysis of the peptide fragments produced by "in-gel" trypsin digestion of the modified proteins. The fluorescent spectra of the dipeptidomimetic 3.26 and modified DHFR having fluorescent dipeptidomimetic 3.26 were also measured. The type I and II DNA topoisomerases have been firmly established as effective molecular targets for many antitumor drugs. A "classical" topoisomerase I or II poison acts by misaligning the free hydroxyl group of the sugar moiety of DNA and preventing the reverse transesterfication reaction to religate DNA. There have been only two classes of compounds, saintopin and topopyrones, reported as dual topoisomerase I and II poisons. Chapter 4 describes the synthesis and biological evaluation of topopyrones. Compound 4.10, employed at 20 µM, was as efficient as 0.5 uM camptothecin, a potent topoisomerase I poison, in stabilizing the covalent binary complex (~30%). When compared with a known topoisomerase II poison, etoposide (at 0.5 uM), topopyorone 4.10 produced similar levels of stabilized DNA-enzyme binary complex (~34%) at 5 uM concentration.
ContributorsMaini, Rumit (Author) / Hecht, Sidney M. (Thesis advisor) / Gould, Ian (Committee member) / Yan, Hao (Committee member) / Arizona State University (Publisher)
Created2013
Description
Photosynthesis, one of the most important processes in nature, has provided an energy basis for nearly all life on Earth, as well as the fossil fuels we use today to power modern society. This research aims to mimic the photosynthetic process of converting incident solar energy into chemical potential energy in the form of a fuel via systems capable of carrying out photo-induced electron transfer to drive the production of hydrogen from water. Herein is detailed progress in using photo-induced stepwise electron transfer to drive the oxidation of water and reduction of protons to hydrogen. In the design, use of more blue absorbing porphyrin dyes to generate high-potential intermediates for oxidizing water and more red absorbing phthalocyanine dyes for forming the low potential charge needed for the production of hydrogen have been utilized. For investigating water oxidation at the photoanode, high potential porphyrins such as, bis-pyridyl porphyrins and pentafluorophenyl porphyrins have been synthesized and experiments have aimed at the co-immobilization of this dye with an IrO2-nH2O catalyst on TiO2. To drive the cathodic reaction of the water splitting photoelectrochemical cell, utilization of silicon octabutoxy-phthalocyanines have been explored, as they offer good absorption in the red to near infrared, coupled with low potential photo-excited states. Axially and peripherally substituted phthalocyanines bearing carboxylic anchoring groups for the immobilization on semiconductors such as TiO2 has been investigated. Ultimately, this work should culminate in a photoelectrochemical cell capable of splitting water to oxygen and hydrogen with the only energy input from light. A series of perylene dyes bearing multiple semi-conducting metal oxide anchoring groups have been synthesized and studied. Results have shown interfacial electron transfer between these perylenes and TiO2 nanoparticles encapsulated within reverse micelles and naked nanoparticles. The binding process was followed by monitoring the hypsochromic shift of the dye absorption spectra over time. Photoinduced electron transfer from the singlet excited state of the perylenes to the TiO2 conduction band is indicated by emission quenching of the TiO2-bound form of the dyes and confirmed by transient absorption measurements of the radical cation of the dyes and free carriers (injected electrons) in the TiO2.
ContributorsBergkamp, Jesse J (Author) / Moore, Ana L (Thesis advisor) / Mariño-Ochoa, Ernesto (Thesis advisor) / Gust, Devens J (Committee member) / Gould, Ian (Committee member) / Arizona State University (Publisher)
Created2013
Description
Our research focuses on finding answers through decentralized search, for complex, imprecise queries (such as "Which is the best hair salon nearby?") in situations where there is a spatiotemporal constraint (say answer needs to be found within 15 minutes) associated with the query. In general, human networks are good in answering imprecise queries. We try to use the social network of a person to answer his query. Our research aims at designing a framework that exploits the user's social network in order to maximize the answers for a given query. Exploiting an user's social network has several challenges. The major challenge is that the user's immediate social circle may not possess the answer for the given query, and hence the framework designed needs to carry out the query diffusion process across the network. The next challenge involves in finding the right set of seeds to pass the query to in the user's social circle. One other challenge is to incentivize people in the social network to respond to the query and thereby maximize the quality and quantity of replies. Our proposed framework is a mobile application where an individual can either respond to the query or forward it to his friends. We simulated the query diffusion process in three types of graphs: Small World, Random and Preferential Attachment. Given a type of network and a particular query, we carried out the query diffusion by selecting seeds based on attributes of the seed. The main attributes are Topic relevance, Replying or Forwarding probability and Time to Respond. We found that there is a considerable increase in the number of replies attained, even without saturating the user's network, if we adopt an optimal seed selection process. We found the output of the optimal algorithm to be satisfactory as the number of replies received at the interrogator's end was close to three times the number of neighbors an interrogator has. We addressed the challenge of incentivizing people to respond by associating a particular amount of points for each query asked, and awarding the same to people involved in answering the query. Thus, we aim to design a mobile application based on our proposed framework so that it helps in maximizing the replies for the interrogator's query by diffusing the query across his/her social network.
ContributorsSwaminathan, Neelakantan (Author) / Sundaram, Hari (Thesis advisor) / Davulcu, Hasan (Thesis advisor) / Turaga, Pavan (Committee member) / Arizona State University (Publisher)
Created2013
Description
The biological and chemical diversity of protein structure and function can be greatly expanded by position-specific incorporation of non-natural amino acids bearing a variety of functional groups. Non-cognate amino acids can be incorporated into proteins at specific sites by using orthogonal aminoacyl-tRNA synthetase/tRNA pairs in conjunction with nonsense, rare, or 4-bp codons. There has been considerable progress in developing new types of amino acids, in identifying novel methods of tRNA aminoacylation, and in expanding the genetic code to direct their position. Chemical aminoacylation of tRNAs is accomplished by acylation and ligation of a dinucleotide (pdCpA) to the 3'-terminus of truncated tRNA. This strategy allows the incorporation of a wide range of natural and unnatural amino acids into pre-determined sites, thereby facilitating the study of structure-function relationships in proteins and allowing the investigation of their biological, biochemical and biophysical properties. Described in Chapter 1 is the current methodology for synthesizing aminoacylated suppressor tRNAs. Aminoacylated suppressor tRNACUAs are typically prepared by linking pre-aminoacylated dinucleotides (aminoacyl-pdCpAs) to 74 nucleotide (nt) truncated tRNAs (tRNA-COH) via a T4 RNA ligase mediated reaction. Alternatively, there is another route outlined in Chapter 1 that utilizes a different pre-aminoacylated dinucleotide, AppA. This dinucleotide has been shown to be a suitable substrate for T4 RNA ligase mediated coupling with abbreviated tRNA-COHs for production of 76 nt aminoacyl-tRNACUAs. The synthesized suppressor tRNAs have been shown to participate in protein synthesis in vitro, in an S30 (E. coli) coupled transcription-translation system in which there is a UAG codon in the mRNA at the position corresponding to Val10. Chapter 2 describes the synthesis of two non-proteinogenic amino acids, L-thiothreonine and L-allo-thiothreonine, and their incorporation into predetermined positions of a catalytically competent dihydrofolate reductase (DHFR) analogue lacking cysteine. Here, the elaborated proteins were site-specifically derivitized with a fluorophore at the thiothreonine residue. The synthesis and incorporation of phosphorotyrosine derivatives into DHFR is illustrated in Chapter 3. Three different phosphorylated tyrosine derivatives were prepared: bis-nitrobenzylphosphoro-L-tyrosine, nitrobenzylphosphoro-L-tyrosine, and phosphoro-L-tyrosine. Their ability to participate in a protein synthesis system was also evaluated.
ContributorsNangreave, Ryan Christopher (Author) / Hecht, Sidney M. (Thesis advisor) / Yan, Hao (Committee member) / Gould, Ian (Committee member) / Arizona State University (Publisher)
Created2013
Description
We solve the problem of activity verification in the context of sustainability. Activity verification is the process of proving the user assertions pertaining to a certain activity performed by the user. Our motivation lies in incentivizing the user for engaging in sustainable activities like taking public transport or recycling. Such incentivization schemes require the system to verify the claim made by the user. The system verifies these claims by analyzing the supporting evidence captured by the user while performing the activity. The proliferation of portable smart-phones in the past few years has provided us with a ubiquitous and relatively cheap platform, having multiple sensors like accelerometer, gyroscope, microphone etc. to capture this evidence data in-situ. In this research, we investigate the supervised and semi-supervised learning techniques for activity verification. Both these techniques make use the data set constructed using the evidence submitted by the user. Supervised learning makes use of annotated evidence data to build a function to predict the class labels of the unlabeled data points. The evidence data captured can be either unimodal or multimodal in nature. We use the accelerometer data as evidence for transportation mode verification and image data as evidence for recycling verification. After training the system, we achieve maximum accuracy of 94% when classifying the transport mode and 81% when detecting recycle activity. In the case of recycle verification, we could improve the classification accuracy by asking the user for more evidence. We present some techniques to ask the user for the next best piece of evidence that maximizes the probability of classification. Using these techniques for detecting recycle activity, the accuracy increases to 93%. The major disadvantage of using supervised models is that it requires extensive annotated training data, which expensive to collect. Due to the limited training data, we look at the graph based inductive semi-supervised learning methods to propagate the labels among the unlabeled samples. In the semi-supervised approach, we represent each instance in the data set as a node in the graph. Since it is a complete graph, edges interconnect these nodes, with each edge having some weight representing the similarity between the points. We propagate the labels in this graph, based on the proximity of the data points to the labeled nodes. We estimate the performance of these algorithms by measuring how close the probability distribution of the data after label propagation is to the probability distribution of the ground truth data. Since labeling has a cost associated with it, in this thesis we propose two algorithms that help us in selecting minimum number of labeled points to propagate the labels accurately. Our proposed algorithm achieves a maximum of 73% increase in performance when compared to the baseline algorithm.
ContributorsDesai, Vaishnav (Author) / Sundaram, Hari (Thesis advisor) / Li, Baoxin (Thesis advisor) / Turaga, Pavan (Committee member) / Arizona State University (Publisher)
Created2013
Description
As the genetic information storage vehicle, deoxyribonucleic acid (DNA) molecules are essential to all known living organisms and many viruses. It is amazing that such a large amount of information about how life develops can be stored in these tiny molecules. Countless scientists, especially some biologists, are trying to decipher the genetic information stored in these captivating molecules. Meanwhile, another group of researchers, nanotechnologists in particular, have discovered that the unique and concise structural features of DNA together with its information coding ability can be utilized for nano-construction efforts. This idea culminated in the birth of the field of DNA nanotechnology which is the main topic of this dissertation. The ability of rationally designed DNA strands to self-assemble into arbitrary nanostructures without external direction is the basis of this field. A series of novel design principles for DNA nanotechnology are presented here, from topological DNA nanostructures to complex and curved DNA nanostructures, from pure DNA nanostructures to hybrid RNA/DNA nanostructures. As one of the most important and pioneering fields in controlling the assembly of materials (both DNA and other materials) at the nanoscale, DNA nanotechnology is developing at a dramatic speed and as more and more construction approaches are invented, exciting advances will emerge in ways that we may or may not predict.
ContributorsHan, Dongran (Author) / Yan, Hao (Thesis advisor) / Liu, Yan (Thesis advisor) / Ros, Anexandra (Committee member) / Gould, Ian (Committee member) / Arizona State University (Publisher)
Created2012
Description
Image understanding has been playing an increasingly crucial role in vision applications. Sparse models form an important component in image understanding, since the statistics of natural images reveal the presence of sparse structure. Sparse methods lead to parsimonious models, in addition to being efficient for large scale learning. In sparse modeling, data is represented as a sparse linear combination of atoms from a "dictionary" matrix. This dissertation focuses on understanding different aspects of sparse learning, thereby enhancing the use of sparse methods by incorporating tools from machine learning. With the growing need to adapt models for large scale data, it is important to design dictionaries that can model the entire data space and not just the samples considered. By exploiting the relation of dictionary learning to 1-D subspace clustering, a multilevel dictionary learning algorithm is developed, and it is shown to outperform conventional sparse models in compressed recovery, and image denoising. Theoretical aspects of learning such as algorithmic stability and generalization are considered, and ensemble learning is incorporated for effective large scale learning. In addition to building strategies for efficiently implementing 1-D subspace clustering, a discriminative clustering approach is designed to estimate the unknown mixing process in blind source separation. By exploiting the non-linear relation between the image descriptors, and allowing the use of multiple features, sparse methods can be made more effective in recognition problems. The idea of multiple kernel sparse representations is developed, and algorithms for learning dictionaries in the feature space are presented. Using object recognition experiments on standard datasets it is shown that the proposed approaches outperform other sparse coding-based recognition frameworks. Furthermore, a segmentation technique based on multiple kernel sparse representations is developed, and successfully applied for automated brain tumor identification. Using sparse codes to define the relation between data samples can lead to a more robust graph embedding for unsupervised clustering. By performing discriminative embedding using sparse coding-based graphs, an algorithm for measuring the glomerular number in kidney MRI images is developed. Finally, approaches to build dictionaries for local sparse coding of image descriptors are presented, and applied to object recognition and image retrieval.
ContributorsJayaraman Thiagarajan, Jayaraman (Author) / Spanias, Andreas (Thesis advisor) / Frakes, David (Committee member) / Tepedelenlioğlu, Cihan (Committee member) / Turaga, Pavan (Committee member) / Arizona State University (Publisher)
Created2013
Description
Effective modeling of high dimensional data is crucial in information processing and machine learning. Classical subspace methods have been very effective in such applications. However, over the past few decades, there has been considerable research towards the development of new modeling paradigms that go beyond subspace methods. This dissertation focuses on the study of sparse models and their interplay with modern machine learning techniques such as manifold, ensemble and graph-based methods, along with their applications in image analysis and recovery. By considering graph relations between data samples while learning sparse models, graph-embedded codes can be obtained for use in unsupervised, supervised and semi-supervised problems. Using experiments on standard datasets, it is demonstrated that the codes obtained from the proposed methods outperform several baseline algorithms. In order to facilitate sparse learning with large scale data, the paradigm of ensemble sparse coding is proposed, and different strategies for constructing weak base models are developed. Experiments with image recovery and clustering demonstrate that these ensemble models perform better when compared to conventional sparse coding frameworks. When examples from the data manifold are available, manifold constraints can be incorporated with sparse models and two approaches are proposed to combine sparse coding with manifold projection. The improved performance of the proposed techniques in comparison to sparse coding approaches is demonstrated using several image recovery experiments. In addition to these approaches, it might be required in some applications to combine multiple sparse models with different regularizations. In particular, combining an unconstrained sparse model with non-negative sparse coding is important in image analysis, and it poses several algorithmic and theoretical challenges. A convex and an efficient greedy algorithm for recovering combined representations are proposed. Theoretical guarantees on sparsity thresholds for exact recovery using these algorithms are derived and recovery performance is also demonstrated using simulations on synthetic data. Finally, the problem of non-linear compressive sensing, where the measurement process is carried out in feature space obtained using non-linear transformations, is considered. An optimized non-linear measurement system is proposed, and improvements in recovery performance are demonstrated in comparison to using random measurements as well as optimized linear measurements.
ContributorsNatesan Ramamurthy, Karthikeyan (Author) / Spanias, Andreas (Thesis advisor) / Tsakalis, Konstantinos (Committee member) / Karam, Lina (Committee member) / Turaga, Pavan (Committee member) / Arizona State University (Publisher)
Created2013