Nominal logic is a variant of first-order logic which provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values considered so far). Previous attempts have been made to develop convenient rules for reasoning with the new-quantifier, but we argue that none of these...

We provide a new technique to derive group strategyproof mechanisms for the cost-sharing problem. Our technique is simpler and provably more powerful than the existing one based on so called crossmonotonic cost-sharing methods given by Moulin and Shenker [1997]. Indeed, our method yields the first polynomial-time mechanism for the Steiner tree game which is group strategyproof, budget balance a...

In recent years Laura Kallmeyer, Maribel Romero, and their collaborators have led research on TAG semantics through a series of papers refining a system of TAG semantics computation. Kallmeyer and Romero bring together the lessons of these attempts with a set of desirable properties that such a system should have. First, computation of the semantics of a sentence should rely only on the relatio...

This paper provides the best bounds to date on the number of randomly sampled entries required to reconstruct an unknown low rank matrix. These results improve on prior work by Candès and Recht [3], Candès and Tao [6], and Keshavan, Montanari, and Oh [13]. The reconstruction is accomplished by minimizing the nuclear norm, or sum of the singular values, of the hidden matrix subject to agreement ...

Let P be a set of n points embedded in the plane, and let C be the complete Euclidean graph whose point-set is P. Each edge in C between two points p, q is realized as the line segment [pq], and is assigned a weight equal to the Euclidean distance |pq|. In this paper, we show how to construct inO(n lgn) time a plane spanner of C of maximum degree at most 4 and of stretch factor at most 20. This...

The completely bounded trace and spectral norms, for finite-dimensional spaces, are known to be efficiently expressible by semidefinite programs (J. Watrous, Theory of Computing 5: 11, 2009). This paper presents two new, and arguably simpler, semidefinite programming formulations of these norms.

A simple proof for the Shannon coding theorem, using only the Markov inequality, is presented. The technique is useful for didactic purposes, since it does not require many preliminaries and the information density and mutual information follow naturally in the proof. It may also be applicable to situations where typicality is not natural.

The complexity of models used for or considered for use in genetic evaluation is increasing. Examples of new models are test-day models in dairy cattle, growth models in beef cattle, and models with dominance or/and QTL effects. These models are usually linear but analyses of some traits may require nonlinear models, which are usually more complicated to write and test. More complicated models ...

A new tool for writing platform-independent optimized QCD code, QA 0 , is described. Performance of a Möbius Domain Wall Fermion inverter written with qa0 on several platforms is presented .

A miracle of evolution, the human immune system is not controlled by any central organ.... Rather it has developed to function as a kind of biologic democracy, wherein the individual members achieve their ends through an information network of awesome scope. the University of Zimbabwe in Harare have good news for women in developing nations. According to an article published in the 13 March 199...