Matching Items (257)
Filtering by
- All Subjects: artificial intelligence
- Genre: Academic theses
Description
Yannis Constantinidis was the last of the handful of composers referred to collectively as the Greek National School. The members of this group strove to create a distinctive national style for Greece, founded upon a synthesis of Western compositional idioms with melodic, rhyhmic, and modal features of their local folk traditions. Constantinidis particularly looked to the folk melodies of his native Asia Minor and the nearby Dodecanese Islands. His musical output includes operettas, musical comedies, orchestral works, chamber and vocal music, and much piano music, all of which draws upon folk repertories for thematic material. The present essay examines how he incorporates this thematic material in his piano compositions, written between 1943 and 1971, with a special focus on the 22 Songs and Dances from the Dodecanese. In general, Constantinidis's pianistic style is expressed through miniature pieces in which the folk tunes are presented mostly intact, but embedded in accompaniment based in early twentieth-century modal harmony. Following the dictates of the founding members of the Greek National School, Manolis Kalomiris and Georgios Lambelet, the modal basis of his harmonic vocabulary is firmly rooted in the characteristics of the most common modes of Greek folk music. A close study of his 22 Songs and Dances from the Dodecanese not only offers a valuable insight into his harmonic imagination, but also demonstrates how he subtly adapts his source melodies. This work also reveals his care in creating a musical expression of the words of the original folk songs, even in purely instrumental compositon.
ContributorsSavvidou, Dina (Author) / Hamilton, Robert (Thesis advisor) / Little, Bliss (Committee member) / Meir, Baruch (Committee member) / Thompson, Janice M (Committee member) / Arizona State University (Publisher)
Created2011
Description
This dissertation transforms a set of system complexity reduction problems to feature selection problems. Three systems are considered: classification based on association rules, network structure learning, and time series classification. Furthermore, two variable importance measures are proposed to reduce the feature selection bias in tree models. Associative classifiers can achieve high accuracy, but the combination of many rules is difficult to interpret. Rule condition subset selection (RCSS) methods for associative classification are considered. RCSS aims to prune the rule conditions into a subset via feature selection. The subset then can be summarized into rule-based classifiers. Experiments show that classifiers after RCSS can substantially improve the classification interpretability without loss of accuracy. An ensemble feature selection method is proposed to learn Markov blankets for either discrete or continuous networks (without linear, Gaussian assumptions). The method is compared to a Bayesian local structure learning algorithm and to alternative feature selection methods in the causal structure learning problem. Feature selection is also used to enhance the interpretability of time series classification. Existing time series classification algorithms (such as nearest-neighbor with dynamic time warping measures) are accurate but difficult to interpret. This research leverages the time-ordering of the data to extract features, and generates an effective and efficient classifier referred to as a time series forest (TSF). The computational complexity of TSF is only linear in the length of time series, and interpretable features can be extracted. These features can be further reduced, and summarized for even better interpretability. Lastly, two variable importance measures are proposed to reduce the feature selection bias in tree-based ensemble models. It is well known that bias can occur when predictor attributes have different numbers of values. Two methods are proposed to solve the bias problem. One uses an out-of-bag sampling method called OOBForest, and the other, based on the new concept of a partial permutation test, is called a pForest. Experimental results show the existing methods are not always reliable for multi-valued predictors, while the proposed methods have advantages.
ContributorsDeng, Houtao (Author) / Runger, George C. (Thesis advisor) / Lohr, Sharon L (Committee member) / Pan, Rong (Committee member) / Zhang, Muhong (Committee member) / Arizona State University (Publisher)
Created2011
Description
Real-world environments are characterized by non-stationary and continuously evolving data. Learning a classification model on this data would require a framework that is able to adapt itself to newer circumstances. Under such circumstances, transfer learning has come to be a dependable methodology for improving classification performance with reduced training costs and without the need for explicit relearning from scratch. In this thesis, a novel instance transfer technique that adapts a "Cost-sensitive" variation of AdaBoost is presented. The method capitalizes on the theoretical and functional properties of AdaBoost to selectively reuse outdated training instances obtained from a "source" domain to effectively classify unseen instances occurring in a different, but related "target" domain. The algorithm is evaluated on real-world classification problems namely accelerometer based 3D gesture recognition, smart home activity recognition and text categorization. The performance on these datasets is analyzed and evaluated against popular boosting-based instance transfer techniques. In addition, supporting empirical studies, that investigate some of the less explored bottlenecks of boosting based instance transfer methods, are presented, to understand the suitability and effectiveness of this form of knowledge transfer.
ContributorsVenkatesan, Ashok (Author) / Panchanathan, Sethuraman (Thesis advisor) / Li, Baoxin (Committee member) / Ye, Jieping (Committee member) / Arizona State University (Publisher)
Created2011
Description
The purpose of this project was to examine the lives and solo piano works of four members of the early generation of female composers in Taiwan. These four women were born between 1950 and 1960, began to appear on the Taiwanese musical scene after 1980, and were still active as composers at the time of this study. They include Fan-Ling Su (b. 1955), Hwei-Lee Chang (b. 1956), Shyh-Ji Pan-Chew (b. 1957), and Kwang-I Ying (b. 1960). Detailed biographical information on the four composers is presented and discussed. In addition, the musical form and features of all solo piano works at all levels by the four composers are analyzed, and the musical characteristics of each composer's work are discussed. The biography of a fifth composer, Wei-Ho Dai (b. 1950), is also discussed but is placed in the Appendices because her piano music could not be located. This research paper is presented in six chapters: (1) Prologue; the life and music of (2) Fan-Ling Su, (3) Hwei-Lee Chang, (4) Shyh-Ji Pan-Chew, and (5) Kwang-I Ying; and (6) Conclusion. The Prologue provides an overview of the development of Western classical music in Taiwan, a review of extant literature on the selected composers and their music, and the development of piano music in Taiwan. The Conclusion is comprised of comparisons of the four composers' music, including their personal interests and preferences as exhibited in their music. For example, all of the composers have used atonality in their music. Two of the composers, Fan-Ling Su and Kwang-I Ying, openly apply Chinese elements in their piano works, while Hwei-Lee Chang tries to avoid direct use of the Chinese pentatonic scale. The piano works of Hwei-Lee Chang and Shyh-Ji Pan-Chew are chromatic and atonal, and show an economical usage of material. Biographical information on Wei-Ho Dai and an overview of Taiwanese history are presented in the Appendices.
ContributorsWang, Jinding (Author) / Pagano, Caio (Thesis advisor) / Campbell, Andrew (Committee member) / Humphreys, Jere T. (Committee member) / Meyer-Thompson, Janice (Committee member) / Norton, Kay (Committee member) / Arizona State University (Publisher)
Created2011
Description
Mechanisms for oxygen reduction are proposed for three distinct cases covering two ionic liquids of fundamentally different archetypes and almost thirty orders of magnitude of proton activity. Proton activity is treated both extrinsically by varying the concentration and intrinsically by selecting proton donors with a wide range of aqueous pKa values. The mechanism of oxygen reduction in ionic liquids is introduced by way of the protic ionic liquid (pIL) triethylammonium triflate (TEATf) which shares some similarities with aqueous acid solutions. Oxygen reduction in TEATf begins as the one electron rate limited step to form superoxide, O2*-, which is then rapidly protonated by the pIL cation forming the perhydroxyl radical, HO2*. The perhydroxyl radical is further reduced to peroxidate (HO2-) and hydrogen peroxide in proportions in accordance with their pKa. The reaction does not proceed beyond this point due to the adsorption of the conjugate base triethylammine interfering with the disproportionation of hydrogen peroxide. This work demonstrates that this mechanism is consistent across Pt, Au, Pd, and Ag electrodes. Two related sets of experiments were performed in the inherently aprotic ionic liquid 1-butyl-2,3-dimethylimidazolium triflate (C4dMImTf). The first involved the titration of acidic species of varying aqueous pKa into the IL while monitoring the extent of oxygen reduction as a function of pKa and potential on Pt and glassy carbon (GC) electrodes. These experiments confirmed the greater propensity of Pt to reduce oxygen by its immediate and abrupt transition from one electron reduction to four electron reduction, while oxygen reduction on GC gradually approaches four electron reduction as the potentials were driven more cathodic. The potential at which oxygen reduction initiates shows general agreement with the Nernst equation and the acid's tabulated aqueous pKa value, however at the extremely acidic end, a small deviation is observed. The second set of experiments in C4dMImTf solicited water as the proton donor for oxygen reduction in an approximation of the aqueous alkaline case. The water content was varied between extremely dry (<0.1 mol% H2O) and saturated (approximately 15.8 mol% H2O}). As the water content increased so too did the extent of oxygen reduction eventually approach two electrons on both Pt and GC. However, additional water led to a linear increase in the Tafel slope under enhanced mass transport conditions up to the point of 10 mol% water. This inhibition of oxygen adsorption is the result of the interaction between superoxide and water and more specifically is proposed to be associated with decomposition of theC4dMIm+ cation by hydroxide at the elevated temperatures required for the experiment. Oxygen reduction on both Pt and GC follows Nernstian behavior as the water content is increased. Separate mechanisms for oxygen reduction on Pt and GC are proposed based on the nature of the Nernstian response in these systems.
ContributorsZeller, Robert August (Author) / Friesen, Cody (Thesis advisor) / Sieradzki, Karl (Committee member) / Buttry, Daniel (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
Description
Action language C+ is a formalism for describing properties of actions, which is based on nonmonotonic causal logic. The definite fragment of C+ is implemented in the Causal Calculator (CCalc), which is based on the reduction of nonmonotonic causal logic to propositional logic. This thesis describes the language of CCalc in terms of answer set programming (ASP), based on the translation of nonmonotonic causal logic to formulas under the stable model semantics. I designed a standard library which describes the constructs of the input language of CCalc in terms of ASP, allowing a simple modular method to represent CCalc input programs in the language of ASP. Using the combination of system F2LP and answer set solvers, this method achieves functionality close to that of CCalc while taking advantage of answer set solvers to yield efficient computation that is orders of magnitude faster than CCalc for many benchmark examples. In support of this, I created an automated translation system Cplus2ASP that implements the translation and encoding method and automatically invokes the necessary software to solve the translated input programs.
ContributorsCasolary, Michael (Author) / Lee, Joohyung (Thesis advisor) / Ahn, Gail-Joon (Committee member) / Baral, Chitta (Committee member) / Arizona State University (Publisher)
Created2011
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
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
Objective of this thesis project is to build a prototype using Linear Temporal Logic specifications for generating a 2D motion plan commanding an iRobot to fulfill the specifications. This thesis project was created for Cyber Physical Systems Lab in Arizona State University. The end product of this thesis is creation of a software solution which can be used in the academia and industry for research in cyber physical systems related applications. The major features of the project are: creating a modular system for motion planning, use of Robot Operating System (ROS), use of triangulation for environment decomposition and using stargazer sensor for localization. The project is built on an open source software called ROS which provides an environment where it is very easy to integrate different modules be it software or hardware on a Linux based platform. Use of ROS implies the project or its modules can be adapted quickly for different applications as the need arises. The final software package created and tested takes a data file as its input which contains the LTL specifications, a symbols list used in the LTL and finally the environment polygon data containing real world coordinates for all polygons and also information on neighbors and parents of each polygon. The software package successfully ran the experiment of coverage, reachability with avoidance and sequencing.
ContributorsPandya, Parth (Author) / Fainekos, Georgios (Thesis advisor) / Dasgupta, Partha (Committee member) / Lee, Yann-Hang (Committee member) / Arizona State University (Publisher)
Created2013