V20+离子1s23d-1s2nf的跃迁能和振子强

用全实加关联方法计算了类锂V20+离子1s23d-1s2nf的跃迁能和偶极振子强度.依据量子亏损理论, 确定了1s2nf系列的量子数亏损,用这些作为能量的缓变函数的量子亏损,实现对该Rydberg系列任意高激发态(n≥10)的能量的可靠预言.将这些分立态振子强度与量子亏损理论相结合,得到在电离域附近束缚态间的偶极跃迁振子强度以及束缚态-连续态跃迁的振子强度密度,从而将V20+离子的这一重要光谱特性的理论预言外推到整个能域.     

准晶体中八方晶系点群的对称性与矩阵表示

从理论上对准晶体中八方晶系各点群进行了研究.运用八方晶系各点群的极赤投影图,列出了各点群的所有对称操作;填出了固有点群822的群乘表.运用坐标变换和群论在自定义的八方坐标系中,推导出八方晶系点群所有对称操作的矩阵.这32个3×3矩阵的结构是相当简洁的,它们的矩阵元只有5种可能取值:0,±1,±2.其中2是反映八方晶系准晶体所具有的准周期性的特殊无理数.     

直流稳压电源波形演示器制作说明

直流稳压电源可以将交流电压变换为直流电压,并使之稳定,在我们现实生活中应用很广泛,在实验中我们利用的电学知识,设计制造了一种直流稳压电源。本文简要介绍了这种直流稳压电源波形演示器的设计目的和电路原理,重点阐述了它的制作流程、滤波和稳压原理以及性能测试输出波形。     

聚丙烯孔洞铁电驻极体膜的电极化及其电荷动态特性

根据栅控恒压电晕充电组合反极性电晕补偿充电法的实验结果计算出铁电驻极体的极化强度.结果说明，伴随着薄膜内孔洞气体的Paschen击穿，该铁电体的极化强度随栅压增加而显著上升.利用上述充电方法和热刺激放电(TSD)谱的分析讨论了这类空间电荷型宏观电偶极子，及与其补偿的空间电荷热退极化的电荷动态特性；阐明了这两类俘获电荷的能阱分布，即构成宏观电偶极子的位于孔洞上下介质层内的等值异号空间电荷分别被俘获在深、浅两种能值陷阱内，而位于薄膜表面层的注入空间电荷则被俘获在中等能值陷阱中. 关键词： 反极性电晕补偿充电法 铁电驻极体 充电电流 热刺激放电     

Banach空间中渐近正则半群的不动点定理

设X是p一致凸Banach空间,具有弱一致正规结构与非严格的Opial性质.又设C是X的非空凸弱紧子集.在适当的条件下,证明了C上每个渐近正则半群T={T(t):t∈S}都有不动点进一步,在类似的条件下,也讨论了一致凸Banach空间中渐近正则半群的不动点的存在性.     

不同入射角度下强流脉冲电子束能量沉积剖面和束流传输系数模拟计算

 强流脉冲电子束在材料中的能量沉积剖面、能量沉积系数和束流传输系数受其入射角的影响很大，理论计算了0.5~2.0MeV的电子束以不同的入射角在Al材料中的能量沉积剖面和能量沉积系数，并且还计算了0.4~1.4MeV电子束以不同入射角穿透不同厚度C靶的束流传输系数。计算结果表明，随着入射角的增大，靶材表面层单位质量中沉积的能量增大，电子在靶材料中穿透深度减小，能量沉积系数减小，相应的束流传输系数也减小；能量为0.5~2.0MeV的电子束当入射角在60°~70°时在材料表面层单位质量中沉积的能量较大。     

一致Banach空间中非扩张映象的弱收敛定理

设犈是一致凸Ｂａｎａｃｈ空间，满足Ｏｐｉａｌ条件或具有Ｆｒｅｃｈｅｔ可微范数，犆是犈的非空闭凸子集，且犜：犆→犆是非扩张映象．又设对任何初始数据狓１ ∈犆，序列｛狓狀｝由下列修改了的Ｉｓｈｉｋａｗａ迭代程序生成：狓狀＋１ ＝狋狀犜狀（狊狀犜狀狓狀＋ （１－狊狀）狓狀）＋ （１－狋狀）狓狀，　狀≥１， （Ｉ）其中，数列｛狋狀｝与｛狊狀｝满足下列条件（ｉ）和（ｉｉ）之一：（ｉ）狋狀∈ ［犪，犫］且狊狀∈ ［０，犫］；（ｉｉ）狋狀∈ ［犪，１］且狊狀∈ ［犪，犫］，这里，常数犪，犫满足０＜犪≤犫＜１．作者证明了，犜有不动点的充要条件是，｛狓狀｝ 弱收敛且｛‖狓狀－犜狓狀‖｝收敛到０．而且，由此即知，若犜有不动点，则｛狓狀｝弱收敛到犜的一个不动点．     

Extremes of deterministic sub‐sampled moving averages with heavy‐tailed innovations

Let {X_k}_k?1 be a strictly stationary time series. For a strictly increasing sampling function g:?→? define Y_k=X_g(k) as the deterministic sub‐sampled time series. In this paper, the extreme value theory of {Y_k} is studied when X_k has representation as a moving average driven by heavy‐tailed innovations. Under mild conditions, convergence results for a sequence of point processes based on {Y_k} are proved and extremal properties of the deterministic sub‐sampled time series are derived. In particular, we obtain the limiting distribution of the maximum and the corresponding extremal index. Copyright © 2003 John Wiley & Sons, Ltd.     

Hypernormal form theory: foundations and algorithms

Hypernormal forms (unique normal forms, simplest normal forms) are investigated both from the standpoint of foundational theory and algorithms suitable for use with computer algebra. The Baider theory of the Campbell-Hausdorff group is refined, by a study of its subgroups, to determine the smallest substages into which the hypernormalization process can be divided. This leads to a linear algebra algorithm to compute the generators needed for each substage with the least amount of work. A concrete interpretation of Jan Sanders’ spectral sequence for hypernormal forms is presented. Examples are given, and a proof is given for a little-known theorem of Belitskii expressing the hypernormal form space (in the inner product style) as the kernel of a higher-order differential operator.     

Propriétés statistiques des entiers friables

Let Ψ(x,y) (resp. Ψ_m(x,y)) denote the number of integers not exceeding x that are y-friable, i.e. have no prime factor exceeding y (resp. and are coprime to m). Evaluating the ratio Ψ_m(x/d,y)/Ψ(x,y) for 1≤slantd≤slantx, m≥slant 1, x≥slant y≥slant 2, turns out to be a crucial step for estimating arithmetic sums over friable integers. Here, it is crucial to obtain formulae with a very wide range of validity. In this paper, several uniform estimates are provided for the aforementioned ratio, which supersede all previously known results. Applications are given to averages of various arithmetic functions over friable integers which in turn improve corresponding results from the literature. The technique employed rests mainly on the saddle-point method, which is an efficient and specific tool for the required design.2000 Mathematics Subject Classification: Primary—11N25; Secondary—11K65, 11N37