We study the behavior of Stanley decompositions and of pretty clean filtrations under reduction modulo a regular element.

A corpus of inference rules between a pair of relation phrases is typically generated using the statistical overlap of argument-pairs associated with the relations (e.g., PATTY, CLEAN). We investigate knowledge-guided linguistic rewrites as a secondary source of evidence and find that they can vastly improve the quality of inference rule corpora, obtaining 27 to 33 point precision improvement w...

Recently Acemolgu, Aghion, Bursztyn and Hemous (AER 2012) formulated a model in which a high macroeconomic elasticity of substitution between clean and dirty production represents a crucial condition for green growth. Until now it has never been systematically estimated. Using a novel panel of cross-country sectoral data, we formulate specifications of nested CES production functions that allow...

Cosmic shear offers a remarkbly clean way to measure the equation of state of the Universe and its evolution. Resolution over a wide field is paramount, and Antarctica offers unique possibilities in this respect. There is an order of magnitude gain in speed over temperate sites, or a factor three in surface density. This means that PILOT outperforms much larger telescopes elsewhere, and can com...

In synchronous networks, protocols can achieve security guarantees that are not possible in an asynchronous world: i.e., they can simultaneously achieve input completeness (all honest parties’ inputs are included in the computation) and guaranteed termination (honest parties do not “hang” indefinitely). In practice truly synchronous networks rarely exist, but synchrony can be emulated if channe...

When programs communicate with other programs, exibil-ity is demanded. Programs do not necessarily have information about each other. When assigning types to these communications a certain amount of dynamic typing is unavoidable. But we do not want our entire language to become dynamically typed, and consequently an interface between the statically and dynamically typed parts of the program has...

In a pure functional language like Clean the values of the functional variables are constants; variables of functional programs do not change in time. Hence it seems that temporality has no meaning in functional programs. However, in certain cases (e.g. in interactive or distributed programs, or in ones that use IO) we would like to consider a series of values computed from each other as differ...