Variational transition state theory without the minimum-energy path

In this paper we propose a method for carrying out variational transition state theory calculations without first obtaining a converged minimum-energy path (MEP). We illustrate the method in two ways, first of all by employing an unconverged MEP and secondly by using a dynamically optimized distinguished reaction path. Preliminary tests of the algorithm for the reactions OH+H₂→H₂O+H and C₂H₅→C₂H₄+H are very encouraging. Received: 22 January 1997 / Accepted: 11 March 1997     

不饱和链烃沸点的拓扑研究

基于邻接矩阵与边价 (fi)定义边价连接性指数 ( mF) ,其中的0 F ,1 F与 2 94种不饱和链烃 (包括烯烃、炔烃及烯炔烃 )的沸点 (Tb)关联 ,得到良好的数学模型 :ln( 70 0 -Tb) =6 5 2 3 3 1-0 0 0 4880 F2 -0 3 46771 F0 5(n =2 94,R =0 9979,R2 =0 995 8,F =3 490 4,S =5 12 ) ,该回归模型经Jackknife法检验具有总体稳健性 .可以预示 ,该指数将在定量构效关系研究中成为重要参数 .     

Fast Marching Method for Calculating Reactive Trajectories for Chemical Reactions

We present a method for computing classical Newtonian trajectories that minimize the path length or transit time from reactant to product. Our approach is based on a generalization of the fast-marching method, which allows us to construct the solution of the Hamilton-Jacobi equation for the action that optimizes the desired quantity. The resulting “reactive paths” can be interpreted as reaction coordinates but, unlike more conventional choices, they contain dynamical information about the chemical system of interest.     

N叉树上的离散时间量子随机行走

通过离散时间量子随机行走的框架,我们研究了在N叉树上的离散时间量子随机行走,该框架不需要硬币空间,仅仅只需要选择一个除了酉性再无其它限制的演化算子,并且包含了使用再生结构的轨道枚举和z变换.作为结果,我们在封闭形式中计算了在根处的振幅的生成函数.     

基于网格化管理视角下灾后应急物流决策模型与算法研究

灾害发生后,应急资源的需求预测与应急配送中心的合理选址是实现高效救援的关键。本文通过在网格化管理视角下的信息更新将应急救援过程划分为多个阶段,在开展救援的过程中实现救援信息收集和救援预测的同步开展,建立一种多阶段带时间约束的应急救援物资配送响应-时效性的选址模型。借助遗传算法(NSGA-II),实现了基于编码结构独立、路径相互关联基础上的多目标规划求解。本研究的决策模型及算法有着较好的搜索与寻优能力,对实际救援开展具有指导意义。     

Pattern-specific neural network design

We present evidence that the performance of the traditional fully connected Hopfield model can be dramatically improved by carefully selecting an information-specific connectivity structure, while the synaptic weights of the selected connections are the same as in the Hopfield model. Starting from a completely disconnected network we let genuine Hebbian synaptic connections grow, one by one, until a desired degree of stability is achieved. Neural pathways are thus fixed notbefore, butduring the learning phase.     

Approximating the zeros of analytic functions by the exclusion algorithm

We give a practical version of the exclusion algorithm for localizing the zeros of an analytic function and in particular of a polynomial in a compact of . We extend the real exclusion algorithm to a Jordan curve and give a method which excludes discs without any zero. The result of this algorithm is a set of discs arbitrarily small which contains the zeros of the analytic function.     

连接性指数与Kov(a)ts指数的相关性研究

在分子拓扑理论的基础上,提出一种新的拓扑指数——连接性指数~mG,其中。计算了12个系列94种分子的~0G、~1G值,发现~0G或~1G与这些化合物的Kovts指数具有很好的相关性。该模式计算方法简单,使用方便,预测结果理想。     

An algorithm for determining dynamically defined reaction paths (DDRP)

Summary A numerically stable and well-parallelizable curve variational algorithm is described for determining tangent curves of vector fields between two given stationary points. In particular, the method is suitable for finding reaction paths and saddle points on potential energy hypersurfaces (PHS). The stability of the procedure is illustrated by an artificial mathematical function, showing phases of following the reaction on the PHS.Dedicated to Professor Zoltán G. Szabó, the great teacher and scientist in reaction kinetics and in many other fields of physical chemistry, on his 84th birthday.