Matching Items (286)
150674-Thumbnail Image.png
Description
The legacy of the great double bassist and pedagogue Joseph Prunner (1886-1969) includes his scale and arpeggio exercise book, Progressive Studies for the Double Bass, composed in 1955. Progressive Studies was originally written for Prunner's students at the Bucharest Conservatoire and was not intended for a wide publication. In the

The legacy of the great double bassist and pedagogue Joseph Prunner (1886-1969) includes his scale and arpeggio exercise book, Progressive Studies for the Double Bass, composed in 1955. Progressive Studies was originally written for Prunner's students at the Bucharest Conservatoire and was not intended for a wide publication. In the work Prunner presents major and harmonic and melodic minor scales that are performed in one octave and then extended diatonically through all their modes, progressing through this pattern for three octaves, followed by a series of arpeggio exercises. These exercises are based on a modernized fingering system and are offered in the traditional positions and in what Prunner called "Fixed-Position" scales. A series of chromatic scale exercises are also included that follow the template of the major and minor scales. The study at hand is a revision and expansion of Prunner's work. The edition presented here intends to preserve the information that Prunner provided, fix the errors made in editing, and expand the study greatly by increasing the range of the exercises, providing more arpeggio exercises, creating melodic and harmonic minor "Fixed-Position" scales and arpeggio exercises, and including the study of double-stops. In support of the revised and updated version of Progressive Studies, this study includes a biography of Joseph Prunner and a summary of the importance of the type of scale and arpeggio practice the collection of exercises supports. An explanation of the revisions made to Prunner's work and recommendations for using the exercises also precede the new edition.
ContributorsStotz, Daniel Aaron (Author) / Rotaru, Catalin (Thesis advisor) / Holbrook, Amy (Committee member) / Kennedy, Jeffery (Committee member) / Koonce, Frank (Committee member) / Landschoot, Thomas (Committee member) / Arizona State University (Publisher)
Created2012
150534-Thumbnail Image.png
Description
Different logic-based knowledge representation formalisms have different limitations either with respect to expressivity or with respect to computational efficiency. First-order logic, which is the basis of Description Logics (DLs), is not suitable for defeasible reasoning due to its monotonic nature. The nonmonotonic formalisms that extend first-order logic, such as circumscription

Different logic-based knowledge representation formalisms have different limitations either with respect to expressivity or with respect to computational efficiency. First-order logic, which is the basis of Description Logics (DLs), is not suitable for defeasible reasoning due to its monotonic nature. The nonmonotonic formalisms that extend first-order logic, such as circumscription and default logic, are expressive but lack efficient implementations. The nonmonotonic formalisms that are based on the declarative logic programming approach, such as Answer Set Programming (ASP), have efficient implementations but are not expressive enough for representing and reasoning with open domains. This dissertation uses the first-order stable model semantics, which extends both first-order logic and ASP, to relate circumscription to ASP, and to integrate DLs and ASP, thereby partially overcoming the limitations of the formalisms. By exploiting the relationship between circumscription and ASP, well-known action formalisms, such as the situation calculus, the event calculus, and Temporal Action Logics, are reformulated in ASP. The advantages of these reformulations are shown with respect to the generality of the reasoning tasks that can be handled and with respect to the computational efficiency. The integration of DLs and ASP presented in this dissertation provides a framework for integrating rules and ontologies for the semantic web. This framework enables us to perform nonmonotonic reasoning with DL knowledge bases. Observing the need to integrate action theories and ontologies, the above results are used to reformulate the problem of integrating action theories and ontologies as a problem of integrating rules and ontologies, thus enabling us to use the computational tools developed in the context of the latter for the former.
ContributorsPalla, Ravi (Author) / Lee, Joohyung (Thesis advisor) / Baral, Chitta (Committee member) / Kambhampati, Subbarao (Committee member) / Lifschitz, Vladimir (Committee member) / Arizona State University (Publisher)
Created2012
150662-Thumbnail Image.png
Description
New works for the bass clarinet as a solo instrument are uncommon. In the interest of expanding the repertoire of the bass clarinet, three new works for bass clarinet were commissioned from three different composers, all with different instrumentations. The resulting works are Industrial Strength for bass clarinet and piano

New works for the bass clarinet as a solo instrument are uncommon. In the interest of expanding the repertoire of the bass clarinet, three new works for bass clarinet were commissioned from three different composers, all with different instrumentations. The resulting works are Industrial Strength for bass clarinet and piano by Kenji Bunch; Dark Embers for two bass clarinets by Theresa Martin; and Shovelhead for bass clarinet and interactive electronics by Steven Snowden. Although all three works feature the bass clarinet, they are all very different and pose unique challenges to the performer. To accompany these pieces, and as an aid to future performers, a performance practice guide has been included with recommendations for individuals who wish to perform these works. Included in the guide are recommended fingerings, practice techniques, and possible adjustments to the bass clarinet parts designed in collaboration with the composers that make the works more technically accessible. Accompanying this guide are full scores of all three works, a recording of them performed by the author, and a chart that contains recommended altissimo fingerings.
ContributorsMiracle, Matthew (Author) / Spring, Robert (Thesis advisor) / Gardner, Joshua (Committee member) / Holbrook, Amy (Committee member) / Micklich, Albie (Committee member) / Rogers, Rodney (Committee member) / Arizona State University (Publisher)
Created2012
150623-Thumbnail Image.png
Description
This paper is the writing component of a project the author under took to create an entertaining program for a chamber ensemble. It discusses ways for chamber ensembles to create entertaining concert programs for today's audiences. Information was gathered by analyzing four interesting and successful groups--The Canadian Brass, Mnozil Brass,

This paper is the writing component of a project the author under took to create an entertaining program for a chamber ensemble. It discusses ways for chamber ensembles to create entertaining concert programs for today's audiences. Information was gathered by analyzing four interesting and successful groups--The Canadian Brass, Mnozil Brass, Les Trompettes de Lyon, and The Blue Man Group--and identifying common traits. These traits help facilitate the ultimate goal of making connections with audiences and include originality, comedy, choreography, memorization, continuous presentation, musical appeal, high quality presentations, and the proper personnel. These attributes were then implemented into the author's experimental group, the Omni Brass Ensemble, for testing with live audiences. Materials were used from published interviews, articles, newspapers, ensemble websites, and recordings of their performances. From the author's performances with the Omni Brass Ensemble, indications are that these findings work with live audiences.
ContributorsLee, Randolph Thomas (Author) / Hickman, David (Thesis advisor) / Ericson, John (Committee member) / Holbrook, Amy (Committee member) / Pilafian, J. Samuel (Committee member) / Russell, Timothy (Committee member) / Arizona State University (Publisher)
Created2012
150872-Thumbnail Image.png
Description
John Harbison is one of the most prominent composers of the twentieth and twenty-first centuries. He has made major contributions in all areas of classical music, including operas, symphonies, chamber music, choral works, and vocal pieces.Among his vast output is 'Four Songs of Solitude,' his only composition (to date) for

John Harbison is one of the most prominent composers of the twentieth and twenty-first centuries. He has made major contributions in all areas of classical music, including operas, symphonies, chamber music, choral works, and vocal pieces.Among his vast output is 'Four Songs of Solitude,' his only composition (to date) for solo violin. Though the piece is beautiful and reflective in nature, its inherent technical and musical difficulties present challenges to violinists preparing the piece. There is no published edition of 'Four Songs of Solitude' that includes bowings and fingerings, and violinists used to practicing and performing the études and repertoire of the eighteenth and nineteenth centuries may have difficulty determining how to successfully navigate the music. This paper examines the piece in detail, providing an analytic description of the music and suggestions for practice. An interview with the composer yielded many insights into the structural and harmonic events of the songs, and the composer's interpretive suggestions are given alongside technical suggestions by the author. The solo violin has a centuries-long legacy, and some of the most performed repertoire exists in the medium. 'Four Songs of Solitude' is a demanding set of pieces that stands out in late twentieth-century violin music. Providing information about the piece directly from the composer and suggestions for practice and performance increases the accessibility of the work for violinists seeking to bring it to the concert stage.
ContributorsSchreffler, Sarah (Author) / McLin, Katherine (Thesis advisor) / Hill, Gary (Committee member) / Holbrook, Amy (Committee member) / Spring, Robert (Committee member) / Swartz, Jonathan (Committee member) / Arizona State University (Publisher)
Created2012
150987-Thumbnail Image.png
Description
In this dissertation, two interrelated problems of service-based systems (SBS) are addressed: protecting users' data confidentiality from service providers, and managing performance of multiple workflows in SBS. Current SBSs pose serious limitations to protecting users' data confidentiality. Since users' sensitive data is sent in unencrypted forms to remote machines owned

In this dissertation, two interrelated problems of service-based systems (SBS) are addressed: protecting users' data confidentiality from service providers, and managing performance of multiple workflows in SBS. Current SBSs pose serious limitations to protecting users' data confidentiality. Since users' sensitive data is sent in unencrypted forms to remote machines owned and operated by third-party service providers, there are risks of unauthorized use of the users' sensitive data by service providers. Although there are many techniques for protecting users' data from outside attackers, currently there is no effective way to protect users' sensitive data from service providers. In this dissertation, an approach is presented to protecting the confidentiality of users' data from service providers, and ensuring that service providers cannot collect users' confidential data while the data is processed or stored in cloud computing systems. The approach has four major features: (1) separation of software service providers and infrastructure service providers, (2) hiding the information of the owners of data, (3) data obfuscation, and (4) software module decomposition and distributed execution. Since the approach to protecting users' data confidentiality includes software module decomposition and distributed execution, it is very important to effectively allocate the resource of servers in SBS to each of the software module to manage the overall performance of workflows in SBS. An approach is presented to resource allocation for SBS to adaptively allocating the system resources of servers to their software modules in runtime in order to satisfy the performance requirements of multiple workflows in SBS. Experimental results show that the dynamic resource allocation approach can substantially increase the throughput of a SBS and the optimal resource allocation can be found in polynomial time
ContributorsAn, Ho Geun (Author) / Yau, Sik-Sang (Thesis advisor) / Huang, Dijiang (Committee member) / Ahn, Gail-Joon (Committee member) / Santanam, Raghu (Committee member) / Arizona State University (Publisher)
Created2012
150827-Thumbnail Image.png
Description
In modern healthcare environments, there is a strong need to create an infrastructure that reduces time-consuming efforts and costly operations to obtain a patient's complete medical record and uniformly integrates this heterogeneous collection of medical data to deliver it to the healthcare professionals. As a result, healthcare providers are more

In modern healthcare environments, there is a strong need to create an infrastructure that reduces time-consuming efforts and costly operations to obtain a patient's complete medical record and uniformly integrates this heterogeneous collection of medical data to deliver it to the healthcare professionals. As a result, healthcare providers are more willing to shift their electronic medical record (EMR) systems to clouds that can remove the geographical distance barriers among providers and patient. Even though cloud-based EMRs have received considerable attention since it would help achieve lower operational cost and better interoperability with other healthcare providers, the adoption of security-aware cloud systems has become an extremely important prerequisite for bringing interoperability and efficient management to the healthcare industry. Since a shared electronic health record (EHR) essentially represents a virtualized aggregation of distributed clinical records from multiple healthcare providers, sharing of such integrated EHRs may comply with various authorization policies from these data providers. In this work, we focus on the authorized and selective sharing of EHRs among several parties with different duties and objectives that satisfies access control and compliance issues in healthcare cloud computing environments. We present a secure medical data sharing framework to support selective sharing of composite EHRs aggregated from various healthcare providers and compliance of HIPAA regulations. Our approach also ensures that privacy concerns need to be accommodated for processing access requests to patients' healthcare information. To realize our proposed approach, we design and implement a cloud-based EHRs sharing system. In addition, we describe case studies and evaluation results to demonstrate the effectiveness and efficiency of our approach.
ContributorsWu, Ruoyu (Author) / Ahn, Gail-Joon (Thesis advisor) / Yau, Stephen S. (Committee member) / Huang, Dijiang (Committee member) / Arizona State University (Publisher)
Created2012
150685-Thumbnail Image.png
Description
The ability of musicians to perform well in multiple musical styles is increasingly common and necessary. This paper profiles two trombonists who have gone well beyond the ability to function in multiple genres, and are instead considered significant artists. Tony Baker and Alex Iles were chosen to be profiled for

The ability of musicians to perform well in multiple musical styles is increasingly common and necessary. This paper profiles two trombonists who have gone well beyond the ability to function in multiple genres, and are instead considered significant artists. Tony Baker and Alex Iles were chosen to be profiled for this project because both have achieved recognition as solo artists in the genres of classical music and jazz and have performed on international stages as soloists. They also have significant ensemble experience in both classical and jazz settings and are active teachers as well. Both hold-high profile positions that have helped grow their reputations as performers: Mr. Baker as a professor at one of the largest music schools in the United States, the University of North Texas, and Mr. Iles as a highly in-demand freelance musician in Los Angeles. This paper presents interviews with both trombonists that investigate their development as musicians and soloists in both classical music and jazz. They are asked to describe the benefits and challenges of performing at a high level in both styles, and how these have affected their musical voices. Common traits found in their responses are examined, and recommendations are created for musicians seeking stylistic versatility.
ContributorsLennex, William (Author) / Pilafian, J. Samuel (Thesis advisor) / Bush, Jeffrey (Committee member) / Ericson, John (Committee member) / Hackbarth, Glenn (Committee member) / Holbrook, Amy (Committee member) / Arizona State University (Publisher)
Created2012
151144-Thumbnail Image.png
Description
Automated planning problems classically involve finding a sequence of actions that transform an initial state to some state satisfying a conjunctive set of goals with no temporal constraints. But in many real-world problems, the best plan may involve satisfying only a subset of goals or missing defined goal deadlines. For

Automated planning problems classically involve finding a sequence of actions that transform an initial state to some state satisfying a conjunctive set of goals with no temporal constraints. But in many real-world problems, the best plan may involve satisfying only a subset of goals or missing defined goal deadlines. For example, this may be required when goals are logically conflicting, or when there are time or cost constraints such that achieving all goals on time may be too expensive. In this case, goals and deadlines must be declared as soft. I call these partial satisfaction planning (PSP) problems. In this work, I focus on particular types of PSP problems, where goals are given a quantitative value based on whether (or when) they are achieved. The objective is to find a plan with the best quality. A first challenge is in finding adequate goal representations that capture common types of goal achievement rewards and costs. One popular representation is to give a single reward on each goal of a planning problem. I further expand on this approach by allowing users to directly introduce utility dependencies, providing for changes of goal achievement reward directly based on the goals a plan achieves. After, I introduce time-dependent goal costs, where a plan incurs penalty if it will achieve a goal past a specified deadline. To solve PSP problems with goal utility dependencies, I look at using state-of-the-art methodologies currently employed for classical planning problems involving heuristic search. In doing so, one faces the challenge of simultaneously determining the best set of goals and plan to achieve them. This is complicated by utility dependencies defined by a user and cost dependencies within the plan. To address this, I introduce a set of heuristics based on combinations using relaxed plans and integer programming formulations. Further, I explore an approach to improve search through learning techniques by using automatically generated state features to find new states from which to search. Finally, the investigation into handling time-dependent goal costs leads us to an improved search technique derived from observations based on solving discretized approximations of cost functions.
ContributorsBenton, J (Author) / Kambhampati, Subbarao (Thesis advisor) / Baral, Chitta (Committee member) / Do, Minh B. (Committee member) / Smith, David E. (Committee member) / Langley, Pat (Committee member) / Arizona State University (Publisher)
Created2012
151152-Thumbnail Image.png
Description
Access control is one of the most fundamental security mechanisms used in the design and management of modern information systems. However, there still exists an open question on how formal access control models can be automatically analyzed and fully realized in secure system development. Furthermore, specifying and managing access control

Access control is one of the most fundamental security mechanisms used in the design and management of modern information systems. However, there still exists an open question on how formal access control models can be automatically analyzed and fully realized in secure system development. Furthermore, specifying and managing access control policies are often error-prone due to the lack of effective analysis mechanisms and tools. In this dissertation, I present an Assurance Management Framework (AMF) that is designed to cope with various assurance management requirements from both access control system development and policy-based computing. On one hand, the AMF framework facilitates comprehensive analysis and thorough realization of formal access control models in secure system development. I demonstrate how this method can be applied to build role-based access control systems by adopting the NIST/ANSI RBAC standard as an underlying security model. On the other hand, the AMF framework ensures the correctness of access control policies in policy-based computing through automated reasoning techniques and anomaly management mechanisms. A systematic method is presented to formulate XACML in Answer Set Programming (ASP) that allows users to leverage off-the-shelf ASP solvers for a variety of analysis services. In addition, I introduce a novel anomaly management mechanism, along with a grid-based visualization approach, which enables systematic and effective detection and resolution of policy anomalies. I further evaluate the AMF framework through modeling and analyzing multiparty access control in Online Social Networks (OSNs). A MultiParty Access Control (MPAC) model is formulated to capture the essence of multiparty authorization requirements in OSNs. In particular, I show how AMF can be applied to OSNs for identifying and resolving privacy conflicts, and representing and reasoning about MPAC model and policy. To demonstrate the feasibility of the proposed methodology, a suite of proof-of-concept prototype systems is implemented as well.
ContributorsHu, Hongxin (Author) / Ahn, Gail-Joon (Thesis advisor) / Yau, Stephen S. (Committee member) / Dasgupta, Partha (Committee member) / Ye, Nong (Committee member) / Arizona State University (Publisher)
Created2012