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.     

激光除冰研究

架空输送电线路因覆冰而导致的事故危害性很大,本文总结了目前国内外输电线路导线覆冰的现状。统计国内外探索出来的各种预防,融化,除冰等很多解决方案。通过研究和探讨,分析导线覆冰的传热和能量,运用了多种激光器进行激光熔(除)冰实验,比较研究二氧化碳激光器的除冰情况。以及提出激光熔冰的方法、研究方向和前景。     

A new family of proximity graphs: Class cover catch digraphs

Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given.     

关于AOR迭代法的研究

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

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

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

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.     

中国邮路问题的一个解法

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

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-完全问题.     

工程施工中运输网络优化方案

施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 .