The automatic orchestration problem is that of assigning instruments or sounds to the notes of an unorchestrated score. This is related to, but distinct from, problems of automatic expressive interpretation. A simple algorithm is described that successfully orchestrates scores based on analysis of one musical structure -- the "Z-chain."

Imagine that a budding composer suffers from writer's block partway through devising a melody. A system called FreshJam is demonstrated, which offers a solution to this problem in the form of an interactive composition assistant; an algorithm that analyzes the notes composed so far, makes a comparison with an indexed corpus of existing music, and suggests a possible next note by choosing randomly among continuations of matched melody fragments. We provide a demonstration of FreshJam as an aid in stylistic composition, and of its potential to be more iterative than existing composition assistants such as PG Music's Band in a Box or Microsoft's Songsmith.

Quantum mechanical systems exist as superpositions of complementary states that collapse to classical, concrete states upon becoming entangled with the measurement apparatus of observer-participants. A musical composition and its performance constitute a quantum system. Historically, conventional musical notation has presented the appearance of a composition as a deterministic, concrete entity, with interpretation approached as an extrinsic act. This historical perspective inhabits a subspace of the available quantum space. A quantum musical system unifies the composition, instruments, situated performance and perception as a superposition of musical events that collapses to concrete musical events via the interactions and perceptions of performers and audience. A composer captures superposed musical events via implicit or explicit conditional event probabilities, and human and/or machine performers create music by collapsing interrelated probabilities to zeros and ones via observer-participancy.

Beyond the goal of refining system design to the needs and tastes of users, user evaluation of interactive music systems offers a method of examining the nature of musical creativity as understood by its human practitioners. In the case of improvising music systems, user study and evaluation of a system’s ability to improvise may be useful in the ethnomusicological study of musical interaction in contemporary improvised music. A survey of preliminary findings based on the interactions of an improvising system, Maxine, with several improvisers is discussed, with results suggesting methodological reconfigurations of the purpose and goals of evaluating of interactive musical metacreations.

In this work, we propose Answer-Set Programming (ASP) as a tool for rapid prototyping of dynamic programming algorithms based on tree decompositions. In fact, many such algorithms have been designed, but only a few of them found their way into implementation. The main obstacle is the lack of easy-to-use systems which (i) take care of building a tree decomposition and (ii) provide an interface for declarative specifications of dynamic programming algorithms. In this paper, we present D-FLAT, a novel tool that relieves the user of having to handle all the technical details concerned with parsing, tree decomposition, the handling of data structures, etc. Instead, it is only the dynamic programming algorithm itself which has to be specified in the ASP language. D-FLAT employs an ASP solver in order to compute the local solutions in the dynamic programming algorithm. In the paper, we give a few examples illustrating the use of D-FLAT and describe the main features of the system. Moreover, we report experiments which show that ASP-based D-FLAT encodings for some problems outperform monolithic ASP encodings on instances of small treewidth.

We present a system that enables rapid model experimentation for tera-scale machine learning with trillions of non-zero features, billions of training examples, and millions of parameters. Our contribution to the literature is a new method (SA L-BFGS) for changing batch L-BFGS to perform in near real-time by using statistical tools to balance the contributions of previous weights, old training examples, and new training examples to achieve fast convergence with few iterations. The result is, to our knowledge, the most scalable and flexible linear learning system reported in the literature, beating standard practice with the current best system (Vowpal Wabbit and AllReduce). Using the KDD Cup 2012 data set from Tencent, Inc. we provide experimental results to verify the performance of this method.

As an important tool for information filtering in the era of socialized web, recommender systems have witnessed rapid development in the last decade. As benefited from the better interpretability, neighborhood-based collaborative filtering techniques, such as item-based collaborative filtering adopted by Amazon, have gained a great success in many practical recommender systems. However, the neighborhood-based collaborative filtering method suffers from the rating bound problem, i.e., the rating on a target item that this method estimates is bounded by the observed ratings of its all neighboring items. Therefore, it cannot accurately estimate the unobserved rating on a target item, if its ground truth rating is actually higher (lower) than the highest (lowest) rating over all items in its neighborhood. In this paper, we address this problem by formalizing rating estimation as a task of recovering a scalar rating function. With a linearity assumption, we infer all the ratings by optimizing the low-order norm, e.g., the $l_1/2$-norm, of the second derivative of the target scalar function, while remaining its observed ratings unchanged. Experimental results on three real datasets, namely Douban, Goodreads and MovieLens, demonstrate that the proposed approach can well overcome the rating bound problem. Particularly, it can significantly improve the accuracy of rating estimation by 37% than the conventional neighborhood-based methods.

A vast amount of textual web streams is influenced by events or phenomena emerging in the real world. The social web forms an excellent modern paradigm, where unstructured user generated content is published on a regular basis and in most occasions is freely distributed. The present Ph.D. Thesis deals with the problem of inferring information - or patterns in general - about events emerging in real life based on the contents of this textual stream. We show that it is possible to extract valuable information about social phenomena, such as an epidemic or even rainfall rates, by automatic analysis of the content published in Social Media, and in particular Twitter, using Statistical Machine Learning methods. An important intermediate task regards the formation and identification of features which characterise a target event; we select and use those textual features in several linear, non-linear and hybrid inference approaches achieving a significantly good performance in terms of the applied loss function. By examining further this rich data set, we also propose methods for extracting various types of mood signals revealing how affective norms - at least within the social web's population - evolve during the day and how significant events emerging in the real world are influencing them. Lastly, we present some preliminary findings showing several spatiotemporal characteristics of this textual information as well as the potential of using it to tackle tasks such as the prediction of voting intentions.

It is well established that in certain domains, noisy inputs can be reliablycombined to obtain a better answer than any individual.It is now possible to consider the crowdsourcing of physical actions,commonly used for creative expressions such as drawing, shading, and singing.We provide algorithms for converting low-quality inputobtained from the physical actions of a crowd into high-quality output.The inputs take the form of line drawings, shaded images, and songs.We investigate single-individual crowds (multiple inputs from a single human)and multiple-individual crowds.

Computational systems can use sociocultural knowledge to understand human behavior and interact with humans in more natural ways. However, such systems are limited by their reliance on hand-authored sociocultural knowledge and models. We introduce an approach to automatically learn robust, script-like sociocultural knowledge from crowdsourced narratives. Crowdsourcing, the use of anonymous human workers, provides an opportunity for rapidly acquir­ing a corpus of examples of situations that are highly specialized for our purpose yet sufficiently varied, from which we can learn a versatile script. We describe a semi-automated process by which we query human workers to write natural language narrative examples of a given situation and learn the set of events that can occur and the typical even ordering.