The object of the present work is the analysis of the convergence behaviour of a learning algorithm for grammars belonging to a special version – the maximum entropy version – of stochastic Optimality Theory. Stochastic Optimality Theory is like its deterministic predecessor, namely Optimality Theory as introduced by Prince and Smolensky, in that both are theories of universal grammar in the se...

The SU(3) and hyperfine mass splittings of mesons containing a single heavy quark are computed to one-loop order in chiral perturbation theory with heavy quark spin symmetry. Electromagnetic contributions of order αem are included. The observed values of the mass splittings are consistent with the one-loop chiral perturbation theory calculation. The d− u hyperfine splitting (D∗+ −D)− (D∗0 −D) i...

Age replacement of technical units has received much attention in the reliability literature over the last four decades. Mostly, the failure time distribution for the units is assumed to be known, and minimal costs per unit of time is used as optimality criterion, where renewal reward theory simplifies the mathematics involved but requires the assumption that the same process and replacement st...

A sufficient condition is given that a certain drawing minimizes the crossing number. The condition is in terms of intersections in an arbitrary set system related to the drawing, and is like a correlation inequality.

The graph realization problem is to find for given nonnegative integers a1, . . . , an a simple graph (no loops or multiple edges) such that each vertex vi has degree ai. Given pairs of nonnegative integers (a1, b1), . . . , (an, bn), (i) the bipartite realization problem ask whether there is a bipartite graph (no loops or multiple edges) such that vectors (a1, ..., an) and (b1, ..., bn) corres...

Before we discuss the details of the Bayesian detection, let us take a quick tour about the overall framework to detect (or classify) an object in practice. In the Bayesian setting, we model observations as random samples drawn from some probability distributions. The classification process usually involves extracting features from the observations, and a decision rule that satisfies certain op...

The purpose of this paper is to reconsider the phonology of English nasal-final prefixes within the framework of Optimality Theory, especially making use of a relation of correspondence. In this paper, I show that compared with previous analyses employing rules and their extrinsic orderings, a constraint-based approach can give a better account of the phenomenon. In order to do this, following ...

In various settings time consistency in dynamic programming has been addressed by many authors going all the way back to original developments by Richard Bellman. The basic idea of the involved dynamic principle is that a policy designed at the first stage, before observing realizations of the random data, should not be changed at the later stages of the decision process. This is a rather vague...