Reasoning algebraically about probabilistic loops

Back and von Wright have developed algebraic laws for reasoning about loops in the refinement calculus. We extend their work to reasoning about probabilistic loops in the probabilistic refinement calculus. We apply our algebraic reasoning to derive transformation rules for probabilistic action systems. In particular we focus on developing data refinement rules for probabilistic action systems. Our extension is interesting since some well known transformation rules that are applicable to standard programs are not applicable to probabilistic ones: we identify some of these important differences and we develop alternative rules where possible. In particular, our probabilistic action system data refinement rules are new.

Refining exceptions using King and Morgan's exit construct

In this paper we discuss the refinement of exceptions. We extend the Guarded Command Language normally used in the refinement calculus, with a simple exception handling statement, which we model using King and Morgan's exit statement (1995). We derive some variants of King and Morgan's refinement laws for their exit statement, and illustrate the approach with an example of a refinement of a simple program.

A computational algorithm for the verification of tautologies in propositional calculus

A computational algorithm (based on Smullyan's analytic tableau method) that varifies whether a given well-formed formula in propositional calculus is a tautology or not has been implemented on a DEC system 10. The stepwise refinement approch of program development used for this implementation forms the subject matter of this paper. The top-down design has resulted in a modular and reliable program package. This computational algoritlhm compares favourably with the algorithm based on the well-known resolution principle used in theorem provers.

Linear temporal logic and z refinement

Since Z, being a state-based language, describes a system in terms of its state and potential state changes, it is natural to want to describe properties of a specified system also in terms of its state. One means of doing this is to use Linear Temporal Logic (LTL) in which properties about the state of a system over time can be captured. This, however, raises the question of whether these properties are preserved under refinement. Refinement is observation preserving and the state of a specified system is regarded as internal and, hence, non-observable. In this paper, we investigate this issue by addressing the following questions. Given that a Z specification A is refined by a Z specification C, and that P is a temporal logic property which holds for A, what temporal logic property Q can we deduce holds for C? Furthermore, under what circumstances does the property Q preserve the intended meaning of the property P? The paper answers these questions for LTL, but the approach could also be applied to other temporal logics over states such as CTL and the mgr-calculus.

A semi-local method for iterative depth-map refinement

We present an iterative hierarchical algorithm for multi-view stereo. The algorithm attempts to utilise as much contextual information as is available to compute highly accurate and robust depth maps. There are three novel aspects to the approach: 1) firstly we incrementally improve the depth fidelity as the algorithm progresses through the image pyramid; 2) secondly we show how to incorporate visual hull information (when available) to constrain depth searches; and 3) we show how to simultaneously enforce the consistency of the depth-map by continual comparison with neighbouring depth-maps. We show that this approach produces highly accurate depth-maps and, since it is essentially a local method, is both extremely fast and simple to implement.

An examination of the factorial invariance and refinement of the multidimensional school anger inventory for five Pacific Rim countries

The validity of the Multidimensional School Anger Inventory (MSAI) was examined with adolescents from 5 Pacific Rim countries (N ¼ 3,181 adolescents; age, M ¼ 14.8 years; 52% females). Confirmatory factor analyses examined configural invariance for the MSAI’s anger experience, hostility, destructive expression, and anger coping subscales. The model did not converge for Peruvian students. Using the top 4 loaded items for anger experience, hostility, and destructive expression configural invariance and partial metric and scalar invariances were found. Latent means analysis compared mean responses on each subscale to the U.S. sample. Students from other countries showed higher mean responses on the anger experience subscale (ds ¼ .37–.73). Australian (d ¼ .40) and Japanese students (d ¼ .21) had significantly higher mean hostility subscale scores. Australian students had higher mean scores on the destructive expression subscale (d ¼ .30), whereas Japanese students had lower mean scores (d ¼ 2.17). The largest latent mean gender differences (females lower than males) were for destructive expression among Australian (d ¼ 2.67), Guatemalan (d ¼ 2.42), and U.S. (d ¼ 2.66) students. This study supported an abbreviated, 12-item MSAI with partial invariance. Implications for the use of the MSAI in comparative research are discussed.

Modeling obligations with event-calculus

Time plays an important role in norms. In this paper we start from our previously proposed classification of obligations, and point out some shortcomings of Event Calculus (EC) to represent obligations. We proposed an extension of EC that avoids such shortcomings and we show how to use it to model the various types of obligations.

Selective involvement of TIMP-2 in the second activational cleavage of pro-MMP-2 : refinement of the pro-MMP-2 activation mechanism

A tissue inhibitor of metalloproteinases-2 (TIMP-2)-independent mechanism for generating the first activational cleavage of pro-matrix metalloproteinase-2 (MMP-2) was identified in membrane type-1 MMP (MT1-MMP)-transfected MCF-7 cells and confirmed in TIMP-2-deficient fibroblasts. In contrast, the second MMP-2-activational step was found to be TIMP-2 dependent in both systems. MMP-2 hemopexin C-terminal domain was found to be critical for the first step processing, confirming a need for membrane tethering. We propose that the intermediate species of MMP-2 forms the well-established trimolecular complex (MT1-MMP/TIMP-2/MMP-2) for further TIMP-2-dependent autocatalytic cleavage to the fully active species. This alternate mechanism may supplement the traditional TIMP-2-mediated first step mechanism.