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.     

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.     

Melatonin Rescues the Dendrite Collapse Induced by the Pro-Oxidant Toxin Okadaic Acid in Organotypic Cultures of Rat Hilar Hippocampus

The pro-oxidant compound okadaic acid (OKA) mimics alterations found in Alzheimer’s disease (AD) as oxidative stress and tau hyperphosphorylation, leading to neurodegeneration and cognitive decline. Although loss of dendrite complexity occurs in AD, the study of this post-synaptic domain in chemical-induced models remains unexplored. Moreover, there is a growing expectation for therapeutic adjuvants to counteract these brain dysfunctions. Melatonin, a free-radical scavenger, inhibits tau hyperphosphorylation, modulates phosphatases, and strengthens dendritic arbors. Thus, we determined if OKA alters the dendritic arbors of hilar hippocampal neurons and whether melatonin prevents, counteracts, or reverses these damages. Rat organotypic cultures were incubated with vehicle, OKA, melatonin, and combined treatments with melatonin either before, simultaneously, or after OKA. DNA breaks were assessed by TUNEL assay and nuclei were counterstained with DAPI. Additionally, MAP2 was immunostained to assess the dendritic arbor properties by the Sholl method. In hippocampal hilus, OKA increased DNA fragmentation and reduced the number of MAP2(+) cells, whereas melatonin protected against oxidation and apoptosis. Additionally, OKA decreased the dendritic arbor complexity and melatonin not only counteracted, but also prevented and reversed the dendritic arbor retraction, highlighting its role in post-synaptic domain integrity preservation against neurodegenerative events in hippocampal neurons.     

相对性区域创新指数与经济周期挖掘

提出了一类新的相对性区域创新指数,并采用世界专利申请数据对其进行了具体计算.基于区域创新同经济发展水平之间的超线性关系,该指数消除了经济发展水平对创新能力的影响,可以实现对不同发展水平的经济体之间进行有效的创新能力横纵对比.该创新指数尽管极其简单,却揭示出一系列迥异于传统认知的现象,例如中国大陆地区的技术创新能力在1980年代就已经位居世界前列.采用该指数,不但可以在较高水平上解释世界各国的经济增长,还发现它同经济增长率之间的相关性存在一个20年的经济周期.这些结果显示,该指数作为一个单一性指标,以极小的数据依赖就实现了较高程度的解释性,不但重新定位了世界各经济体的创新能力,对深入理解创新同经济发展之间的关系提供了新的角度,而且暗示着这类相对性经济指标的发展潜力与应用空间.     

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.     

Infinite family of transmission irregular trees of even order

Distance between two vertices is the number of edges in a shortest path connecting them in a connected graph $G$. The transmission of a vertex $v$ is the sum of distances from $v$ to all the other vertices of $G$. If transmissions of all vertices are mutually distinct, then $G$ is a transmission irregular graph. It is known that almost no graphs are transmission irregular. Infinite families of transmission irregular trees of odd order were presented in Alizadeh and Klav?ar (2018). The following problem was posed in Alizadeh and Klav?ar (2018): do there exist infinite families of transmission irregular trees of even order? In this article, such a family is constructed.     

Consecutive Supramolecular Polymerization of a Rylene-Based Twistacene

The synthesis and self-assembling features of twistacene 1 are reported. The supramolecular polymerization of 1 displays a consecutive pathway to afford slipped ( AggI ) and rotationally displaced ( AggII ) aggregates conditioned by the formation of intramolecularly H-bonded pseudocycles. In methylcyclohexane, both AggI and AggII are highly stable and the interconversion of the kinetically controlled AggI into the thermodynamically controlled AggII takes several weeks to occur. The utilization of toluene as solvent changes the energetic level for both aggregates and favors a faster conversion of AggI into AggII within a period of minutes. This conversion can be accelerated by the addition of seeds. Furthermore, concentration dependent kinetic studies demonstrate the consecutive character of the supramolecular polymerization of 1 .     

Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture

Recently F. M. Dekking conjectured the form of the subword complexity function for the Fibonacci–Thue–Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.