Field Theory Methods in Classical Dynamics

A Dirac picture perturbation theory is developed for the time evolution operator in classical dynamics in the spirit of the Schwinger–Feynman–Dyson perturbation expansion and detailed rules are derived for computations. Complexification formalisms are given for the time evolution operator suitable for phase space analyses, and then extended to a two-dimensional setting for a study of the geometrical Berry phase as an example. Finally a direct integration of Hamilton's equations is shown to lead naturally to a path integral expression, as a resolution of the identity, as applied to arbitrary functions of generalized coordinates and momenta.     

线性分式规划最优解集的求法

本文使用多面集的表示定理，导出了线性分式规划最优解集的结构，并给出确定全部最优解的计算步骤。     

关于惠斯登电桥测电阻倍率与检流计灵敏度关系的研究

在相同的设备条件下，电桥临近平衡时灵敏度最高的最佳倍率是：组成倍率的两个电阻的数量级与待测电阻数量级相等，且比值为1的倍率。     

The measurement of subcritical electroconvection

Under idealized conditions, electroconvection in a nematic liquid crystal sets in at a well-defined threshold of the driving ac voltage. Fluctuating convection rolls of a small amplitude below that threshold have been observed recently. The measurement of the amplitude of these fluctuations is described in detail in this paper. It is based on averaging the light intensity signals using the structure function and a quantitative analysis of the light deflection.     

Truncated Newton method for sparse unconstrained optimization using automatic differentiation

When solving large complex optimization problems, the user is faced with three major problems. These are (i) the cost in human time in obtaining accurate expressions for the derivatives involved; (ii) the need to store second derivative information; and (iii), of lessening importance, the time taken to solve the problem on the computer. For many problems, a significant part of the latter can be attributed to solving Newton-like equations. In the algorithm described, the equations are solved using a conjugate direction method that only needs the Hessian at the current point when it is multiplied by a trial vector. In this paper, we present a method that finds this product using automatic differentiation while only requiring vector storage. The method takes advantage of any sparsity in the Hessian matrix and computes exact derivatives. It avoids the complexity of symbolic differentiation, the inaccuracy of numerical differentiation, the labor of finding analytic derivatives, and the need for matrix store. When far from a minimum, an accurate solution to the Newton equations is not justified, so an approximate solution is obtained by using a version of Dembo and Steihaug's truncated Newton algorithm (Ref. 1).This paper was presented at the SIAM National Meeting, Boston, Massachusetts, 1986.     

SW规约下的一些性质

本文进一步分析了SW规约下的SW度结构的一些性质,得到了强可计算实数的两个性质.并且证明了给定可计算可枚举实数,可构造出sw归约下不小于该数的低的可计算可枚举实数.     

基于协方差矩阵的自适应盲分离算法

提出了一种新的线性混叠信号的盲分离算法,该算法利用信号相互独立时其协方差矩阵的对角化特征作为分离准则,采用最速下降法进行分离.该算法对源信号和混叠矩阵没有过多要求且计算量不大,理论分析与仿真结果表明:该算法具有很好的分离效果.     

On the analysis of a dynamic evolutionary algorithm

Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability.     

混沌实验数据处理及仿真

大学物理实验中混沌实验大多采用观察现象的方法进行,本实验采用蔡氏电路(Chua s circuit)产生混沌行为.在观察不同初始值条件下出现的倍周期分岔、阵发混沌、奇异吸引子等相图及现象的基础上,通过对采集数据进行处理,对负电阻伏安特性进行分段线性拟合,用功率频谱法、计算机仿真方法(龙格-库塔数值积分法)对混沌现象进行描绘,将实验数据与非线性方程组的数值解相结合,呈现出混沌现象的本质.     

Er3+掺杂的Bi2O3-B2O3-SiO2玻璃的光谱性质

测试了Bi₂O₃-B₂O₃-SiO₂玻璃中的Er³⁺离子的吸收光谱、发射光谱、⁴I_13/2的荧光寿命、拉曼光谱,及OH^-的傅里叶红外吸收光谱。应用Judd-Ofelt理论计算了该玻璃中的Er³⁺离子的J-O参数、振子强度、⁴I_13/2能级的寿命,从而利用测得的⁴I_13/2的荧光寿命得出了⁴I_13/2能级的量子效率(15%)。由于较低量子效率可能与OH^-有关,所以计算了玻璃中的OH^-浓度,发现其浓度较高(1.66×10¹⁹cm^-1,相当于Er³⁺浓度的3倍)。应用McCumber理论和四能级模型计算了Er³⁺离子的受激发射截面和荧光发射光谱的半峰全宽,结果与通过吸收光谱计算所得基本吻合。根据透射率和折射率的关系计算了折射率,发现和测量值相差很大,说明有较大的散射,通过拉曼光谱和显微镜测试,认为是玻璃中的微小气泡造成的。