Z=18—82原子的同步辐射内壳层光电离积分截面的计算和讨论

此文计算了Ｚ＝１８－８２的原子在北京同步辐射４Ｂ９Ａ束线的白色Ｘ光照射下的光电离积分截面Ｇ值。结果表明，有三个Ｇ值较大的区域，Ｚ＝１８－２０，３９－４７和５９－８２，最大值分别为３．８×１０－６，１．６×１０－５和３．５×１０－５ｐｈｏｔｏｎｓ·ｃｍ２／ｓ。同时，估计了平衡时主要多重电荷态离子数目，分析了用同步辐射和离子阱进行多重电荷态实验的新的候选原子，讨论了有关实验方法和技术。     

基态He2Ne^＋分子结构与性质的理论计算

利用Ｇａｕｓｓｉａｎ ９２程序和ＵＨＦ／６－３１Ｇ方法，计算了基诚Ｈｅ２Ｎ３＾＋分子的结构、能量，振动光主、热化学数据与静电参数。得到线型和弯曲的两处平衡结构。     

大麦抽穗期的遗传分析

本文对8×8大麦品种双列杂交的F_1和F_2的抽穗期进行了遗传分析,结果:(1)抽穗期性状在F_1双列试验中,W_r/V_r回归系数b(0.8399)与单位斜率1无显著差异,表明符合加性-显性遗传模型,在F_2中,b=0.2768,显著不同于1,存在上位效应。去阵列8后,对F_2双列资料重新检验,发现由此获得的亚双列系统符合模型(b=0.8230).W_r/V_r分析表明,F_1与F_2世代间阵列位置有变动,但阵列2,3在两个世代中均据回归线的上部.W_r+V_r与Y_r间的相关测定均为负相关,表明抽穗期晚一般由显性基因效应控制.(2)抽穗期F_1和F_2的广义遗传力为97％与98％,狭义遗传力为87％与69％.在F_1为0.59,表明抽穗期晚为部分显性.F_2却大于1,示有超显性特点;H_2/4H_1值都小于0.25,说明全部有关座位上,平均地说,显隐性等位基因频率不相等.F_1值为负值,表明所有亲本所携带的隐性基因比显性基因要多. (3)抽穗期一般配合力效应为负向的有小将,早熟3号和永2830.特殊配合力存在较大负向优势的杂交组合中,必含小将、早熟三号和永2830三个早熟品种之一为杂交亲本.     

核压力容器防止辐照脆化的安全评定

本文结合我国核动力反应堆的实例,首先介绍了设计规范中采用的断裂分析图的评定方法,然后着重讨论一种新的断裂力学的评定方法。结合对容器材料断裂韧性的实验测定,给出了计算结果,绘制了全寿期的安全运行工况图,并对两种方法的结果作了比较讨论。     

最小化非光滑复合函数的投影Hessian校正算法的收敛性

本文考虑复合函数 F(x)=f(x)+h(c(x))最小化问题,给出了校正矩阵逼近 Langrangian 函数的“单边投影 Hessian”的 Broyden-类型方法;此方法是 Q-超线性收敛的.文中还叙述了两个校正算法,并且证明了在合理的条件下,这两种算法都具有局部的两步 Q-超线性收敛性.     

The convergence rate of Euler means sequence

Let denote the Euler means of the Fourier series of the 2π-perodic function f(x). For an integer q>0, setting ℰ _nq (ω)=sup‖f−ℰ _n (q,f)‖, the precise value of is obtained.     

Stability of solutions to Hilbert boundary value problem under perturbation of the boundary curve

In this paper, the authors discuss the stability of the solutions to Hilbert boundary value problem under perturbation of the unit circle. When the index of this problem is non-negative, by extending Lavrentjev's conformal mapping on a region approximating to a unit disc, we show the solutions are stable under small perturbations. For negative index we give a conception of quasi-solution and discuss its stability correspondingly.     

Adding more observations to saturated D‐optimal resolution III two‐level factorial designs

We consider the class of saturated main effect plans for the 2^k factorial. With these saturated designs, the overall mean and all main effects can be unbiasedly estimated provided that there are no interactions. However, there is no way to estimate the error variance with such designs. Because of this and other reasons, we like to add some additional runs to the set of (k+1) runs in the D‐optimal design in this class. Our goals here are: (1) to search for s additional runs so that the resulting design based on (k+s+1) runs yields a D‐optimal design in the class of augmented designs; (2) to classify all the runs into equivalent classes so that the runs in the same equivalent class give us the same value of the determinant of the information matrix. This allows us to trade runs for runs if this becomes necessary; (3) to obtain upper bounds for determinant of the information matrices of augmented designs. In this article we shall address these approaches and present some new results. © 2002 Wiley Periodicals, Inc. J Combin Designs 11: 51–77, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10026     

Further results on large sets of disjoint group‐divisible designs with block size three and type 2n41

Large sets of disjoint group‐divisible designs with block size three and type 2ⁿ4¹ were first studied by Schellenberg and Stinson because of their connection with perfect threshold schemes. It is known that such large sets can exist only for n ≡0 (mod 3) and do exist for all odd n ≡ (mod 3) and for even n=24m, where m odd ≥ 1. In this paper, we show that such large sets exist also for n=2^k(3m), where m odd≥ 1 and k≥ 5. To accomplish this, we present two quadrupling constructions and two tripling constructions for a special large set called ^*LS(2ⁿ). © 2002 Wiley Periodicals, Inc. J Combin Designs 11: 24–35, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10032     

Construction of graphs with given circular flow numbers

Suppose r ≥ 2 is a real number. A proper r‐flow of a directed multi‐graph is a mapping such that (i) for every edge , ; (ii) for every vertex , . The circular flow number of a graph G is the least r for which an orientation of G admits a proper r‐flow. The well‐known 5‐flow conjecture is equivalent to the statement that every bridgeless graph has circular flow number at most 5. In this paper, we prove that for any rational number r between 2 and 5, there exists a graph G with circular flow number r. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 304–318, 2003