A constrained optimum experimental design problem for model discrimination with a continuously varying factor

We present the theoretical background and the numerical procedure for calculating optimum experimental designs for non-linear model discrimination in the presence of constraints. The design support points consist of two kinds of factors: a continuous function of time and discrete levels of other quantitative factors. That is, some of the experimental conditions are allowed to continually vary during the experimental run. We implement the theory in a chemical kinetic model discrimination problem.     

Efficient run orders for a two-factor response surface experiment on a correlated process

The standard assumption in the design and analysis of response surface experiments is that the errors are uncorrelated with common variance. In practice however there may be serial dependence between the errors, in which case the efficiency of the design depends on the order in which the runs are carried out. We investigate the effect of run order on a two-factor response surface experiment when there is positive serial correlation, and recommend some particular run orders which are efficient under a wide range of conditions.     

A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation

The responses obtained from response surface designs that are run sequentially often exhibit serial correlation or time trends. The order in which the runs of the design are performed then has an impact on the precision of the parameter estimators. This article proposes the use of a variable-neighbourhood search algorithm to compute run orders that guarantee a precise estimation of the effects of the experimental factors. The importance of using good run orders is demonstrated by seeking D-optimal run orders for a central composite design in the presence of an AR(1) autocorrelation pattern.     

Optimal design of synthetic np control chart based on median run length

The synthetic np chart is a combination of the np sub-chart and the conforming run length sub-chart. A procedure for the optimal design of the synthetic np chart is provided by minimizing the out-of-control median run length (MRL). The comparative results show that the synthetic np chart performs better than the corresponding standard np chart for detecting process shifts in the fraction non conforming, in terms of the MRL. An example is given to illustrate the operation of the synthetic np chart.     

On use of symmetrical balanced incomplete block design in construction of sampling design realising pre-assigned sets of inclusion probabilities of first two orders.

Gupta, Nigam and Kumar (1982) proposed a sampling scheme using certain combinatorial properties of balanced incomplete block design (BIBD) which realises first order inclusion probabilities proportional to measure of size(IPPS). Here their results have been extended by presenting samplng schemes realising pre-assigned sets of inclusion probabilities of first two orders.     

An optimization model for economic design of sampling plans based on conforming run length considering outgoing quality

In this article, a new economical acceptance sampling model is proposed based on Taguchi loss function. The objective function of the model consists of inspection cost, scrap cost, and Taguchi loss function including producer loss and consumer loss. The expected total cost includes the loss for an inspected item plus the loss for an accepted item which has not been inspected. Decision-making is based on conforming run length. It is assumed that the quality characteristics follow normal distribution. A numerical example is solved for illustrating application of this model. Sensitivity analysis is proposed for illustrating the effect of some important parameters on the objective function. Finally, we compared the results of the proposed method with classical Dodge–Romig sampling plans tables based on average outgoing quality limit. The results confirmed the superiority of proposed model.     

Minimally changed run sequences in factorial experiments

Randomization of run sequences in factorial experiments may result in large number of changes in factor levels which will make the experimentation expensive, time-consuming and difficult. Experiments in which it is difficult to change the levels of factor(s) use of minimally changed run sequences may often be preferable to a random run sequence. In the present paper, we have developed method for obtaining minimally changed run sequences for factorial experiments. The general expression of factor-wise number of level changes for the developed minimally changed run sequences has also been obtained. A relationship has been established between the time count effect of a lower order factorial with minimally changed run sequences and that of a higher order factorial with minimally changed run sequences obtained through the lower order minimally changed run sequences. For providing a readymade solution to the end users, a SAS macro has also been developed for generating these minimally changed run sequences along with its parameters.     

Testing stochastic orders in tails of contingency tables

Testing for the difference in the strength of bivariate association in two independent contingency tables is an important issue that finds applications in various disciplines. Currently, many of the commonly used tests are based on single-index measures of association. More specifically, one obtains single-index measurements of association from two tables and compares them based on asymptotic theory. Although they are usually easy to understand and use, often much of the information contained in the data is lost with single-index measures. Accordingly, they fail to fully capture the association in the data. To remedy this shortcoming, we introduce a new summary statistic measuring various types of association in a contingency table. Based on this new summary statistic, we propose a likelihood ratio test comparing the strength of association in two independent contingency tables. The proposed test examines the stochastic order between summary statistics. We derive its asymptotic null distribution and demonstrate that the least favorable distributions are chi-bar distributions. We numerically compare the power of the proposed test to that of the tests based on single-index measures. Finally, we provide two examples illustrating the new summary statistics and the related tests.     

On inequalities in constrained random variables

A unified treatment allows an inequality due to Mallows and an inequality due to Slepian to be generalized     

Selecting the optimum k in ridge regression

Two ridge rules are proposed for selecting the optimal k in ridge regression . Since the sampling distribution of the proposed rules are mathematically in tractable , a Monte Carlo study is conducted to examine their statisticl properties . Numerical results of the simulations in dicate that the performance of ridge rules depends upon the risk function used. Nevertheless, one of the ridge rules does produce a smaller mean squared error than the least squares estimator with the probability greater than 0.57 for all situations.     

Influence diagnostics in constrained general linear models

ABSTRACT

Constrained general linear models (CGLMs) have wide applications in practice. Similar to other data analysis, the identification of influential observations that may be potential outliers is an important step beyond in the CGLMs. We develop multiple case-deletion diagnostics for detecting influential observations in the CGLMs. The diagnostics are functions of basic building blocks: studentized residuals, error contrast matrix, and the inverse of the response variable covariance matrix. The basic building blocks are computed only once from the complete data analysis and provide information on the influence of the data on different aspects of the model fit. Computational formulas are given which make the procedures feasible. An illustrative example with a real data set is also reported.     

Mixture designs for constrained components in orthogonal blocks

It is often the case in mixture experiments that some of the ingredients, such as additives or flavourings, are included with proportions constrained to lie in a restricted interval, while the majority of the mixture is made up of a particular ingredient used as a filler. The experimental region in such cases is restricted to a parallelepiped in or near one corner of the full simplex region. In this paper, orthogonally blocked designs with two experimental blends on each edge of the constrained region are considered for mixture experiments with three and four ingredients. The optimal symmetric orthogonally blocked designs within this class are determined and it is shown that even better designs are obtained for the asymmetric situation, in which some experimental blends are taken at the vertices of the experimental region. Some examples are given to show how these ideas may be extended to identify good designs in three and four blocks. Finally, an example is included to illustrate how to overcome the problems of collinearity that sometimes occur when fitting quadratic models to experimental data from mixture experiments in which some of the ingredient proportions are restricted to small values.     

Optimum mixture designs in some constrained experimental regions

In a mixture experiment, the response depends on the mixing proportions of the components present in the mixture. Optimum designs are available for the estimation of parameters of the models proposed in such situations. However, these designs are found to include the vertex points of the simplex Ξ defining the experimental region, which are not mixtures in the true sense. Recently, Mandal et al. (2015 Mandal, N.K., Pal, M., Sinha, B.K., and Das, P. (2015). Optimum mixture designs in a restricted region. Stat. Pap. 56(1):105–119.[Crossref], [Web of Science ®] , [Google Scholar]) derived optimum designs when the experiment is confined to an ellipsoidal region within Ξ, which does not include the vertices of Ξ. In this paper, an attempt has been made to find optimum designs when the experimental region is a simplex or is cuboidal inside Ξ and does not contain the extreme points.     

The multiplier method in constrained estimation of covariance structure models

Based on the multiplier method of constrained minimization, an algorithm is developed to handle the constrained estimation problem in covariance structure analysis. In the context of a general model which has wide applicability in multivariate medical and behavioural researches, computer programs are implemented to produce the weighted least squares estimates and the maximum likelihood estimates. The multiplier method is compared with the penalty function method in terms of computer time, number of iterations and number of unconstrained minimizations. The indication is that the multiplier method is substantially better.     

Convergence properties of the EM algorithm in constrained parameter spaces

The established general results on convergence properties of the EM algorithm require the sequence of EM parameter estimates to fall in the interior of the parameter space over which the likelihood is being maximized. This paper presents convergence properties of the EM sequence of likelihood values and parameter estimates in constrained parameter spaces for which the sequence of EM parameter estimates may converge to the boundary of the constrained parameter space contained in the interior of the unconstrained parameter space. Examples of the behavior of the EM algorithm applied to such parameter spaces are presented.     

Wald's approximations to the average run length in cusum procedures

Wald's approximation to the ARL(average run length in cusum) (cumulative sum) procedures are given for an exponential family of densities. From these approximations it is shown that Page's (1954) cusum procedure is (in a sense) identical with a cusum procedure defined in terms of likelihood ratios. Moreover, these approximations are improved by estimating the excess over the boundary and their closeness is examined by numerical comparisons with some exact results. Some examples are also given.