Efficient decoding with generative score-spaces using the expectation semiring

State-of-the-art speech recognisers are usually based on hidden Markov models (HMMs). They model a hidden symbol sequence with a Markov process, with the observations independent given that sequence. These assumptions yield efficient algorithms, but limit the power of the model. An alternative model that allows a wide range of features, including word- and phone-level features, is a log-linear model. To handle, for example, word-level variable-length features, the original feature vectors must be segmented into words. Thus, decoding must find the optimal combination of segmentation of the utterance into words and word sequence. Features must therefore be extracted for each possible segment of audio. For many types of features, this becomes slow. In this paper, long-span features are derived from the likelihoods of word HMMs. Derivatives of the log-likelihoods, which break the Markov assumption, are appended. Previously, decoding with this model took cubic time in the length of the sequence, and longer for higher-order derivatives. This paper shows how to decode in quadratic time. © 2013 IEEE.

AGWAN: A Generative Model for Labelled, Weighted Graphs

Real-world graphs or networks tend to exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Much effort has been directed into creating realistic and tractable models for unlabelled graphs, which has yielded insights into graph structure and evolution. Recently, attention has moved to creating models for labelled graphs: many real-world graphs are labelled with both discrete and numeric attributes. In this paper, we present AGWAN (Attribute Graphs: Weighted and Numeric), a generative model for random graphs with discrete labels and weighted edges. The model is easily generalised to edges labelled with an arbitrary number of numeric attributes. We include algorithms for fitting the parameters of the AGWAN model to real-world graphs and for generating random graphs from the model. Using the Enron “who communicates with whom” social graph, we compare our approach to state-of-the-art random labelled graph generators and draw conclusions about the contribution of discrete vertex labels and edge weights to the structure of real-world graphs.

AGWAN: A Generative Model for Labelled, Weighted Graphs

Real-world graphs or networks tend to exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Much effort has been directed into creating realistic and tractable models for unlabelled graphs, which has yielded insights into graph structure and evolution. Recently, attention has moved to creating models for labelled graphs: many real-world graphs are labelled with both discrete and numeric attributes. In this paper, we presentAgwan (Attribute Graphs: Weighted and Numeric), a generative model for random graphs with discrete labels and weighted edges. The model is easily generalised to edges labelled with an arbitrary number of numeric attributes. We include algorithms for fitting the parameters of the Agwanmodel to real-world graphs and for generating random graphs from the model. Using real-world directed and undirected graphs as input, we compare our approach to state-of-the-art random labelled graph generators and draw conclusions about the contribution of discrete vertex labels and edge weights to graph structure.

Mining Money: the generative capacities of scientific and legal knowledge practices in the making of resource economies

In 1997 a scandal associated with Bre-X, a junior mining firm, and its prospecting activities in Indonesia, exposed to public scrutiny the ways in which mineral exploration firms acquire, assess and report on scientific claims about the natural environment. At stake here was not just how investors understood the provisional nature of scientific knowledge, but also evidence of fraud. Contemporaneous mining scandals not only included the salting of cores, but also unreliable proprietary sample preparation and assay methods, mis-representations of visual field estimates as drilling results and ‘overly optimistic’ geological reports. This paper reports on initiatives taken in the wake of these scandals and prompted by the Mining Standards Task Force (TSE/OSC 1999). For regulators, mandated to increase investor confidence in Canada’s leading role within the global mining industry, efforts focused first and foremost upon identifying and removing sources of error and wilfulness within the production and circulation of scientific knowledge claims. A common goal cross-cutting these initiatives was ‘a faithful representation of nature’ (Daston and Galison 2010), however, as the paper argues, this was manifest in an assemblage of practices governed by distinct and rival regulative visions of science and the making of markets in claims about ‘nature’. These ‘practices of fidelity’, it is argued, can be consequential in shaping the spatial and temporal dynamics of the marketization of nature.

Generative Divergent Analysis as a Model for Reflection Illustrated with Reference to an Early-years Reception Class and Wicker Settee

Generative divergent analysis (GDA) is a creative additive approach to raising insignificant details of experience to significance. A schematic view of the model highlights use of evocative objects as starting point for ‘turning towards’, ‘turning away’ and ‘being-in-relation-to’ as part of an ongoing burgeoning of experience.The model is exemplified by focusing on a wicker settee as an evocative object that was noticed in an early-years reception class. Revisiting the object generated several speculative ideas relating to the hidden curriculum and energies of childhood. Poetry and song were used during the revisiting in order to develop a more direct experience in addition to the more contemplative awareness that was evoked during the first encounters. As an additive process the outcome of GDA takes the form of unfinished resources for thinking.

Instrumental Fado: a generative interactive system

Fado was listed as UNESCO Intangible Cultural Heritage in 2011. This dissertation describes a theoretical model, as well as an automatic system, able to generate instrumental music based on the musics and vocal sounds typically associated with fado’s practice. A description of the phenomenon of fado, its musics and vocal sounds, based on ethnographic, historical sources and empirical data is presented. The data includes the creation of a digital corpus, of musical transcriptions, identified as fado, and statistical analysis via music information retrieval techniques. The second part consists in the formulation of a theory and the coding of a symbolic model, as a proof of concept, for the automatic generation of instrumental music based on the one in the corpus.

Developing and Applying Generative Market Intelligence within Multinational Companies

Tutkielman tarkoitus on kehittää monikansallisille yrityksille tuottavan markkinaälyn malli, jonka avulla yritykset pystyvät käsittelemään muuttuvasta ja globalisoituvasta markkinaympäristöstä aiheutuvaa epävarmuutta. Malli koostuu pääosin kolmesta käsitteestä: markkinainformaation prosessoinnista, markkinasuuntautuneisuudesta ja organisationaalisesta oppimisesta. Tutkimuksessa osoitetaan, kuinka näiden samanaikainen soveltaminen johtaa synergiaetuihin. Lähdeaineistona käytettiin alan kirjallisuutta. Lisäksi haastateltiin neljää johtajaa monikansallisista yrityksistä. Käytännössä markkinaälyn soveltamisen haasteet liittyvät lähinnä markkinainformaation prosessoinnin asenteellisiin ja psykologisiin aspekteihin. Ihmisten tulisi ymmärtää, että koko yritys hyötyy heidän halukkuudestaan tiedon tuottamiseen ja jakamiseen. Lisäksi tietoa itsessään voimavarana tulisi kunnioittaa

Enabling and Measuring Complexity in Evolving Designs using Generative Representations for Artificial Architecture

As the complexity of evolutionary design problems grow, so too must the quality of solutions scale to that complexity. In this research, we develop a genetic programming system with individuals encoded as tree-based generative representations to address scalability. This system is capable of multi-objective evaluation using a ranked sum scoring strategy. We examine Hornby's features and measures of modularity, reuse and hierarchy in evolutionary design problems. Experiments are carried out, using the system to generate three-dimensional forms, and analyses of feature characteristics such as modularity, reuse and hierarchy were performed. This work expands on that of Hornby's, by examining a new and more difficult problem domain. The results from these experiments show that individuals encoded with those three features performed best overall. It is also seen, that the measures of complexity conform to the results of Hornby. Moving forward with only this best performing encoding, the system was applied to the generation of three-dimensional external building architecture. One objective considered was passive solar performance, in which the system was challenged with generating forms that optimize exposure to the Sun. The results from these and other experiments satisfied the requirements. The system was shown to scale well to the architectural problems studied.

Generative Temporal Planning with Complex Processes

Autonomous vehicles are increasingly being used in mission-critical applications, and robust methods are needed for controlling these inherently unreliable and complex systems. This thesis advocates the use of model-based programming, which allows mission designers to program autonomous missions at the level of a coach or wing commander. To support such a system, this thesis presents the Spock generative planner. To generate plans, Spock must be able to piece together vehicle commands and team tactics that have a complex behavior represented by concurrent processes. This is in contrast to traditional planners, whose operators represent simple atomic or durative actions. Spock represents operators using the RMPL language, which describes behaviors using parallel and sequential compositions of state and activity episodes. RMPL is useful for controlling mobile autonomous missions because it allows mission designers to quickly encode expressive activity models using object-oriented design methods and an intuitive set of activity combinators. Spock also is significant in that it uniformly represents operators and plan-space processes in terms of Temporal Plan Networks, which support temporal flexibility for robust plan execution. Finally, Spock is implemented as a forward progression optimal planner that walks monotonically forward through plan processes, closing any open conditions and resolving any conflicts. This thesis describes the Spock algorithm in detail, along with example problems and test results.