Turning on the heat: ecological response to simulated warming in the sea

Significant warming has been observed in every ocean, yet our ability to predict the consequences of oceanic warming on marine biodiversity remains poor. Experiments have been severely limited because, until now, it has not been possible to manipulate seawater temperature in a consistent manner across a range of marine habitats. We constructed a "hot-plate'' system to directly examine ecological responses to elevated seawater temperature in a subtidal marine system. The substratum available for colonisation and overlying seawater boundary layer were warmed for 36 days, which resulted in greater biomass of marine organisms and a doubling of space coverage by a dominant colonial ascidian. The "hot-plate'' system will facilitate complex manipulations of temperature and multiple stressors in the field to provide valuable information on the response of individuals, populations and communities to environmental change in any aquatic habitat

Prior Knowledge of Trial Number Influences the Incidence of Plateau at VO2max

The purpose of this study was to assess the VO2max plateau response at VO2max during a series of pre-determined trials. METHODS: Ten male well-trained athletes (age, 23.0 ± 3.2; height, 183.3 ± 5.5 cm; mass 77.5 ± 11.1 Kg; VO2max 66.5 ± 5.0 ml.kg-1,min-1), but who were VO2max testing naïve and with prior-knowledge of trial number completed four incremental tests to volitional exhaustion, separated by ~72-h for the determination of VO2max and gas exchange threshold. Throughout all trials VO2max was recorded on a breath-by-breath basis using a pre-calibrated metabolic cart, using a plateau criterion of Δ VO2 ≤1.5 ml.kg-1.min-1 over the final 2 consecutive 30 s sampling periods. A significant difference was observed between trial-1 and trial-4 for plateau incidence (p = 0.0285) rising from 20% in trial-1 to a 70% response rate in trial-4. Furthermore a significant difference was observed for VO2dif (difference be-tween criterion value and Δ VO2) in trial-1, 1.02 ± 1.69 ml.kg-1.min-1 (p = 0.038), with non-significant differences observed for all other trials, despite a non-significant difference for VO2max across all trials (p > 0.05). Finally, a significant difference was observed for effort perception (RPE) at volitional exhaustion between trial-1 (17.7 ± 1.3) and trial-4 (19.0 ± 1.4) (p = 0.0052). These data indicate that prior-knowledge of trial number can influence the manifestation of the VO2 plateau in a group of well-trained male athletes, thereby suggesting that a form of effort control is established in order to preserve the finite anaerobic capacity

A fast recursive coordinate bisection tree for neighbour search and gravity

We introduce our new binary tree code for neighbour search and gravitational force calculations in an N-particle system. The tree is built in a "top-down" fashion by "recursive coordinate bisection" where on each tree level we split the longest side of a cell through its centre of mass. This procedure continues until the average number of particles in the lowest tree level has dropped below a prescribed value. To calculate the forces on the particles in each lowest-level cell we split the gravitational interaction into a near- and a far-field. Since our main intended applications are SPH simulations, we calculate the near-field by a direct, kernel-smoothed summation, while the far field is evaluated via a Cartesian Taylor expansion up to quadrupole order. Instead of applying the far-field approach for each particle separately, we use another Taylor expansion around the centre of mass of each lowest-level cell to determine the forces at the particle positions. Due to this "cell-cell interaction" the code performance is close to O(N) where N is the number of used particles. We describe in detail various technicalities that ensure a low memory footprint and an efficient cache use. In a set of benchmark tests we scrutinize our new tree and compare it to the "Press tree" that we have previously made ample use of. At a slightly higher force accuracy than the Press tree, our tree turns out to be substantially faster and increasingly more so for larger particle numbers. For four million particles our tree build is faster by a factor of 25 and the time for neighbour search and gravity is reduced by more than a factor of 6. In single processor tests with up to 10^8 particles we confirm experimentally that the scaling behaviour is close to O(N). The current Fortran 90 code version is OpenMP-parallel and scales excellently with the processor number (=24) of our test machine.Comment: 12 pages, 16 figures, 1 table, accepted for publication in MNRAS on July 28, 201

Under the Radar: Learning to Predict Robust Keypoints for Odometry Estimation and Metric Localisation in Radar

This paper presents a self-supervised framework for learning to detect robust keypoints for odometry estimation and metric localisation in radar. By embedding a differentiable point-based motion estimator inside our architecture, we learn keypoint locations, scores and descriptors from localisation error alone. This approach avoids imposing any assumption on what makes a robust keypoint and crucially allows them to be optimised for our application. Furthermore the architecture is sensor agnostic and can be applied to most modalities. We run experiments on 280km of real world driving from the Oxford Radar RobotCar Dataset and improve on the state-of-the-art in point-based radar odometry, reducing errors by up to 45% whilst running an order of magnitude faster, simultaneously solving metric loop closures. Combining these outputs, we provide a framework capable of full mapping and localisation with radar in urban environments.Comment: Video summary: https://youtu.be/L-PO7nxWpJ

Semantic mutation testing

This is the Pre-print version of the Article. The official published version can be obtained from the link below - Copyright @ 2011 ElsevierMutation testing is a powerful and flexible test technique. Traditional mutation testing makes a small change to the syntax of a description (usually a program) in order to create a mutant. A test suite is considered to be good if it distinguishes between the original description and all of the (functionally non-equivalent) mutants. These mutants can be seen as representing potential small slips and thus mutation testing aims to produce a test suite that is good at finding such slips. It has also been argued that a test suite that finds such small changes is likely to find larger changes. This paper describes a new approach to mutation testing, called semantic mutation testing. Rather than mutate the description, semantic mutation testing mutates the semantics of the language in which the description is written. The mutations of the semantics of the language represent possible misunderstandings of the description language and thus capture a different class of faults. Since the likely misunderstandings are highly context dependent, this context should be used to determine which semantic mutants should be produced. The approach is illustrated through examples with statecharts and C code. The paper also describes a semantic mutation testing tool for C and the results of experiments that investigated the nature of some semantic mutation operators for C