Partial evaluation, also known as automatic specialization, is a particular collection of techniques for improving the performance of an application. With clear benefits, but unclear implementation up until now, partial evaluation is little used in current computing practice. This soon will change. Presented here is partial execution, an alternative to symbolic evaluation the technique driving ...

Sketching is a natural way of input that provides an effective means of illustration. A sketch consists of multiple strokes that can be captured by pen-based devices to be stored in a database for future retrieval. In our prior work, we proposed a sketch retrieval method that is suitable for whole matching. However, the problem gets complicated if the retrieval is performed for partially matche...

Let ‖ · ‖ denote the distance to the nearest integer and, for a prime number p, let | · |p denote the p-adic absolute value. In 2004, de Mathan and Teulié asked whether infq≥1 q · ‖qα‖ · |q|p = 0 holds for every badly approximable real number α and every prime number p. Among other results, we establish that, if the complexity of the sequence of partial quotients of a real number α grows too ra...

Definition 1.6. Preemption-bound persistent sets. A set T ⊆ T of transitions enabled in a state s = final(S) is preemption-bound persistent in s iff for all nonempty sequences α of transitions from s in AG(Pb,c) such that ∀i ∈ dom(α), αi 6∈ T and for all t ∈ T , 1. Pb(S.t) ≤ Pb(S.α1) 2. if Pb(S.t) < Pb(S.α1), then t↔ last(α) and t↔ next(final(S.α), last(α).tid) 3. if Pb(S.t) = Pb(S.α1), then ex...

Two features common to many auctions are the use of reserve prices and the existence of secondary markets for the goods being sold. Even in simple symmetric settings, the combination of these features can preclude existence of an equilibrium in symmetric separating bidding strategies. With a reserve price sufficiently far below the maximum (endogenous) valuation, a symmetric equilibrium still e...

We examine the designs produced by different types of difference families. Difference families have long been known to produce designs with well behaved automorphism groups. These designs provide the elegant solutions desired for applications. In this work, we explore the following question: Does every (named) design have a difference family analogue? We answer this question in the affirmative ...

Retrieving multiple cases is supposed to be an adequate retrieval strategy for guiding partial-order planners because of the recognized exibility of these planners to interleave steps in the plans. Cases are combined by merging them. In this paper, we will examine two different kinds of merging cases in the context of partial-order planning. We will see that merging cases can be very diicult if...

Conditions of information independence are important in information economics and game theory. We present notions of partial independence in Bayesian environments, and study their relationships to notions of common knowledge.

Starting from the Kac–Moody structure of the WZNW model for SL(2, R) and using the general canonical formalism, we formulate a gauge theory invariant under local SL(2, R)× SL(2, R) and diffeomorphisms. This theory represents a gauge extension of the WZNW system, defined by a difference of two simple WZNW actions. By performing a partial gauge fixing and integrating out some dynamical variables,...

It is well known that some of the most basic properties of words, like the commutativity (xy = yx) and the conjugacy (xz = zy), can be expressed as solutions of word equations. An important problem is to decide whether or not a given equation on words has a solution. For instance, the equation xmyn = zp has only periodic solutions in a free monoid, that is, if xmyn = zp holds with integers m,n,...