Given a tree each of whose terminal vertices is associated with a given poin t in a compact metric space, the problem is to optimally associate a point in this space to each nonterminal vertex of the tree. The optimali ty criterion is the minimizat ion o f the sum of the lengths, in the metric space, over all edges of the tree. This note shows how a dynamic programming solution to this problem ...

A compare-exchange network, or CMPX-net, is a sequence of operations of the form [i : j], each of which operates on an array, D, of length N. The network is said to have width N. The length of the network is the number of CMPX’s in the network. For each [i : j], we have i < j and i, j E [0, N 11. To apply a CMPXnet to an array, swap O[i] and O[j] if D[i] > O[j] for each [i : j] in the sequence....

We present a general framework to define an application–dependent weight measure on terms that subsumes e.g. total simplification orderings, and an O(n · log n) algorithm for the simultaneous computation of the minimal weight of a term in the language of each nonterminal of a regular tree grammar, based on Barzdins’ liquid–flow technique.

v CHAPTER 1 : GENERAL INTRODUCTION 1 Thesis Organization 5 References 9 CHAPTER 2: DISTINCTIONS MADE IN THE PROTEIN RECOGNITION OF CARBOHYDRATES 14 Abstract 14 Introduction 15 Discussion 19 Conclusion 24 References 26 CHAPTER 3: SPECIFIC EMPIRICAL FREE ENERGY FUNCTION FOR AUTOMATED DOCKING OF CARBOHYDRATES TO PROTEINS 34 Abstract 34 Introduction 35 Methods 37 Results and Discussion 42 Conclusio...

We examine the role of simplicity in directing the induction of context-free grammars from sample sentences. We present a rational reconstruction of Woll's SNPR { the Grids system { which incorporates a bias toward grammars that minimize description length. The algorithm alternates between merging existing nonterminal symbols and creating new symbols, using a beam search to move from complex to...

Let (G, T ) be an instance of the (vertex) multiway cut problem where G is a graph and T is a set of terminals. For t ∈ T , a set of nonterminal vertices separating t from T \ {T } is called an isolating cut of t. The largest among all the smallest isolating cuts is a natural lower bound for a multiway cut of (G, T ). Denote this lower bound by m and let k be an integer. In this paper we propos...

A partial function F : Σ∗ → Ω∗ is called a simple function if F (w) ∈ Ω∗ is the output produced in the generation of a word w ∈ Σ∗ from a nonterminal of a simple context free grammar G with output alphabet Ω. In this paper we present an efficient algorithm for testing equivalence of simple functions. Such functions correspond also to onestate deterministic pushdown transducers. Our algorithm wo...

Kim, C. and D.H. Lee, Separating k-separated eNCE graph languages, Theoretical Computer Science 120 (1993) 247-259. An eNCE graph grammar is k-separated (k > 1) if the distance between any two nonterminal nodes in any of its sentential forms is at least k. Let SEP, denote the class of graph languages generated by SEPl (SEP2) is the class of eNCE (boundar E) graph languages, Recently, Engelfriet...

This paper proposes a novel method for long distance, clause-level reordering in statistical machine translation (SMT). The proposed method separately translates clauses in the source sentence and reconstructs the target sentence using the clause translations with non-terminals. The nonterminals are placeholders of embedded clauses, by which we reduce complicated clause-level reordering into si...

This paper describes The Vocal Augmentation and Manipulation Prosthesis (VAMP) a gesture-based wearable controller for live-time vocal performance. This controller allows a singer to capture and manipulate single notes that he or she sings, using a gestural vocabulary developed from that of choral conducting. By drawing from a familiar gestural vocabulary, this controller and the associated map...