Results 301 to 310 of about 142,506 (314)

Common Randomization Restrictions

2009
The examples presented in Chapters 1 and 2 were either unreplicated full factorial designs with random assignment of treatment combinations to runs or they were replicated experiments obtained without any restriction to run order. Some experiments are too large to be run effectively in this manner.
openaire   +2 more sources

Local matching of random restriction maps

Journal of Applied Probability, 2001
Optical mapping is a new technique to generate restriction maps of DNA easily and quickly. DNA restriction maps can be aligned by comparing corresponding restriction fragment lengths. To relate, organize, and analyse these maps it is necessary to rapidly compare maps. The issue of the statistical significance of approximately matching maps then becomes
Mengxiang Tang, Michael S. Waterman
openaire   +2 more sources

On random walks with restricted reversals

Mathematical Proceedings of the Cambridge Philosophical Society, 1958
1. Introduction. Problems of unrestricted random walks on lattices have been considered by many authors and methods have been discovered for the exact enumeration of the number of walks between two points, for obtaining asymptotic estimates of the distribution functions and for evaluating special parameters such as the probability of ultimate retum to ...
M. E. Fisher, C. Domb
openaire   +2 more sources

Hadamard randomization: a valid restriction of random permuted blocks

Biometrical Journal, 2003
AbstractRandom permuted blocks can result in treatment imbalance if entry to the trial stops in mid‐block. This paper presents a restriction of this method of randomization. The restriction avoids severe treatment imbalance but gives unbiased estimators of the treatment difference and its variance.
R. A. Bailey, P.R. Nelson
openaire   +2 more sources

Randomized Post-optimization for t-Restrictions

2013
Search, test, and measurement problems in sparse domains often require the construction of arrays in which every t or fewer columns satisfy a simply stated combinatorial condition. Such t-restriction problems often ask for the construction of an array satisfying the t-restriction while having as few rows as possible.
Peyman Nayeri, Charles J. Colbourn
openaire   +2 more sources

Restricted Randomization Designs in Clinical Trials

Biometrics, 1979
Though therapeutic clinical trials are often categorized as using either "randomization" or "historical controls" as a basis for treatment evaluation, pure random assignment of treatments is rarely employed. Instead various restricted randomization designs are used.
openaire   +3 more sources

Averages in restricted random walks

Journal of Physics A: Mathematical and General, 1981
In configurational studies of polymer chains one is sometimes concerned with averages in the presence of restrictions, e.g. that the end-to-end distance of the chain is R. The standard method of calculating such averages is to assume that the separation of all pairs of elements is Gaussian.
openaire   +2 more sources

Random Hypergraph Processes with Degree Restrictions

Graphs and Combinatorics, 2004
A d-process for s-uniform hypergraphs starts with an empty hypergraph on n vertices, and adds one s-tuple at each time step, chosen uniformly at random from those s-tuples which are not already present as a hyperedge and which consist entirely of vertices with degree less than d.
Andrzej Ruciński, Catherine Greenhill, Nicholas C. Wormald   +2 more
openaire   +2 more sources

Restrictions on Randomization [PDF]

, 2018
Virgil L. Anderson, Thomas J. Lorenzen
openaire   +1 more source

Restricted random walks and the use of moments

Philosophical Magazine, 1958
Abstract It is shown that the method of moments can be applied to many problems of random walks on lattices with inequivalent sites. The method is illustrated by two simple examples.
openaire   +2 more sources