Dynamical analysis,circuit realization,and application in pseudorandom number generators of a fractional-order laser chaotic system

A new five-dimensional fractional-order laser chaotic system (FOLCS) is constructed by incorporating complex variables and fractional calculus into a Lorentz-Haken-type laser system. Dynamical behavior of the system, circuit realization and application in pseudorandom number generators are studied. Many types of multi-stable states are discovered in the system. Interestingly, there are two types of state transition phenomena in the system, one is the chaotic state degenerates to a periodical state, and the other is the intermittent chaotic oscillation. In addition, the complexity of the system when two parameters change simultaneously is measured by the spectral entropy algorithm. Moreover, a digital circuit is design and the chaotic oscillation behaviors of the system are verified on this circuit. Finally, a pseudo-random sequence generator is designed using the FOLCS, and the statistical characteristics of the generated pseudo-random sequence are tested with the NIST-800-22. This study enriches the research on the dynamics and applications of FOLCS.     

An efficient edge based data structure for the compressible Reynolds-averaged Navier–Stokes equations on hybrid unstructured meshes

An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds-averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open-source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR-F6 wing-body-nacelle-pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times.     

Triesterase and Promiscuous Diesterase Activities of a Di‐CoII‐Containing Organophosphate Degrading Enzyme Reaction Mechanisms

The reaction mechanism for the hydrolysis of trimethyl phosphate and of the obtained phosphodiester by the di‐Co^II derivative of organophosphate degrading enzyme from Agrobacterium radiobacter P230(OpdA), have been investigated at density functional level of theory in the framework of the cluster model approach. Both mechanisms proceed by a multistep sequence and each catalytic cycle begins with the nucleophilic attack by a metal‐bound hydroxide on the phosphorus atom of the substrate, leading to the cleavage of the phosphate‐ester bond. Four exchange‐correlation functionals were used to derive the potential energy profiles in protein environments. Although the enzyme is confirmed to work better as triesterase, as revealed by the barrier heights in the rate‐limiting steps of the catalytic processes, its promiscuous ability to hydrolyze also the product of the reaction has been confirmed. The important role played by water molecules and some residues in the outer coordination sphere has been elucidated, while the binuclear Co^II center accomplishes both structural and catalytic functions. To correctly describe the electronic configuration of the d shell of the metal ions, high‐ and low‐spin arrangement jointly with the occurrence of antiferromagnetic coupling, have been herein considered.     

Influence of Polarity and Activation Energy in Microwave–Assisted Organic Synthesis (MAOS)

The aim of this work was to determine the parameters that have decisive roles in microwave-assisted reactions and to develop a model, using computational chemistry, to predict a priori the type of reactions that can be improved under microwaves. For this purpose, a computational study was carried out on a variety of reactions, which have been reported to be improved under microwave irradiation. This comprises six types of reactions. The outcomes obtained in this study indicate that the most influential parameters are activation energy, enthalpy, and the polarity of all the species that participate. In addition to this, in most cases, slower reacting systems observe a much greater improvement under microwave irradiation. Furthermore, for these reactions, the presence of a polar component in the reaction (solvent, reagent, susceptor, etc.) is necessary for strong coupling with the electromagnetic radiation. We also quantified that an activation energy of 20–30 kcal mol⁻¹ and a polarity (μ) between 7–20 D of the species involved in the process is required to obtain significant improvements under microwave irradiation.     

An Update on Molecularly Imprinted Polymer Design through a Computational Approach to Produce Molecular Recognition Material with Enhanced Analytical Performance

Molecularly imprinted polymer (MIP) computational design is expected to become a routine technique prior to synthesis to produce polymers with high affinity and selectivity towards target molecules. Furthermore, using these simulations reduces the cost of optimizing polymerization composition. There are several computational methods used in MIP fabrication and each requires a comprehensive study in order to select a process with results that are most similar to properties exhibited by polymers synthesized through laboratory experiments. Until now, no review has linked computational strategies with experimental results, which are needed to determine the method that is most appropriate for use in designing MIP with high molecular recognition. This review will present an update of the computational approaches started from 2016 until now on quantum mechanics, molecular mechanics and molecular dynamics that have been widely used. It will also discuss the linear correlation between computational results and the polymer performance tests through laboratory experiments to examine to what extent these methods can be relied upon to obtain polymers with high molecular recognition. Based on the literature search, density functional theory (DFT) with various hybrid functions and basis sets is most often used as a theoretical method to provide a shorter MIP manufacturing process as well as good analytical performance as recognition material.     

12β-Acetyloxyperforatin,a New Limonoid from Harrisonia Perforata

A new A, D-seco limonoid, named 12-acetyloxyperforatin (1), along with three known ones, were isolated from the leaves of Harrisonia perforata. Their structures were elucidated on the basis of spectroscopic analysis, including extensive NMR techniques and computational modelling. These compounds showed no inhibitory activity against the 11β-HSD1 enzyme.     

A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form

The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a λ-approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers.     

Near-Ultraviolet Circular Dichroism and Two-Dimensional Spectroscopy of Polypeptides

A fully quantitative theory of the relationship between protein conformation and optical spectroscopy would facilitate deeper insights into biophysical and simulation studies of protein dynamics and folding. In contrast to intense bands in the far-ultraviolet, near-UV bands are much weaker and have been challenging to compute theoretically. We report some advances in the accuracy of calculations in the near-UV, which were realised through the consideration of the vibrational structure of the electronic transitions of aromatic side chains.     

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.