极化子导电到能带导电的转变

采用交流法测量大功率商用钛酸钡(BT)陶瓷加热器的电阻和加热功率随温度的变化关系.结果显示,BT陶瓷的电导特性在80℃附近出现了明显的转变,从低温时的极化子跳跃导电转变为高温时的能带导电,此时,电阻出现极小值,而加热功率出现极大值.     

相对论性无自旋粒子在Hartmann势场中运动的精确解

在标量势等于矢量势的条件下,本文获得了具有Hartmann型势的Klein-Gordon方程的精确解.给出了束缚态的精确的能谱方程和归一化的径向波函数,对于散射态,获得了按“k/2π标度”归一化的径向波函数和相移的解析计算公式.讨论了散射振幅的解析性质和波函数、能谱方程以及相移的非相对论近似.     

Scale Invariance Properties in the Simulated Annealing Algorithm

The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed.     

Many-Polaron States in the Holstein–Hubbard Model

A variational approach is proposed to study some properties of the adiabatic Holstein–Hubbard model which describes an assembly of fermionic charges interacting with a static atomic lattice. The sum of the electronic energy and the lattice elastic energy is proved to have minima with a many-polaron structure in a certain domain of model parameters. Our analytical work consists in expanding these energy minima from the zero electronic transfer limit which remarkably holds for a finite amplitude of the onsite Hubbard repulsion and for an unbounded lattice size.     

有界变量线性规划的基线算法

本文对有界变量线性规划的算法进行了研究，得到了一种解此问题的新算法。文中根据基线算法的算法原理，通过对BL表的旋转，在各变量满足界约束的条件下，使目标函数值不断增大，直至得到有界硬上界，从而得到问题的最优解。文中给出了有界变量线性规划基线算法的计算步骤，并给出了一个例子。与单纯形法相比，采用基线算法解有界变量线性规划操作更简单。迭代次数少，解题速度更快。     

A branch and bound algorithm for the robust shortest path problem with interval data

Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented.     

苯基取代聚乙炔中的元激发

苯环取代聚乙炔是一类具有简并基态的发光聚合物.利用扩展的SuSchriefferHeeger模型,研究了这类聚合物链中的孤子、极化子等元激发特性.结果表明:由于苯环与聚乙炔主链间的强π电子耦合,苯环取代抑制了聚乙炔主链的二聚化,减小了导带与价带之间的能隙;因此取代聚乙炔中的元激发具有较小的激发能,同时具有更大的相干长度.尽管苯基取代对元激发有很大的影响,但是非取代聚乙炔中元激发的基本物理规律依然成立,表明这些元激发的基本特性不受取代基团的影响 关键词： 孤子 极化子 苯基取代聚乙炔     

A note on worst-case performance of heuristics for maintenance scheduling problems

We study a machine scheduling model in which job scheduling and machine maintenance activities have to be considered simultaneously. We develop the worst-case bounds for some heuristic algorithms, including a sharper worst-case bound of the SPT schedule than the results in the literature, and another bound of the EDD schedule.