A simple method for constructing confounded designs for mixed factorial experiments

This paper presents the sinplesr procedure that uses wodular aryithmetic for constructing confounded designs for mixed factorial experiments. The present procedure and the classical one for confounding in symmetrical factorial experiments are both at the same mathema.tical level. The present procedure is written for

practitioners and is lllustrared with several examples.     

Confounding in mixed factorial experiments through isomorphisms

The derivation of a simpie mexhoa for confounding in mixed factorial experiments from an isomorphism of finite abelian groups is presented. The theoretical bases of confounding procedures that use modular arithmetic for such experiments are compared.     

Marginally oversaturated designs

A special class of supersaturated design, called marginally over saturated design (MOSD), in which the number of variables under investigation (k) is only slightly larger than the number of experimental runs (n), is presented. Several optimality criteria for supersaturated designs are discussed. It is shown that the resolution rank criterion is most appropriate for screening situations. The construction method builds on two major theorems which provide an efficient way to evaluate resolution rank. Examples are given for the cases n=8, 12, 16, and 20. Potential extensions for future work are discussed.     

Estimation of parameters and reliability from generalized life models

Simultaneous estimation of parameters with p (≥ 2) components, where each component has a generalized life distribution, is considered under a sum of squared error loss function. Improved estimators are obtained which dominate the maximum likelihood and the niinimum mean square estimators. Robustness of the improved estimators is shown even when the component distributions are dependent. The result is extended to the estimation of the system reliability when the components are connected in series. Several numerical studies are performed to demonstrate the risk improvement and the Pitman closeness of the new estimators.     

Extension of the pool-adjacent-violators algorithm

The pool-adjacent-violators algorithm (PAVA) is an efficient algorithm which converges in a finite number of steps. However, it has been applicable so far only in isotonic regression with the simple order. This report extends its applicability to other quadratic programming problems, including certain one-sided multivariate testing problems and concave regression problems.     

Economic-statistical design of X ¥ charts for non-normal data by considering quality loss

When the X ¥ control chart is used to monitor a process, three parameters should be determined: the sample size, the sampling interval between successive samples, and the control limits of the chart. Duncan presented a cost model to determine the three parameters for an X ¥ chart. Alexander et al. combined Duncan's cost model with the Taguchi loss function to present a loss model for determining the three parameters. In this paper, the Burr distribution is employed to conduct the economic-statistical design of X ¥ charts for non-normal data. Alexander's loss model is used as the objective function, and the cumulative function of the Burr distribution is applied to derive the statistical constraints of the design. An example is presented to illustrate the solution procedure. From the results of the sensitivity analyses, we find that small values of the skewness coefficient have no significant effect on the optimal design; however, a larger value of skewness coefficient leads to a slightly larger sample size and sampling interval, as well as wider control limits. Meanwhile, an increase on the kurtosis coefficient results in an increase on the sample size and wider control limits.     

青岛一套表的实践与经验

 企业统计一套表一直是统计制度方法改革和实践中的焦点问题。本文通过对青岛市统计局企业一套表制度实施情况的案例分析,系统界定了企业一套表的概念和内涵,全面展现了企业一套表的运作过程,客观分析了制约企业一套表实施的主要原因,并提出了在现阶段实施企业统计一套表的条件和要求。     

Sparse additive models

Summary.  We present a new class of methods for high dimensional non-parametric regression and classification called sparse additive models. Our methods combine ideas from sparse linear modelling and additive non-parametric regression. We derive an algorithm for fitting the models that is practical and effective even when the number of covariates is larger than the sample size. Sparse additive models are essentially a functional version of the grouped lasso of Yuan and Lin. They are also closely related to the COSSO model of Lin and Zhang but decouple smoothing and sparsity, enabling the use of arbitrary non-parametric smoothers. We give an analysis of the theoretical properties of sparse additive models and present empirical results on synthetic and real data, showing that they can be effective in fitting sparse non-parametric models in high dimensional data.     

Parametric non-mixture cure models for schedule finding of therapeutic agents

We propose a phase I clinical trial design that seeks to determine the cumulative safety of a series of administrations of a fixed dose of an investigational agent. In contrast with traditional phase I trials that are designed solely to find the maximum tolerated dose of the agent, our design instead identifies a maximum tolerated schedule that includes a maximum tolerated dose as well as a vector of recommended administration times. Our model is based on a non-mixture cure model that constrains the probability of dose limiting toxicity for all patients to increase monotonically with both dose and the number of administrations received. We assume a specific parametric hazard function for each administration and compute the total hazard of dose limiting toxicity for a schedule as a sum of individual administration hazards. Throughout a variety of settings motivated by an actual study in allogeneic bone marrow transplant recipients, we demonstrate that our approach has excellent operating characteristics and performs as well as the only other currently published design for schedule finding studies. We also present arguments for the preference of our non-mixture cure model over the existing model.     

Unifying CRM and EWOC designs for phase I cancer clinical trials

The main goal of phase I cancer clinical trials is to determine the highest dose of a new therapy associated with an acceptable level of toxicity for the use in a subsequent phase II trial. The continual reassessment method (CRM) [O’Quigley, J., Pepe, M., Fisher, L., 1990. Continual reassessment method: a practical design for phase I clinical trials in cancer. Biometrics 46, 33–48] and escalation with overdose control (EWOC) [Babb, J., Rogatko, A., Zacks, S., 1998. Cancer phase I clinical trials: efficient dose escalation with overdose control. Statist. Med. 17 (10), 1103–1120] are two model-based designs used for phase I cancer clinical trials. A few modifications of the (original) CRM and EWOC have been made by many authors. In this paper, we show how CRM and EWOC can be unified and present a hybrid design. We study the characteristics of the approach of the hybrid design. The comparisons of the three designs (CRM, EWOC, and the hybrid design) are presented by convergence rates and overdose proportions. The simulation results show that the hybrid design generally has faster convergence rates than EWOC and smaller overdose proportions than CRM, especially when the true maximum tolerated dose (MTD) is above the mid-level of the dose range considered. The performance of these three designs is also evaluated in terms of sensitivity to outliers.