Universal quantifiers occur frequently in proof obligations produced by program verifiers, for instance, to axiomatize uninterpreted functions and statically express properties of arrays. SMT-based verifiers typically reason about them via E-matching, an SMT algorithm that requires syntactic matching patterns guide the quantifier instantiations. Devising good is challenging. In particular, over...

The ever increasing emphasis on complex reporting guidelines is getting in the way of designing and conducting good clinical trials, say Jeremy Howick, Rebecca Webster, J André Knottnerus. But David Moher argues that, while following can be frustrating, such complexity remains necessary improving research, not impeding it

An important open problem in molecular biology is how to use computational methods to understand the structure and function of proteins given only their primary sequences. We describe and evaluate an original machine-learning approach to classifying protein sequences according to their structural folding class. Our work is novel in several respects: we use a set of protein classes that previous...

Figure 1: The user queries for the all the parents of the file file.txt. PQLite responds with all prove-nance objects that influence file.txt. PQLite, unlike SQL-like languages, has the ability to query paths. The file query2.txt has the query: SELECT r FROM Graph r WHERE r.child = " /file.txt " .

In this paper, we describe the range of sentences that we synthesize from a knowledge base (KB) using a natural language generation (NLG) system. We give an overview of our NLG system, and then focus on the specific challenge in handling overly general classes such as Tangible-Entity and Physical-Object. Such classes are unavoidable in the KB, and it is undesirable to show them in an output for...

This paper examines an anaphoric construction, British English do, and locates it within the dichotomy in the ellipsis literature between deleted phrases and null pro-forms, concluding that the choice is a false one, in that pro-forms involve deletion as well; the question, then, is how to account for the differential permeability to dependencies that require external licensing of the various d...

The Generalized Born (GB) continuum solvent model is arguably the most widely used implicit solvent model in protein folding and protein structure prediction simulations; however, it still remains an open question on how well the model behaves in these large-scale simulations. The current study uses the beta-hairpin from C-terminus of protein G as an example to explore the folding free energy l...