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 81
Description
CYOA is a prototype of an iPhone application that produces a single, generative, musical work. This document details some of the thoughts and practices that informed its design, and specifically addresses the overlap between application structure and musical form. The concept of composed instruments is introduced and briefly discussed, some features of video game design that relate to this project are considered, and some specifics of hardware implementation are addressed.
ContributorsPeterson, Julian (Author) / Hackbarth, Glenn (Thesis advisor) / DeMars, James (Committee member) / Feisst, Sabine (Committee member) / Levy, Benjamin (Committee member) / Tobias, Evan (Committee member) / Arizona State University (Publisher)
Created2013
Description
Johann Sebastian Bach's violin Sonata I in G minor, BWV 1001, is a significant and widely performed work that exists in numerous editions and also as transcriptions or arrangements for various other instruments, including the guitar. A pedagogical guitar performance edition of this sonata, however, has yet to be published. Therefore, the core of my project is a transcription and pedagogical edition of this work for guitar. The transcription is supported by an analysis, performance and pedagogical practice guide, and a recording. The analysis and graphing of phrase structures illuminate Bach's use of compositional devices and the architectural function of the work's harmonic gravities. They are intended to guide performers in their assessment of the surface ornamentation and suggest a reduction toward its fundamental purpose. The end result is a clarification of the piece through the organization of phrase structures and the prioritization of harmonic tensions and resolutions. The compiling process is intended to assist the performer in "seeing the forest from the trees." Based on markings from Bach's original autograph score, the transcription considers fingering ease on the guitar that is critical to render the music to a functional and practical level. The goal is to preserve the composer's indications to the highest degree possible while still adhering to the technical confines that allow for actual execution on the guitar. The performance guide provides suggestions for articulation, phrasing, ornamentation, and other interpretive decisions. Considering the limitations of the guitar, the author's suggestions are grounded in various concepts of historically informed performance, and also relate to today's early-music sensibilities. The pedagogical practice guide demonstrates procedures to break down and assimilate the musical material as applied toward the various elements of guitar technique and practice. The CD recording is intended to demonstrate the transcription and the connection to the concepts discussed. It is hoped that this pedagogical edition will provide a rational that serves to support technical decisions within the transcription and generate meaningful interpretive realizations based on principles of historically informed performance.
ContributorsFelice, Joseph Philip (Author) / Koonce, Frank (Thesis advisor) / Feisst, Sabine (Committee member) / Swartz, Jonathan (Committee member) / Arizona State University (Publisher)
Created2013
Description
Biological systems are complex in many dimensions as endless transportation and communication networks all function simultaneously. Our ability to intervene within both healthy and diseased systems is tied directly to our ability to understand and model core functionality. The progress in increasingly accurate and thorough high-throughput measurement technologies has provided a deluge of data from which we may attempt to infer a representation of the true genetic regulatory system. A gene regulatory network model, if accurate enough, may allow us to perform hypothesis testing in the form of computational experiments. Of great importance to modeling accuracy is the acknowledgment of biological contexts within the models -- i.e. recognizing the heterogeneous nature of the true biological system and the data it generates. This marriage of engineering, mathematics and computer science with systems biology creates a cycle of progress between computer simulation and lab experimentation, rapidly translating interventions and treatments for patients from the bench to the bedside. This dissertation will first discuss the landscape for modeling the biological system, explore the identification of targets for intervention in Boolean network models of biological interactions, and explore context specificity both in new graphical depictions of models embodying context-specific genomic regulation and in novel analysis approaches designed to reveal embedded contextual information. Overall, the dissertation will explore a spectrum of biological modeling with a goal towards therapeutic intervention, with both formal and informal notions of biological context, in such a way that will enable future work to have an even greater impact in terms of direct patient benefit on an individualized level.
ContributorsVerdicchio, Michael (Author) / Kim, Seungchan (Thesis advisor) / Baral, Chitta (Committee member) / Stolovitzky, Gustavo (Committee member) / Collofello, James (Committee member) / Arizona State University (Publisher)
Created2013
Description
This project features three new pieces for clarinet commissioned from three different composers. Two are for unaccompanied clarinet and one is for clarinet, bass clarinet, and laptop. These pieces are Storm's a Comin' by Chris Burton, Light and Shadows by Theresa Martin, and My Own Agenda by Robbie McCarthy. These three solos challenge the performer in various ways including complex rhythm, use of extended techniques such as growling, glissando, and multiphonics, and the incorporation of technology into a live performance. In addition to background information, a performance practice guide has also been included for each of the pieces. This guide provides recommendations and suggestions for future performers wishing to study and perform these works. Also included are transcripts of interviews done with each of the composers as well as full scores for each of the pieces. Accompanying this document are recordings of each of the three pieces, performed by the author.
ContributorsVaughan, Melissa Lynn (Author) / Spring, Robert (Thesis advisor) / Micklich, Albie (Committee member) / Gardner, Joshua (Committee member) / Hill, Gary (Committee member) / Feisst, Sabine (Committee member) / Arizona State University (Publisher)
Created2013
Description
Linear Temporal Logic is gaining increasing popularity as a high level specification language for robot motion planning due to its expressive power and scalability of LTL control synthesis algorithms. This formalism, however, requires expert knowledge and makes it inaccessible to non-expert users. This thesis introduces a graphical specification environment to create high level motion plans to control robots in the field by converting a visual representation of the motion/task plan into a Linear Temporal Logic (LTL) specification. The visual interface is built on the Android tablet platform and provides functionality to create task plans through a set of well defined gestures and on screen controls. It uses the notion of waypoints to quickly and efficiently describe the motion plan and enables a variety of complex Linear Temporal Logic specifications to be described succinctly and intuitively by the user without the need for the knowledge and understanding of LTL specification. Thus, it opens avenues for its use by personnel in military, warehouse management, and search and rescue missions. This thesis describes the construction of LTL for various scenarios used for robot navigation using the visual interface developed and leverages the use of existing LTL based motion planners to carry out the task plan by a robot.
ContributorsSrinivas, Shashank (Author) / Fainekos, Georgios (Thesis advisor) / Baral, Chitta (Committee member) / Burleson, Winslow (Committee member) / Arizona State University (Publisher)
Created2013
Description
Three Meditations on the Philosophy of Boethius is a musical piece for guitar, piano interior, and computer. Each of the three movements, or meditations, reflects one level of music according to the medieval philosopher Boethius: Musica Mundana, Musica Humana, and Musica Instrumentalis. From spatial aspects, through the human element, to letting sound evolve freely, different movements revolve around different sounds and sound producing techniques.
ContributorsDori, Gil (Contributor) / Hackbarth, Glenn (Thesis advisor) / DeMars, James (Committee member) / Feisst, Sabine (Committee member) / Arizona State University (Publisher)
Created2013
Description
Answer Set Programming (ASP) is one of the most prominent and successful knowledge representation paradigms. The success of ASP is due to its expressive non-monotonic modeling language and its efficient computational methods originating from building propositional satisfiability solvers. The wide adoption of ASP has motivated several extensions to its modeling language in order to enhance expressivity, such as incorporating aggregates and interfaces with ontologies. Also, in order to overcome the grounding bottleneck of computation in ASP, there are increasing interests in integrating ASP with other computing paradigms, such as Constraint Programming (CP) and Satisfiability Modulo Theories (SMT). Due to the non-monotonic nature of the ASP semantics, such enhancements turned out to be non-trivial and the existing extensions are not fully satisfactory. We observe that one main reason for the difficulties rooted in the propositional semantics of ASP, which is limited in handling first-order constructs (such as aggregates and ontologies) and functions (such as constraint variables in CP and SMT) in natural ways. This dissertation presents a unifying view on these extensions by viewing them as instances of formulas with generalized quantifiers and intensional functions. We extend the first-order stable model semantics by by Ferraris, Lee, and Lifschitz to allow generalized quantifiers, which cover aggregate, DL-atoms, constraints and SMT theory atoms as special cases. Using this unifying framework, we study and relate different extensions of ASP. We also present a tight integration of ASP with SMT, based on which we enhance action language C+ to handle reasoning about continuous changes. Our framework yields a systematic approach to study and extend non-monotonic languages.
ContributorsMeng, Yunsong (Author) / Lee, Joohyung (Thesis advisor) / Ahn, Gail-Joon (Committee member) / Baral, Chitta (Committee member) / Fainekos, Georgios (Committee member) / Lifschitz, Vladimir (Committee member) / Arizona State University (Publisher)
Created2013
Description
In this dissertation I develop a deep theory of temporal planning well-suited to analyzing, understanding, and improving the state of the art implementations (as of 2012). At face-value the work is strictly theoretical; nonetheless its impact is entirely real and practical. The easiest portion of that impact to highlight concerns the notable improvements to the format of the temporal fragment of the International Planning Competitions (IPCs). Particularly: the theory I expound upon here is the primary cause of--and justification for--the altered (i) selection of benchmark problems, and (ii) notion of "winning temporal planner". For higher level motivation: robotics, web service composition, industrial manufacturing, business process management, cybersecurity, space exploration, deep ocean exploration, and logistics all benefit from applying domain-independent automated planning technique. Naturally, actually carrying out such case studies has much to offer. For example, we may extract the lesson that reasoning carefully about deadlines is rather crucial to planning in practice. More generally, effectively automating specifically temporal planning is well-motivated from applications. Entirely abstractly, the aim is to improve the theory of automated temporal planning by distilling from its practice. My thesis is that the key feature of computational interest is concurrency. To support, I demonstrate by way of compilation methods, worst-case counting arguments, and analysis of algorithmic properties such as completeness that the more immediately pressing computational obstacles (facing would-be temporal generalizations of classical planning systems) can be dealt with in theoretically efficient manner. So more accurately the technical contribution here is to demonstrate: The computationally significant obstacle to automated temporal planning that remains is just concurrency.
ContributorsCushing, William Albemarle (Author) / Kambhampati, Subbarao (Thesis advisor) / Weld, Daniel S. (Committee member) / Smith, David E. (Committee member) / Baral, Chitta (Committee member) / Davalcu, Hasan (Committee member) / Arizona State University (Publisher)
Created2012
Description
Piano Quintet> is a three movement piece, inspired by music of Eastern Europe. Sunrise in Hungary starts with a legato song in the first violin unfolding over slow moving sustained harmonics in the rest of the strings. This is contrasted with a lively Hungarian dance which starts in the piano and jumps throughout all of the voices. Armenian Lament introduces a mournful melody performed over a subtly shifting pedal tone in the cello. The rest of the voices are slowly introduced until the movement builds into a canonic threnody. Evening in Bulgaria borrows from the vast repertoire of Bulgarian dances, including rhythms from the horo and rachenitsa. Each time that the movement returns to the primary theme, it incorporates aspects of the dance that directly preceded it. The final return is the crux of the piece, with the first violin playing a virtuosic ornaments run on the melody.
ContributorsGiese, Adam (Composer) / Hackbarth, Glenn (Thesis advisor) / DeMars, James (Committee member) / Feisst, Sabine (Committee member) / Arizona State University (Publisher)
Created2014
Description
Modeling dynamic systems is an interesting problem in Knowledge Representation (KR) due to their usefulness in reasoning about real-world environments. In order to effectively do this, a number of different formalisms have been considered ranging from low-level languages, such as Answer Set Programming (ASP), to high-level action languages, such as C+ and BC. These languages show a lot of promise over many traditional approaches as they allow a developer to automate many tasks which require reasoning within dynamic environments in a succinct and elaboration tolerant manner. However, despite their strengths, they are still insufficient for modeling many systems, especially those of non-trivial scale or that require the ability to cope with exceptions which occur during execution, such as unexpected events or unintended consequences to actions which have been performed. In order to address these challenges, a theoretical framework is created which focuses on improving the feasibility of applying KR techniques to such problems. The framework is centered on the action language BC+, which integrates many of the strengths of existing KR formalisms, and provides the ability to perform efficient reasoning in an incremental fashion while handling exceptions which occur during execution. The result is a developer friendly formalism suitable for performing reasoning in an online environment. Finally, the newly enhanced Cplus2ASP 2 is introduced, which provides a number of improvements over the original version. These improvements include implementing BC+ among several additional languages, providing enhanced developer support, and exhibiting a significant performance increase over its predecessors and similar systems.
ContributorsBabb, Joseph (Author) / Lee, Joohyung (Thesis advisor) / Lee, Yann-Hang (Committee member) / Baral, Chitta (Committee member) / Arizona State University (Publisher)
Created2014