恒加试验简单线性估计的改进

在恒加试验中加速方程的二个系数ａ与ｂ的估计最为重要。文中给出了参数ａ与ｂ的二种新的简单线性无偏估计（ＢＧＬＵＥ，ＲＧＬＵＥ），这两种无偏估计均比常用的二步估计有较大的改进。基于上述新的线性估计，文中还构造了二种新的线性不变估计（ＢＧＬＩＥ，ＲＧＬＩＥ）。这两种不变估计均优于文献（１）给出的简单线性不变估计。     

线性模型中参数估计的相对效率

本文对线性模型中的最小二乘估计（LSE）与BLUE给出了一种新的相对效率（4），并研究了新的相对效率（4）与其它两种相对效率（2）与（3）的关系．最后在广义G－M模型下还给出了新的相对效率的下界．     

广义G-M模型参数估计的相对效率

本文提出了广义Ｇ－Ｍ模型中参数β的ＢＬＵＥβ^*和ＬＳ估计β的一种新的相对效率,对其与其他两种相对效率的关系及其下界进行了研究,并讨论了它与广义相关系数的关系．     

错误先验假定下回归系数Bayes估计的小样本性质

本在于错误指定的先验假定获得了回归系数的Ｂａｙｅｓ估计（ＢＥ）,并在均方误差矩阵准则下对其与最小二乘（ＬＳ）估计进行了比较,导出了它们的相对效率的界、讨论了在后验ＰｉｔｍａｎＣｌｏｓｅｎｅｓｓ准则下ＢＥ相对于ＬＳ估计的优良性。     

回归系数的混合估计与最小二乘估计的一个新的相对效率

本文对具有附加信息的线性回归模型中的混合估计与最小二乘估计给出了一种新的相对效率,研究了新的相对效率与其它几种相对效率的关系,得出了新的相对效率的上、下界.     

广义G-M模型参数估计的一种相对效率

对于广义G—M模型，如果最小二乘估计（LSE）与最佳线性无偏估计（BLUE）相等，就可以用LSE代替BLUE反之，用LSE代替BLUE就要蒙受一些损失．有时，这种损失可能是很大的，因而研究这种损失的大小就显得颇为重要．本文提出了一种新的相对效率，并给出了该相对效率的上下界，最后讨论了该相对效率与广义相关系数的关系．     

奇异线性模型参数估计的相对效率

提出了奇异线性模型中参数β的最佳线性无偏估计(BLUE)相对于最小二乘估计(LSE)的一种新的相对效率,并给出了该相对效率的下界,最后讨论了该相对效率与广义相关系数的关系.     

回归系数的混合估计与最小二乘估计的两种相对效率

本文研究了线性回归模型中,回归系数的混合估计与最小二乘估计的相对效率,利用矩阵的相关性质和运算,导出了两者之间两种新的相对效率的上下界.     

奇异线性模型最小二乘估计的相对效率

对于奇异线性模型引入了参数β的最小二乘估计相对与最佳线性无偏估计的一种新的相对效率，并讨论了它的下界。     

线性模型中最小二乘估计的一种新的相对效率

对于线性模型未知参数最小二乘估计，本文提出了一种新的相对效率，并研究了它的性质，以及与Bloonfield-Watson等，讨论过的另一种相对效率的关系。     

最小二乘估计精度及其界限

Puntanen[1]提出用均方误差来度量最小二乘估计的精度,以后Styan[2],Rao[3]等相继讨论了这种精度及其界限.本文考虑采用广义方差,从而引进了一种新的最小二乘估计精度的度量并讨论了它的界.     

Bounding the beta invariant of 3-connected matroids

The beta invariant is related to the Chromatic and Tutte Polynomials and has been studied by Crapo [4], Brylawski [2], Oxley [7] and others. Crapo [4] showed that a matroid with at least two elements is connected if and only if its beta invariant is greater than zero. Brylawski [2] showed that a connected matroid has beta invariant one if and only if M is isomorphic to a serial-parallel network. Oxley [7] characterized all matroids with beta invariant two, three and four. In this paper, we first give a best possible lower bound on the beta invariant of 3-connected matroids, then we characterize all 3-connected matroids attaining the lower bound. We also characterize all binary matroids with beta invariant 5, 6, and 7.     

Inequality for the Moment of a Function of a Random Variable

ＩｎｅｑｕａｌｉｔｙｆｏｒｔｈｅＭｏｍｅｎｔｏｆａＦｕｎｃｔｉｏｎｏｆａＲａｎｄｏｍＶａｒｉａｂｌｅ￥ＬｉＢａｉｎｉａｎＨｕＳｈｕｈｅ（李柏年，胡舒合）（ＡｎｈｕｉＩｎｓｔｉｔｕｔｅｏｆＦｉｎａｎｃｅａｎｄＴｒａｄｅ）（ＡｎｈｕｉＵｎｉｖｅｒｓｉｔｙ...     

Bounds for the positive eigenvalues of the p-Laplacian with decaying potential

An upper bound is obtained for the positive eigenvalues of the p-Laplacian with decaying potential on [0,∞). The bound is expressed in terms of the potential and is shown to be the best possible of its kind.     

超图的Laplacian

本文讨论了由Ｆ．Ｒ．Ｋ．Ｃｈｕｎｇ 引入的ｋ－图的Ｌａｐｌａｃｉａｎ 的一些基本性质．通过引入ｋ－图的邻接图的概念,得到了ｋ－图的Ｌａｐｌａｃｉａｎ 及其特征多项式的更明确的表达式．同时,也改进了文［１］中关于ｄ－正则ｋ－图的谱值的一个下界     

On the exact upper bound for the multifit processor scheduling algorithm

We consider the well-known problem of schedulingn independent tasks nonpre-emptively onm identical processors with the aim of minimizing the makespan. Coffman, Garey and Johnson [1] described an algorithm, MULTIFIT, based on techniques from binpacking, with better worst performance than the LPT algorithm and proved that it satisfies a bound of 1.22. It has been claimed by Friesen [2] that this bound can be improved upon to 1.2. However, we found his proof, in particular his lemma 4.9, difficult to understand. Yue, Kellerer and Yu [3] have presented the bound 1.2 in a simpler way. In this paper, we prove first that the bound cannot exceed 13/11 and then prove that it is exactly 13/11.This work was done while the author was visiting the Institut für Operations Research, Universität Bonn. The author expresses his thanks to the Institut for the support given to him in the preparation and completion of the work.     

时间延迟周期为4的单因素优选问题

<正> §1.引言 关于单因素优选法的术语见[1].所谓有(时间)延迟周期τ,是说当作第i次试验时只知道直到第i-τ-1次试验的结果.τ=1,2,3的情形分别在[2]和[3]中研究.[3]并对任意的τ,给出了n次(试验)策略可行区间长度L_n(τ)的上界A_n(τ).它在τ=2和3时可以达到.于是[3]猜测:对任何τ,L_n(τ)=A_n(τ).     

一类扰动多项式系统极限环

本文对一类多项式扰动系统的极限环进行了研究，得到了极限环个数的上界估计，弥补了文献［２］主要定理的不足．     

Error bounds for convex differentiable inequality systems in Banach spaces

The paper is devoted to studying the Hoffman global error bound for convex quadratic/affine inequality/equality systems in the context of Banach spaces. We prove that the global error bound holds if the Hoffman local error bound is satisfied for each subsystem at some point of the solution set of the system under consideration. This result is applied to establishing the equivalence between the Hoffman error bound and the Abadie qualification condition, as well as a general version of Wang &; Pang's result [30], on error bound of Hölderian type. The results in the present paper generalize and unify recent works by Luo &; Luo in [17], Li in [16] and Wang &; Pang in [30].     

On lower bounds for the chromatic number in terms of vertex degree

In this paper we discuss the existence of lower bounds for the chromatic number of graphs in terms of the average degree or the coloring number of graphs. We obtain a lower bound for the chromatic number of K_1,t-free graphs in terms of the maximum degree and show that the bound is tight. For any tree T, we obtain a lower bound for the chromatic number of any K_2,t-free and T-free graph in terms of its average degree. This answers affirmatively a modified version of Problem 4.3 in [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley, New York, 1995]. More generally, we discuss δ-bounded families of graphs and then we obtain a necessary and sufficient condition for a family of graphs to be a δ-bounded family in terms of its induced bipartite Turán number. Our last bound is in terms of forbidden induced even cycles in graphs; it extends a result in [S.E. Markossian, G.S. Gasparian, B.A. Reed, β-perfect graphs, J. Combin. Theory Ser. B 67 (1996) 1–11].