Termination of real-time programs: Definitely, definitely not, or maybe

Real-time control programs are often used in contexts where (conceptually) they run forever. Repetitions within such programs (or their specifications) may either (i) be guaranteed to terminate, (ii) be guaranteed to never terminate (loop forever), or (iii) may possibly terminate. In dealing with real-time programs and their specifications, we need to be able to represent these possibilities, and define suitable refinement orderings. A refinement ordering based on Dijkstra's weakest precondition only copes with the first alternative. Weakest liberal preconditions allow one to constrain behaviour provided the program terminates, which copes with the third alternative to some extent. However, neither of these handles the case when a program does not terminate. To handle this case a refinement ordering based on relational semantics can be used. In this paper we explore these issues and the definition of loops for real-time programs as well as corresponding refinement laws.

A theory for execution-time derivation in real-time programs

We provide an abstract command language for real-time programs and outline how a partial correctness semantics can be used to compute execution times. The notions of a timed command, refinement of a timed command, the command traversal condition, and the worst-case and best-case execution time of a command are formally introduced and investigated with the help of an underlying weakest liberal precondition semantics. The central result is a theory for the computation of worst-case and best-case execution times from the underlying semantics based on supremum and infimum calculations. The framework is applied to the analysis of a message transmitter program and its implementation. (c) 2005 Elsevier B.V. All rights reserved.

Towards a refinement calculus for concurrent real-time programs

We define a language and a predicative semantics to model concurrent real-time programs. We consider different communication paradigms between the concurrent components of a program: communication via shared variables and asynchronous message passing (for different models of channels). The semantics is the basis for a refinement calculus to derive machine-independent concurrent real-time programs from specifications. We give some examples of refinement laws that deal with concurrency.

Reasoning about deadlines in concurrent real-time programs

We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We divide the analysis into a machine-independent and a machine-dependent task. The latter takes into account the execution times of the program on a particular machine. Therefore, our goal is to make the machine-dependent phase of the analysis as simple as possible. We succeed in the sense that the machine-dependent phase remains the same as in the analysis of sequential programs. We shift the complexity introduced by concurrency completely to the machine-independent phase.

Procedures and parameters in the real-time program refinement calculus

The real-time refinement calculus is a formal method for the systematic derivation of real-time programs from real-time specifications in a style similar to the non-real-time refinement calculi of Back and Morgan. In this paper we extend the real-time refinement calculus with procedures and provide refinement rules for refining real-time specifications to procedure calls. A real-time specification can include constraints on, not only what outputs are produced, but also when they are produced. The derived programs can also include time constraints oil when certain points in the program must be reached; these are expressed in the form of deadline commands. Such programs are machine independent. An important consequence of the approach taken is that, not only are the specifications machine independent, but the whole refinement process is machine independent. To implement the machine independent code on a target machine one has a separate task of showing that the compiled machine code will reach all its deadlines before they expire. For real-time programs, externally observable input and output variables are essential. These differ from local variables in that their values are observable over the duration of the execution of the program. Hence procedures require input and output parameter mechanisms that are references to the actual parameters so that changes to external inputs are observable within the procedure and changes to output parameters are externally observable. In addition, we allow value and result parameters. These may be auxiliary parameters, which are used for reasoning about the correctness of real-time programs as well as in the expression of timing deadlines, but do not lead to any code being generated for them by a compiler. (c) 2006 Elsevier B.V. All rights reserved.

The real-time refinement calculus: A foundation for machine-independent real-time programming

The real-time refinement calculus is an extension of the standard refinement calculus in which programs are developed from a precondition plus post-condition style of specification. In addition to adapting standard refinement rules to be valid in the real-time context, specific rules are required for the timing constructs such as delays and deadlines. Because many real-time programs may be nonterminating, a further extension is to allow nonterminating repetitions. A real-time specification constrains not only what values should be output, but when they should be output. Hence for a program to implement such a specification, it must guarantee to output values by the specified times. With standard programming languages such guarantees cannot be made without taking into account the timing characteristics of the implementation of the program on a particular machine. To avoid having to consider such details during the refinement process, we have extended our real-time programming language with a deadline command. The deadline command takes no time to execute and always guarantees to meet the specified time; if the deadline has already passed the deadline command is infeasible (miraculous in Dijkstra's terminology). When such a realtime program is compiled for a particular machine, one needs to ensure that all execution paths leading to a deadline are guaranteed to reach it by the specified time. We consider this checking as part of an extended compilation phase. The addition of the deadline command restores for the real-time language the advantage of machine independence enjoyed by non-real-time programming languages.

Programs as paths: An approach to timing constraint analysis

A program can be decomposed into a set of possible execution paths. These can be described in terms of primitives such as assignments, assumptions and coercions, and composition operators such as sequential composition and nondeterministic choice as well as finitely or infinitely iterated sequential composition. Some of these paths cannot possibly be followed (they are dead or infeasible), and they may or may not terminate. Decomposing programs into paths provides a foundation for analyzing properties of programs. Our motivation is timing constraint analysis of real-time programs, but the same techniques can be applied in other areas such as program testing. In general the set of execution paths for a program is infinite. For timing analysis we would like to decompose a program into a finite set of subpaths that covers all possible execution paths, in the sense that we only have to analyze the subpaths in order to determine suitable timing constraints that cover all execution paths.

Simplifying the molecular mechanisms of human papillomavirus

The human papillomaviruses (HPVs) are associated with several human epithelial diseases. These diseases are confined to cutaneous and mucosal epithelia and comprise papillomas (warts) and benign or malignant neoplasms. Globally, infection by HPVs presents a considerable health problem given that at any one time approximately 10% of the population may have warts of one form or another. Of more serious concern is the prevalence of HPV-associated cervical carcinoma. It is estimated that 500,000 new cases of cervical neoplasia are diagnosed per year (primarily squamous carcinomas). Thus, HPV-associated cancer represents one of the most common cancers afflicting women and is one of the three most common causes of cancer death among women globally.(15) Although some genotypes of human papillomaviruses are clearly associated with the development of cancer (in particular, HPVs 16 and 18) these viruses share significant structural and functional similarity to the nononcogenic genotypes, and one of the puzzles of HPV biology is why essentially similar viruses vary so widely in their oncogenic potential.

Binocular rivalry and the cerebral hemispheres with a note on the correlates and constitution of visual consciousness

In addressing the scientific study of consciousness, Crick and Koch state, "It is probable that at any moment some active neuronal processes in your head correlate with consciousness, while others do not: what is the difference between them?" (1998, p. 97). Evidence from electrophysiological and brain-imaging studies of binocular rivalry supports the premise of this statement and answers to some extent, the question posed. I discuss these recent developments and outline the rationale and experimental evidence for the interhemispheric switch hypothesis of perceptual rivalry. According to this model, the perceptual alternations of rivalry reflect hemispheric alternations, suggesting that visual consciousness of rivalling stimuli may be unihemispheric at any one time (Miller et al., 2000). However, in this paper, I suggest that interhemispheric switching could involve alternating unihemispheric attentional selection of neuronal processes for access to visual consciousness. On this view, visual consciousness during rivalry could be bihemispheric because the processes constitutive of attentional selection may be distinct from those constitutive of visual consciousness. This is a special case of the important distinction between the neuronal correlates and constitution of visual consciousness.

Service guarantees: A strategic mechanism to minimise customers' perceived risk in service organisations

Service offerings are largely intangible in nature. Customers are thus unable to assess the purchase outcome prior to experience, rendering the risk of possible customer dissatisfaction very high. It is argued that the concept of service guarantees proposed by services management theory can be effectively utilised to reduce the perceived risk of dissatisfaction for the customer in service organisations. Additionally, it is suggested that service guarantees force management to undertake activities which elevate the superiority of the organisation in the eyes of the customer and, thus, the opportunity to transform one-time customers into loyal ones. The purpose of this paper is twofold: first, to illustrate how customers’ behavioural intentions can be influenced by the use of a service guarantee; and second, to outline a systematic process that can help service business managers to develop and implement an effective service guarantee. This research highlights the numerous benefits available to service organisations by utilising the service guarantee as a strategic tool. Some of the important management implications are also outlined.

Repeated blood pressure measurements in a sample of Swedish twins: heritabilities and associations with polymorphisms in the renin-angiotensin-aldosterone system Iliadou, Anastasia, Lichtenstein, Paul, Morgenstern, Ralf, Forsberg, Lena, Svensson, Richard, de Faire, Ulf, Martin, Nicholas, Pedersen, Nancy

Background Twin and family studies have shown that genetic effects explain a relatively high amount of the phenotypic variation in blood pressure. However, many studies have not been able to replicate findings of association between specific polymorphisms and diastolic and systolic blood pressure. Methods In a structural equation-modelling framework the authors investigated longitudinal changes in repeated measures of blood pressures in a sample of 298 like-sexed twin pairs from the population-based Swedish Twin Registry. Also examined was the association between blood pressure and polymorphisms in the angiotensin-I converting enzyme and the angiotensin 11 receptor type 1 with the 'Fulker' test Both linkage and association were tested simultaneously revealing whether the polymorphism is a Quantitative Trait Locus (QTL) or in linkage disequilibrium with the QTL. Results Genetic influences explained up to 46% of the phenotypic variance in diastolic and 63% of the phenotypic variance in systolic blood pressure. Genetic influences were stable over time and contributed up to 78% of the phenotypic correlation in both diastolic and systolic blood pressure. Non-shared environmental effects were characterised by time specific influences and little transmission from one time point to the next. There was no significant linkage and association between the polymorphisms and blood pressure. Conclusions There is a considerable genetic stability in both diastolic and systolic blood pressure for a 6-year period of time in adult life. Non-shared environmental influences have a small long-term effect Although associations with the polymorphisms could not be replicated, results should be interpreted with caution due to power considerations. (C) 2002 Lippincott Williams Wilkins.

Distribution and abundance of dugongs in Moreton Bay, Queensland, Australia

Dugong abundances in Moreton Bay (south-east Queensland) were estimated during six bi- monthly aerial surveys throughout 1995. Sampling intensity ranged between 20 and 80% for different sampling zones within the Bay, with a mean intensity of 40.5%. Population estimates for dugongs were corrected for perception bias ( the proportion of animals visible in the transect that were missed by observers), and standardised for availability bias ( the proportion of animals that were invisible due to water turbidity) with survey and species-specific correction factors. Population estimates for dugongs in Moreton Bay ranged from 503 +/- 64 (s.e.) in July to 1019 +/- 166 in January. The highest uncorrected count was 857 dugongs in December. This is greater than previous population estimates, suggesting that either previous surveys have underestimated abundance and/or that this population may have increased through recruitment, immigration, or a combination of both. The high degree of variation in population estimates between surveys may be due to temporal differences in distribution and herding behaviour. In winter, dugongs were found in smaller herds and were dispersed over a wider area than in summer. The Eastern Banks region of the bay supported 80 - 98% of the dugong population at any one time. Within this region, there were several dugong 'hot spots' that were visited repeatedly by large herds. These 'hot spots' contained seagrass communities that were dominated by species that dugongs prefer to eat. The waters of Rous Channel, South Passage and nearby oceanic waters are also frequently inhabited by dugongs in the winter months. Dugongs in other parts of Moreton Bay were at much lower densities than on the Eastern Banks.

Using quantity/intensity relationships to assess the potential for ammonium leaching in a Vertosol

High concentrations of ammonium (up to 0.1 cmol/kg) have been observed below 1 m depth in a Vertosol soil near Warra in south-eastern Queensland. This study examined whether ammonium leaching could be responsible for the ammonium accumulation observed in the Warra soil. This was done by using quantity/intensity (Q/I) relationships to compare the ammonium retention capacity of the Warra soil with other similar soils throughout the region that did not contain elevated subsoil ammonium concentrations. Analysis of Q/I curves revealed that in the concentration range studied, the amount of ammonium retained on high affinity adsorption sites in all 3 soils was low, and the Warra soil was not significantly different from the other 2 soils. The ability of the soils to retain ammonium in the soil solution against leaching [i.e. their potential buffer capacity (PBC)] did differ between soils and was greatest at Warra. This indicates that at any one time the Warra soil holds more ammonium on the exchange complex and less in solution than the other soils examined. It was concluded that ammonium is no more likely to leach through the surface horizons of the Warra soil than the other soils examined. Indeed, the data indicated that the Warra soil probably has greater capacity to retain ammonium against leaching due to its greater PBC. Consequently, it is considered unlikely that leaching of ammonium has been a major contributor to the subsoil ammonium concentrations at Warra.

Searching oligo sets of human chromosome 12 using evolutionary strategies

DNA Microarray is a powerful tool to measure the level of a mixed population of nucleic acids at one time, which has great impact in many aspects of life sciences research. In order to distinguish nucleic acids with very similar composition by hybridization, it is necessary to design microarray probes with high specificities and sensitivities. Highly specific probes correspond to probes having unique DNA sequences; whereas highly sensitive probes correspond to those with melting temperature within a desired range and having no secondary structure. The selection of these probes from a set of functional DNA sequences (exons) constitutes a computationally expensive discrete non-linear search problem. We delegate the search task to a simple yet effective Evolution Strategy algorithm. The computational efficiency is also greatly improved by making use of an available bioinformatics tool.

Geodesics without differential equations: general relativistic calculations for introductory modern physics classes

Introductory courses covering modem physics sometimes introduce some elementary ideas from general relativity, though the idea of a geodesic is generally limited to shortest Euclidean length on a curved surface of two spatial dimensions rather than extremal aging in spacetime. It is shown that Epstein charts provide a simple geometric picture of geodesics in one space and one time dimension and that for a hypothetical uniform gravitational field, geodesics are straight lines on a planar diagram. This means that the properties of geodesics in a uniform field can be calculated with only a knowledge of elementary geometry and trigonometry, thus making the calculation of some basic results of general relativity accessible to students even in an algebra-based survey course on physics.