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.     

非线性互补问题的一种全局收敛的显式光滑Newton方法

本针对Po函数非线性互补问题，给出了一种显式光滑Newton方法，该方法将光滑参数μ进行显式迭代而不依赖于Newton方向的搜索过程，并在适当的假设条件下，证明了算法的全局收敛性。     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.     

Surface structures formed by individual adsorption and coadsorption of Mn and Bi on Cu(0 0 1), studied by LEED

We have studied the individual adsorption of Mn and Bi, and their coadsorption on Cu(0 0 1) by low-energy electron diffraction (LEED). For Mn, we have determined the c(2 × 2) structure formed at 300 K, whose structure had been determined by several methods. We reconfirmed by a tensor LEED analysis that it is a substitutional structure and that a previously reported large corrugation (0.30 Å) between substitutional Mn and remaining surface Cu atoms coincides perfectly with the present value. In the individual adsorption of Bi, we have found a c(4 × 2) structure, which is formed by cooling below ∼250 K a surface prepared by Bi deposition of ∼0.25 ML coverage at 300 K where streaky half-order LEED spots appear. The c(4 × 2) structure has been determined by the tensor LEED analysis at 130 K and it is a substitutional structure. In the coadsorption, we found a c(6 × 4) structure, which has been determined by the tensor LEED analysis. It is very similar to the previously determined structure of the c(6 × 4) formed by coadsorption of Mg and Bi, and embedded MnBi₄ clusters are arranged in the top Cu layer instead of MgBi₄. Large lateral displacements of Bi atoms in the c(6 × 4)-(Mn + Bi) suggest that the Mn atoms undergo the size-enhancement caused by their large magnetic moment.     

Germanium growth on Br-terminated Si(1 0 0)

The consequences of Ge deposition on Br-terminated Si(1 0 0) were studied with scanning tunneling microscopy at ambient temperature after annealing at 650 K. One monolayer of Br was sufficient to prevent the formation of Ge huts beyond the critical thickness of 3 ML. This is possible because Br acts as a surfactant whose presence lowered the diffusivity of Ge adatoms. Hindered mobility was manifest at low coverage through the formation of short Ge chains. Further deposition resulted in the extension and connection of the Ge chains and gave rise to the buildup of incomplete layers. The deposition of 7 ML of Ge resulted in a rough surface characterized by irregularly shaped clusters. A short 800 K anneal desorbed the Br and allowed Ge atoms to reorganize into the more energetically favorable “hut” structures produced by conventional Ge overlayer growth on Si(1 0 0).     

猜想M(2k,k+1)=3k-1+[(k-1)/2]的反例

Brualdi与Jung在[1]中研究了一类具有固定线和k的n×n矩阵上的最大跳跃数M(n,k),并提出猜想M(2k, k + 1) = 3k - 1 + [(k-1)/2].本文给出了这一猜想的两个反例．     

4一致反超图的最小边数问题

混合超图是在超图的基础上添加一个反超边得到的图．超边和反超边的区别主要体现在着色要求上．在着色中,要求每一超边至少要有两个点着不同的颜色,而每一反超边至少有两个点着相同的颜色．最大最小颜色数分别称为混合超图的上色数和下色数。本文主要研究反超图,即只含反超边的超图。讨论了上色数为3的4一致超图的最小边数问题．给出了上色数为3的4一致反超图的最小边数的一个上界和一个下界．