An innovative flower pollination algorithm for continuous optimization problem

The flower pollination algorithm (FPA) is a relatively new swarm optimization algorithm that inspired by the pollination phenomenon of natural phanerogam. Since its proposed, it has received widespread attention and been applied in various engineering fields. However, the FPA still has certain drawbacks, such as inadequate optimization precision and poor convergence. In this paper, an innovative flower pollination algorithm based on cloud mutation is proposed (CMFPA), which adds information of all dimensions in the global optimization stage and uses the designed cloud mutation method to redistribute the population center. To verify the performance of the CMFPA in solving continuous optimization problems, we test twenty-four well-known functions, composition functions of CEC2013 and all benchmark functions of CEC2017. The results demonstrate that the CMFPA has better performance compared with other state-of-the-art algorithms. In addition, the CMFPA is implemented for five constrained optimization problems in practical engineering, and the performance is compared with state-of-the-art algorithms to further prove the effectiveness and efficiency of the CMFPA.     

Divergent 2-Chloroquinazolin-4(3H)-one Rearrangement: Twisted-Cyclic Guanidine Formation or Ring-Fused N-Acylguanidines via a Domino Process

A highly efficient 2-chloroquinazolin-4(3H)-one rearrangement was developed that predictably generates either twisted-cyclic or ring-fused guanidines in a single operation, depending on the presence of a primary versus secondary amine in the accompanying diamine reagent. Exclusive formation of twisted-cyclic guanidines results from pairing 2-chloroquinazolinones with secondary diamines. Use of primary amine-containing diamines permits a domino quinazolinone rearrangement/intramolecular cyclization, gated through (E)-twisted-cyclic guanidines, to afford ring-fused N-acylguanidines. This scalable, structurally tolerant transformation generated 55 guanidines and delivered twisted-cyclic guanidines with robust plasma stability and an abbreviated total synthesis of an antitumor ring-fused guanidine (4 steps, 55 % yield).     

Multi-funnel optimization using Gaussian underestimation

In several applications, underestimation of functions has proven to be a helpful tool for global optimization. In protein–ligand docking problems as well as in protein structure prediction, single convex quadratic underestimators have been used to approximate the location of the global minimum point. While this approach has been successful for basin-shaped functions, it is not suitable for energy functions with more than one distinct local minimum with a large magnitude. Such functions may contain several basin-shaped components and, thus, cannot be underfitted by a single convex underestimator. In this paper, we propose using an underestimator composed of several negative Gaussian functions. Such an underestimator can be computed by solving a nonlinear programming problem, which minimizes the error between the data points and the underestimator in the L ¹ norm. Numerical results for simulated and actual docking energy functions are presented.     

The empirical behavior of sampling methods for stochastic programming

We investigate the quality of solutions obtained from sample-average approximations to two-stage stochastic linear programs with recourse. We use a recently developed software tool executing on a computational grid to solve many large instances of these problems, allowing us to obtain high-quality solutions and to verify optimality and near-optimality of the computed solutions in various ways. Research supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, U.S. Department of Energy, under Contract W-31-109-Eng-38, and by the National Science Foundation under Grant 9726385. Research supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, U.S. Department of Energy, under Contract W-31-109-Eng-38, and by the National Science Foundation under Grant DMS-0073770. Research supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, U.S. Department of Energy, under Contract W-31-109-Eng-38, and by the National Science Foundation under Grants 9726385 and 0082065.     

Mukai flop and Ruan cohomology

Suppose that two compact symplectic manifolds X,X are connected by a sequence of simple Mukai flops. In this paper, we construct a ring isomorphism between cohomology rings of X and X. Using the localization technique, we prove that the quantum corrected products on X,X are the ordinary intersection products. Furthermore, X,X have isomorphic Ruan cohomology, i.e. we verify the cohomological minimal model conjecture proposed by Ruan for the pair (X,X).Mathematics Subject Classification (2001): 14N35, 53D45Supported in part by NSF of China (10171114 and 10231050).Revised version: 9 April 2004     

Phase equilibria of charge-, size-, and shape-asymmetric model electrolytes

The low-temperature phase behavior of two 2:1 hard-core electrolyte models has been investigated by Monte Carlo simulations. In the first model, both bivalent cations and monovalent anions are spherical, and the charges are located at the ion's centers; in the second model, bivalent cations are modeled as rigid dimers composed of two tangent hard spheres, each carrying a positive charge at the center. It is found that the critical temperature and the critical density are strongly affected by the size asymmetry and the shape of the ions. The results presented in this work provide insights into the behavior of charged colloidal suspensions and polyelectrolytes, where large, symmetric or asymmetric ionic species carrying like charges can attract each other and give rise to thermodynamically unstable conditions.     

Multi-parameter singular radon transforms I: The <Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript> theory

The purpose of this paper is to study the L ² boundedness of operators of the form f ↦ ψ(x) ∫ f (γ _t (x))K(t)dt, where γ _t (x) is a C ^∞ function defined on a neighborhood of the origin in (t, x) ∈ ℝ ^N × ℝ ⁿ , satisfying γ ₀(x) ≡ x, ψ is a C ^∞ cut-off function supported on a small neighborhood of 0 ∈ ℝ ⁿ , and K is a “multi-parameter singular kernel” supported on a small neighborhood of 0 ∈ ℝ ^N . The goal is, given an appropriate class of kernels K, to give conditions on γ such that every operator of the above form is bounded on L ². The case when K is a Calderón-Zygmund kernel was studied by Christ, Nagel, Stein, and Wainger; we generalize their conditions to the case when K has a “multi-parameter” structure. For example, when K is given by a “product kernel.” Even when K is a Calderón- Zygmund kernel, our methods yield some new results. This is the first paper in a three part series, the later two of which are joint with E. M. Stein. The second paper deals with the related question of L ^p boundedness, while the third paper deals with the special case when γ is real analytic.