Computing the Kekulé structure count for alternant hydrocarbons

A fast computer algorithm brings computation of the permanents of sparse matrices, specifically, molecular adjacency matrices. Examples and results are presented, along with a discussion of the relationship of the permanent to the Kekulé structure count. A simple method is presented for determining the Kekulé structure count of alternant hydrocarbons. For these hydrocarbons, the square of the Kekulé structure count is equal to the permanent of the adjacency matrix. In addition, for alternant structures the adjacency matrix for N atoms can be written in such a way that only an N/2 × N/2 matrix need be evaluated. The Kekulé structure count correlates with topological indices. The inclusion of the number of cycles improves the fit. When comparing with previous results, the variance decreases 74%. The calculated standard heat of formation correlates with the logarithm of the Kekulé structure count. This heat increments 349 kJ/mol each time the Kekulé structure count increases by one order of magnitude. © 2002 Wiley Periodicals, Inc. Int J Quantum Chem, 2002     

On the automatic restricted-step rational-function-optimization method

The rational function optimization algorithm is one of the widely used methods to search stationary points on surfaces. However, one of the drawbacks of this method is the step reduction procedure to deal with the overstepping problem. We present and comment on a method such that the step obtained from the solution of the rational function equations possesses the desired correct length. The analysis and discussion of the method is mainly centered on the location and optimization of transition states. Received: 18 June 1998 / Accepted: 17 September 1998 / Published online: 23 November 1998     

Modular design of icosahedral metal clusters

The concept of crystalline module, that is, an unambiguously isolated, repeated quasi-molecular element, is introduced. This concept is more general than the concept of crystal lattice. The generalized modular approach allows extension of the methods and principles of crystallography to quasi-crystals, clusters, amorphous solids, and periodic biological structures. Principles of construction of aperiodic, nonequilibrium regular modular structures are formulated. Limitations on the size of icosahedral clusters are due to the presence of spherical shells with non-Euclidean tetrahedral tiling in their structure. A parametric relationship between the structures of icosahedral fullerenes and metal clusters of the Chini series was found.     

A genetic algorithm for the automated generation of small organic molecules: Drug design using an evolutionary algorithm

Rational drug design involves finding solutions to large combinatorial problems for which an exhaustive search is impractical. Genetic algorithms provide a novel tool for the investigation of such problems. These are a class of algorithms that mimic some of the major characteristics of Darwinian evolution. LEA has been designed in order to conceive novel small organic molecules which satisfy quantitative structure-activity relationship based rules (fitness). The fitness consists of a sum of constraints that are range properties. The algorithm takes an initial set of fragments and iteratively improves them by means of crossover and mutation operators that are related to those involved in Darwinian evolution. The basis of the algorithm, its implementation and parameterization, are described together with an application in de novo molecular design of new retinoids. The results may be promising for chemical synthesis and show that this tool may find extensive applications in de novo drug design projects.     

Test of variational transition state theory with multidimensional tunneling contributions against experimental kinetic isotope effects for the CHnD4−n + OH→P (n=0, 4) reactions

 Variational transition state theory including tunneling corrections (as implemented in Polyrate 8.7) and using multilevel energy calculations at the MCCM-CCSD(T)-1sc level for the CH₄ + OH reaction and at the MCCM-CCSD(T)-2m level for the CD₄ + OH process, reproduces very well the experimental rate constants. However, no single methodology was found that reproduces equally well the experimental rate constants for both title reactions. Received: 24 March 2002 / Accepted: 11 April 2002 / Published online: 4 July 2002     

多组分多出口稀土串级萃取静态优化设计研究(I)静态设计算法

研究了多组分、多出口稀土串级萃取体系静态优化设计过程的精确计算方法. 首先推导出串级萃取体系最重要的物料平衡和萃取平衡关系, 其次根据分离要求等条件确定了各出口的相对流量, 利用萃取平衡和物料平衡关系进行静态递推, 并在求解过程中根据物料平衡关系引入了校正参数, 通过对递推结果的迭代校正, 最终得到收敛的计算结果, 解决了静态设计算法的关键问题. 这一方法为多组分多出口稀土串级萃取过程的静态优化设计提供了精确算法.     

A Procedure for Transforming Impedance Spectra for the Determination of Mechanism of Electrochemical Reactions

Transformation of impedance spectra into relaxation time spectra (RTS) is used for determining contributions of individual processes of the oxygen electroreduction reaction (OER) to the polarization resistance of the electrochemical cell. The transformation technique involves the solution of the convolution equation found with the aid of a modified Van Cittert iteration algorithm checked on model impedance spectra. The technique, when used to analyze impedance spectra of electrochemical cells air|Pt|YSZ|YSZ + Pt|air, shows that the conversion of a globular structure of the YSZ + Pt cermet layer to a columnar one is accompanied by a change of peak amplitudes in RTS. The revealed RTS dynamics when heated to 750°C is compared with peculiarities of individual processes in OER.     

Comparative analysis of affine scaling algorithms based on simplifying assumptions

We analyze several affine potential reduction algorithms for linear programming based on simplifying assumptions. We show that, under a strong probabilistic assumption regarding the distribution of the data in an iteration, the decrease in the primal potential function will be with high probability, compared to the guaranteed(1). ( 2n is a parameter in the potential function andn is the number of variables.) Under the same assumption, we further show that the objective reduction rate of Dikin's affine scaling algorithm is with high probability, compared to no guaranteed convergence rate.Research supported in part by NSF Grant DDM-8922636.