Developing the Low-Temperature Oxidation Mechanism of Cyclopentane: An Experimental and Theoretical Study

At present, the reactivity of cyclic alkanes is estimated by comparison with acyclic hydrocarbons. Due to the difference in the structure of cycloalkanes and acycloalkanes, the thermodynamic data obtained by analogy are not applicable. In this study, a molecular beam sampling vacuum ultraviolet photoionization time-of-flight mass spectrometer (MB-VUV-PI-TOFMS) was applied to study the low-temperature oxidation of cyclopentane (CPT) at a total pressure range from 1–3 atm and low-temperature range between 500 and 800 K. Low-temperature reaction products including cyclic olefins, cyclic ethers, and highly oxygenated intermediates (e. g., ketohydroperoxide KHP, keto-dihydroperoxide KDHP, olefinic hydroperoxides OHP and ketone structure products) were observed. Further investigation of the oxidation of CPT – electronic structure calculations – were carried out at the UCCSD(T)-F12a/aug-cc-pVDZ//B3LYP/6-31+ G(d,p) level to explore the reactivity of O₂ molecules adding sequentially to cyclopentyl radicals. Experimental and theoretical observations showed that the dominant product channel in the reaction of CPT radicals with O₂ is HO₂ elimination yielding cyclopentene. The pathways of second and third O₂ addition – the dissociation of hydroperoxide – were further confirmed. The results of this study will develop the low-temperature oxidation mechanism of CPT, which can be used for future research on accurately simulating the combustion process of CPT.     

A branch-and-bound method for the minimum k−enclosing ball problem

The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets.     

An approach of dynamic mesh adaptation for simulating 3‐dimensional unsteady moving‐immersed‐boundary flows

In this paper, we present an approach of dynamic mesh adaptation for simulating complex 3‐dimensional incompressible moving‐boundary flows by immersed boundary methods. Tetrahedral meshes are adapted by a hierarchical refining/coarsening algorithm. Regular refinement is accomplished by dividing 1 tetrahedron into 8 subcells, and irregular refinement is only for eliminating the hanging points. Merging the 8 subcells obtained by regular refinement, the mesh is coarsened. With hierarchical refining/coarsening, mesh adaptivity can be achieved by adjusting the mesh only 1 time for each adaptation period. The level difference between 2 neighboring cells never exceeds 1, and the geometrical quality of mesh does not degrade as the level of adaptive mesh increases. A predictor‐corrector scheme is introduced to eliminate the phase lag between adapted mesh and unsteady solution. The error caused by each solution transferring from the old mesh to the new adapted one is small because most of the nodes on the 2 meshes are coincident. An immersed boundary method named local domain‐free discretization is employed to solve the flow equations. Several numerical experiments have been conducted for 3‐dimensional incompressible moving‐boundary flows. By using the present approach, the number of mesh nodes is reduced greatly while the accuracy of solution can be preserved.     

Two-dimensional vortex sheets for the nonisentropic Euler equations: Nonlinear stability

We show the short-time existence and nonlinear stability of vortex sheets for the nonisentropic compressible Euler equations in two spatial dimensions, based on the weakly linear stability result of Morando and Trebeschi (2008) [20]. The missing normal derivatives are compensated through the equations of the linearized vorticity and entropy when deriving higher-order energy estimates. The proof of the resolution for this nonlinear problem follows from certain a priori tame estimates on the effective linear problem in the usual Sobolev spaces and a suitable Nash–Moser iteration scheme.     

Thermally induced solid-state transformation of cimetidine. A multi-spectroscopic/chemometrics determination of the kinetics of the process and structural elucidation of one of the products as a stable N3-enamino tautomer

Exposure of cimetidine (CIM) to dry heat (160–180 °C) afforded, upon cooling, a glassy solid containing new and hitherto unknown products. The kinetics of this process was studied by a second order chemometrics-assisted multi-spectroscopic approach. Proton and carbon-13 nuclear magnetic resonance (NMR), as well as ultraviolet and infrared spectroscopic data were jointly used, whereas multivariate curve resolution with alternating least squares (MCR-ALS) was employed as the chemometrics method to extract process information. It was established that drug degradation follows a first order kinetics.     

Potts models with magnetic field: Arithmetic,geometry, and computation

We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming.