Bifurcations and transition states

Bifurcations of reaction channels are related to valley-ridge inflection points and it is examined what happens when these do not coincide with transition states. Under such conditions there result bifurcating regions. There exist a number of different prototypes for such regions which are discussed explicitly on the basis of the pertinent Taylor expansions. When bifurcations occur close enough to transition states then there result bifurcating transition regions. An example for a bifurcating transition region is exhibited which is obtained from a quantum mechanical ab initio calculation for the ring opening of cyclopropylidene to aliene. In general there exist no orthogonal trajectory patterns which could serve as simplified models for channel bifurcations.Operated for the U.S. Department of Energy by Iowa State University under Contract No. W-7405-ENG-82. This work was supported by the Office of Basic Energy Sciences     

A note on packing paths in planar graphs

Seymour (1981) proved that the cut criterion is necessary and sufficient for the solvability of the edge-disjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, Middendorf and Pfeiffer (1993) proved the problem to be NP-complete. For this case, Korach and Penn (1992) proved that the cut criterion is sufficient for the existence of a near-complete packing of paths. Here we generalize this result by showing how a natural strengthening of the cut criterion yields better packings of paths.Analogously to Seymour's approach, we actually prove a theorem on packing cuts in an arbitrary graph and then the planar edge-disjoint paths case is obtained by planar dualization. The main result is derived from a theorem of Seb (1990) on the structure of ±1 weightings of a bipartite graph with no negative circuits.Research partially supported by the Hungarian National Foundation for Scientific Research Grants OTKA 2118 and 4271.     

Minimum cost multiflows in undirected networks

LetN = (G, T, c, a) be a network, whereG is an undirected graph,T is a distinguished subset of its vertices (calledterminals), and each edgee ofG has nonnegative integer-valuedcapacity c(e) andcost a(e). Theminimum cost maximum multi(commodity)flow problem (*) studied in this paper is to find ac-admissible multiflowf inG such that: (i)f is allowed to contain partial flows connecting any pairs of terminals, (ii) the total value off is as large as possible, and (iii) the total cost off is as small as possible, subject to (ii). This generalizes, on one hand, the undirected version of the classical minimum cost maximum flow problem (when |T| = 2), and, on the other hand, the problem of finding a maximum fractional packing ofT-paths (whena 0). Lovász and Cherkassky independently proved that the latter has a half-integral optimal solution.A pseudo-polynomial algorithm for solving (*) has been developed earlier and, as its consequence, the theorem on the existence of a half-integral optimal solution for (*) was obtained. In the present paper we give a direct, shorter, proof of this theorem. Then we prove the existence of a half-integral optimal solution for the dual problem. Finally, we show that half-integral optimal primal and dual solutions can be designed by a combinatorial strongly polynomial algorithm, provided that some optimal dual solution is known (the latter can be found, in strongly polynomial time, by use of a version of the ellipsoid method).This work was partially supported by Chaire municipale, Mairie de Grenoble, France.     

Exploring potential energy surfaces for chemical reactions: an overview of some practical methods

Potential energy surfaces form a central concept in the application of electronic structure methods to the study of molecular structures, properties, and reactivities. Recent advances in tools for exploring potential energy surfaces are surveyed. Methods for geometry optimization of equilibrium structures, searching for transition states, following reaction paths and ab initio molecular dynamics are discussed. For geometry optimization, topics include methods for large molecules, QM/MM calculations, and simultaneous optimization of the wave function and the geometry. Path optimization methods and dynamics based techniques for transition state searching and reaction path following are outlined. Developments in the calculation of ab initio classical trajectories in the Born-Oppenheimer and Car-Parrinello approaches are described.     

Location of saddle points and minimum energy paths by a constrained simplex optimization procedure

Two methods are proposed, one for the location of saddle points and one for the calculation of steepest-descent paths on multidimensional surfaces. Both methods are based on a constrained simplex optimization technique that avoids the evaluation of gradients or second derivative matrices. Three chemical reactions of increasing structural complexity are studied within the PRDDO SCF approximation. Predicted properties of reaction hypersurfaces are in good overall agreement with those determined by gradient minimization and gradient following algorithms in connection with various ab initio SCF methods. Computational efforts required by the new procedures are discussed.     

Ab initio studies of the protonation of CO,N2 and NO+: Calculation of the minimum energy reaction paths

Ab initio molecular orbital calculations employing a 4-31G basis set have been used to study the minimum energy paths for the formation of HCO⁺, COH⁺, and HCOH²⁺ from CO by protonation. The protonation of N₂ to give NNH⁺ and HNNH²⁺ and of NO⁺ to form HNO²⁺ and NOH²⁺ have also been investigated. All species formed have linear equilibrium geometries and the minimum energy path for approach of the proton is along the line-of-centers of the heavy atoms. Energy barriers to the formation of the various species are given, where appropriate, and changes in geometry, ordering of molecular orbitals and orbital occupancy are discussed.     

贪婪格点路径的一些性质

设{Xv:v∈Zd}是一族独立同分布的随机变量序列,对Zd上的任意一路径π,定义S(π)=∑v∈πXv,记Mn=maxπ∈Π0(n)S(π),Π0(n)表示从原点出发大小为n的自不相交的路径的全体.论文讨论Mn的性质,得到了类似完全收敛性的结果,即对任意的ε>0,∑∞n=11nPMnn-M>ε<∞.另外还讨论了Xv允许取负值的情形,得到类似的结果,从而推广了Gandolfi和Kesten所研究的贪婪格点路径模型.     

EXPERIMENTAL RESEARCH ON FAILURE AND ENERGY DISSIPATION CHRACTERISTICS OF THE SANDSTONE1)

通过三轴卸荷试验,探究了不同路径下卸荷速率对砂岩力学特性及破坏过程中的能量耗散的影响。试验结果表明在全过程应力-应变曲线的弹性阶段,轴向变形起主导作用,弹塑性阶段,环向应变的增加值大于轴向应变增加值。在围压卸荷阶段,卸荷速率越小,卸荷阶段的应变折合柔度越大,此时岩样的变形不充分,呈现明显的脆性破坏。恒主应力差路径下的耗散能大于恒轴压路径下的耗散能的35%,卸荷速率越大,岩样的弹性应变能越小。