复杂像散椭圆光束的轨道角动量的实验研究

提出一种直接测量光束的轨道角动量的方法，其原理是把具有轨道角动量的光束照射到一个金属靶上，使其在光束的角动量作用下发生转动. 通过测量靶转动的角度来计算光束的角动量值. 对几种不同参数的光束的轨道角动量进行了测量，获得了轨道角动量与光束参数之间的关系，实验结果与理论分析较好地符合. 关键词： 复杂像散椭圆光束 轨道角动量 测量     

有关力学谱和内耗工作的综合与回顾

本文广泛地收集了有关内耗，力学谱，超声衰减方面的专著及会议文集。反映了20世纪在此领域的英文，俄文出版的书籍。也列出了历次国际会议及前苏联，乌克兰，中国的国内会议。文中包括了点缺陷，电，声子，位错，晶界，电畴等诸方面在内的内耗与力学谱工作。     

正丁基苝四羧酸二酰亚胺的晶型和性能研究

文章合成了N,N'-二正丁基苝四羧酸二酰亚胺,并纯化、调晶,进行了IR、元素分析、X射线等测定.分析该化合物在DMF中的紫外光谱(最大吸收波长524.80 nm)、荧光光谱(最大发射波长539.0 nm)、Stokes位移(数值15 nm)等光谱性质.在400～700 nm范围内,α晶型薄膜紫外-可见吸收出现很强的吸收峰,且由β型变为α型,最大吸收波长有明显的红移(545 nm变为580 nm).X射线粉末衍射也反映出α晶型的2θ在26.0°处衍射峰CPS为2 508,β型在25.2°为1 891.α,β晶型作为电荷产生材料制得的功能分离型有机光导体,在光源滤波波长λ=532 nm曝光下,测得含α,β感光体达到饱和电位的时间分别为46,93.98 s,光衰电位(5.3千伏电压负充电电晕,1～2 s后的表面电位)分别为727和525 V,半衰曝光量分别为4.32,4.34μJ·cm-2,残余电位分别为30和45 V等光导性能数值.     

(2+1)维广义Nizhnik-Novikov-Veselov系统的新严格解和复合波激发

利用拓展的Riccati方程映射法与变量分离法，得到了(2+1)维广义Nizhnik-Novikov-Veselov(GNNV)系统新的含有两个任意函数的相当广义的变量分离严格解.根据其中的周期波解，找到了该系统的复合波，即在周期波背景下的孤立波，并简要讨论了其演化行为. 关键词： GNNV系统 拓展Riccati映射 周期波解 孤立波     

Roots,iterations and logarithms of formal automorphisms

In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order in the group of automorphisms of a formal power series ring, and in algebraic subgroups too     

非对称三态叠加多模泛函叠加态光场的高次压缩——广义电场分量的不等幂次和压缩效应研究

多模真空态|{0j}〉q与两个空间强度分布特征不同的多模复共轭泛函相干态|{f(j a)*(x,y,z)}〉q和|{f(j b)*(x,y,z)}〉q的线性叠加组成的三态叠加多模泛函叠加态光场|ψ(f3)〉q,利用多模压缩态理论,研究了态|ψ(f3)〉q中广义电场分量的不等幂次高次和(H)压缩特性.结果表明:在一定的条件下,态|ψ(f3)〉q的广义电场分量可呈现出周期性变化的任意奇数次和任意偶数次的不等幂次高次H压缩效应;光场的经典振幅和经典初始相位的任意非对称空间分布特征对其压缩程度和压缩深度等压缩特性将产生直接的影响.     

Preemptive scheduling of interval orders is polynomial

In 1979, Papadimitriou and Yannakakis gave a polynomial time algorithm for the scheduling of jobs requiring unit completion times when the precedence constraints form an interval order. The authors solve here the corresponding problem, for preemptive scheduling (a job can be interrupted to work on more important tasks, and completed at a later time, subject to the usual scheduling constraints.) The m-machine preemptive scheduling problem is shown to have a polynomial algorithm, for both unit time and variable execution times as well, when the precedence constraints are given by an interval order.     

Approximating the single source unsplittable min-cost flow problem

In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing. Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem. Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001     

Optimality relationships forp-cyclic SOR

Summary The optimality question for blockp-cyclic SOR iterations discussed in Young and Varga is answered under natural conditions on the spectrum of the block Jacobi matrix. In particular, it is shown that repartitioning a blockp-cyclic matrix into a blockq-cyclic form,q, results in asymptotically faster SOR convergence for the same amount of work per iteration. As a consequence block 2-cyclic SOR is optimal under these conditions.Research supported in part by the US Air Force under Grant no. AFOSR-88-0285 and the National Science Foundation under grant no. DMS-85-21154 Present address: Boeing Computer Services, P.O. Box 24346, MS 7L-21, Seattle, WA 98124-0346, USA     

Invariant measures for equicontinuous semigroups of continuous transformations of a compact Hausdorff space

Equicontinuous semigroups of transformations of a compact Hausdorff space and their sets of all invariant (Borel, regular and probabilistic) measures are studied. Conditions equivalent to the existence of at least one invariant measure are given. The (algebraic and topological) structure of the set of invariant measures is researched.