On the use of partial confounding for the construction of alternative regular two-level blocked fractional factorial designs

In this paper, we consider experimental situations in which a regular fractional factorial design is to be used to study the effects of m two-level factors using n=2^m−k experimental units arranged in 2^p blocks of size 2^m−k−p. In such situations, two-factor interactions are often confounded with blocks and complete information is lost on these two-factor interactions. Here we consider the use of the foldover technique in conjunction with combining designs having different blocking schemes to produce alternative partially confounded blocked fractional factorial designs that have more estimable two-factor interactions or a higher estimation capacity or both than their traditional counterparts.     

Generalized Weibull Linear Models

For the first time, a new class of generalized Weibull linear models is introduced to be competitive to the well-known generalized (gamma and inverse Gaussian) linear models which are adequate for the analysis of positive continuous data. The proposed models have a constant coefficient of variation for all observations similar to the gamma models and may be suitable for a wide range of practical applications in various fields such as biology, medicine, engineering, and economics, among others. We derive a joint iterative algorithm for estimating the mean and dispersion parameters. We obtain closed form expressions in matrix notation for the second-order biases of the maximum likelihood estimates of the model parameters and define bias corrected estimates. The corrected estimates are easily obtained as vectors of regression coefficients in suitable weighted linear regressions. The practical use of the new class of models is illustrated in one application to a lung cancer data set.     

Schur optimality of one-way designs

In comparison of treatments using homogeneous experimental units, it is shown that a design is Schur optimal when treatment replications are as equal as possible.     

Central Limit Theorem approximations for the number of runs in Markov-dependent binary sequences

We consider Markov-dependent binary sequences and study various types of success runs (overlapping, non-overlapping, exact, etc.) by examining additive functionals based on state visits and transitions in an appropriate Markov chain. We establish a multivariate Central Limit Theorem for the number of these types of runs and obtain its covariance matrix by means of the recurrent potential matrix of the Markov chain. Explicit expressions for the covariance matrix are given in the Bernoulli and a simple Markov-dependent case by expressing the recurrent potential matrix in terms of the stationary distribution and the mean transition times in the chain. We also obtain a multivariate Central Limit Theorem for the joint number of non-overlapping runs of various sizes and give its covariance matrix in explicit form for Markov dependent trials.     

New difference-based estimator of parameters in semiparametric regression models

The paper introduces a new difference-based Liu estimator β?_Ldiff=([Xtilde]′[Xtilde]+I)^?1([Xtilde]′[ytilde]+η β?_diff) of the regression parameters β in the semiparametric regression model, y=Xβ+f+?. Difference-based estimator, β?_diff=([Xtilde]′[Xtilde])^?1[Xtilde]′[ytilde] and difference-based Liu estimator are analysed and compared with respect to mean-squared error (mse) criterion. Finally, the performance of the new estimator is evaluated for a real data set. Monte Carlo simulation is given to show the improvement in the scalar mse of the estimator.     

On Comparison Of Estimates Of Dispersion Using Generalized Pitman Nearness Criterion

In this paper, estimates QP dispersion matrix and its functions are compared based on generalized Pitman nearness criterion, Various Iosa functions are considered for the purpose. Locally superior estimates are defined and obtained. Comparison of these estimates are made with other standard ones. It is snown that within certain classes, defined in the paper, these are the best estimatcrs ia the generalized Fitman nearness sense     

基于区间数大小不能直接判定的灰矩阵博弈的策略优超及其最优解研究

对于区间灰数大小不能直接判定的灰矩阵博弈G(⊗)={S₁,S₂,A(⊗)}问题,其策略优超和纯策略求解问题的关键在于A(⊗)中区间灰数大小判定准则的设定与判定方法的设计。本文运用灰色系统思想和系统工程的理论,揭示了人们在灰信息条件下的博弈心理与博弈决策规则,根据区间灰数势关系的判定规则,提出了灰数势意义下的策略优超法则,定义了纯策略解。最后,以商业银行贷款动态损失准备金计提为案例,对其灰势意义下的策略优超和纯策略解问题进行了研究。     

The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices

We investigate the computational complexity of two special cases of the Steiner tree problem where the distance matrix is a Kalmanson matrix or a circulant matrix, respectively. For Kalmanson matrices we develop an efficient polynomial time algorithm that is based on dynamic programming. For circulant matrices we give an -hardness proof and thus establish computational intractability.     

The information matrix test in the linear regression with ARMA errors

Summary The paper shows that the informaton matrix test presented by White (1982) decomposes into the sum of quadratic forms in the case of a linear model with ARMA errors. By extending previous results, which analysed the information matrix test in the presence of serial correlation, the test allows detection of additional sources of misspecification.     

The Incremental Group Testing Model for Gap Closing in Sequencing Long Molecules

In this paper, we propose the incremental group testing model for the gap closing problem, which assumes that we can tell the difference between the outcome of testing a subset S, and the outcome of testing S {x}. We also give improvements over currently best results in literature for some other models.