Linear models of simple cells: Correspondence to real cell responses and space spanning properties

Despite their limitations, linear filter models continue to be used to simulate the receptive field properties of cortical simple cells. For theoreticians interested in large scale models of visual cortex, a family of self-similar filters represents a convenient way in which to characterise simple cells in one basic model. This paper reviews research on the suitability of such models, and goes on to advance biologically motivated reasons for adopting a particular group of models in preference to all others. In particular, the paper describes why the Gabor model, so often used in network simulations, should be dropped in favour of a Cauchy model, both on the grounds of frequency response and mutual filter orthogonality.

Do generalized visual training programmes for sport really work? An experimental investigation

We assessed the effectiveness of two generalized visual training programmes in enhancing visual and motor performance for racquet sports. Forty young participants were assigned equally to groups undertaking visual training using Revien and Gabor's Sports Vision programme (Group 1), visual training using Revien's Eyerobics (Group 2), a placebo condition involving reading (Group 3) and a control condition involving physical practice only (Group 4). Measures of basic visual function and of sport-specific motor performance were obtained from all participants before and immediately after a 4-week training period. Significant pre- to post-training differences were evident on some of the measures; however, these were not group-dependent. Contrary to the claims made by proponents of generalized visual training, we found no evidence that the visual training programmes led to improvements in either vision or motor performance above and beyond those resulting simply from test familiarity.

A real-time PCR assay for the detection of Neisseria gonorrhoeae by LightCycler

The detection of Neisseria gonorrhoeae by the polymerase chain reaction (PCR) is now recognized as a sensitive and specific method of diagnosing infection by the organism. In this Study 152 urine specimens were examined for N. gonorrhoeae by a real-time PCR method using the LightCycler platform and results were compared to an in-house PCR assay using an ELISA-based detection method. N. gonorrhoeae DNA was detected in 29 (19%) specimens by LightCycler PCR (LC-PCR) and in 31 (20%) specimens by the in house PCR method. The LightCycler assay proved to be specific and 94% sensitive when compared to the in house PCR method. These features combined with the rapid turn-around time for results makes the LC-PCR particularly suitable for the detection of N. gonorrhoeae in a routine clinical laboratory. (C) 2002 Elsevier Science Inc. All rights reserved.

Reasoning about real-time repetitions: terminating and nonterminating

It is common for a real-time system to contain a nonterminating process monitoring an input and controlling an output. Hence, a real-time program development method needs to support nonterminating repetitions. In this paper we develop a general proof rule for reasoning about possibly nonterminating repetitions. The rule makes use of a Floyd-Hoare-style loop invariant that is maintained by each iteration of the repetition, a Jones-style relation between the pre- and post-states on each iteration, and a deadline specifying an upper bound on the starting time of each iteration. The general rule is proved correct with respect to a predicative semantics. In the case of a terminating repetition the rule reduces to the standard rule extended to handle real time. Other special cases include repetitions whose bodies are guaranteed to terminate, nonterminating repetitions with the constant true as a guard, and repetitions whose termination is guaranteed by the inclusion of a fixed deadline. (C) 2002 Elsevier Science B.V. All rights reserved.

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.