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.     

时距估计干扰效应的研究与思考

已有的研究从不同作业类型下的干扰效应和相关的理论解释两个方面对时距估计干扰效应进行了剖析 ,未来的研究应以分段 /综合模型为基础进行探讨 ,时距加工的认知神经研究促进了人们对时间信息加工实质的理解。     

A correlation-theoretical interpretation of schur analysis

This paper is heavily leaned on the author's recent investigations concerning SCHUR analysis of non-negative Hermitian block matrices. The parameters of the matrix balls and the triangular choice scheme which describe a non-negative Hermitian block matrix will be interpreted in the framework of correlation theory     

Superiority comparisons between mixed regression estimators

This paper gives necessary and sufficient conditions for a mixed regression estimator to be superior to another mixed estimator. The comparisons are based on the mean square error matrices of the estimators. Both estimators are allowed to be biased.     

Standard errors for EM estimation

The EM algorithm is a popular method for computing maximum likelihood estimates. One of its drawbacks is that it does not produce standard errors as a by-product. We consider obtaining standard errors by numerical differentiation. Two approaches are considered. The first differentiates the Fisher score vector to yield the Hessian of the log-likelihood. The second differentiates the EM operator and uses an identity that relates its derivative to the Hessian of the log-likelihood. The well-known SEM algorithm uses the second approach. We consider three additional algorithms: one that uses the first approach and two that use the second. We evaluate the complexity and precision of these three and the SEM in algorithm seven examples. The first is a single-parameter example used to give insight. The others are three examples in each of two areas of EM application: Poisson mixture models and the estimation of covariance from incomplete data. The examples show that there are algorithms that are much simpler and more accurate than the SEM algorithm. Hopefully their simplicity will increase the availability of standard error estimates in EM applications. It is shown that, as previously conjectured, a symmetry diagnostic can accurately estimate errors arising from numerical differentiation. Some issues related to the speed of the EM algorithm and algorithms that differentiate the EM operator are identified.