半参数方差误差模型的估计

本文综合近邻权函数法及最小二乘法，用两阶段最小二乘估计的方法得到了半参数EV模型中参数的估计量及其强相合性，渐近正态性。同时也得到了非参数函数的估计量及其强相合性，一致强相合性。     

微型燃气轮机回热器换热表面的对比研究

采用高效紧凑式换热器是近年来微型燃气轮机发展取得成功的关键技术之一。本文在燃机参数给定情况下,通 过对三种换热表面进行热力计算和分析,结果表明,CC原表面在紧凑式换热器中具有较强的应用潜力。此外,还就温差 对压损的影响及燃气旁通量对回热度的影响进行了研究。     

Strengthened semidefinite programming bounds for codes

We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras. The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with O(n ⁷) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n ³), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s bound with the same computational complexity. Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

六角系统的边面点面全色数

本文得到了六角系统的边面和点面金色数．     

Zeroth-order phase transitions and Zipf law quantization

From the standpoint of thermodynamic averaging of fission microprocesses, we investigate the origin of radioactive release in an NPP after an accident or after resource depletion. The genesis of the NPP release is interpreted as a new thermodynamic phenomenon, a zeroth-order phase transition. This problem setting results in a problem in probabilistic number theory. We prove the corresponding theorem leading to quantization of the Zipf law for the frequency of a zeroth-order phase transition with different values of the jump of the Gibbs thermodynamic potential. We introduce the notion of hole dimension. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 150, No. 1, pp. 118–142, January, 2007.     

强色指数的一个新的上界

给出了图的强色指数的一个新的上界，并指出几类恰好达到该上界的图，从而改进了Erodoes和Nesetri的强色指数猜想，在某种意义上证明了这个猜想。     

BIFURCATION DIAGRAMS OF SYSTEM =-y δx lx~2 ny~2,=x ax~2

Ｗｅｃｏｎｓｉｄｅｒｔｈｅｑｕａｄｒａｔｉｃｓｙｓｔｅｍｏｆｔｙｐｅ（Ｉ）ｍ＝０ａｃｏｒｄｉｎｇｔｏｔｈｅｃｌａｓｉｆｉｃａｔｉｏｎｏｆ［１］．Ｗｉｔｈｏｕｔｌｏｓｏｆｇｅｎｅｒａｌｉｔｙ，ｗｅｍａｙａｓｕｍｅｔｈａｔｔｈｅｓｙｓｔｅｍｉｓｔａｋｅｎ...     

最大度为6的极大外平面图的完备色数

证明了最大度为６的极大外平面图的完备色数为７。     

抽样调查中最佳测量次数的确定

现场抽样调查中，由于测量误差的存在，使得所测变量实测值的方差增大，通过增加每个体的测量次数可以控制测量误差，但这样每个体调查费用增大。本文对测量信度Ｒ，每个体测量次数ｍ与相应所需的样本含量ｎｍ、调查费用Ｔｎ的关系进行了探讨，并介绍了如何根据Ｒ，及每个体测量费用占其总费用构成比Ｃ，确定最佳测量次数ｍ值，以达到最佳控制调查费用的目的，这对我们在大型现场调查中进行经济效益分析具有重大的理论指导意义。