Genetic stability of pneumococcal isolates during 35 days of human experimental carriage

Background Pneumococcal carriage is a reservoir for transmission and a precursor to pneumococcal disease. The experimental human pneumococcal carriage model provides a useful tool to aid vaccine licensure through the measurement of vaccine efficacy against carriage (VEcol). Documentation of the genetic stability of the experimental human pneumococcal carriage model is important to further strengthen confidence in its safety and conclusions, enabling it to further facilitate vaccine licensure through providing evidence of VEcol. Methods 229 isolates were sequenced from 10 volunteers in whom experimental human pneumococcal carriage was established, sampled over a period of 35 days. Multiple isolates from within a single volunteer at a single time provided a deep resolution for detecting variation. HiSeq data from the isolates were mapped against a PacBio reference of the inoculum to call variable sites. Results The observed variation between experimental carriage isolates was minimal with the maximum SNP distance between any isolate and the reference being 3 SNPs. Conclusion The low-level variation described provides evidence for the stability of the experimental human pneumococcal carriage model over 35 days, which can be reliably and confidently used to measure VEcol and aid future progression of pneumococcal vaccination

Single-Inclusive Jet Production in Polarized pp Collisions at O(alpha_s^3)

We present a next-to-leading order QCD calculation for single-inclusive high-p_T jet production in longitudinally polarized pp collisions within the ``small-cone'' approximation. The fully analytical expressions obtained for the underlying partonic hard-scattering cross sections greatly facilitate the analysis of upcoming BNL-RHIC data on the double-spin asymmetry A_{LL}^{jet} for this process in terms of the unknown polarization of gluons in the nucleon. We simultaneously rederive the corresponding QCD corrections to unpolarized scattering and confirm the results existing in the literature. We also numerically compare to results obtained with Monte-Carlo methods and assess the range of validity of the ``small-cone'' approximation for the kinematics relevant at BNL-RHIC.Comment: 23 pages, 8 eps-figure

A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness

It is well known that it is impossible for two parties to toss a coin fairly (Cleve, STOC 1986). This result implies that it is impossible to securely compute with fairness any function that can be used to toss a coin fairly. In this paper, we focus on the class of deterministic Boolean functions with finite domain, and we ask for which functions in this class is it possible to information-theoretically toss an unbiased coin, given a protocol for securely computing the function with fairness. We provide a complete characterization of the functions in this class that imply and do not imply fair coin tossing. This characterization extends our knowledge of which functions cannot be securely computed with fairness. In addition, it provides a focus as to which functions may potentially be securely computed with fairness, since a function that cannot be used to fairly toss a coin is not ruled out by the impossibility result of Cleve (which is the only known impossibility result for fairness). In addition to the above, we draw corollaries to the feasibility of achieving fairness in two possible fail-stop models

“Don’t let the trial kill the intervention”: How can researchers and care home teams implement complex intervention trials in care homes?

There is a need for a context-specific sustainable model for conduct of high-quality research in care homes Implementation of research interventions in care homes needs co-design, good relationships, understanding the context and funding A framework can provide the basis to build trust between researchers, care home residents, families and staff

Random Oracles in a Quantum World

The interest in post-quantum cryptography - classical systems that remain secure in the presence of a quantum adversary - has generated elegant proposals for new cryptosystems. Some of these systems are set in the random oracle model and are proven secure relative to adversaries that have classical access to the random oracle. We argue that to prove post-quantum security one needs to prove security in the quantum-accessible random oracle model where the adversary can query the random oracle with quantum states. We begin by separating the classical and quantum-accessible random oracle models by presenting a scheme that is secure when the adversary is given classical access to the random oracle, but is insecure when the adversary can make quantum oracle queries. We then set out to develop generic conditions under which a classical random oracle proof implies security in the quantum-accessible random oracle model. We introduce the concept of a history-free reduction which is a category of classical random oracle reductions that basically determine oracle answers independently of the history of previous queries, and we prove that such reductions imply security in the quantum model. We then show that certain post-quantum proposals, including ones based on lattices, can be proven secure using history-free reductions and are therefore post-quantum secure. We conclude with a rich set of open problems in this area.Comment: 38 pages, v2: many substantial changes and extensions, merged with a related paper by Boneh and Zhandr

Polarization-Insensitive Medium-Switchable Holographic Metasurfaces

The adoption of metasurfaces has led to revolutionary advances in holography due to improved compactness, integrability, and performance. Switchable meta-holograms projecting different replay field images in a controllable manner are highly desirable. Still, existing technologies generally rely on the use of polarized light and additional optics to facilitate switching. Consequently, the potential benefits afforded through the use of metasurfaces are limited both by the system complexity and a fixed relationship between the optical input and output. In this manuscript, we demonstrate polarization-insensitive metasurfaces encoding arbitrary and independent holograms, which can be switched between by changing the refractive index of the infiltration medium while maintaining identical illumination conditions. By sidestepping the requirements for high-performance light sources, switching optics, or delicate alignment, this approach points toward ultracompact and cost-effective switchable meta-holograms for various practical applications, such as holographic image projection, eye-perceptible sensors, optical information storage, processing, and security

Efficient Secure Computation with Garbled Circuits

Abstract. Secure two-party computation enables applications in which partic-ipants compute the output of a function that depends on their private inputs, without revealing those inputs or relying on any trusted third party. In this pa-per, we show the potential of building privacy-preserving applications using gar-bled circuits, a generic technique that until recently was believed to be too ineffi-cient to scale to realistic problems. We present a Java-based framework that uses pipelining and circuit-level optimizations to build efficient and scalable privacy-preserving applications. Although the standard garbled circuit protocol assumes a very week, honest-but-curious adversary, techniques are available for convert-ing such protocols to resist stronger adversaries, including fully malicious adver-saries. We summarize approaches to producing malicious-resistant secure com-putations that reduce the costs of transforming a protocol to be secure against stronger adversaries. In addition, we summarize results on ensuring fairness, the property that either both parties receive the result or neither party does. Several open problems remain, but as theory and pragmatism advance, secure computa-tion is approaching the point where it offers practical solutions for a wide variety of important problems.

Present Effects of Past Wildfires on Leaf Litter Breakdown in Stream Ecosystems

We investigated the present effects from a 10-year-old wildfire on leaf litter breakdown rates in 3 headwater streams in central Idaho. These systems experienced a massive debris flow one year after the fire. Based on soil instability and burn patterns, we identified 3 stream conditions: unburned, burned only, and burned/scoured. We placed leaf bags containing willow leaves (Salix sp.) in each stream type and removed bags at various time intervals until all bags were collected 100 days after their introduction. Leaf material was dried and weighed, and decay rate coefficients were calculated. Macroinvertebrates colonizing the bags were enumerated and identified, and selected taxa were placed into trophic groups. We found that the unburned stream had the fastest leaf litter breakdown rate, the lowest level of incident light reaching the stream, and the largest amount of benthic organic matter. The burned/scoured stream was nearly opposite in all respects. Numbers of 2 detritivore invertebrate taxa, Serratella tibialis and Zapada oregonensis, were highest in the unburned stream but lowest in the burned/scoured stream. A third taxon, Baetis sp., showed the opposite relationship. Presence of predatory invertebrates did not affect detritivore abundance or leaf decay rate in the bags. Our research suggests that recovery response variables of some stream systems may not have returned to prefire levels even a decade after the initial wildfire. In this study, the recovery of our streams appears to be connected to the return of the riparian zone, though fire-induced debris flows may slow or alter final recovery of the stream system

Genome-wide compound heterozygote analysis highlights alleles associated with adult height in Europeans

Adult height is the most widely genetically studied common trait in humans; however, the trait variance explainable by currently known height-associated single nucleotide polymorphisms (SNPs) identified from the previous genome-wide association studies (GWAS) is yet far from complete given the high heritability of this complex trait. To exam if compound heterozygotes (CH) may explain extra height variance, we conducted a genome-wide analysis to screen for CH in association with adult height in 10,631 Dutch Europeans enriched with extremely tall people, using our recently developed method implemented in the software package CollapsABEL. The analysis identified six regions (3q23, 5q35.1, 6p21.31, 6p21.33, 7q21.2, and 9p24.3), where multiple pairs of SNPs as CH showed genome-wide significant association with height (P < 1.67 × 10−10). Of those, 9p24.3 represents a novel region influencing adult height, whereas the others have been highlighted in the previous GWAS on height based on analysis of individual SNPs. A replication analysis in 4080 Australians of European ancestry confirmed the significant CH-like association at 9p24.3 (P < 0.05). Together, the collapsed genotypes at these six loci explained 2.51% of the height variance (after adjusting for sex and age), compared with 3.23% explained by the 14 top-associated SNPs at 14 loci identified by traditional GWAS in the same data set (P < 5 × 10−8). Overall, our study empirically demonstrates that CH plays an important role in adult height and may explain a proportion of its “missing heritability”. Moreover, our findings raise promising expectations for other highly polygenic complex traits to explain missing heritability identifiable through CH-like associations