GROMACS: fast, flexible, and free

This article describes the software suite GROMACS (Groningen MAchine for Chemical Simulation) that was developed at the University of Groningen, The Netherlands, in the early 1990s. The software, written in ANSI C, originates from a parallel hardware project, and is well suited for parallelization on processor clusters. By careful optimization of neighbor searching and of inner loop performance, GROMACS is a very fast program for molecular dynamics simulation. It does not have a force field of its own, but is compatible with GROMOS, OPLS, AMBER, and ENCAD force fields. In addition, it can handle polarizable shell models and flexible constraints. The program is versatile, as force routines can be added by the user, tabulated functions can be specified, and analyses can be easily customized. Nonequilibrium dynamics and free energy determinations are incorporated. Interfaces with popular quantum-chemical packages (MOPAC, GAMES-UK, GAUSSIAN) are provided to perform mixed MM/QM simulations. The package includes about 100 utility and analysis programs. GROMACS is in the public domain and distributed (with source code and documentation) under the GNU General Public License. It is maintained by a group of developers from the Universities of Groningen, Uppsala, and Stockholm, and the Max Planck Institute for Polymer Research in Mainz. Its Web site is http://www.gromacs.org.     

Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison

We consider the following global optimization problems for a Lipschitz functionf implicitly defined on an interval [a, b]. Problem P: find a globally-optimal value off and a corresponding point; Problem Q: find a set of disjoint subintervals of [a, b] containing only points with a globally-optimal value and the union of which contains all globally optimal points. A two-phase algorithm is proposed for Problem P. In phase I, this algorithm obtains rapidly a solution which is often globally-optimal. Moreover, a sufficient condition onf for this to be the case is given. In phase II, the algorithm proves the-optimality of the solution obtained in phase I or finds a sequence of points of increasing value containing one with a globally-optimal value. The new algorithm is empirically compared (on twenty problems from the literature) with a best possible algorithm (for which the optimal value is assumed to be known), with a passive algorithm and with the algorithms of Evtushenko, Galperin, Shen and Zhu, Piyavskii, Timonov and Schoen. For small, the new algorithm requires only a few percent more function evaluations than the best possible one. An extended version of Piyavskii's algorithm is proposed for problem Q. A sufficient condition onf is given for the globally optimal points to be in one-to-one correspondance with the obtained intervals. This result is achieved for all twenty test problems.The research of the authors has been supported by AFOSR grants 0271 and 0066 to Rutgers University. Research of the second author has been also supported by NSERC grant GP0036426, FCAR grant 89EQ4144 and partially by AFOSR grant 0066. We thank Nicole Paradis for her help in drawing the figures.     

Phenomenology of nonlocal cellular automata

Dynamical systems with nonlocal connections have potential applications to economic and biological systems. This paper studies the dynamics of nonlocal cellular automata. In particular, all two-state, three-input nonlocal cellular automata are classified according to the dynamical behavior starting from random initial configurations and random wirings, although it is observed that sometimes a rule can have different dynamical behaviors with different wirings. The nonlocal cellular automata rule space is studied using a mean-field parametrization which is ideal for the situation of random wiring. Nonlocal cellular automata can be considered as computers carrying out computation at the level of each component. Their computational abilities are studied from the point of view of whether they contain many basic logical gates. In particular, I ask the question of whether a three-input cellular automaton rule contains the three fundamental logical gates: two-input rules AND and OR, and one-input rule NOT. A particularly interesting edge-of-chaos nonlocal cellular automaton, the rule 184, is studied in detail. It is a system of coupled selectors or multiplexers. It is also part of the Fredkin's gate—a proposed fundamental gate for conservative computations. This rule exhibits irregular fluctuations of density, large coherent structures, and long transient times.     

On the usage of NURBS as interface representation in free‐surface flows

When simulating free‐surface flows using the finite element method, there are many cases where the governing equations require information which must be derived from the available discretized geometry. Examples are curvature or normal vectors. The accurate computation of this information directly from the finite element mesh often requires a high degree of refinement—which is not necessarily required to obtain an accurate flow solution. As a remedy and an option to be able to use coarser meshes, the representation of the free surface using non‐uniform rational B‐splines (NURBS) curves or surfaces is investigated in this work. The advantages of a NURBS parameterization in comparison with the standard approach are discussed. In addition, it is explored how the pressure jump resulting from surface tension effects can be handled using doubled interface nodes. Numerical examples include the computation of surface tension in a two‐phase flow as well as the computation of normal vectors as a basis for mesh deformation methods. For these examples, the improvement of the numerical solution compared with the standard approaches on identical meshes is shown. Copyright © 2011 John Wiley & Sons, Ltd.     

On using compressibility to detect when slime mould completed computation

Slime mould Physarum polycephalum is a single cell visible by an unaided eye. The slime mould optimizes its network of protoplasmic tubes in gradients of attractants and repellents. This behavior is interpreted as computation. Several prototypes of the slime mould computers were designed to solve problems of computation geometry, graphs, transport networks, and to implement universal computing circuits. Being a living substrate, the slime mould does not halt its behavior when a task is solved but often continues foraging the space thus masking the solution found. We propose to use temporal changes in compressibility of the slime mould patterns as indicators of the halting of the computation. Compressibility of a pattern characterizes the pattern's morphological diversity, that is, a number of different local configurations. At the beginning of computation the slime explores the space, thus generating less compressible patterns. After gradients of attractants and repellents are detected the slime spans data sites with its protoplasmic network and retracts scouting branches, thus generating more compressible patterns. We analyze the feasibility of the approach on results of laboratory experiments and computer modelling. © 2015 Wiley Periodicals, Inc. Complexity 21: 162–175, 2016     

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.     

峨山褐煤的分子结构和分子模拟

作为重要的化石能源，褐煤资源潜力巨大、分布广泛但综合利用率低。研究褐煤的分子结构模型，有助于预测褐煤在热解、液化和气化过程中的化学反应机理及反应路径，进而提高褐煤的综合应用水平。以云南峨山褐煤为研究对象，利用傅里叶变换红外光谱、13C核磁共振波谱及X射线光电子能谱等分析测试方法，获取了峨山褐煤的含碳、含氧及含氮结构参数。在此基础上，借助Gaussian 09计算平台，采用量子化学建模的方法构建并优化了峨山褐煤的分子结构模型。研究结果表明：峨山褐煤的芳碳率为39.20%，芳香碳结构主要为苯和萘，且芳香桥头碳与周边碳的比值χ_b为0.07；脂碳率为49.51%，脂肪碳结构主要为亚甲基，季碳和氧接脂碳；氧原子主要存在于羟基、醚氧、羰基和羧基结构中；含氮结构则以吡啶为主。基于元素分析、13C 核磁共振波谱分析，又经过热重实验消除褐煤中残余水分的影响后，计算出峨山褐煤的分子式为C₁₅₃H₁₃₇O₃₅N₂。依据分子式及分析结果计算出峨山褐煤的结构单元含量并构建出其初始结构模型，采用半经验法PM 3基组及密度泛函理论M06-2X/3-21G基组对初始分子构型进行优化。优化后的分子模型具有明显的三维立体特征，芳香环之间较为分散且在空间中排列不规则，芳香簇主要通过亚甲基、醚氧基、羰基、酯基和脂肪环连接，含氧官能团主要分布在分子边缘，脂肪族侧链较多。对优化后的分子模型进行振动频率计算进而获得了分子模型的模拟红外光谱，其与实验红外谱图吻合度良好，证明了峨山褐煤分子结构模型的准确性、合理性。分子结构模型的构建有利于直观地了解峨山褐煤的分子结构特征，从而有助于从微观分子角度研究峨山褐煤的宏观性质。同时，峨山褐煤分子结构模型可为其在热解、液化和气化等领域研究中提供理论指导。