Bayesian Confidence Limits For The Reliability Of Mixed Cascade And Parallel Independent Exponential Subsystems

This paper deals with the theoretical problem of deriving Bayesian confidence intervals for the reliability of a system consisting of both cascade and parallel subsystems where each subsystem is independent and has an exponential failure probability density function (pdf). This approach is applicable when test data are available for each individual subsystem and not for the entire system. The Mellin integral transform is used to analyze the system in a step-by-step procedure until the posterior pdf of the system reliability is obtained. The posterior cumulative distribution function is then obtained in the usual manner by integrating the pdf, which serves the dual purpose of yielding system reliability confidence limits while at the same time providing a check on the accuracy of the derived pdf. A computer program has been written in FORTRAN IV to evaluate the confidence limits. An example is presented which uses the computer program. Copyright © 1974 by The Institute of Electrical and Electronics Engineers, Inc

APIS: Arkansas Planning Information System

The Federal Water Pollution Control Act Amendments of 1972 call for the restoration and maintenance of the chemical, physical and biological integrity of the Nation\u27s waters. The Act sets forth two primary goals; 1) the elimination of the discharge of all pollutants into the navigable waters of the United States by 1985 and 2) an interim level of water quality that provides for the protection of fish, shellfish, wildlife and recreation by July 1, 1983. Section 208 of the Act mandated the development and implementation of area wide water quality management plans to achieve the goals previously mentioned

Public-Key Encryption with Efficient Amortized Updates

Searching and modifying public-key encrypted data (without having the decryption key) has received a lot of attention in recent literature. In this paper we re-visit this important problem and achieve much better amortized communication-complexity bounds. Our solution resolves the main open question posed by Boneh at al., \cite{BKOS07}. First, we consider the following much simpler to state problem (which turns out to be central for the above): A server holds a copy of Alice\u27s database that has been encrypted under Alice\u27s public key. Alice would like to allow other users in the system to replace a bit of their choice in the server\u27s database by communicating directly with the server, despite other users not having Alice\u27s private key. However, Alice requires that the server should not know which bit was modified. Additionally, she requires that the modification protocol should have ``small communication complexity (sub-linear in the database size). This task is referred to as private database modification, and is a central tool in building a more general protocol for modifying and searching over public-key encrypted data with small communication complexity. The problem was first considered by Boneh at al., \cite{BKOS07}. The protocol of \cite{BKOS07} to modify $1$ bit of an $N$-bit database has communication complexity $\mathcal{O}(\sqrt N)$. Naturally, one can ask if we can improve upon this. Unfortunately, \cite{OS08} give evidence to the contrary, showing that using current algebraic techniques, this is not possible to do. In this paper, we ask the following question: what is the communication complexity when modifying $L$ bits of an $N$-bit database? Of course, one can achieve naive communication complexity of $\mathcal{O}(L\sqrt N)$ by simply repeating the protocol of \cite{BKOS07}, $L$ times. Our main result is a private database modification protocol to modify $L$ bits of an $N$-bit database that has communication complexity $\mathcal{O}(\sqrt{NL^{1+\alpha}}\textrm{poly-log~} N)$, where $0<\alpha<1$ is a constant. (We remark that in contrast with recent work of Lipmaa \cite{L08} on the same topic, our database size {\em does not grow} with every update, and stays exactly the same size.) As sample corollaries to our main result, we obtain the following: \begin{itemize} \item First, we apply our private database modification protocol to answer the main open question of \cite{BKOS07}. More specifically, we construct a public key encryption scheme supporting PIR queries that allows every message to have a non-constant number of keywords associated with it. \item Second, we show that one can apply our techniques to obtain more efficient communication complexity when parties wish to increment or decrement multiple cryptographic counters (formalized by Katz at al. ~\cite{KMO01}). \end{itemize} We believe that ``public-key encrypted\u27\u27 amortized database modification is an important cryptographic primitive in it\u27s own right and will be a useful in other applications

Hard-Core Predicates for a Diffie-Hellman Problem over Finite Fields

A long-standing open problem in cryptography is proving the existence of (deterministic) hard-core predicates for the Diffie-Hellman problem defined over finite fields. In this paper, we make progress on this problem by defining a very natural variation of the Diffie-Hellman problem over $\mathbb{F}_{p^2}$ and proving the unpredictability of every single bit of one of the coordinates of the secret DH value. To achieve our result, we modify an idea presented at CRYPTO\u2701 by Boneh and Shparlinski [4] originally developed to prove that the LSB of the elliptic curve Diffie-Hellman problem is hard. We extend this idea in two novel ways: 1. We generalize it to the case of finite fields $\mathbb{F}_{p^2}$; 2. We prove that any bit, not just the LSB, is hard using the list decoding techniques of Akavia et al. [1] (FOCS\u2703) as generalized at CRYPTO\u2712 by Duc and Jetchev [6]. In the process, we prove several other interesting results: - Our result also hold for a larger class of predicates, called \emph{segment predicates} in [1]; - We extend the result of Boneh and Shparlinski to prove that every bit (and every segment predicate) of the elliptic curve Diffie-Hellman problem is hard-core; - We define the notion of \emph{partial one-way function} over finite fields $\mathbb{F}_{p^2}$ and prove that every bit (and every segment predicate) of one of the input coordinates for these functions is hard-core

Hardness of Learning Problems over Burnside Groups of Exponent 3

In this work we investigate the hardness of a computational problem introduced in the recent work of Baumslag et al. In particular, we study the $B_n$-LHN problem, which is a generalized version of the learning with errors (LWE) problem, instantiated with a particular family of non-abelian groups (free Burnside groups of exponent 3). In our main result, we demonstrate a random self-reducibility property for $B_n$-LHN. Along the way, we also prove a sequence of lemmas regarding homomorphisms of free Burnside groups of exponent 3 that may be of independent interest

Spin relaxation in (110) and (001) InAs/GaSb superlattices

We report an enhancement of the electron spin relaxation time (T1) in a (110) InAs/GaSb superlattice by more than an order of magnitude (25 times) relative to the corresponding (001) structure. The spin dynamics were measured using polarization sensitive pump probe techniques and a mid-infrared, subpicosecond PPLN OPO. Longer T1 times in (110) superlattices are attributed to the suppression of the native interface asymmetry and bulk inversion asymmetry contributions to the precessional D'yakonov Perel spin relaxation process. Calculations using a nonperturbative 14-band nanostructure model give good agreement with experiment and indicate that possible structural inversion asymmetry contributions to T1 associated with compositional mixing at the superlattice interfaces may limit the observed spin lifetime in (110) superlattices. Our findings have implications for potential spintronics applications using InAs/GaSb heterostructures.Comment: 4 pages, 2 figure

The risk of cesarean delivery after labor induction among women with prior pregnancy complications: a subgroup analysis of the AFFIRM study

Background:To determine the risk of cesarean delivery after labor induction among patients with prior placenta-mediated pregnancy complications (pre-eclampsia, late pregnancy loss, placental abruption or intrauterine growth restriction).MethodsThe AFFIRM database includes patient level data from 9 randomized controlled trials that evaluated the role of LMWH versus no LMWH during pregnancy to prevent recurrent placenta-mediated pregnancy complications. The primary outcome of this sub-study was the proportion of women who had an unplanned cesarean delivery after induction of labor compared to after spontaneous labor.Results: There were 512 patients from 7 randomized trials included in our sub-study. There was no difference in the risk of cesarean delivery between women with labor induction (21/148, 14.2%) and spontaneous labor (79/364, 21.7%) (odds ratio (OR) 0.60, 95% CI, 0.35-1.01; p=0.052). Among 274 women who used LMWH prophylaxis during pregnancy, the risk of cesarean delivery was lower among those that underwent labor induction (9.8%) compared to spontaneous labor (22.4%) (OR 0.38, 95% CI, 0.17-0.84; p=0.01).Conclusions: The risk of cesarean delivery is not increased after labor induction among a higher risk patient population with prior pregnancy complications. Our results suggest that women who receive LMWH during pregnancy might benefit from labor induction.</div

Hyperuricemia and hypertriglyceridemia: Metabolic basis for the association

Hypertriglyceridemia has been reported frequently in patients with hyperuricemia and gout. The current studies have evaluated this relationship. To examine whether hypertriglyceridemia leads to hyperuricemia, IV Intralipid was given to three gouty patients. Triglycerides increased from 169 to 700 mg/dl for three hours but caused no change in serum urate level or urine uric acid and oxypurine excretion. We next examined whether high carbohydrate intake increases serum urate and triglyceride levels. Four obese patients were placed on a 2000 kcal/d sucrose diet for seven days. The serum urate increased from 6.3 +/- 1.7 to 7.9 +/- 2.0 mg/dL. The percent uric acid clearance to creatinine clearance decreased from 5.9 +/- 1.3 to the lowest mean value of 3.7 +/- 1.2, while serum triglycerides increased from 106 +/- 33 to 252 +/- 57 mg/dL and blood lactate from 607 +/- 227 to 1167 +/- 381 [mu]mol/L. A 3000 kcal/d glucose diet in four other obese subjects produced no change in serum urate levels but increased lactate and triglyceride levels. During an isocaloric sucrose diet in two normal men, the serum urate level increased from 5.3 and 4.0 to peak values of 9.5 and 7.4 mg/dL. The percent uric acid to creatinine clearance decreased from 5.6 and 6.6 to 2.9 and 3.3. The uric acid turnover did not increase. In three gouty patients the mean serum urate increased from 8.5 +/- 1.5 to 10.6 +/- 1.4 mg/dL following an isocaloric sucrose diet. The urine uric acid excretion increased from 0.30 and 0.25 to 0.37 and 0.38 mg/mg creatinine in two patients. The percent uric acid clearance to creatinine clearance decreased from 3.8 to 2.5 in one patient. The serum triglycerides were substantially elevated during the sucrose diet in the normal subjects and the gouty patients. Our studies show that a pure sucrose diet increases both the serum urate and triglyceride levels. The mechanism of the hyperuricemia is decreased renal clearance of uric acid in the obese normal controls and the normal subjects. Increased urate production and decreased uric acid clearance accounted for the hyperuricemia in the gouty patients. The contribution of excessive sucrose ingestion to clinically associated hyperuricemia and hypertriglyceridemia remains to be elucidated.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/25613/1/0000161.pd