Matching Items (611)
Filtering by
- All Subjects: Clarinet and piano music
Description
Despite the wealth of folk music traditions in Portugal and the importance of the clarinet in the music of bandas filarmonicas, it is uncommon to find works featuring the clarinet using Portuguese folk music elements. In the interest of expanding this type of repertoire, three new works were commissioned from three different composers. The resulting works are Seres Imaginarios 3 by Luis Cardoso; Delirio Barroco by Tiago Derrica; and Memória by Pedro Faria Gomes. In an effort to submit these new works for inclusion into mainstream performance literature, the author has recorded these works on compact disc. This document includes interview transcripts with each composer, providing first-person discussion of each composition, as well as detailed biographical information on each composer. To provide context, the author has included a brief discussion on Portuguese folk music, and in particular, the role that the clarinet plays in Portuguese folk music culture.
ContributorsFerreira, Wesley (Contributor) / Spring, Robert S (Thesis advisor) / Bailey, Wayne (Committee member) / Gardner, Joshua (Committee member) / Hill, Gary (Committee member) / Schuring, Martin (Committee member) / Solis, Theodore (Committee member) / Arizona State University (Publisher)
Created2013
Description
The processing of large volumes of RDF data require an efficient storage and query processing engine that can scale well with the volume of data. The initial attempts to address this issue focused on optimizing native RDF stores as well as conventional relational databases management systems. But as the volume of RDF data grew to exponential proportions, the limitations of these systems became apparent and researchers began to focus on using big data analysis tools, most notably Hadoop, to process RDF data. Various studies and benchmarks that evaluate these tools for RDF data processing have been published. In the past two and half years, however, heavy users of big data systems, like Facebook, noted limitations with the query performance of these big data systems and began to develop new distributed query engines for big data that do not rely on map-reduce. Facebook's Presto is one such example.
This thesis deals with evaluating the performance of Presto in processing big RDF data against Apache Hive. A comparative analysis was also conducted against 4store, a native RDF store. To evaluate the performance Presto for big RDF data processing, a map-reduce program and a compiler, based on Flex and Bison, were implemented. The map-reduce program loads RDF data into HDFS while the compiler translates SPARQL queries into a subset of SQL that Presto (and Hive) can understand. The evaluation was done on four and eight node Linux clusters installed on Microsoft Windows Azure platform with RDF datasets of size 10, 20, and 30 million triples. The results of the experiment show that Presto has a much higher performance than Hive can be used to process big RDF data. The thesis also proposes an architecture based on Presto, Presto-RDF, that can be used to process big RDF data.
This thesis deals with evaluating the performance of Presto in processing big RDF data against Apache Hive. A comparative analysis was also conducted against 4store, a native RDF store. To evaluate the performance Presto for big RDF data processing, a map-reduce program and a compiler, based on Flex and Bison, were implemented. The map-reduce program loads RDF data into HDFS while the compiler translates SPARQL queries into a subset of SQL that Presto (and Hive) can understand. The evaluation was done on four and eight node Linux clusters installed on Microsoft Windows Azure platform with RDF datasets of size 10, 20, and 30 million triples. The results of the experiment show that Presto has a much higher performance than Hive can be used to process big RDF data. The thesis also proposes an architecture based on Presto, Presto-RDF, that can be used to process big RDF data.
ContributorsMammo, Mulugeta (Author) / Bansal, Srividya (Thesis advisor) / Bansal, Ajay (Committee member) / Lindquist, Timothy (Committee member) / Arizona State University (Publisher)
Created2014
ContributorsBurton, Charlotte (Performer) / ASU Library. Music Library (Publisher)
Created2018-04-08
ContributorsDruesedow, Elizabeth (Performer) / ASU Library. Music Library (Publisher)
Created2018-04-07
Description
This project includes a recording and performance guide for three newly commissioned pieces for the clarinet. The first piece, shimmer, was written by Grant Jahn and is for B-flat clarinet and electronics. The second piece, Paragon, is for B-flat clarinet and piano and was composed by Dr. Theresa Martin. The third and final piece, Duality in the Eye of a Bovine, was written by Kurt Mehlenbacher and is for B-flat clarinet, bass clarinet, and piano. In addition to the performance guide, this document also includes background information and program notes for the compositions, as well as composer biographical information, a list of other works featuring the clarinet by each composer, and transcripts of composer and performer interviews. This document is accompanied by a recording of the three pieces.
ContributorsPoupard, Caitlin Marie (Author) / Spring, Robert (Thesis advisor) / Gardner, Joshua (Thesis advisor) / Hill, Gary (Committee member) / Oldani, Robert (Committee member) / Schuring, Martin (Committee member) / Arizona State University (Publisher)
Created2016
Description
The primary objective of this research project is to expand the clarinet repertoire with the addition of four new pieces. Each of these new pieces use contemporary clarinet techniques, including electronics, prerecorded sounds, multiphonics, circular breathing, multiple articulation, demi-clarinet, and the clari-flute. The repertoire composed includes Grant Jahn’s Duo for Two Clarinets, Reggie Berg’s Funkalicious for Clarinet and Piano, Rusty Banks’ Star Juice for Clarinet and Fixed Media, and Chris Malloy’s A Celestial Breath for Clarinet and Electronics. In addition to the musical commissions, this project also includes interviews with the composers indicating how they wrote these works and what their influences were, along with any information pertinent to the performer, professional recordings of each piece, as well as performance notes and suggestions.
ContributorsCase-Ruchala, Celeste Ann (Contributor) / Gardner, Joshua (Thesis advisor) / Spring, Robert (Thesis advisor) / Hill, Gary (Committee member) / Rogers, Rodney (Committee member) / Schuring, Martin (Committee member) / Arizona State University (Publisher)
Created2016
ContributorsClements, Katrina (Performer) / ASU Library. Music Library (Publisher)
Created2018-03-15
ContributorsClifton-Armenta, Tyler (Performer) / ASU Library. Music Library (Publisher)
Created2018-03-16
ContributorsMoonitz, Olivia (Performer) / ASU Library. Music Library (Publisher)
Created2018-03-13
Description
The Resource Description Framework (RDF) is a specification that aims to support the conceptual modeling of metadata or information about resources in the form of a directed graph composed of triples of knowledge (facts). RDF also provides mechanisms to encode meta-information (such as source, trust, and certainty) about facts already existing in a knowledge base through a process called reification. In this thesis, an extension to the current RDF specification is proposed in order to enhance RDF triples with an application specific weight (cost). Unlike reification, this extension treats these additional weights as first class knowledge attributes in the RDF model, which can be leveraged by the underlying query engine. Additionally, current RDF query languages, such as SPARQL, have a limited expressive power which limits the capabilities of applications that use them. Plus, even in the presence of language extensions, current RDF stores could not provide methods and tools to process extended queries in an efficient and effective way. To overcome these limitations, a set of novel primitives for the SPARQL language is proposed to express Top-k queries using traditional query patterns as well as novel predicates inspired by those from the XPath language. Plus, an extended query processor engine is developed to support efficient ranked path search, join, and indexing. In addition, several query optimization strategies are proposed, which employ heuristics, advanced indexing tools, and two graph metrics: proximity and sub-result inter-arrival time. These strategies aim to find join orders that reduce the total query execution time while avoiding worst-case pattern combinations. Finally, extensive experimental evaluation shows that using these two metrics in query optimization has a significant impact on the performance and efficiency of Top-k queries. Further experiments also show that proximity and inter-arrival have an even greater, although sometimes undesirable, impact when combined through aggregation functions. Based on these results, a hybrid algorithm is proposed which acknowledges that proximity is more important than inter-arrival time, due to its more complete nature, and performs a fine-grained combination of both metrics by analyzing the differences between their individual scores and performing the aggregation only if these differences are negligible.
ContributorsCedeno, Juan Pablo (Author) / Candan, Kasim S (Thesis advisor) / Chen, Yi (Committee member) / Sapino, Maria L (Committee member) / Arizona State University (Publisher)
Created2010