Vortex reflection at boundaries of Josephson-junction arrays

We study the propagation properties of a single vortex in square Josephson-junction arrays (JJA) with free boundaries and subject to an applied dc current. We model the dynamics of the JJA by the resistively and capacitively shunted junction (RCSJ) equations. For zero Stewart-McCumber parameter $\beta_c$ we find that the vortex always escapes from the array when it gets to the boundary. For $\beta_c\geq 2.5$ and for low currents we find that the vortex escapes, while for larger currents the vortex is reflected as an antivortex at one edge and the antivortex as a vortex at the other, leading to a stationary oscillatory state and to a non-zero time-averaged voltage. The escape and the reflection of a vortex at the array edges are qualitatively explained in terms of a coarse-grained model of a vortex interacting logarithmically with its image. We also discuss the case when the free boundaries are at $45$ degrees with respect to the direction of the vortex motion. Finally, we discuss the effect of self-induced magnetic fields by taking into account the full-range inductance matrix of the array, and find qualitatively equivalent results.Comment: 14 pages RevTex, 9 Postscript figure

Sleepwalking into lock-in? Avoiding wrongs to future people in the governance of solar radiation management research

This paper argues for two ways in which we can avoid the reckless endangerment of future people in the governance of solar radiation management (SRM) research, which could happen through lock-in to SRM deployment from research. SRM research is at an early stage, one at which the mechanisms of lock-in could start to operate. However, lock-in fit to endanger future people could be slowed or stopped through targeted governance. This paper argues that governance of SRM research that does not include provisions to detect, slow, or stop lock-in fails the test of an intergenerationally adequate precautionary principle, and that research governed without these provisions cannot itself be justified as a precaution against the impacts of climate change

Sustainable change: long-term efforts toward developing a learning organization

Globalization and intensified competition require organizations to change and adapt to dynamic environments in order to stay competitive. This article describes a longitudinal action research study supporting the strategic change of a trading company. The strategic change was accompanied by planned changes in organizational structures and processes, management systems, emerging changes in leadership, and organization members’ attitudes and behaviors, and it was supported by management development activities. Longitudinal data over a 4-year period including participant observation and interviews reveal that a systemic approach, a learning and becoming perspective toward change, trust, an appropriate role perception, and the specific use of management instruments contribute to sustained change that resulted in performance improvements and a move toward a learning organization. We conclude with implications for strategic change and suggestions for further research in this area

Search for Lorentz and CPT violation using sidereal time dependence of neutrino flavor transitions over a short baseline

A class of extensions of the Standard Model allows Lorentz and CPT violations, which can be identified by the observation of sidereal modulations in the neutrino interaction rate. A search for such modulations was performed using the T2K on-axis near detector. Two complementary methods were used in this study, both of which resulted in no evidence of a signal. Limits on associated Lorentz and CPT-violating terms from the Standard Model extension have been derived by taking into account their correlations in this model for the first time. These results imply such symmetry violations are suppressed by a factor of more than 10 20 at the GeV scale

TRY plant trait database – enhanced coverage and open access

Plant traits—the morphological, anatomical, physiological, biochemical and phenological characteristics of plants—determine how plants respond to environmental factors, affect other trophic levels, and influence ecosystem properties and their benefits and detriments to people. Plant trait data thus represent the basis for a vast area of research spanning from evolutionary biology, community and functional ecology, to biodiversity conservation, ecosystem and landscape management, restoration, biogeography and earth system modelling. Since its foundation in 2007, the TRY database of plant traits has grown continuously. It now provides unprecedented data coverage under an open access data policy and is the main plant trait database used by the research community worldwide. Increasingly, the TRY database also supports new frontiers of trait‐based plant research, including the identification of data gaps and the subsequent mobilization or measurement of new data. To support this development, in this article we evaluate the extent of the trait data compiled in TRY and analyse emerging patterns of data coverage and representativeness. Best species coverage is achieved for categorical traits—almost complete coverage for ‘plant growth form’. However, most traits relevant for ecology and vegetation modelling are characterized by continuous intraspecific variation and trait–environmental relationships. These traits have to be measured on individual plants in their respective environment. Despite unprecedented data coverage, we observe a humbling lack of completeness and representativeness of these continuous traits in many aspects. We, therefore, conclude that reducing data gaps and biases in the TRY database remains a key challenge and requires a coordinated approach to data mobilization and trait measurements. This can only be achieved in collaboration with other initiatives

Fine-mapping of prostate cancer susceptibility loci in a large meta-analysis identifies candidate causal variants

Prostate cancer is a polygenic disease with a large heritable component. A number of common, low-penetrance prostate cancer risk loci have been identified through GWAS. Here we apply the Bayesian multivariate variable selection algorithm JAM to fine-map 84 prostate cancer susceptibility loci, using summary data from a large European ancestry meta-analysis. We observe evidence for multiple independent signals at 12 regions and 99 risk signals overall. Only 15 original GWAS tag SNPs remain among the catalogue of candidate variants identified; the remainder are replaced by more likely candidates. Biological annotation of our credible set of variants indicates significant enrichment within promoter and enhancer elements, and transcription factor-binding sites, including AR, ERG and FOXA1. In 40 regions at least one variant is colocalised with an eQTL in prostate cancer tissue. The refined set of candidate variants substantially increase the proportion of familial relative risk explained by these known susceptibility regions, which highlights the importance of fine-mapping studies and has implications for clinical risk profiling. © 2018 The Author(s).Prostate cancer is a polygenic disease with a large heritable component. A number of common, low-penetrance prostate cancer risk loci have been identified through GWAS. Here we apply the Bayesian multivariate variable selection algorithm JAM to fine-map 84 prostate cancer susceptibility loci, using summary data from a large European ancestry meta-analysis. We observe evidence for multiple independent signals at 12 regions and 99 risk signals overall. Only 15 original GWAS tag SNPs remain among the catalogue of candidate variants identified; the remainder are replaced by more likely candidates. Biological annotation of our credible set of variants indicates significant enrichment within promoter and enhancer elements, and transcription factor-binding sites, including AR, ERG and FOXA1. In 40 regions at least one variant is colocalised with an eQTL in prostate cancer tissue. The refined set of candidate variants substantially increase the proportion of familial relative risk explained by these known susceptibility regions, which highlights the importance of fine-mapping studies and has implications for clinical risk profiling. © 2018 The Author(s).Peer reviewe

The Cholecystectomy As A Day Case (CAAD) Score: A Validated Score of Preoperative Predictors of Successful Day-Case Cholecystectomy Using the CholeS Data Set

Background Day-case surgery is associated with significant patient and cost benefits. However, only 43% of cholecystectomy patients are discharged home the same day. One hypothesis is day-case cholecystectomy rates, defined as patients discharged the same day as their operation, may be improved by better assessment of patients using standard preoperative variables. Methods Data were extracted from a prospectively collected data set of cholecystectomy patients from 166 UK and Irish hospitals (CholeS). Cholecystectomies performed as elective procedures were divided into main (75%) and validation (25%) data sets. Preoperative predictors were identified, and a risk score of failed day case was devised using multivariate logistic regression. Receiver operating curve analysis was used to validate the score in the validation data set. Results Of the 7426 elective cholecystectomies performed, 49% of these were discharged home the same day. Same-day discharge following cholecystectomy was less likely with older patients (OR 0.18, 95% CI 0.15–0.23), higher ASA scores (OR 0.19, 95% CI 0.15–0.23), complicated cholelithiasis (OR 0.38, 95% CI 0.31 to 0.48), male gender (OR 0.66, 95% CI 0.58–0.74), previous acute gallstone-related admissions (OR 0.54, 95% CI 0.48–0.60) and preoperative endoscopic intervention (OR 0.40, 95% CI 0.34–0.47). The CAAD score was developed using these variables. When applied to the validation subgroup, a CAAD score of ≤5 was associated with 80.8% successful day-case cholecystectomy compared with 19.2% associated with a CAAD score >5 (p < 0.001). Conclusions The CAAD score which utilises data readily available from clinic letters and electronic sources can predict same-day discharges following cholecystectomy

Highly-parallelized simulation of a pixelated LArTPC on a GPU

The rapid development of general-purpose computing on graphics processing units (GPGPU) is allowing the implementation of highly-parallelized Monte Carlo simulation chains for particle physics experiments. This technique is particularly suitable for the simulation of a pixelated charge readout for time projection chambers, given the large number of channels that this technology employs. Here we present the first implementation of a full microphysical simulator of a liquid argon time projection chamber (LArTPC) equipped with light readout and pixelated charge readout, developed for the DUNE Near Detector. The software is implemented with an end-to-end set of GPU-optimized algorithms. The algorithms have been written in Python and translated into CUDA kernels using Numba, a just-in-time compiler for a subset of Python and NumPy instructions. The GPU implementation achieves a speed up of four orders of magnitude compared with the equivalent CPU version. The simulation of the current induced on 10^3 pixels takes around 1 ms on the GPU, compared with approximately 10 s on the CPU. The results of the simulation are compared against data from a pixel-readout LArTPC prototype