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 90
Description
The repertoire of the saxophone has advanced significantly since its invention circa 1840. Performers are required to adapt to the demands of composers - many of whom are exploring new and unconventional sounds and techniques. Numerous texts exist to identify and explain these so-called "extended" techniques, but there are very few resources for the initial stages of performance. In order to offer performers a resource, the author of this text composed forty original etudes (or studies) that incorporate extended techniques in a variety of ways. After identifying common extended techniques that a performer might face, the author focused on four different ways each individual technique might appear in actual repertoire. The resulting work is entitled Pushing Boundaries: Forty Etudes on Extended Techniques. Each etude offers a practical approach to what is generally a single extended technique. Although this text is not pedagogical in the sense of identifying the mechanics and anatomical requirements of each technique, it does contain a performance analysis of each etude. This analysis identifies areas where performers might struggle and offers helpful suggestions. To this end, the etudes accompanied by performance analysis provide a paced, systematic approach to the mastery of each technique.
ContributorsMurphy, Patrick Joseph (Author) / Hill, Gary (Thesis advisor) / Spring, Robert (Committee member) / McAllister, Timothy (Committee member) / Micklich, Albie (Committee member) / DeMars, James (Committee member) / Arizona State University (Publisher)
Created2013
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
The increasing popularity of Twitter renders improved trustworthiness and relevance assessment of tweets much more important for search. However, given the limitations on the size of tweets, it is hard to extract measures for ranking from the tweet's content alone. I propose a method of ranking tweets by generating a reputation score for each tweet that is based not just on content, but also additional information from the Twitter ecosystem that consists of users, tweets, and the web pages that tweets link to. This information is obtained by modeling the Twitter ecosystem as a three-layer graph. The reputation score is used to power two novel methods of ranking tweets by propagating the reputation over an agreement graph based on tweets' content similarity. Additionally, I show how the agreement graph helps counter tweet spam. An evaluation of my method on 16~million tweets from the TREC 2011 Microblog Dataset shows that it doubles the precision over baseline Twitter Search and achieves higher precision than current state of the art method. I present a detailed internal empirical evaluation of RAProp in comparison to several alternative approaches proposed by me, as well as external evaluation in comparison to the current state of the art method.
ContributorsRavikumar, Srijith (Author) / Kambhampati, Subbarao (Thesis advisor) / Davulcu, Hasan (Committee member) / Liu, Huan (Committee member) / Arizona State University (Publisher)
Created2013
Description
Automating aspects of biocuration through biomedical information extraction could significantly impact biomedical research by enabling greater biocuration throughput and improving the feasibility of a wider scope. An important step in biomedical information extraction systems is named entity recognition (NER), where mentions of entities such as proteins and diseases are located within natural-language text and their semantic type is determined. This step is critical for later tasks in an information extraction pipeline, including normalization and relationship extraction. BANNER is a benchmark biomedical NER system using linear-chain conditional random fields and the rich feature set approach. A case study with BANNER locating genes and proteins in biomedical literature is described. The first corpus for disease NER adequate for use as training data is introduced, and employed in a case study of disease NER. The first corpus locating adverse drug reactions (ADRs) in user posts to a health-related social website is also described, and a system to locate and identify ADRs in social media text is created and evaluated. The rich feature set approach to creating NER feature sets is argued to be subject to diminishing returns, implying that additional improvements may require more sophisticated methods for creating the feature set. This motivates the first application of multivariate feature selection with filters and false discovery rate analysis to biomedical NER, resulting in a feature set at least 3 orders of magnitude smaller than the set created by the rich feature set approach. Finally, two novel approaches to NER by modeling the semantics of token sequences are introduced. The first method focuses on the sequence content by using language models to determine whether a sequence resembles entries in a lexicon of entity names or text from an unlabeled corpus more closely. The second method models the distributional semantics of token sequences, determining the similarity between a potential mention and the token sequences from the training data by analyzing the contexts where each sequence appears in a large unlabeled corpus. The second method is shown to improve the performance of BANNER on multiple data sets.
ContributorsLeaman, James Robert (Author) / Gonzalez, Graciela (Thesis advisor) / Baral, Chitta (Thesis advisor) / Cohen, Kevin B (Committee member) / Liu, Huan (Committee member) / Ye, Jieping (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
Data mining is increasing in importance in solving a variety of industry problems. Our initiative involves the estimation of resource requirements by skill set for future projects by mining and analyzing actual resource consumption data from past projects in the semiconductor industry. To achieve this goal we face difficulties like data with relevant consumption information but stored in different format and insufficient data about project attributes to interpret consumption data. Our first goal is to clean the historical data and organize it into meaningful structures for analysis. Once the preprocessing on data is completed, different data mining techniques like clustering is applied to find projects which involve resources of similar skillsets and which involve similar complexities and size. This results in "resource utilization templates" for groups of related projects from a resource consumption perspective. Then project characteristics are identified which generate this diversity in headcounts and skillsets. These characteristics are not currently contained in the data base and are elicited from the managers of historical projects. This represents an opportunity to improve the usefulness of the data collection system for the future. The ultimate goal is to match the product technical features with the resource requirement for projects in the past as a model to forecast resource requirements by skill set for future projects. The forecasting model is developed using linear regression with cross validation of the training data as the past project execution are relatively few in number. Acceptable levels of forecast accuracy are achieved relative to human experts' results and the tool is applied to forecast some future projects' resource demand.
ContributorsBhattacharya, Indrani (Author) / Sen, Arunabha (Thesis advisor) / Kempf, Karl G. (Thesis advisor) / Liu, Huan (Committee member) / Arizona State University (Publisher)
Created2013
Description
Contemporary online social platforms present individuals with social signals in the form of news feed on their peers' activities. On networks such as Facebook, Quora, network operator decides how that information is shown to an individual. Then the user, with her own interests and resource constraints selectively acts on a subset of items presented to her. The network operator again, shows that activity to a selection of peers, and thus creating a behavioral loop. That mechanism of interaction and information flow raises some very interesting questions such as: can network operator design social signals to promote a particular activity like sustainability, public health care awareness, or to promote a specific product? The focus of my thesis is to answer that question. In this thesis, I develop a framework to personalize social signals for users to guide their activities on an online platform. As the result, we gradually nudge the activity distribution on the platform from the initial distribution p to the target distribution q. My work is particularly applicable to guiding collaborations, guiding collective actions, and online advertising. In particular, I first propose a probabilistic model on how users behave and how information flows on the platform. The main part of this thesis after that discusses the Influence Individuals through Social Signals (IISS) framework. IISS consists of four main components: (1) Learner: it learns users' interests and characteristics from their historical activities using Bayesian model, (2) Calculator: it uses gradient descent method to compute the intermediate activity distributions, (3) Selector: it selects users who can be influenced to adopt or drop specific activities, (4) Designer: it personalizes social signals for each user. I evaluate the performance of IISS framework by simulation on several network topologies such as preferential attachment, small world, and random. I show that the framework gradually nudges users' activities to approach the target distribution. I use both simulation and mathematical method to analyse convergence properties such as how fast and how close we can approach the target distribution. When the number of activities is 3, I show that for about 45% of target distributions, we can achieve KL-divergence as low as 0.05. But for some other distributions KL-divergence can be as large as 0.5.
ContributorsLe, Tien D (Author) / Sundaram, Hari (Thesis advisor) / Davulcu, Hasan (Thesis advisor) / Liu, Huan (Committee member) / Arizona State University (Publisher)
Created2014
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
Concerto for Piano and Chamber Orchestra was conceived in February of 2013, and conceptually it is my attempt to fuse personal expressions of jazz and classical music into one fully realized statement. It is a three movement work (fast, slow, fast) for 2 fl., 2 ob., 2 cl., bsn., 2 hrn., 2 tpt., tbn., pno., perc., str. (6,4,2,2,1). The work is approximately 27 minutes in duration. The first movement of the Concerto is written in a fluid sonata form. A fugato begins where the second theme would normally appear, and the second theme does not fully appear until near the end of the solo piano section. The result is that the second theme when finally revealed is so reminiscent of the history of jazz and classical synthesis that it does not sound completely new, and in fact is a return of something that was heard before, but only hinted at in this piece. The second movement is a kind of deconstructive set of variations, with a specific theme and harmonic pattern implied throughout the movement. However, the full theme is not disclosed until the final variation. The variations are interrupted by moments of pure rhythmic music, containing harmony made up of major chords with an added fourth, defying resolution, and dissolving each time back into a new variation. The third movement is in rondo form, using rhythmic and harmonic influences from jazz. The percussion plays a substantial role in this movement, acting as a counterpoint to the piano part throughout. This movement and the piece concludes with an extended coda, inspired indirectly by the simple complexities of an improvisational piano solo, building in complexity as the concerto draws to a close.
ContributorsSneider, Elliot (Author) / Rogers, Rodney (Thesis advisor) / DeMars, James (Committee member) / Hackbarth, Glenn (Committee member) / Solis, Theodore (Committee member) / Arizona State University (Publisher)
Created2013
Description
Most data cleaning systems aim to go from a given deterministic dirty database to another deterministic but clean database. Such an enterprise pre–supposes that it is in fact possible for the cleaning process to uniquely recover the clean versions of each dirty data tuple. This is not possible in many cases, where the most a cleaning system can do is to generate a (hopefully small) set of clean candidates for each dirty tuple. When the cleaning system is required to output a deterministic database, it is forced to pick one clean candidate (say the "most likely" candidate) per tuple. Such an approach can lead to loss of information. For example, consider a situation where there are three equally likely clean candidates of a dirty tuple. An appealing alternative that avoids such an information loss is to abandon the requirement that the output database be deterministic. In other words, even though the input (dirty) database is deterministic, I allow the reconstructed database to be probabilistic. Although such an approach does avoid the information loss, it also brings forth several challenges. For example, how many alternatives should be kept per tuple in the reconstructed database? Maintaining too many alternatives increases the size of the reconstructed database, and hence the query processing time. Second, while processing queries on the probabilistic database may well increase recall, how would they affect the precision of the query processing? In this thesis, I investigate these questions. My investigation is done in the context of a data cleaning system called BayesWipe that has the capability of producing multiple clean candidates per each dirty tuple, along with the probability that they are the correct cleaned version. I represent these alternatives as tuples in a tuple disjoint probabilistic database, and use the Mystiq system to process queries on it. This probabilistic reconstruction (called BayesWipe–PDB) is compared to a deterministic reconstruction (called BayesWipe–DET)—where the most likely clean candidate for each tuple is chosen, and the rest of the alternatives discarded.
ContributorsRihan, Preet Inder Singh (Author) / Kambhampati, Subbarao (Thesis advisor) / Liu, Huan (Committee member) / Davulcu, Hasan (Committee member) / Arizona State University (Publisher)
Created2013