Andy Leist

Learn More
  • D P Playne, A P Gerdelan, A Leist, C J Scogings, K A Hawick
  • 2008
Simulations users at all levels make heavy use of compute resources to drive computational simulations for greatly varying applications areas of research using different simulation paradigms. Simulations are implemented in many software forms, ranging from highly stan-dardised and general models that run in proprietary software packages to ad hoc(More)
Eye and arm-hand movements were recorded in human subjects under three conditions. In the first a spot of light moved 30 deg back and forth sinusoidally at different frequencies. Limits of ocular pursuit were about 60 deg/sec at a frequency of about 1 Hz. In the second condition the arm and hand pointed a lever at the spot of light and pursued the moving(More)
  • A Leist, K A Hawick, D P Playne
  • 2010
Network science makes heavy use of simulation models and calculations based upon graph-oriented data structures that are intrinsically highly irregular in nature. The key to efficient use of data-parallel and multi-core parallelism on graphical processing units (GPUs) and CPUs is often to optimise the data layout and to exploit distributed memory locality(More)
BACKGROUND Acute striatal necrosis is a devastating consequence of encephalopathic crisis in patients with glutaric aciduria type I (GA-I), but the mechanisms underlying brain injury are not completely understood. OBJECTIVE To approach pathophysiological aspects of brain injury in GA-I by means of functional techniques in magnetic resonance imaging (MRI).(More)
Resource discovery is one of the most important underpinning problems behind producing a scalable, robust and efficient global infrastructure for e-Science. A number of approaches to the resource discovery and management problem have been made in various computational grid environments and prototypes over the last decade. Computational resources and(More)
— Complex networks are often studied using statistical measurements over many independently generated samples. Irregular data structures such as graphs that involve dynamical memory management and " pointer chasing " are an important class of application and have attracted recent interest in the form of the Graph500 benchmark formulation. The generation of(More)
  • V Du Preez, M G B Johnson, A Leist, K A Hawick
  • 2011
— Random number generation continues to be a critical component in much of computational science and the tradeoff between quality and computational performance is a key issue for many numerical simulations. We review the performance and statistical quality of some well known algorithms for generating pseudo random numbers. Graphical Processing Units (GPUs)(More)
  • Arno Leist, K A Hawick, inproceedings{cstn, Ken Hawick, A Leist
  • 2013
2009 The growing uptake of semantic web and grid ideas is raising the importance of optimising distribution algorithms for semantic metadata. While it is not yet clear how real-world metadata distribution patterns ought to evolve, practical experience of social and technical networks suggests that a small-world pattern is desireable and practical. We(More)