Calibration of liquid argon and neon detectors with 83Krm^{83}Kr^m

We report results from tests of $^{83}$Kr$^{\mathrm{m}}$, as a calibration source in liquid argon and liquid neon. $^{83}$Kr$^{\mathrm{m}}$ atoms are produced in the decay of $^{83}$Rb, and a clear $^{83}$Kr$^{\mathrm{m}}$ scintillation peak at 41.5 keV appears in both liquids when filling our detector through a piece of zeolite coated with $^{83}$Rb. Based on this scintillation peak, we observe 6.0 photoelectrons/keV in liquid argon with a resolution of 6% ($\sigma$/E) and 3.0 photoelectrons/keV in liquid neon with a resolution of 19% ($\sigma$/E). The observed peak intensity subsequently decays with the $^{83}$Kr$^{\mathrm{m}}$ half-life after stopping the fill, and we find evidence that the spatial location of $^{83}$Kr$^{\mathrm{m}}$ atoms in the chamber can be resolved. $^{83}$Kr$^{\mathrm{m}}$ will be a useful calibration source for liquid argon and neon dark matter and solar neutrino detectors.Comment: 7 pages, 12 figure

Biomechanical considerations for optimising subretinal injections

\ua9 2024 The AuthorsSubretinal injection is the preferred delivery technique for various novel ocular therapies and is widely used because of its precision and efficient delivery of gene and cell therapies; however, choosing an injection point and defining delivery parameters to target a specified retinal location and area is an inexact science. We provide an overview of the key factors that play important roles during subretinal injections to refine the technique, enhance patient outcomes, and minimise risks. We describe the role of anatomical and physical variables that affect subretinal bleb propagation and shape and their impact on retinal integrity. We highlight the risks associated with subretinal injections and consider strategies to mitigate reflux and retinal trauma. Finally, we explore the emerging field of robotic assistance in improving intraocular manouvrability and precision to facilitate the injection procedure

Order-Revealing Encryption and the Hardness of Private Learning

An order-revealing encryption scheme gives a public procedure by which two ciphertexts can be compared to reveal the ordering of their underlying plaintexts. We show how to use order-revealing encryption to separate computationally efficient PAC learning from efficient $(\epsilon, \delta)$-differentially private PAC learning. That is, we construct a concept class that is efficiently PAC learnable, but for which every efficient learner fails to be differentially private. This answers a question of Kasiviswanathan et al. (FOCS '08, SIAM J. Comput. '11). To prove our result, we give a generic transformation from an order-revealing encryption scheme into one with strongly correct comparison, which enables the consistent comparison of ciphertexts that are not obtained as the valid encryption of any message. We believe this construction may be of independent interest.Comment: 28 page

Measuring the Small-Scale Power Spectrum of Cosmic Density Fluctuations Through 21 cm Tomography Prior to the Epoch of Structure Formation

The thermal evolution of the cosmic gas decoupled from that of the cosmic microwave background (CMB) at a redshift z~200. Afterwards and before the first stars had formed, the cosmic neutral hydrogen absorbed the CMB flux at its resonant 21cm spin-flip transition. We calculate the evolution of the spin temperature for this transition and the resulting anisotropies that are imprinted on the CMB sky due to linear density fluctuations during this epoch. These anisotropies at an observed wavelength of 10.56[(1+z)/50] meters, contain an amount of information that is orders of magnitude larger than any other cosmological probe. Their detection, although challenging, could tightly constrain any possible running of the spectral index from inflation (as suggested by WMAP), small deviations from Gaussianity, or any significant contribution from neutrinos or warm dark matter to the cosmic mass budget.Comment: 4 pages, 3 figures, accepted for publication in Physical Review Letter

Age-specific vaccine effectiveness of seasonal 2010/2011 and pandemic influenza A(H1N1) 2009 vaccines in preventing influenza in the United Kingdom

An analysis was undertaken to measure age-specific vaccine effectiveness (VE) of 2010/11 trivalent seasonal influenza vaccine (TIV) and monovalent 2009 pandemic influenza vaccine (PIV) administered in 2009/2010. The test-negative case-control study design was employed based on patients consulting primary care. Overall TIV effectiveness, adjusted for age and month, against confirmed influenza A(H1N1)pdm 2009 infection was 56% (95% CI 42–66); age-specific adjusted VE was 87% (95% CI 45–97) in <5-year-olds and 84% (95% CI 27–97) in 5- to 14-year-olds. Adjusted VE for PIV was only 28% (95% CI x6 to 51) overall and 72% (95% CI 15–91) in <5-year-olds. For confirmed influenza B infection, TIV effectiveness was 57% (95% CI 42–68) and in 5- to 14-year-olds 75% (95% CI 32–91). TIV provided moderate protection against the main circulating strains in 2010/2011, with higher protection in children. PIV administered during the previous season provided residual protection after 1 year, particularly in the <5 years age group

Risk-Averse Matchings over Uncertain Graph Databases

A large number of applications such as querying sensor networks, and analyzing protein-protein interaction (PPI) networks, rely on mining uncertain graph and hypergraph databases. In this work we study the following problem: given an uncertain, weighted (hyper)graph, how can we efficiently find a (hyper)matching with high expected reward, and low risk? This problem naturally arises in the context of several important applications, such as online dating, kidney exchanges, and team formation. We introduce a novel formulation for finding matchings with maximum expected reward and bounded risk under a general model of uncertain weighted (hyper)graphs that we introduce in this work. Our model generalizes probabilistic models used in prior work, and captures both continuous and discrete probability distributions, thus allowing to handle privacy related applications that inject appropriately distributed noise to (hyper)edge weights. Given that our optimization problem is NP-hard, we turn our attention to designing efficient approximation algorithms. For the case of uncertain weighted graphs, we provide a $\frac{1}{3}$-approximation algorithm, and a $\frac{1}{5}$-approximation algorithm with near optimal run time. For the case of uncertain weighted hypergraphs, we provide a $\Omega(\frac{1}{k})$-approximation algorithm, where $k$ is the rank of the hypergraph (i.e., any hyperedge includes at most $k$ nodes), that runs in almost (modulo log factors) linear time. We complement our theoretical results by testing our approximation algorithms on a wide variety of synthetic experiments, where we observe in a controlled setting interesting findings on the trade-off between reward, and risk. We also provide an application of our formulation for providing recommendations of teams that are likely to collaborate, and have high impact.Comment: 25 page

A parabolic approach to the control of opinion spreading

We analyze the problem of controlling to consensus a nonlinear system modeling opinion spreading. We derive explicit exponential estimates on the cost of approximately controlling these systems to consensus, as a function of the number of agents N and the control time-horizon T. Our strategy makes use of known results on the controllability of spatially discretized semilinear parabolic equations. Both systems can be linked through time-rescalin

What constitutes brilliant aged care? A qualitative study of practices that exceed expectation

Aim This study aimed to explore what constitutes brilliant aged care. Background Although many aged care services do not offer the care that older people and carers need and want, some perform better. Rather than focus on problems with aged care, this study examined brilliant aged care—practices that exceeded expectation. Design The methodology for this study was informed by grounded theory, underpinned by constructionism to socially construct meaning. Methods This study invited nominations for a Brilliant Award via a survey, and interviews with the nominees via web conference. After receiving survey responses from 10 nominators, interviews were conducted with 12 nominees. Data were analysed using reflexive thematic analysis and documented according to COREQ guidelines to optimise rigour and transparency. Results According to participants, brilliant aged care involved being relationally attuned to older people, a deep understanding of the older person, recognition of aged care as more than a job, innovative practices and permission to reprioritise. Conclusions This study suggests that, in aged care, brilliance happens. It emphasises the importance of meaningful connections and relationships in aged care, where thoughtful acts acknowledge an older person's value and humanity as well as creativity and innovation. Relevance to Clinical Practice For those who manage and deliver aged care, the findings suggest that small practice changes can make a positive difference to older people. Brilliant aged care can involve acts of empathy; enthusiasm for aged care; innovative practices, even those that are small scale; and reprioritising workplace tasks to spend time with older people. For policymakers, this study highlights the need to recognise and raise the profile of the pockets of brilliance within the aged care sector. This might be achieved via awards and other initiatives that serve to celebrate and learn from brilliance in its myriad forms. Patient or Public Contribution The nominees, who included carers, were invited to participate in workshops with other carers and older people to co-design a model of brilliant aged care, during which workshop participants discussed and critiqued the findings constructed from the data