SFHarmony: Source Free Domain Adaptation for Distributed Neuroimaging Analysis

To represent the biological variability of clinical neuroimaging populations, it is vital to be able to combine data across scanners and studies. However, different MRI scanners produce images with different characteristics, resulting in a domain shift known as the `harmonisation problem'. Additionally, neuroimaging data is inherently personal in nature, leading to data privacy concerns when sharing the data. To overcome these barriers, we propose an Unsupervised Source-Free Domain Adaptation (SFDA) method, SFHarmony. Through modelling the imaging features as a Gaussian Mixture Model and minimising an adapted Bhattacharyya distance between the source and target features, we can create a model that performs well for the target data whilst having a shared feature representation across the data domains, without needing access to the source data for adaptation or target labels. We demonstrate the performance of our method on simulated and real domain shifts, showing that the approach is applicable to classification, segmentation and regression tasks, requiring no changes to the algorithm. Our method outperforms existing SFDA approaches across a range of realistic data scenarios, demonstrating the potential utility of our approach for MRI harmonisation and general SFDA problems. Our code is available at \url{https://github.com/nkdinsdale/SFHarmony}

Trace Properties from Separation Logic Specifications

We propose a formal approach for relating abstract separation logic library specifications with the trace properties they enforce on interactions between a client and a library. Separation logic with abstract predicates enforces a resource discipline that constrains when and how calls may be made between a client and a library. Intuitively, this can enforce a protocol on the interaction trace. This intuition is broadly used in the separation logic community but has not previously been formalised. We provide just such a formalisation. Our approach is based on using wrappers which instrument library code to induce execution traces for the properties under examination. By considering a separation logic extended with trace resources, we prove that when a library satisfies its separation logic specification then its wrapped version satisfies the same specification and, moreover, maintains the trace properties as an invariant. Consequently, any client and library implementation that are correct with respect to the separation logic specification will satisfy the trace properties

Formalized Verification of Snapshotable Trees: Separation and Sharing

Abstract. We use separation logic to specify and verify a Java program that implements snapshotable search trees, fully formalizing the specification and verification in the Coq proof assistant. We achieve local and modular reasoning about a tree and its snapshots and their iterators, although the implementation involves shared mutable heap data structures with no separation or ownership relation between the various data. The paper also introduces a series of four increasingly sophisticated implementations and verifies the first one. The others are included as future work and as a set of challenge problems for full functional specification and verification, whether by separation logic or by other formalisms.

Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity

We present a lightweight approach to Hoare-style specifications for fine-grained concurrency, based on a notion of time-stamped histories that abstractly capture atomic changes in the program state. Our key observation is that histories form a partial commutative monoid, a structure fundamental for representation of concurrent resources. This insight provides us with a unifying mechanism that allows us to treat histories just like heaps in separation logic. For example, both are subject to the same assertion logic and inference rules (e.g., the frame rule). Moreover, the notion of ownership transfer, which usually applies to heaps, has an equivalent in histories. It can be used to formally represent helping---an important design pattern for concurrent algorithms whereby one thread can execute code on behalf of another. Specifications in terms of histories naturally abstract granularity, in the sense that sophisticated fine-grained algorithms can be given the same specifications as their simplified coarse-grained counterparts, making them equally convenient for client-side reasoning. We illustrate our approach on a number of examples and validate all of them in Coq.Comment: 17 page

Modular termination verification for non-blocking concurrency

© Springer-Verlag Berlin Heidelberg 2016.We present Total-TaDA, a program logic for verifying the total correctness of concurrent programs: that such programs both terminate and produce the correct result. With Total-TaDA, we can specify constraints on a thread’s concurrent environment that are necessary to guarantee termination. This allows us to verify total correctness for nonblocking algorithms, e.g. a counter and a stack. Our specifications can express lock- and wait-freedom. More generally, they can express that one operation cannot impede the progress of another, a new non-blocking property we call non-impedance. Moreover, our approach is modular. We can verify the operations of a module independently, and build up modules on top of each other

A comparison of efficient methods for the computation of Born gluon amplitudes

We compare four different methods for the numerical computation of the pure gluonic amplitudes in the Born approximation. We are in particular interested in the efficiency of the various methods as the number n of the external particles increases. In addition we investigate the numerical accuracy in critical phase space regions. The methods considered are based on (i) Berends-Giele recurrence relations, (ii) scalar diagrams, (iii) MHV vertices and (iv) BCF recursion relations.Comment: 20 page

Sprint and Jump Mechanical Profiles in Academy Rugby League Players: Positional Differences and the Associations between Profiles and Sprint Performance.

This cross-sectional study evaluated the sprint and jump mechanical profiles of male academy rugby league players, the differences between positions, and the associations between mechanical profiles and sprint performance. Twenty academy rugby league players performed 40-m sprints and squat jumps at increasing loads (0-80 kg) to determine individual mechanical (force-velocity-power) and performance variables. The mechanical variables (absolute and relative theoretical maximal force-velocity-power, force-velocity linear relationship, and mechanical efficiency) were determined from the mechanical profiles. Forwards had significantly (p < 0.05) greater vertical and horizontal force, momentum but jumped lower (unloaded) and were slower than backs. No athlete presented an optimal jump profile. No associations were found between jump and sprint mechanical variables. Absolute theoretical maximal vertical force significantly (p < 0.05) correlated (r = 0.71-0.77) with sprint momentum. Moderate (r = -0.47) to near-perfect (r = 1.00) significant associations (p < 0.05) were found between sprint mechanical and performance variables. The largest associations shifted from maximum relative horizontal force-power generation and application to maximum velocity capabilities and force application at high velocities as distance increased. The jump and sprint mechanical profiles appear to provide distinctive and highly variable information about academy rugby league players' sprint and jump capacities. Associations between mechanical variables and sprint performance suggest horizontal and vertical profiles differ and should be trained accordingly

The Training of Short Distance Sprint Performance in Football Code Athletes: A Systematic Review and Meta-Analysis

Background Short-sprint (≤20m) performance is an important quality for success in the football codes. Therefore, developing an evidence base for understanding training methods to enhance short-sprint performance is key for practitioners. However, current systematic reviews are limited by 1) a lack of focus on football code athletes, 2) a lack of consideration of all training modalities, and 3) a failure to account for the normal training practices undertaken by intervention groups within their analysis. Therefore, this review aimed to 1) conduct a systematic review of the scientific literature evaluating training interventions upon short-sprint performance within football code athletes, 2) undertake a meta-analysis to assess the magnitude of change of sport-sprint performance following training interventions, and 3) identify how moderator variables affect the training response. Methods A systematic search of electronic databases was conducted. A random-effects meta-analysis was performed to establish standardised mean difference with 95% confidence intervals. This identified the magnitude and direction of the individual training effects of intervention subgroups (primary, secondary, combined-specific, tertiary and combined training methods) on short-sprint performance while considering moderator variables (i.e., football code, sex, age, playing standard, phase of season). Results 121 studies met the inclusion criteria, totalling 3,419 athletes. Significant improvements (small-large) were found between pre- and post-training in short-sprint performance for the combined, secondary, tertiary and combined-specific training methods. No significant effect was found for primary or sport only training. No individual mode was found to be the most effective. Between-subgroup analysis identified that football code, age, playing standard and phase of season all moderated the overall magnitude of training effects. Conclusions This review provides the largest systematic review and meta-analysis of short-sprint performance development methods and the only one to assess football code athletes exclusively. Practitioners can apply combined, secondary and tertiary training methods to improve short-sprint performance within football code athletes. The application of sport only and primary methods does not appear to improve short-sprint performance. Regardless of the population characteristics, short-sprint performance can be enhanced by increasing either or both the magnitude and the orientation of force an athlete can generate in the sprinting action

The Training of Medium- to Long-Distance Sprint Performance in Football Code Athletes: A Systematic Review and Meta-analysis

Background Within the football codes, medium-distance (i.e., > 20 m and ≤ 40 m) and long-distance (i.e., > 40 m) sprint performance and maximum velocity sprinting are important capacities for success. Despite this, no research has identified the most effective training methods for enhancing medium- to long-distance sprint outcomes. Objectives This systematic review with meta-analysis aimed to (1) analyse the ability of different methods to enhance medium- to long-distance sprint performance outcomes (0–30 m, 0 to > 30 m, and the maximum sprinting velocity phase [Vmax]) within football code athletes and (2) identify how moderator variables (i.e., football code, sex, age, playing standard, phase of season) affected the training response. Methods We conducted a systematic search of electronic databases and performed a random-effects meta-analysis (within-group changes and pairwise between-group differences) to establish standardised mean differences (SMDs) with 95% confidence intervals and 95% prediction intervals. This identified the magnitude and direction of the individual training effects of intervention subgroups (sport only; primary, secondary, tertiary, and combined training methods) on medium- to long-distance sprint performance while considering moderator variables. Results In total, 60 studies met the inclusion criteria (26 with a sport-only control group), totalling 111 intervention groups and 1500 athletes. The within-group changes design reported significant performance improvements (small–moderate) between pre- and post-training for the combined, secondary (0–30 and 0 to > 30 m), and tertiary training methods (0–30 m). A significant moderate improvement was found in the Vmax phase performance only for tertiary training methods, with no significant effect found for sport only or primary training methods. The pairwise between-group differences design (experimental vs. control) reported favourable performance improvements (large SMD) for the combined (0 to > 30 m), primary (Vmax phase), secondary (0–30 m), and tertiary methods (all outcomes) when compared with the sport-only control groups. Subgroup analysis showed that the significant differences between the meta-analysis designs consistently demonstrated a larger effect in the pairwise between-group differences than the within-group change. No individual training mode was found to be the most effective. Subgroup analysis identified that football code, age, and phase of season moderated the overall magnitude of training effects. Conclusions This review provides the first systematic review and meta-analysis of all sprint performance development methods exclusively in football code athletes. Secondary, tertiary, and combined training methods appeared to improve medium-long sprint performance of football code athletes. Tertiary training methods should be implemented to enhance Vmax phase performance. Nether sport-only nor primary training methods appeared to enhance medium to long sprint performance. Performance changes may be attributed to either adaptations specific to the acceleration or Vmax phases, or both, but not exclusively Vmax. Regardless of the population characteristics, sprint performance can be enhanced by increasing either the magnitude or the orientation of force an athlete can generate in the sprinting action, or both