On Risks of Estimates Based on Random-Size Samples

2020 ◽  
Vol 44 (1) ◽  
pp. 16-26
Author(s):  
V. E. Bening
Keyword(s):  
Random Size

Random size trees on the one and two dimensional integer lattice

1969 ◽  
Vol 6 (02) ◽  
pp. 301-308
Author(s):  
A.M.V. Verhagen
Keyword(s):  
Stochastic Process ◽  
Continuous Distribution ◽  
Integer Lattice ◽  
Two Dimensional ◽  
Random Size ◽  
Integer Lattices ◽  
The One

A stochastic process in which any tree in a forest planted on an integer lattice eliminates its four neighbours when it exceeds their heights, is studied for the case when all heights are independent samples from a continuous distribution. The proportion of the trees of the forest eliminated in this manner is determined for both the one and the two dimensional integer lattices.

RANDOM k-SET POOL DESIGNS WITH DISTINCT COLUMNS

2000 ◽  
Vol 14 (1) ◽  
pp. 49-56 ◽  
Author(s):  
F. K. Hwang
Keyword(s):  
Random Size ◽  
Test Sets ◽  
Identical Test

Random k-set pool designs are known to be efficient but suffer the presence of clones having identical test sets (hence indistinguishable). We propose a random pool design with distinct k-sets. We give an algorithm to generate the design and compute the expected numbers of unresolved negatives and unresolved positives. We show a relation between the two numbers which holds also for other random designs; hence, it can be used to obtain their expected numbers of unresolved positives which are not known. Among these other random designs, the random size-k design is a new design.

Random size trees on the one and two dimensional integer lattice

1969 ◽  
Vol 6 (2) ◽  
pp. 301-308
Author(s):  
A.M.V. Verhagen
Keyword(s):  
Stochastic Process ◽  
Continuous Distribution ◽  
Integer Lattice ◽  
Two Dimensional ◽  
Random Size ◽  
Integer Lattices ◽  
The One

A stochastic process in which any tree in a forest planted on an integer lattice eliminates its four neighbours when it exceeds their heights, is studied for the case when all heights are independent samples from a continuous distribution. The proportion of the trees of the forest eliminated in this manner is determined for both the one and the two dimensional integer lattices.

scholarly journals Corrections to the Capacitance between Two Electrodes Due to the Presence of Quantum Confined System

VLSI Design ◽  
1998 ◽  
Vol 6 (1-4) ◽  
pp. 345-349 ◽  
Author(s):  
M. Macucci ◽  
K. Hess
Keyword(s):  
Quantum Dots ◽  
Free Energy ◽  
Applied Voltage ◽  
Differential Capacitance ◽  
Quantum Capacitance ◽  
Parallel Plates ◽  
Random Size ◽  
Quantum Confined ◽  
Special Case ◽  
Confined System

We have studied the capacitance between two parallel plates enclosing a quantum confined system and its dependence on the applied voltage. The concepts of capacitance and differential capacitance are discussed together with their applicability to systems characterized by single.electron tunneling. We determine the tunneling thresholds by means of a formalism based on the minimization of the system free energy and we retrieve, as a special case, Luryi's quantum capacitance formula. We apply our method to the study of an idealized system made up of a number of quantum dots with random size distributed according to a gaussian. Results are shown for different choices of the position of the dots between the plates and of the voltage span applied to perform the measurement of the differential capacitance.

Sequential selection of an increasing subsequence from a sample of random size

1999 ◽  
Vol 36 (04) ◽  
pp. 1074-1085 ◽  
Author(s):  
Alexander V. Gnedin
Keyword(s):  
Random Number ◽  
Random Variables ◽  
Random Size ◽  
Sequential Selection ◽  
Expected Length ◽  
Decision Policies ◽  
Independent Identically Distributed ◽  
Selection Of

A random number of independent identically distributed random variables is inspected in strict succession. As a variable is inspected, it can either be selected or rejected and this decision becomes final at once. The selected sequence must increase. The problem is to maximize the expected length of the selected sequence. We demonstrate decision policies which approach optimality when the number of observations becomes in a sense large and show that the maximum expected length is close to an easily computable value.

AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS

2013 ◽  
Vol 30 (03) ◽  
pp. 1340009 ◽  
Author(s):  
SHUHUI JI ◽  
XIAOJIN ZHENG ◽  
XIAOLING SUN
Keyword(s):  
Matrix Decomposition ◽  
Knapsack Problems ◽  
Quadratic Program ◽  
Optimal Parameters ◽  
Piecewise Linearization ◽  
General Matrix ◽  
Random Size ◽  
Comparison Results ◽  
Continuous Relaxation ◽  
Quadratic Knapsack

We consider a chance-constrained quadratic knapsack problem (CQKP) where each item has a random size that is finitely distributed. We present a new convex 0-1 quadratic program reformulation for CQKP. This new reformulation improves the existing reformulation for general 0-1 quadratic program based on diagonal perturbation in the sense that the continuous relaxation of the new reformulation is tighter than or at least as tight as that of the existing reformulation. The improved reformulation is derived from a general matrix decomposition of the objective function and piecewise linearization of 0-1 variables. We show that the optimal parameters in the improved reformulation can be obtained by solving an SDP problem. Extension to k-item probabilistic quadratic knapsack problems is also discussed. Preliminary comparison results are reported to demonstrate the effectiveness of the improved reformulation.

Sign in / Sign up

Export Citation Format

Share Document