Timing analysis of assembler code control-flow paths

Timinganalysis of assembler code is essential to achieve the strongest possible guarantee of correctness for safety-critical, real-time software. Previous work has shown how timingconstrain ts on controlflow paths through high-level language programs can be formalised using the semantics of the statements comprisingthe path. We extend these results to assembler-level code where it becomes possible to not only determine timingconstrain ts, but also to verify them against the known execution times for each instruction. A minimal formal model is developed with both a weakest liberal precondition and a strongest postcondition semantics. However, despite the formalism’s simplicity, it is shown that complex timingb ehaviour associated with instruction pipeliningand iterative code can be modelled accurately.

Hitting a moving target: Perception and action in the timing of rapid interceptions

Different interceptive tasks and modes of interception (hitting or capturing) do not necessarily involve similar control processes. Control based on preprogramming of movement parameters is possible for actions with brief movement times but is now widely rejected; continuous perceptuomotor control models are preferred for all types of interception. The rejection of preprogrammed control and acceptance of continuous control is evaluated for the timing of rapidly executed, manual hitting actions. It is shown that a preprogrammed control model is capable of providing a convincing account of observed behavior patterns that avoids many of the arguments that have been raised against it. Prominent continuous perceptual control models are analyzed within a common framework and are shown to be interpretable as feedback control strategies. Although these models can explain observations of on-line adjustments to movement, they offer only post hoc explanations for observed behavior patterns in hitting tasks and are not directly supported by data. It is proposed that rapid manual hitting tasks make up a class of interceptions for which a preprogrammed strategy is adopted-a strategy that minimizes the role of visual feedback. Such a strategy is effective when the task demands a high degree of temporal accuracy.

Theory manual to OctVCE – a cartesian cell CFD code with special application to blast wave problems, Department of Mechanical Engineering Report 2007/12

OctVCE is a cartesian cell CFD code produced especially for numerical simulations of shock and blast wave interactions with complex geometries, in particular, from explosions. Virtual Cell Embedding (VCE) was chosen as its cartesian cell kernel for its simplicity and sufficiency for practical engineering design problems. The code uses a finite-volume formulation of the unsteady Euler equations with a second order explicit Runge-Kutta Godonov (MUSCL) scheme. Gradients are calculated using a least-squares method with a minmod limiter. Flux solvers used are AUSM, AUSMDV and EFM. No fluid-structure coupling or chemical reactions are allowed, but gas models can be perfect gas and JWL or JWLB for the explosive products. This report also describes the code’s ‘octree’ mesh adaptive capability and point-inclusion query procedures for the VCE geometry engine. Finally, some space will also be devoted to describing code parallelization using the shared-memory OpenMP paradigm. The user manual to the code is to be found in the companion report 2007/13.

User guide for shock and blast simulation with the OctVCE code (version 3.5+), Department of Mechanical Engineering Report 2007/13

OctVCE is a cartesian cell CFD code produced especially for numerical simulations of shock and blast wave interactions with complex geometries. Virtual Cell Embedding (VCE) was chosen as its cartesian cell kernel as it is simple to code and sufficient for practical engineering design problems. This also makes the code much more ‘user-friendly’ than structured grid approaches as the gridding process is done automatically. The CFD methodology relies on a finite-volume formulation of the unsteady Euler equations and is solved using a standard explicit Godonov (MUSCL) scheme. Both octree-based adaptive mesh refinement and shared-memory parallel processing capability have also been incorporated. For further details on the theory behind the code, see the companion report 2007/12.

Timing of rotator cuff activation during shoulder external rotation in throwers with and without symptoms of pain

Study Design: Fine-wire EMG rotator cuff onset time analysis in 2 matched groups of throwers with and without pain. Objective: To identify if there is a difference in the activation patterns of the rotator cuff muscles during a rapid shoulder external rotation task between throwers with and without pain. Background: The coordinated action of the rotator cuff is recognized as essential for glenohumeral joint control in the throwing athlete. Identification of abnormalities occurring in muscle activation patterns for injured athletes is relevant when prescribing rehabilitative exercises. Methods and Measures: Twelve throwers with shoulder pain were compared to a matched group of 11 asymptomatic throwers. Participants were matched for age, height, body mass, and habitual activity. Fine-wire EMG electrodes were inserted into the subscapularis, supraspinatus, and infraspinatus. EMG activity was measured during a reaction time task of rapid shoulder external rotation in a seated position. The timing of onset of EMG activity was analyzed in relation to visualization of a light (reaction time) and to the onset of infraspinatus activity (relative latency). Results: In the group with shoulder pain, the onset of subscapularis activity was found to be significantly delayed (reaction time, P = .0018; relative latency, P = .0005) from the onset of infraspinatus activity when compared to the control group. Conclusions: The presence of shoulder pain in these athletes was associated with a difference in the onset of subscapularis EMG activity during a rapid shoulder external rotation movement. This was an initial step in the understanding of the joint protection mechanisms of the glenohumeral joint and the problems that occur in throwers. This information may assist in providing future guidelines for more effective rehabilitation and prevention strategies for this condition.

Timing and duration of the last interglacial inferred from high resolution U-series chronology of stalagmite growth in Southern Hemisphere

High-precision Th-230-U-238 ages for a stalagmite from Newdegate Cave in southern Tasmania, Australia define a rare record of precipitation between 100 and 155 ka before the present. The fastest stalagmite growth occurred between 129.2 +/- 1.6 and 122.1 +/- 2.0 ka (similar to 61.5 mm/ka), coinciding with a time of prolific coral growth from Western Australia (128-122 ka). This is the first high-resolution continental record in the Southern Hemisphere that can be compared and correlated with the marine record. Such correlation shows that in southern Australia the onset of full interglacial sea level and the initiation of highest precipitation on land were synchronous. The stalagmite growth rate between 129.2 and 142.2 ka (similar to 5.9 mm/ka) was lower than that between 142.2 and 154.5 ka (similar to 18.7 mm/ka), implying drier conditions during the Penultimate Deglaciation, despite rising temperature and sea level. This asymmetrical precipitation pattern is caused by latitudinal movement of subtropical highs and an associated Westerly circulation, in response to a changing Equator-to-Pole temperature gradient. Both marine and continental records in Australia strongly suggest that the insolation maximum between 126 and 128 ka at 65 degreesN was directly responsible for the maintenance of full Last Interglacial conditions, although the triggers that initiated Penultimate Deglaciation (at similar to 142 ka) remain unsolved. (C) 2001 Elsevier Science B.V. All rights reserved.

Code-switching in Bangladesh

A survey of hybridization in proper names and commercial signs. CODE-SWITCHING is commonly seen as more typical of the spoken language. But there are some areas of language use, including business names (e.g. restaurants), where foreign proper names, common nouns and sometimes whole phrases are imported into the written language too. These constitute a more stable variety of code-switching than the spontaneous and more unpredictable code-switching in the spoken language.

Timing and magnitude of peak height velocity and peak tissue velocities for early, average, and late maturing boys and girls

Height, weight, and tissue accrual were determined in 60 male and 53 female adolescents measured annually over six years using standard anthropometry and dual-energy X-ray absorptiometry (DXA). Annual velocities were derived, and the ages and magnitudes of peak height and peak tissue velocities were determined using a cubic spline fit to individual data. Individuals were rank ordered on the basis of sex and age at peak height velocity (PHV) and then divided into quartiles: early (lowest quartile), average (middle two quartiles), and late (highest quartile) maturers. Sex- and maturity-related comparisons in ages and magnitudes of peak height and peak tissue velocities were made. Males reached peak velocities significantly later than females for all tissues and had significantly greater magnitudes at peak. The age at PHV was negatively correlated with the magnitude of PHV in both sexes. At a similar maturity point (age at PHV) there were no differences in weight or fat mass among maturity groups in both sexes. Late maturing males, however, accrued more bone mineral and lean mass and were taller at the age of PHV compared to early maturers. Thus, maturational status (early, average, or late maturity) as indicated by age at PHV is inversely related to the magnitude and late maturers for weight and fat mass in boys and girls. Am. J. Hum. Biol. 13:1-8, 2001. (C) 2001 Wiley-Liss, Inc.

Rate and timing of vegetative growth, flowering and fruit development of Persoonia virgata (Proteaceae)

Persoonia virgata R. Br. is harvested from the wild in both its vegetative and flowering stages. There has been no systematic study published on the annual growth cycle and anecdotal reports are conflicting. The growth pattern, flowering and fruit development of P. virgata in its natural habitat was recorded monthly for two consecutive years. The main growth period occurred in late spring-mid-autumn (November-May) when the shrubs were producing little or no fruit. Very few open flowers were observed at the site over the 2 years, with only 6.7 and 12.7% of stems bearing open flowers in January and February 1996, respectively. A second study of flowering on container-grown shrubs showed that individual flowers were open for only 2-5 days, with individual stems taking 3-8.5 weeks to complete flowering. The main fruit growth period occurred from May to September, and in June and July 1996 the total fruit set per stem was 41.6 and 36.1%, respectively. The fruit took at least 6 months to develop during which vegetative growth was minimal. The harvesting of plants in the flowering or fruiting stages removes the annual seed crop, which may reduce regeneration of this obligate seed regenerator and threaten its survival after fire.

Determining when the absolute state complexity of a Hermitian code achieves its DLP bound

Let g be the genus of the Hermitian function field H/F(q)2 and let C-L(D,mQ(infinity)) be a typical Hermitian code of length n. In [Des. Codes Cryptogr., to appear], we determined the dimension/length profile (DLP) lower bound on the state complexity of C-L(D,mQ(infinity)). Here we determine when this lower bound is tight and when it is not. For m less than or equal to n-2/2 or m greater than or equal to n-2/2 + 2g, the DLP lower bounds reach Wolf's upper bound on state complexity and thus are trivially tight. We begin by showing that for about half of the remaining values of m the DLP bounds cannot be tight. In these cases, we give a lower bound on the absolute state complexity of C-L(D,mQ(infinity)), which improves the DLP lower bound. Next we give a good coordinate order for C-L(D,mQ(infinity)). With this good order, the state complexity of C-L(D,mQ(infinity)) achieves its DLP bound (whenever this is possible). This coordinate order also provides an upper bound on the absolute state complexity of C-L(D,mQ(infinity)) (for those values of m for which the DLP bounds cannot be tight). Our bounds on absolute state complexity do not meet for some of these values of m, and this leaves open the question whether our coordinate order is best possible in these cases. A straightforward application of these results is that if C-L(D,mQ(infinity)) is self-dual, then its state complexity (with respect to the lexicographic coordinate order) achieves its DLP bound of n /2 - q(2)/4, and, in particular, so does its absolute state complexity.

Factors influencing paternity success in Antechinus agilis: last-male sperm precedence, timing of mating and genetic compatibility

We describe the patterns of paternity success from laboratory mating experiments conducted in Antechinus agilis, a small size dimorphic carnivorous marsupial (males are larger than females). A previous study found last-male sperm precedence in this species, but they were unable to sample complete Utters, and did not take male size and relatedness into account. We tested whether last-male sperm precedence regardless of male size still holds for complete litters. We explored the relationship between male mating order, male size, timing of mating and relatedness on paternity success. Females were mated with two males of different size with either the large or the small male first, with 1 day rest between the matings. Matings continued for 6 h. in these controlled conditions male size did not have a strong effect on paternity success, but mating order did. Males mating second sired 69.5% of the offspring. Within first mated males, males that mated closer to ovulation sired more offspring, To a lesser degree, variation appeared also to be caused by differences in genetic compatibility of the female and the male, where high levels of allele-sharing resulted in lower paternity success.

A formal model of real-time program compilation

Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from high-level language programs to assembler code, Recent models also incorporate timing properties, but the resulting formalisms are intimidatingly complex. Here we take advantage of a new, simple model of real-time refinement, based on predicate transformer semantics, to present a straightforward compilation formalism that incorporates real-time constraints. (C) 2002 Elsevier Science B.V. All rights reserved.