Matching Items (189)
Description
A new arrangement of the Concerto for Two Horns in E-flat Major, Hob. VIId/6, attributed by some to Franz Joseph Haydn, is presented here. The arrangement reduces the orchestral portion to ten wind instruments, specifically a double wind quintet, to facilitate performance of the work. A full score and a complete set of parts are included. In support of this new arrangement, a discussion of the early treatment of horns in pairs and the subsequent development of the double horn concerto in the eighteenth century provides historical context for the Concerto for Two Horns in E-flat major. A summary of the controversy concerning the identity of the composer of this concerto is followed by a description of the content and structure of each of its three movements. Some comments on the procedures of the arrangement complete the background information.
ContributorsYeh, Guan-Lin (Author) / Ericson, John (Thesis advisor) / Holbrook, Amy (Committee member) / Micklich, Albie (Committee member) / Pilafian, J. Samuel (Committee member) / Arizona State University (Publisher)
Created2011
Description
The purpose of this project was to commission, perform, and discuss a new work for an instrument pairing not often utilized, oboe and percussion. The composer, Alyssa Morris, was selected in June 2009. Her work, titled Forecast, was completed in October of 2009 and premiered in February of 2010, as part of a program showcasing music for oboe and percussion. Included in this document is a detailed biography of the composer, a description of the four movements of Forecast, performance notes for each movement, a diagram for stage set-up, the full score, the program from the premiere performance with biographies of all the performers involved, and both a live recording and MIDI sound file. The performance notes discuss issues that arose during preparation for the premiere and should help avoid potential pitfalls. TrevCo Music, publisher of the work, graciously allowed inclusion of the full score. This score is solely for use in this document; please visit the publisher's website for purchasing information. The commission and documentation of this composition are intended to add to the repertoire for oboe in an unusual instrument pairing and to encourage further exploration of such combinations.
ContributorsCreamer, Caryn (Author) / Schuring, Martin (Thesis advisor) / Hill, Gary (Committee member) / Holbrook, Amy (Committee member) / Micklich, Albie (Committee member) / Spring, Robert (Committee member) / Arizona State University (Publisher)
Created2011
Description
Although one finds much scholarship on nineteenth-century music in America, one finds relatively little about music in the post-Civil-War frontier west. Generalities concerning small frontier towns of regional importance remain to be discovered. This paper aims to contribute to scholarship by chronicling musical life in the early years of two such towns in northern Arizona territory: Prescott and Flagstaff. Prescott, adjacent to Fort Whipple, was founded in 1864 to serve as capital of the new territory. Primarily home to soldiers and miners, the town was subject to many challenges of frontier life. Flagstaff, ninety miles to the north-northwest, was founded about two decades later in 1883 during the building of the Atlantic & Pacific Railroad, which connected the town to Albuquerque, New Mexico in the east and southern California in the west. Although the particular resources of each town provided many different musical opportunities, extant newspaper articles from Prescott's Arizona Miner and Flagstaff's Arizona Champion describe communities in which musical concerts, dances and theatrical performances provided entertainment and socializing for its citizens. Furthermore, music was an important part of developing institutions such as the church, schools, and fraternal lodges, and the newspapers of both towns advertised musical instruments and sheet music. Both towns were home to amateur musicians, and both offered the occasional opportunity to learn to dance or play an instrument. Although territorial Arizona was sometimes harsh and resources were limited, music was valued in these communities and was a consistent presence in frontier life.
ContributorsJohnson, Amber V (Author) / Oldani, Robert W. (Thesis advisor) / Holbrook, Amy (Committee member) / Saucier, Catherine (Committee member) / Arizona State University (Publisher)
Created2011
Description
This thesis proposed a novel approach to establish the trust model in a social network scenario based on users' emails. Email is one of the most important social connections nowadays. By analyzing email exchange activities among users, a social network trust model can be established to judge the trust rate between each two users. The whole trust checking process is divided into two steps: local checking and remote checking. Local checking directly contacts the email server to calculate the trust rate based on user's own email communication history. Remote checking is a distributed computing process to get help from user's social network friends and built the trust rate together. The email-based trust model is built upon a cloud computing framework called MobiCloud. Inside MobiCloud, each user occupies a virtual machine which can directly communicate with others. Based on this feature, the distributed trust model is implemented as a combination of local analysis and remote analysis in the cloud. Experiment results show that the trust evaluation model can give accurate trust rate even in a small scale social network which does not have lots of social connections. With this trust model, the security in both social network services and email communication could be improved.
ContributorsZhong, Yunji (Author) / Huang, Dijiang (Thesis advisor) / Dasgupta, Partha (Committee member) / Syrotiuk, Violet (Committee member) / Arizona State University (Publisher)
Created2011
Description
The theme for this work is the development of fast numerical algorithms for sparse optimization as well as their applications in medical imaging and source localization using sensor array processing. Due to the recently proposed theory of Compressive Sensing (CS), the $\ell_1$ minimization problem attracts more attention for its ability to exploit sparsity. Traditional interior point methods encounter difficulties in computation for solving the CS applications. In the first part of this work, a fast algorithm based on the augmented Lagrangian method for solving the large-scale TV-$\ell_1$ regularized inverse problem is proposed. Specifically, by taking advantage of the separable structure, the original problem can be approximated via the sum of a series of simple functions with closed form solutions. A preconditioner for solving the block Toeplitz with Toeplitz block (BTTB) linear system is proposed to accelerate the computation. An in-depth discussion on the rate of convergence and the optimal parameter selection criteria is given. Numerical experiments are used to test the performance and the robustness of the proposed algorithm to a wide range of parameter values. Applications of the algorithm in magnetic resonance (MR) imaging and a comparison with other existing methods are included. The second part of this work is the application of the TV-$\ell_1$ model in source localization using sensor arrays. The array output is reformulated into a sparse waveform via an over-complete basis and study the $\ell_p$-norm properties in detecting the sparsity. An algorithm is proposed for minimizing a non-convex problem. According to the results of numerical experiments, the proposed algorithm with the aid of the $\ell_p$-norm can resolve closely distributed sources with higher accuracy than other existing methods.
ContributorsShen, Wei (Author) / Mittlemann, Hans D (Thesis advisor) / Renaut, Rosemary A. (Committee member) / Jackiewicz, Zdzislaw (Committee member) / Gelb, Anne (Committee member) / Ringhofer, Christian (Committee member) / Arizona State University (Publisher)
Created2011
Description
With the advent of technologies such as web services, service oriented architecture and cloud computing, modern organizations have to deal with policies such as Firewall policies to secure the networks, XACML (eXtensible Access Control Markup Language) policies for controlling the access to critical information as well as resources. Management of these policies is an extremely important task in order to avoid unintended security leakages via illegal accesses, while maintaining proper access to services for legitimate users. Managing and maintaining access control policies manually over long period of time is an error prone task due to their inherent complex nature. Existing tools and mechanisms for policy management use different approaches for different types of policies. This research thesis represents a generic framework to provide an unified approach for policy analysis and management of different types of policies. Generic approach captures the common semantics and structure of different access control policies with the notion of policy ontology. Policy ontology representation is then utilized for effectively analyzing and managing the policies. This thesis also discusses a proof-of-concept implementation of the proposed generic framework and demonstrates how efficiently this unified approach can be used for analysis and management of different types of access control policies.
ContributorsKulkarni, Ketan (Author) / Ahn, Gail-Joon (Thesis advisor) / Yau, Stephen S. (Committee member) / Huang, Dijiang (Committee member) / Arizona State University (Publisher)
Created2011
Description
This research describes software based remote attestation schemes for obtaining the integrity of an executing user application and the Operating System (OS) text section of an untrusted client platform. A trusted external entity issues a challenge to the client platform. The challenge is executable code which the client must execute, and the code generates results which are sent to the external entity. These results provide the external entity an assurance as to whether the client application and the OS are in pristine condition. This work also presents a technique where it can be verified that the application which was attested, did not get replaced by a different application after completion of the attestation. The implementation of these three techniques was achieved entirely in software and is backward compatible with legacy machines on the Intel x86 architecture. This research also presents two approaches to incorporating software based "root of trust" using Virtual Machine Monitors (VMMs). The first approach determines the integrity of an executing Guest OS from the Host OS using Linux Kernel-based Virtual Machine (KVM) and qemu emulation software. The second approach implements a small VMM called MIvmm that can be utilized as a trusted codebase to build security applications such as those implemented in this research. MIvmm was conceptualized and implemented without using any existing codebase; its minimal size allows it to be trustworthy. Both the VMM approaches leverage processor support for virtualization in the Intel x86 architecture.
ContributorsSrinivasan, Raghunathan (Author) / Dasgupta, Partha (Thesis advisor) / Colbourn, Charles (Committee member) / Shrivastava, Aviral (Committee member) / Huang, Dijiang (Committee member) / Dewan, Prashant (Committee member) / Arizona State University (Publisher)
Created2011
Description
This dissertation is focused on building scalable Attribute Based Security Systems (ABSS), including efficient and privacy-preserving attribute based encryption schemes and applications to group communications and cloud computing. First of all, a Constant Ciphertext Policy Attribute Based Encryption (CCP-ABE) is proposed. Existing Attribute Based Encryption (ABE) schemes usually incur large, linearly increasing ciphertext. The proposed CCP-ABE dramatically reduces the ciphertext to small, constant size. This is the first existing ABE scheme that achieves constant ciphertext size. Also, the proposed CCP-ABE scheme is fully collusion-resistant such that users can not combine their attributes to elevate their decryption capacity. Next step, efficient ABE schemes are applied to construct optimal group communication schemes and broadcast encryption schemes. An attribute based Optimal Group Key (OGK) management scheme that attains communication-storage optimality without collusion vulnerability is presented. Then, a novel broadcast encryption model: Attribute Based Broadcast Encryption (ABBE) is introduced, which exploits the many-to-many nature of attributes to dramatically reduce the storage complexity from linear to logarithm and enable expressive attribute based access policies. The privacy issues are also considered and addressed in ABSS. Firstly, a hidden policy based ABE schemes is proposed to protect receivers' privacy by hiding the access policy. Secondly,a new concept: Gradual Identity Exposure (GIE) is introduced to address the restrictions of hidden policy based ABE schemes. GIE's approach is to reveal the receivers' information gradually by allowing ciphertext recipients to decrypt the message using their possessed attributes one-by-one. If the receiver does not possess one attribute in this procedure, the rest of attributes are still hidden. Compared to hidden-policy based solutions, GIE provides significant performance improvement in terms of reducing both computation and communication overhead. Last but not least, ABSS are incorporated into the mobile cloud computing scenarios. In the proposed secure mobile cloud data management framework, the light weight mobile devices can securely outsource expensive ABE operations and data storage to untrusted cloud service providers. The reported scheme includes two components: (1) a Cloud-Assisted Attribute-Based Encryption/Decryption (CA-ABE) scheme and (2) An Attribute-Based Data Storage (ABDS) scheme that achieves information theoretical optimality.
ContributorsZhou, Zhibin (Author) / Huang, Dijiang (Thesis advisor) / Yau, Sik-Sang (Committee member) / Ahn, Gail-Joon (Committee member) / Reisslein, Martin (Committee member) / Arizona State University (Publisher)
Created2011
Description
Owen Middleton (b. 1941) enjoys an established and growing reputation as a composer of classical guitar music, but his works for piano are comparatively little known. The close investigation offered here of Middleton's works for piano reveals the same impressive craftsmanship, compelling character, and innovative spirit found in his works for guitar. Indeed, the only significant thing Middleton's piano music currently lacks is the well-deserved attention of professional players and a wider audience. Middleton's piano music needs to be heard, not just discussed, so one of this document's purposes is to provide a recorded sample of his piano works. While the overall repertoire for solo piano is vast, and new works become established in that repertoire with increasing difficulty, Middleton's piano works have a significant potential to find their way into the concert hall as well as the private teaching studio. His solo piano music is highly effective, well suited to the instrument, and, perhaps most importantly, fresh sounding and truly original. His pedagogical works are of equal value. Middleton's piano music offers something for everyone: there one finds daring virtuosity, effusions of passion, intellectual force, colorful imagery, poetry, humor, and even a degree of idiomatic innovation. This study aims to reveal key aspects of the composer's musical style, especially his style of piano writing, and to provide pianists with helpful analytical, technical, and interpretive insights. These descriptions of the music are supported with recorded examples, selected from the works for solo piano written between 1962 and 1993: Sonata for Piano, Childhood Scenes, Katie's Collection, and Toccata for Piano. The complete scores of the recorded works are included in the appendix. A chapter briefly describing the piano pieces since 1993 concludes the study and invites the reader to further investigations of this unique and important body of work.
ContributorsMoreau, Barton Andrew (Author) / Hamilton, Robert (Thesis advisor) / Holbrook, Amy (Committee member) / Campbell, Andrew (Committee member) / Spring, Robert (Committee member) / Gardner, Joshua (Committee member) / Arizona State University (Publisher)
Created2011
Description
TaxiWorld is a Matlab simulation of a city with a fleet of taxis which operate within it, with the goal of transporting passengers to their destinations. The size of the city, as well as the number of available taxis and the frequency and general locations of fare appearances can all be set on a scenario-by-scenario basis. The taxis must attempt to service the fares as quickly as possible, by picking each one up and carrying it to its drop-off location. The TaxiWorld scenario is formally modeled using both Decentralized Partially-Observable Markov Decision Processes (Dec-POMDPs) and Multi-agent Markov Decision Processes (MMDPs). The purpose of developing formal models is to learn how to build and use formal Markov models, such as can be given to planners to solve for optimal policies in problem domains. However, finding optimal solutions for Dec-POMDPs is NEXP-Complete, so an empirical algorithm was also developed as an improvement to the method already in use on the simulator, and the methods were compared in identical scenarios to determine which is more effective. The empirical method is of course not optimal - rather, it attempts to simply account for some of the most important factors to achieve an acceptable level of effectiveness while still retaining a reasonable level of computational complexity for online solving.
ContributorsWhite, Christopher (Author) / Kambhampati, Subbarao (Thesis advisor) / Gupta, Sandeep (Committee member) / Varsamopoulos, Georgios (Committee member) / Arizona State University (Publisher)
Created2011