نتایج جستجو برای: optimal size

تعداد نتایج: 894468  

2011
James MS Wason Thomas Jaki

In early stages of drug development there is often uncertainty about the most promising among a set of different treatments. In order to ensure the best use of resources it is important to decide which, if any, of the treatments should be taken forward for further testing. Multi-arm multi-stage (MAMS) trials provide gains in efficiency over separate randomised trials of each treatment. They all...

2004
EUGENE KHMELNITSKY MICHAL TZUR

We consider a capacitated production-inventory problem in both discreteand continuous-time, stationary settings. In the discretetime setting we analyze the infinite horizon capacitated dynamic lot-sizing problem, find the optimal solution and characterize its properties. For the continuous-time setting we formulate a new problem, which we claim to be an appropriate counterpart of the above disc...

2007
KATHRYN CHALONER

In nonlinear regression problems, the assumption is usually made that parameter estimates will be approximately normally distributed. The accuracy of the approximation depends on the sample size and also on the intrinsic and parameter-eeects curvatures. Based on these curvatures, criteria are deened here that indicate whether or not an experiment will lead to estimates with distributions well a...

2015
Victoria Vickerstaff Gareth Ambler Rumana Z Omar

In clinical trials, multiple primary outcomes are often needed to assess the effectiveness of an intervention as a single primary outcome can be insufficient to describe all aspects of a complex disorder. These outcomes are often correlated. Many procedures for addressing multiple outcomes have been introduced; however, most of the commonly used methods do not make use of the correlations among...

Journal: :Discrete Applied Mathematics 2004
Meinard Müller Masakazu Jimbo

In this paper, we investigate erasure-resilient codes coming from Steiner 2-designs with block size k which can correct up to any k erasures. In view of applications it is desirable that such a code can also correct as many erasures of higher order as possible. Our main result is that the erasure-resilient code constructed from an affine space with block size q – a special Steiner 2-design – ca...

1999
Vladimir P. Dragalin Alexander G. Tartakovsky Venugopal V. Veeravalli

{ The problem of sequential testing of multiple hypotheses is considered, and two candidate sequential test procedures are studied. Both tests are multihypothesis versions of the binary sequential probability ratio test (SPRT), and are referred to as MSPRT's. The rst test is motivated by Bayesian optimality arguments, while the second one corresponds to a generalized likelihood ratio test. It i...

Journal: :CoRR 2017
Yodai Watanabe

Randomness extraction against side information is the art of distilling from a given source a key which is almost uniform conditioned on the side information. This paper provides randomness extraction against quantum side information whose extractable key length is given by a quantum generalization of the conditional collision entropy defined without the conventional smoothing. Based on the fac...

1999
Vladimir P. Dragalin Alexander G. Tartakovsky Venugopal V. Veeravalli

{ The problem of sequential testing of multiple hypotheses is considered, and two candidate sequential test procedures are studied. Both tests are multihypothesis versions of the binary sequential probability ratio test (SPRT), and are referred to as MSPRT's. The rst test is motivated by Bayesian optimality arguments, while the second one corresponds to a generalized likelihood ratio test. It i...

2005
STEVEN M. BORTNICK ANGELA M. DEAN THOMAS J. SANTNER

The problem of providing lower confidence bounds for the mean improvements of p ≥ 2 test treatments over a control treatment is considered. The expected average and expected maximum allowances are two criteria for comparing different systems of confidence intervals or bounds. In this paper, lower bounds are derived for the expected average allowance and the expected maximum allowance of Dunnett...

Journal: :IACR Cryptology ePrint Archive 2013
Rodolphe Lampe Yannick Seurin

We consider tweakable blockciphers with beyond the birthday bound security. Landecker, Shrimpton, and Terashima (CRYPTO 2012) gave the first construction with security up to O(22n/3) adversarial queries (n denotes the block size in bits of the underlying blockcipher), and for which changing the tweak does not require changing the keys for blockcipher calls. In this paper, we extend this constru...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید