用于二聚物三能级蒸气激光系统的环形谐振腔设计

针对二聚物三能级蒸气激光系统增益相对于泵浦光方向显著的不对称特性,本文设计了一种稳定的能够充分利用介质增益特性的环形谐振腔,给出了象散和慧差补偿及泵浦激光与谐振腔匹配的条件。文中还给出了Na_2B~1Ⅱ_u-X~1∑_g~+跃迁激光谐振腔设计数据。     

Bifurcation and Isochronicity at Infinity in a Class of Cubic Polynomial Vector Fields

In this paper, we study the appearance of limit cycles from the equator and isochronicity of infinity in polynomial vector fields with no singular points at infinity. We give a recursive formula to compute the singular point quantities of a class of cubic polynomial systems, which is used to calculate the first seven singular point quantities. Further, we prove that such a cubic vector field can have maximal seven limit cycles in the neighborhood of infinity. We actually and construct a system that has seven limit cycles. The positions of these limit cycles can be given exactly without constructing the Poincare cycle fields. The technique employed in this work is essentially different from the previously widely used ones. Finally, the isochronous center conditions at infinity are given.     

对甲苯胺配位的羰基钌簇合物[HRu~3(CO)~1~0(C~7H~8N)]的合成及晶体结构

合成对甲苯胺配位的羰基钌簇合物.用IR,NMR和元素分析.X射线衍射等手段对此簇合物进行了结构表征.此谈合物含有钌-氢键,是瑞金属氢键.簇合物为单斜晶系,空间群为P2_1/C.晶胞参数:α=1.3816(2),b=0.9941(2),c=1.6005(2)nm,α=γ=90.00(0)°,β=98.39(l)°,V=2.1747(6)nm~3,Z=4,μ=20.70cm~(-1),D_c=2.11g/cm_3,F(000)=1320,最终偏差因子:R=0.0311.     

关于三次高斯和的均值

主要研究三次高斯和的均值性质，并给出一个较强的渐近公式。     

《数术记遗》中的算器研究（一）

《数术记遗》旧题汉徐岳撰，北周甄鸾注。唐代选举之制，学习《算经十书》外，兼习此书。《四库全书》提要认为当时好事因托为之，嫁名於岳。钱宝琮先生认为是甄鸾依托伪造的书。近有人提出反对，认为确为汉末作。关于作年代，另外详考。此处只对书中所载的十三种算器进行研究。     

二阶三点半正边值问题正解的存在性

利用锥的Krasnosel'skill不动点定理建立了二阶三点半正边值问题u″+λf(t,u)+δg(t,u)=0, t∈(0,1),u(0)=0, αu(η)=u(1).其中,λ,δ＞0, 0＜η＜1, 0＜αη＜1正解的存在性,这里,非线性项不需要是非负的.     

最小树的一般算法

本文根据设计并行算法的基本原则,给出了最小树的两个对偶定理.在此基础上,建立了两种对偶的同步并行算法的雏型.这两种算法恰恰在对偶的意义下,概括了以往的最小树算法.     

带有边集限制的最均匀支撑树问题

本在无向网络中，建立了带有边集限制的最均匀支撑树问题的网络模型．中首先解决最均匀支撑树问题，并给出求无向网络中最均匀支撑树的多项式时间算法；然后，给出了求无向网络中带有边集限制的最小树多项式时间算法；最后，在已解决的两个问题的基础上解决了带有边集限制的最均匀支撑树问题．     

On the Spectral Radius of Trees with the Given Diameter d

Let T denote a tree with the diameter d(d≥2) and order n. Let P^*d,r,n-d-1denote the tree obtained by identifying the rth vertex of path Pd l and the center of starKl,K1,n-d-1, where r = r(d) is the integer part about d 2/2. Then p(T)≤ p(P^*d,r,n-d-1), andequality holds if and only if T≌P^*d,r,n-d-1