...
首页> 外文期刊>Biometrika >OPTIMALITY AND EFFICIENCY OF TWO-TREATMENT REPEATED MEASUREMENTS DESIGNS
【24h】

OPTIMALITY AND EFFICIENCY OF TWO-TREATMENT REPEATED MEASUREMENTS DESIGNS

机译:两次重复测量设计的最优性和效率

获取原文
获取原文并翻译 | 示例
           

摘要

For an arbitrary covariance matrix and any number of treatments and periods, necessary and sufficient conditions for the optimality of a repeated measurements, i,e, crossover or changeover, design were given in the, as yet, unpublished report by H. B. Kushner 'Optimal repeated measurements designs: the linear optimality equations' (Kushner, report). Here we specialise the results to the two-treatment case. We give linear equations whose solutions are the proportions of subjects allocated to each treatment sequence in the most general optimal design, The treatment effects information matrix of an optimal design is also presented. The results are applied to several situations, For arbitrary covariance matrices, we show that designs consisting of at most two treatment sequences and their duals must necessarily be dual balanced to be optimal, For autoregressive covariance matrices, we confirm that designs of Matthews (1987) for three and four periods are optimal and we derive new optimal designs for five and six periods. Some optimality results of Laska & Meisner (1985) are extended. A simple formula for the efficiency of a dual balanced nonoptimal design is provided and used to compute the exact efficiencies of some of Kunert's (1991) designs. [References: 11]
机译:对于任意协方差矩阵和任意数量的处理和周期,要获得最佳重复测量(即交叉或转换)的必要条件和充分条件,请在尚未发表的HB Kushner报告中进行设计。测量设计:线性最优方程(库什纳,报告)。在这里,我们将结果专门用于两次治疗的情况。我们给出了线性方程,其解是最一般的最优设计中分配给每个治疗序列的对象的比例,并给出了最优设计的治疗效果信息矩阵。结果适用于多种情况,对于任意协方差矩阵,我们表明最多由两个处理序列及其对偶构成的设计必须进行对偶平衡才能达到最优;对于自回归协方差矩阵,我们确认Matthews(1987)的设计三个和四个周期的最优设计,我们得出五个和六个周期的新最优设计。 Laska&Meisner(1985)的一些最优结果得到了扩展。提供了一个双重平衡非最优设计效率的简单公式,并用于计算某些Kunert(1991)设计的确切效率。 [参考:11]

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号