Asymmetrical Orthogonal Arrays With Run Size 100

Nowadays orthogonal arrays play important roles in statistics and other fields. Usual difference matrices are essential for the construction of many symmetrical or a few asymmetrical orthogonal arrays. But there are also asymmetrical orthogonal arrays which can not be obtained by the usual difference matrices. In order to construct these asymmetrical orthogonal arrays, a class of special matrices were discovered from the orthogonal decompositions of projection matrices. In this article, an interesting equivalent relationship between orthogonal arrays and the generalized difference matrices is presented. As an application, a lot of new orthogonal arrays of run size 100 have been constructed.     

Structural changes in multivariate regression models

This study generalizes the work of chin choy and Broemeling (1980) who investigated the change in the regression parameters of univariate linear models.

The marginal posterior distributions of the change point, the regression matrices,and the precision matrix are found with the use of a proper multivariate normal-Wishart distribution for the parameters of the model.

A numerical study is undertaken in order to gain some insight into the effect that changes in sample size and certain parameter values have on these marginal posterior distributions.     

Optimal fractional factorial designs and their construction

Optimal symmetrical fractional factorial designs with n$n$ runs and m$m$ factors of s$s$ levels each are constructed. We consider only designs such that no two factors are aliases. The minimum moment aberration criterion proposed by Xu (2003) is used to judge the optimality of the designs. The minimum moment aberration criterion is equivalent to the popular generalized minimum aberration criterion proposed by Xu and Wu (2001), but the minimum moment criterion is simpler to formulate and employ computationally. Some optimal designs are constructed by using generalized Hadamard matrices.     

Distribution theory of quadratic forms for matrix multivariate elliptical distribution

This paper proposes the density and characteristic functions of a general matrix quadratic form X^(?)AX${\mathbf{X}}^{(?)}\mathbf{AX}$, when A=A^(?)$\mathbf{A}={\mathbf{A}}^{(?)}$ is a positive semidefinite matrix, X$\mathbf{X}$ has a matrix multivariate elliptical distribution and X^(?)${\mathbf{X}}^{(?)}$ denotes the usual conjugate transpose of X$\mathbf{X}$. These results are obtained for real normed division algebras. With particular cases we obtained the density and characteristic functions of matrix quadratic forms for matrix multivariate normal, Pearson type VII, t and Cauchy distributions.     

ON UMP INVARIANT F-TEST PROCEDURES IN A GENERAL LINEAR MODEL

A simple method of setting linear hypotheses for a split mean vector testable by F-tests in a general linear model, when the covariance matrix has a general form and is completely unknown, is provided by extending the method discussed in Ukita et al. The critical functions in these F-tests are constructed as UMP invariants, when the covariance matrix has a known structure. Further critical functions in F-tests of linear hypotheses for the other split mean vector in the model are shown to be UMP invariant if the same known structure of the covariance matrix is assumed.     

Precise asymptotics on spectral statistics of random matrices

This paper focuses on the limiting properties of the spectral statistics of Wigner matrices and sample covariance matrices. Following the ideas of Gut and Spaˇtaru (2000a, b), Gut and Steinebach (2013) and Chow (1988) on precise asymptotics of i.i.d. random variables in the context of complete convergence and moment convergence, we will establish the corresponding results on the spectral statistics of random matrices.     

自旋空间的对称面

本文提出了电子自旋空间的对称面概念，分析并讨论了电子自旋的本征态以及电子自旋角动量分量的平均值等问题。     

What's Wrong with Hazard‐Ranking Systems? An Expository Note

Two commonly recommended principles for allocating risk management resources to remediate uncertain hazards are: (1) select a subset to maximize risk-reduction benefits (e.g., maximize the von Neumann-Morgenstern expected utility of the selected risk-reducing activities), and (2) assign priorities to risk-reducing opportunities and then select activities from the top of the priority list down until no more can be afforded. When different activities create uncertain but correlated risk reductions, as is often the case in practice, then these principles are inconsistent: priority scoring and ranking fails to maximize risk-reduction benefits. Real-world risk priority scoring systems used in homeland security and terrorism risk assessment, environmental risk management, information system vulnerability rating, business risk matrices, and many other important applications do not exploit correlations among risk-reducing opportunities or optimally diversify risk-reducing investments. As a result, they generally make suboptimal risk management recommendations. Applying portfolio optimization methods instead of risk prioritization ranking, rating, or scoring methods can achieve greater risk-reduction value for resources spent.     

矩阵的存储及存储地址研究

探讨了一般矩阵、特殊矩阵和稀疏矩阵在内存中的存储以及如何根据矩阵的不同特点来确定它在存储时的元素个数和存储空间的大小及各个元素在内存中的存储地址。