Bovet, Crescenzi, and Silvestri ( 1992, 1995), and independently Vereshchagin ( 1994), showed that many complexity classes in the polynomial time setting are leaf language classes, i.e. classes which are determined by two disjoint languages. They gave many examples but they did not characterize the set of leaf language classes. This will be done in &his paper. It will be shown that the set of l...

We have built two tools for dynamically verifying MPI programs – one called ISP and the other called DMA. Both these tools are aimed at formally analyzing the executions of an MPI programs by running executions, analyzing the actual MPI operation dependencies that manifest, and rerunning executions to cover the dependency space. ISP implements an MPI-specific dynamic partial order reduction alg...

The fundamental limits for detection and characterization of fluorescent (phosphorescent) inhomogeneities embedded in tissuelike highly scattering turbid media are investigated. The absorption and fluorescence contrast introduced by exogenous fluorophores are also compared. Both analyses are based on practical signal-to-noise ratio considerations. For an object with fivefold fluorophore concent...

Launched before the atomic hypothesis took hold, elasticity theory is a spectacular achievement. A continuum-level description, it provides a powerful toolkit for determining how architecturally simple solids such as crystals respond macroscopically to stress, whilst encoding microscopic, atomic-realm details parsimoniously, via a few parameters. Solids that are architecturally complex at the a...

Allosteric RNA devices are increasingly being viewed as important tools capable of monitoring enzyme evolution, optimizing engineered metabolic pathways, facilitating gene discovery and regulators of nucleic acid-based therapeutics. A key bottleneck in the development of these platforms is the availability of small-molecule-binding RNA aptamers that robustly function in the cellular environment...

We develop a practical approach to querying temporal data stored in temporal SQL:2011 databases through the semantic layer of OWL 2 QL ontologies. An interval-based temporal query language (TQL), which we propose for this task, is defined via naturally characterizable combinations of temporal logic with conjunctive queries. This foundation warrants well-defined semantics and formal properties o...

We consider the Rosenfeld-Gröbner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials F , let M(F ) be the sum of maximal orders of differential indeterminates occurring in F . We propose a modification of the Rosenfeld-Gröbner algorithm, in whi...

In this paper we extend the work by Michaelis (1999) which shows how to encode an arbitrary Minimalist Grammar in the sense of Stabler (1997) into a weakly equivalent multiple contextfree grammar (MCFG). By viewing MCFG rules as terms in a free Lawvere theory we can translate a given MCFG into a regular tree grammar. The latter is characterizable by both a tree automaton and a corresponding for...