Existence of the uniformly minimum risk equivariant estimators of parameters in a class of normal linear models

In this paper, we study the existence of the uniformly minimum risk equivariant (UMRE) estimators of parameters in a class of normal linear models, which include the normal variance components model, the growth curve model, the extended growth curve model, and the seemingly unrelated regression equations model, and so on. The necessary and sufficient conditions are given for the existence of UMRE estimators of the estimable linear functions of regression coefficients, the covariance matrixV and (trV)^α, where α > 0 is known, in the models under an affine group of transformations for quadratic losses and matrix losses, respectively. Under the (extended) growth curve model and the seemingly unrelated regression equations model, the conclusions given in literature for estimating regression coefficients can be derived by applying the general results in this paper, and the sufficient conditions for non-existence of UMRE estimators ofV and tr(V) are expanded to be necessary and sufficient conditions. In addition, the necessary and sufficient conditions that there exist UMRE estimators of parameters in the variance components model are obtained for the first time.     

无向树图的k点连通最小扩充

解决了以最少边集扩充一个任意无向树图为k点连通图这一优化问题,提出了一个计算复杂度为D(|V|~4)的算法。为进一步研究可靠网络的计算机辅助设计打下基础。     

网络计划最低费用日程的一种新解法

根据网络计划的特点,在求解其最低费用日程时,引入最小割的概念,从而改进了该问题的求解方法。文中给出了解决问题的算法流程,并附有算例.此法运用较简便,且易于计算机计算,自动化水平高,因而便于有关人员采用.     

关于AOR迭代法的研究

本文论证了严格对角占优矩阵之AOR法的误差估计式中的误差估计常数hγ,ω（0≤γ≤ω0）的最小值是h1,1.     

Finding the response matrix to the external action from a subspace for a discrete linear stochastic dynamical system

For a discrete linear stochastic dynamical system, computation of the response matrix to the external action from a subspace using given observational data is examined. An algorithm is proposed and substantiated that makes it possible to improve the numerical accuracy and to reduce the amount of observational data compared to the general case where an arbitrary external action is allowed. As an illustration, a discrete system arising in the analysis of a linear stochastic dynamical continuous-time system is considered more thoroughly. Some numerical results are presented.     

K_(1,n)-free图具有给定性质的[a,b]-因子的一个充分条件

图G称为K1,n-free图,如果它不含K1,n作为其导出子图.对K1,n-free图具有给定性质的[a,b]-因子涉及到最小度条件进行了研究,得到一个充分条件.     

The Action Functional for Moyal Planes

Modulo some natural generalizations to noncompact spaces, we show in this Letter that Moyal planes are nonunital spectral triples in the sense of Connes. The action functional of these triples is computed, and we obtain the expected result, i.e. the noncommutative Yang–Mills action associated with the Moyal product. In particular, we show that Moyal gauge theory naturally fits into the rigorous framework of noncommutative geometry.     

基于多元时间序列融合的飞行动作识别方法

针对飞行动作数据随机性强与长度不一致的问题,提出通过减小动态时间规整(DTW)算法的搜索空间,并定义不同特征参数贡献度的概念,实现对飞行数据的多元时间序列融合,从而完成对战术机动动作的识别。通过引入预分类和细分类结合的方式,对动作数据进行预处理,然后根据改进的动态时间规整(WDTW)算法对待测数据进行识别。仿真实验表明,相比传统DTW算法,WDTW算法通过降低算法复杂度,识别计算时间变化明显;对核密度与精准度系数的分析表明识别准确率亦有所提高。实验结果验证了所提方法的准确性。     

中国邮路问题的一个解法

本给出中国邮路问题的一个解法。虽然它仍只是初始方案，但因考虑了问题的足够信息，因而这种方案至少拉近了与最优解的距离。     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.