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

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

一种基于可能度的区间判断矩阵排序法

给出了区间数两两比较的一种可能度公式,以及文献[4]中的方法参数k,m的取值范围,提出了一种基于可能度的区间判断矩阵排序方法。最后,通过算例说明了该法的可行性和有效性。     

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.     

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.     

常系数齐次线性微分方程组与其相应的差分方程组之间的联系

给出了求解常系数线性齐次微分方程组和常系数线性齐次差分方程组的一个方法,指出了这两种方程组之间存在的一个有趣关系．     

初等r-循环矩阵的几个性质

给出了初等ｒ－循环矩阵可逆的充要条件及逆矩阵的表达式;对奇异的初等ｒ－循环矩阵给出了Ａ的一个ｇ－逆Ｇ（满足ＡＧＡ＝Ａ,ＧＡＧ＝Ｇ）及Ｍｏｏｒｅ－ｐｅｎｒｏｓｅ广义逆矩阵的表达式．     

Numerical evaluation of tests based on different heteroskedasticity-consistent covariance matrix estimators

This article considers the issue of performing tests in linear heteroskedastic models when the test statistic employs a consistent variance estimator. Several different estimators are considered, namely: HC0, HC1, HC2, HC3, and their bias-adjusted versions. The numerical evaluation is performed using numerical integration methods; the Imhof algorithm is used to that end. The results show that bias-adjustment of variance estimators used to construct test statistics delivers more reliable tests when they are performed for the HC0 and HC1 estimators, but the same does not hold for the HC3 estimator. Overall, the most reliable test is the HC3-based one.     

Heteroskedasticity-consistent interval estimators

The linear regression model is commonly used in applications. One of the assumptions made is that the error variances are constant across all observations. This assumption, known as homoskedasticity, is frequently violated in practice. A commonly used strategy is to estimate the regression parameters by ordinary least squares and to compute standard errors that deliver asymptotically valid inference under both homoskedasticity and heteroskedasticity of an unknown form. Several consistent standard errors have been proposed in the literature, and evaluated in numerical experiments based on their point estimation performance and on the finite sample behaviour of associated hypothesis tests. We build upon the existing literature by constructing heteroskedasticity-consistent interval estimators and numerically evaluating their finite sample performance. Different bootstrap interval estimators are also considered. The numerical results favour the HC4 interval estimator.     

A two-parameter estimator in the negative binomial regression model

In this article, a two-parameter estimator is proposed to combat multicollinearity in the negative binomial regression model. The proposed two-parameter estimator is a general estimator which includes the maximum likelihood (ML) estimator, the ridge estimator (RE) and the Liu estimator as special cases. Some properties on the asymptotic mean-squared error (MSE) are derived and necessary and sufficient conditions for the superiority of the two-parameter estimator over the ML estimator and sufficient conditions for the superiority of the two-parameter estimator over the RE and the Liu estimator in the asymptotic mean-squared error (MSE) matrix sense are obtained. Furthermore, several methods and three rules for choosing appropriate shrinkage parameters are proposed. Finally, a Monte Carlo simulation study is given to illustrate some of the theoretical results.     

Computing and approximating multivariate chi-square probabilities

We consider computational methods for evaluating and approximating multivariate chi-square probabilities in cases where the pertaining correlation matrix or blocks thereof have a low factorial representation. To this end, techniques from matrix factorization and probability theory are applied. We outline a variety of statistical applications of multivariate chi-square distributions and provide a system of MATLAB programs implementing the proposed algorithms. Computer simulations demonstrate the accuracy and the computational efficiency of our methods in comparison with Monte Carlo approximations, and a real data example from statistical genetics illustrates their usage in practice.