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.     

关于AOR迭代法的研究

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

动态激光衍射法测量细丝直径

基于夫琅禾费衍射理论和巴比涅互补原理,提出了利用激光衍射对细丝直径进行动态测量的方法.该方法具有测量精度高、速度快、非接触、使用方便且易于微机联接实现自动化测量等优点.     

直径对脉冲爆震发动机性能的影响

本文通过实验研究了脉冲爆震发动机的直径对其性能的影响．实验结果表明；当爆震室的直径增大时，爆震波压力波形相似，平均峰值压力比较接近，且比冲基本保持不变，而推力则随爆震室直径的增大而增大。实验曲线表明爆震室内的流动具有自相似性，从而为建立尺寸律提供了实验依据．本文中比冲和平均推力是利用摆动原理测量的，并与由作用在推力壁上的压力计算得出的比冲和平均推力的理论值和实验值进行了比较，结果基本吻合，说明该测量方法可行．     

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

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

中国邮路问题的一个解法

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

用毛细管测量纯水表面张力系数的误差讨论

通过用毛细管测量纯水表面张力系数实验，得到管内径d与接触角θ的相对误差之间的关系曲线，由此说明实验测得的表面张力系数α和理论公式相比呈现一定的偏差，并简单地讨论了实验的理想状态与实际情况的差别．     

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.     

3-正则图的分割问题是NP-完全问题

证明了3-正则图的最小平分问题和最小α-分割问题都是NP-完全问题.