混合判断矩阵排序方法研究

本文介绍了混合判断矩阵及完全一致性混合判断矩阵的概念，提出了混合判断矩阵排序的一种最小偏差法，并给出了其收敛性迭代算法，最后通过算例说明了方法的可行性。     

Cochran's statistical theorem for outer inverses of matrices and matrix quadratic forms

We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures.     

Robust linear optimization under general norms

We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients.     

Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.     

反对称正交对称矩阵反问题

本文讨论一类反对称正交对称矩阵反问题及其最佳逼近．研究了这类矩阵的一些性质，利用这些性质给出了反问题解存在的一些条件和解的一般表达式，不仅证明了最佳逼近解的存在唯一性，而且给出了此解的具体表达式．     

Bounds for the Least Laplacian Eigenvalue of a Signed Graph

A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated.     

The projective method for solving linear matrix inequalities

Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed.     

审讯过程的数学模型

本文从经济学的观点出发，利用对策论方法建立了审讯过程的数学模型，并由此研究了讯问人三种主要策略对审讯成功的效度。     

谱任意的符号模式矩阵

一个n阶符号模式矩阵A称为是谱任意的,如果对任意的实系数n次首1多项式r(x),在A的定性矩阵类Q(A)中至少存在一个实矩阵B,使得B的特征多项式是r(x),文中证明了当n为奇数时n阶谱任意符号模式矩阵是存在的。     

随机环境中双移民生灭过程的极限性质

引入了随机环境中双移民生灭过程的概念，定义了过程的模态指示函数，在此基础上研究了其转移矩阵的平稳分布，给出了平稳分布众数的位置与模态指示函数之间的关系．研究了平稳分布的众数与边界关系．