NASA/GE quiet engine C acoustic test results

The acoustic investigation and evaluation of the C propulsion turbofan engine are discussed. The engine was built as a part of the Quiet Engine Program. The objectives of the program are as follows: (1) to determine the noise levels produced turbofan bypass engines, (2) to demonstrate the technology and innovations which will reduce the production and radiation of noise in turbofan engines, and (3) to acquire experimental acoustic and aerodynamic data for high bypass turbofan engines to provide a better understanding of noise production mechanisms. The goals of the program called for a turbofan engine 15 to 20 PNdB quieter than currently available engines in the same thrust class

Socially Optimal Mining Pools

Mining for Bitcoins is a high-risk high-reward activity. Miners, seeking to reduce their variance and earn steadier rewards, collaborate in pooling strategies where they jointly mine for Bitcoins. Whenever some pool participant is successful, the earned rewards are appropriately split among all pool participants. Currently a dozen of different pooling strategies (i.e., methods for distributing the rewards) are in use for Bitcoin mining. We here propose a formal model of utility and social welfare for Bitcoin mining (and analogous mining systems) based on the theory of discounted expected utility, and next study pooling strategies that maximize the social welfare of miners. Our main result shows that one of the pooling strategies actually employed in practice--the so-called geometric pay pool--achieves the optimal steady-state utility for miners when its parameters are set appropriately. Our results apply not only to Bitcoin mining pools, but any other form of pooled mining or crowdsourcing computations where the participants engage in repeated random trials towards a common goal, and where "partial" solutions can be efficiently verified

Monotonic Prefix Consistency in Distributed Systems

We study the issue of data consistency in distributed systems. Specifically, we consider a distributed system that replicates its data at multiple sites, which is prone to partitions, and which is assumed to be available (in the sense that queries are always eventually answered). In such a setting, strong consistency, where all replicas of the system apply synchronously every operation, is not possible to implement. However, many weaker consistency criteria that allow a greater number of behaviors than strong consistency, are implementable in available distributed systems. We focus on determining the strongest consistency criterion that can be implemented in a convergent and available distributed system that tolerates partitions. We focus on objects where the set of operations can be split into updates and queries. We show that no criterion stronger than Monotonic Prefix Consistency (MPC) can be implemented.Comment: Submitted pape

Non-malleable encryption: simpler, shorter, stronger

In a seminal paper, Dolev et al. [15] introduced the notion of non-malleable encryption (NM-CPA). This notion is very intriguing since it suffices for many applications of chosen-ciphertext secure encryption (IND-CCA), and, yet, can be generically built from semantically secure (IND-CPA) encryption, as was shown in the seminal works by Pass et al. [29] and by Choi et al. [9], the latter of which provided a black-box construction. In this paper we investigate three questions related to NM-CPA security: 1. Can the rate of the construction by Choi et al. of NM-CPA from IND-CPA be improved? 2. Is it possible to achieve multi-bit NM-CPA security more efficiently from a single-bit NM-CPA scheme than from IND-CPA? 3. Is there a notion stronger than NM-CPA that has natural applications and can be achieved from IND-CPA security? We answer all three questions in the positive. First, we improve the rate in the scheme of Choi et al. by a factor O(λ), where λ is the security parameter. Still, encrypting a message of size O(λ) would require ciphertext and keys of size O(λ2) times that of the IND-CPA scheme, even in our improved scheme. Therefore, we show a more efficient domain extension technique for building a λ-bit NM-CPA scheme from a single-bit NM-CPA scheme with keys and ciphertext of size O(λ) times that of the NM-CPA one-bit scheme. To achieve our goal, we define and construct a novel type of continuous non-malleable code (NMC), called secret-state NMC, as we show that standard continuous NMCs are not enough for the natural “encode-then-encrypt-bit-by-bit” approach to work. Finally, we introduce a new security notion for public-key encryption that we dub non-malleability under (chosen-ciphertext) self-destruct attacks (NM-SDA). After showing that NM-SDA is a strict strengthening of NM-CPA and allows for more applications, we nevertheless show that both of our results—(faster) construction from IND-CPA and domain extension from one-bit scheme—also hold for our stronger NM-SDA security. In particular, the notions of IND-CPA, NM-CPA, and NM-SDA security are all equivalent, lying (plausibly, strictly?) below IND-CCA securit

Secret-Sharing for NP

A computational secret-sharing scheme is a method that enables a dealer, that has a secret, to distribute this secret among a set of parties such that a "qualified" subset of parties can efficiently reconstruct the secret while any "unqualified" subset of parties cannot efficiently learn anything about the secret. The collection of "qualified" subsets is defined by a Boolean function. It has been a major open problem to understand which (monotone) functions can be realized by a computational secret-sharing schemes. Yao suggested a method for secret-sharing for any function that has a polynomial-size monotone circuit (a class which is strictly smaller than the class of monotone functions in P). Around 1990 Rudich raised the possibility of obtaining secret-sharing for all monotone functions in NP: In order to reconstruct the secret a set of parties must be "qualified" and provide a witness attesting to this fact. Recently, Garg et al. (STOC 2013) put forward the concept of witness encryption, where the goal is to encrypt a message relative to a statement "x in L" for a language L in NP such that anyone holding a witness to the statement can decrypt the message, however, if x is not in L, then it is computationally hard to decrypt. Garg et al. showed how to construct several cryptographic primitives from witness encryption and gave a candidate construction. One can show that computational secret-sharing implies witness encryption for the same language. Our main result is the converse: we give a construction of a computational secret-sharing scheme for any monotone function in NP assuming witness encryption for NP and one-way functions. As a consequence we get a completeness theorem for secret-sharing: computational secret-sharing scheme for any single monotone NP-complete function implies a computational secret-sharing scheme for every monotone function in NP

Suppressor of cytokine signaling 2 (SOCS2) deletion protects bone health of mice with DSS induced inflammatory bowel disease.

Individuals with inflammatory bowel disease (IBD) often present with poor bone health. The development of targeted therapies for this bone loss requires a fuller understanding of the underlying cellular mechanisms. Although bone loss in IBD is multifactorial the altered sensitivity and secretion of growth hormone (GH) and insulin-like growth factor-1 (IGF-1) in IBD is understood to be a critical contributing mechanism. The expression of suppressor of cytokine signaling 2 (SOCS2), a well-established negative regulator of GH signaling, is stimulated by pro-inflammatory cytokines. Therefore, it is likely that SOCS2 expression represents a critical mediator through which pro-inflammatory cytokines inhibit GH/IGF-1 signaling and decrease bone quality in IBD. Utilising the DSS model of colitis we have revealed that endogenously elevated GH function in the Socs2−/− mouse protects the skeleton from osteopenia. Micro-computed tomography assessment of DSS treated wild-type mice revealed a worsened trabecular architecture compared to control mice. Specifically, DSS treated WT mice had significantly decreased bone volume (BV/TV) (41%; p<0.05), trabecular thickness (16%; p<0.05), trabecular number (30%; p<0.05), and a resulting increase in trabecular separation (19%; <0.05). In comparison, the trabecular bone of Socs2 deficient mice was partially protected from the adverse effects of DSS. The reduction in a number of parameters including BV/TV (21%; p<0.05) was less, and no changes were observed in trabecular thickness or separation. This protected phenotype was unlikely to be a consequence of improved mucosal health in the DSS treated Socs2−/− mice but rather a result of unregulated GH signaling directly on bone. These studies indicate that the absence of SOCS2 is protective against bone loss typical of IBD. This study also provides an improved understanding of the relative effects of GH/IGF-1 on bone health in experimental colitis, information that is essential before these drugs are explored as bone protective agents in children and adults with IBD

Brief behavioural activation for adolescent depression: working with complexity and risk

Given the long-term negative outcomes associated with depression in adolescence, there is a pressing need to develop brief, evidence based treatments that are accessible to more young people experiencing low mood. Behavioural Activation (BA) is an effective treatment for adult depression, however little research has focused on the use of BA with depressed adolescents, particularly with briefer forms of BA. In this article we outline an adaptation of brief Behavioral Activation Treatment of Depression (BATD) designed for adolescents and delivered in eight sessions (Brief BA). This case example illustrates how a structured, brief intervention was useful for a depressed young person with a number of complicating and risk factors

Implementation of routine outcome measurement in child and adolescent mental health services in the United Kingdom: a critical perspective

The aim of this commentary is to provide an overview of clinical outcome measures that are currently recommended for use in UK Child and Adolescent Mental Health Services (CAMHS), focusing on measures that are applicable across a wide range of conditions with established validity and reliability, or innovative in their design. We also provide an overview of the barriers and drivers to the use of Routine Outcome Measurement (ROM) in clinical practice

S1PR2 variants associated with auditory function in humans and endocochlear potential decline in mouse

Progressive hearing loss is very common in the population but we still know little about the underlying pathology. A new spontaneous mouse mutation (stonedeaf, stdf ) leading to recessive, early-onset progressive hearing loss was detected and exome sequencing revealed a Thr289Arg substitution in Sphingosine-1-Phosphate Receptor-2 (S1pr2). Mutants aged 2 weeks had normal hearing sensitivity, but at 4 weeks most showed variable degrees of hearing impairment, which became severe or profound in all mutants by 14 weeks. Endocochlear potential (EP) was normal at 2 weeks old but was reduced by 4 and 8 weeks old in mutants, and the stria vascularis, which generates the EP, showed degenerative changes. Three independent mouse knockout alleles of S1pr2 have been described previously, but this is the first time that a reduced EP has been reported. Genomic markers close to the human S1PR2 gene were significantly associated with auditory thresholds in the 1958 British Birth Cohort (n = 6099), suggesting involvement of S1P signalling in human hearing loss. The finding of early onset loss of EP gives new mechanistic insight into the disease process and suggests that therapies for humans with hearing loss due to S1P signalling defects need to target strial function