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.     

Asymptotic Behavior of Least Energy Solutions for a Fractional Laplacian Eigenvalue Problem on ℝN

Acta Mathematica Sinica, English Series - We are interested in the existence and asymptotic behavior for the least energy solutions of the following fractional eigenvalue problem $$\left({\rm{P}}...     

Three-weight linear codes from Weil sums

Journal of Algebraic Combinatorics - By appropriately choosing a defining set, we define a class of linear codes and establish their complete weight enumerators and weight enumerators using Weil...     

Generalized Jacobi spectral Galerkin method for fractional pantograph differential equation

This work is concerned with the extension of the Jacobi spectral Galerkin method to a class of nonlinear fractional pantograph differential equations. First, the fractional differential equation is converted to a nonlinear Volterra integral equation with weakly singular kernel. Second, we analyze the existence and uniqueness of solutions for the obtained integral equation. Then, the Galerkin method is used for solving the equivalent integral equation. The error estimates for the proposed method are also investigated. Finally, illustrative examples are presented to confirm our theoretical analysis.     

蛋白质-多糖复合体系在活性物质传递中的应用

蛋白质-多糖复合体系作为生物活性物质传递系统的壁材,有着人工合成聚合物或无机物等其他材料不可比拟的多重优势。本文就蛋白质和多糖之间的连接方式及蛋白质-多糖复合体系形成传递系统的多种形式进行了综述,以及对此领域的发展趋势进行了展望。结合蛋白质和多糖的结构特点,二者之间的链接方式分为非共价结合的物理共聚,和共价结合的美拉德偶联、化学交联、酶催化交联等方式,文中分别对各种连接方式的原理和机理,以及其影响因素做了深入阐述。以蛋白质-多糖复合体系为壁材对活性物质的传递形式大体上分成乳化系统、胶束、纳米凝胶、分子复合物以及壳核结构等系统。不同的活性物质的特征和传递需求,可针对性地选择合适结构的蛋白质和多糖种类以及二者的连接方式和传递系统的形式。并且,随着研究的逐步发展和推进,此领域的发展趋势朝着智能化和靶向性的方向进行。目前活性物质的蛋白质-多糖复合体系的传递系统,还依然面临着系统设计、评价和应用等多方面的挑战,这就要求我们在更全面更深入了解认识其对活性物质影响和功效的基础上,安全合理地设计和深入细致地评价活性成分的传递系统。     

Pure tetrahedral quadruple systems with index two

An oriented tetrahedron defined on four vertices is a set of four cyclic triples with the property that any ordered pair of vertices is contained in exactly one of the cyclic triples. A tetrahedral quadruple system of order $n$ with index $\lambda$, denoted by ${\text{TQS}}_{\lambda }\left(n\right)$, is a pair $\left(X,\mathrm{?}\right)$, where $X$ is an $n$‐set and $\mathrm{?}$ is a set of oriented tetrahedra (blocks) such that every cyclic triple on $X$ is contained in exactly $\lambda$ members of $\mathrm{?}$. A ${\text{TQS}}_{\lambda }\left(n\right)$ is pure if there do not exist two blocks with the same vertex set. When $\lambda =1$, the spectrum of a pure TQS $\left(n\right)$ has been completely determined by Ji. In this paper, we show that there exists a pure ${\text{TQS}}_2\left(n\right)$ if and only if $n\equiv 1,2\left(\mathrm{mod}3\right)$ and $n\ge 7$. A corollary is that a simple ${\text{QS}}_4\left(n\right)$ also exists if and only if $n\equiv 1,2\left(\mathrm{mod}3\right)$ and $n\ge 7$.     

An investigation on the influence of the shape of the vortex generator on fluid flow and turbulent heat transfer of hybrid nanofluid in a channel

Journal of Thermal Analysis and Calorimetry - The purpose of this study is to numerically investigate flow field and turbulent heat transfer of hybrid nanofluid, water–DWCNT–TiO2 in a...