Shallow semantic analyzers, such as semantic role labeling and sense tagging, are increasing in accuracy and becoming commonplace. However, they only provide limited and local representations of local words and individual predicate-argument structures. This talk will address some of the current challenges in producing deeper, connected representations of eventualities. Available resources, such...

We show how the dependency pair approach, commonly used to modularize termination proofs of rewrite systems, can be adapted to establish termination of recursive functions in a system like Isabelle/HOL or Coq. It turns out that all that is required are two simple lemmas about wellfoundedness.

We consider the problem of verifying finite state properties of shallow programs; i.e., programs where pointers from program variables to heap-allocated objects are allowed, but where heap-allocated objects may not themselves contain pointers. We prove a number of results relating the complexity of such verification problems to the nature of the finite state machine used to specify the property...

We present a formalization of dependency labeling with Integer Linear Programming. We focus on the integration of subcategorization into the decision making process, where the various subcategorization frames of a verb compete with each other. A maximum entropy model provides the weights for ILP optimization.

This paper deals with violent discontinuities in shallow water flows with large Froude number F . On a horizontal base, the paradigm problem is that of the impact of two fluid layers in situations where the flow can be modelled as two smooth regions joined by a singularity in the flow field. Within the framework of shallow water theory we show that, over a certain timescale, this discontinuity ...

We show that delaying fully-expansive proof reconstruction for non-interactive decision procedures can result in a more efficient workflow. In contrast with earlier work, our approach to postponed proof does not require making deep changes to the theorem prover.

Figure 1. Breakdown of the memory performance for the declarative and implicit tasks. left panel: Subjects having undergone sleep manipulation show a significantly reduced number of true positive responses and an increase in the false negative responses (forgotten items). The absence of differences in the true negative and false positive categories indicates that the memory performance after sh...

The IRAC shallow survey covers 8.5⊓⊔ in the NOAO Deep Wide-Field Survey in Boötes with 3 or more 30 second exposures per position. An overview of the survey design, reduction, calibration, star-galaxy separation, and initial results is provided. The survey includes ≈ 370, 000, 280,000, 38,000, and 34,000 sources brighter than the 5σ limits of 6.4, 8.8, 51, and 50 μJy at 3.6, 4.5, 5.8, and 8 μm ...

We propose a new method for hierarchical clustering based on the optimisation of a cost function over trees of limited depth, and we derive a message–passing method that allows to solve it efficiently. The method and algorithm can be interpreted as a natural interpolation between two well-known approaches, namely single linkage and the recently presented Affinity Propagation. We analyze with th...

Most field-based approaches that address runoff generation questions have been conducted in steep landscapes with shallow soils. Runoff generation processes in low relief landscapes with deep soils remain less understood. We addressed this by characterizing dominant runoff generating flow paths by monitoring the timing and magnitude of precipitation, runoff, shallow soil moisture, and shallow a...