Other Incomplete Designs

1992 ◽  
pp. 223-243
Author(s):  
Harold R. Lindman
Keyword(s):  
Incomplete Designs

Verification of Incomplete Designs

2017 ◽  
pp. 37-72
Author(s):  
Bernd Becker ◽  
Christoph Scholl ◽  
Ralf Wimmer
Keyword(s):  
Incomplete Designs

scholarly journals The hunt for efficient, incomplete designs for stepped wedge trials with continuous recruitment and continuous outcome measures

2020 ◽  
Vol 20 (1) ◽  
Author(s):  
Richard Hooper ◽  
Jessica Kasza ◽  
Andrew Forbes
Keyword(s):  
Outcome Measures ◽  
Total Sample ◽  
Fixed Number ◽  
Good Precision ◽  
Efficient Design ◽  
Stepped Wedge ◽  
Continuous Outcome ◽  
Incomplete Designs ◽  
Before And After ◽  
Stepped Wedge Trials

Abstract Background We consider the design of stepped wedge trials with continuous recruitment and continuous outcome measures. Suppose we recruit from a fixed number of clusters where eligible participants present continuously, and suppose we have fine control over when each cluster crosses to the intervention. Suppose also that we want to minimise the number of participants, leading us to consider “incomplete” designs (i.e. without full recruitment). How can we schedule recruitment and cross-over at different clusters to recruit efficiently while achieving good precision? Methods The large number of possible designs can make exhaustive searches impractical. Instead we consider an algorithm using iterative improvements to hunt for an efficient design. At each iteration (starting from a complete design) a single participant – the one with the smallest impact on precision – is removed, and small changes preserving total sample size are made until no further improvement in precision can be found. Results Striking patterns emerge. Solutions typically focus recruitment and cross-over on the leading diagonal of the cluster-by-time diagram, but in some scenarios clusters form distinct phases resembling before-and-after designs. Conclusions There is much to be learned about optimal design for incomplete stepped wedge trials. Algorithmic searches could offer a practical approach to trial design in complex settings generally.

Some Holey Designs and Incomplete Designs for the Join Graph of and with a Pendent Edge

2013 ◽  
Vol 347-350 ◽  
pp. 2885-2888
Author(s):  
Xiao Shan Liu ◽  
Qi Wang
Keyword(s):  
Join Graph ◽  
Incomplete Designs ◽  
Vertex Set

A-design of is a pair , where is the vertex set of and is a collection of subgraphs of , such that each block is isomorphic to and any two distinct vertices in are joined in exact (at most, at least) blocks of . In this paper, we will discuss some holey designs and incomplete designs for the join graph of and with a pendent edge for .

The Mathematics of Experimental Design: Incomplete Designs and Latin Squares

1970 ◽  
Vol 7 (1) ◽  
pp. 127
Author(s):  
Bertram Schoner ◽  
S. Vajda
Keyword(s):  
Experimental Design ◽  
Latin Squares ◽  
Incomplete Designs
Sign in / Sign up

Export Citation Format

Share Document