R. Boulton & P. Jackson, eds., 14 International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2001), LNAI 2152, pp. 105–120, c ©Springer Verlag, 2001. Abstract. We describe a generic switching protocol for the construction of hybrid protocols and prove it correct with the Nuprl proof development system. For this purpose we introduce the concept of metaproperties and use them to f...

However, a weight-of-evidence approach can only work if there is fill disclosure of industrygenerated unpublished studies. In order to obtain scientific consensus on such matters, we propose that technical reviews of unpublished industry data be carried out by scientists and other technical experts working under the aegis of institutions such as the National Academy of Sciences, the Health Effe...

The Fréchet distance is a metric to compare two curves, which is based on monotonous matchings between these curves. We call a matching that results in the Fréchet distance a Fréchet matching. There are often many different Fréchet matchings and not all of these capture the similarity between the curves well. We propose to restrict the set of Fréchet matchings to “natural” matchings and to this...

Intuitively, a class of functions is robustly learnable if not only the class itself, but also all of the transformations of the class under natural transformations (such as via general recursive operators) are learnable. Fulk [Ful90] showed the existence of a non-trivial class which is robustly learnable under the criterion Ex. However, several of the hierarchies (such as the anomaly hierarchi...

We clarify the existence of two different types of truncations of the field content in a theory, the consistency of each type being achieved by different means. A proof is given of the conditions to have a consistent truncation in the case of dimensional reductions induced by independent Killing vectors. We explain in what sense the tracelessness condition found by Scherk and Scharwz is not onl...

we consider   bivariate  mean-value interpolationproblem, where the integrals over circles are interpolation data. in this case the problem  is described  over   circles of the same radius and with  centers are on astraight line and it is shown that in this case the interpolation is not correct.

We propose a novel Reinforcement Learning (RL) algorithm to synthesize policies for a Markov Decision Process (MDP), such that a linear time property is satisfied. We convert the property into a Limit Deterministic Büchi Automaton (LDBA), then construct a product MDP between the automaton and the original MDP. A reward function is then assigned to the states of the product automaton, according ...

A challenge to conventional thinking has been met and answered by two new articles in this issue. Hua et al. (page 1035< / A r t R e f >) and Paladino et al. (page < A r t R e f v o l = " 1 7 2 " I s s = " 7 " > 1023< / A r t R e f >) have imaged live three-dimensional cells to reaffi rm that a class of proteins takes a direct route to the apical membrane. The suggestion that GPI-linked apical ...

This paper presents a formal approach to correctly generate an architecture level model of a system from its specification model. We define the notion of equivalence of models based on their execution semantics. A formalism is then presented, which can be used to model systems and perform correct transformations on them. Architecture refinement is described, as a sequence of such transformation...

Extended Abstract 1 Introduction A program schema is an abstraction of a class of actual programs, in the sense that it represents their data-ow and control-ow, but does not contain (all) their actual computations or (all) their actual data structures. Program schemas have been shown to be useful in a variety of applications, such as proving properties of programs, teaching programming to novic...