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.     

Boundedness of semilinear Duffing equations at resonance in a critical situation

In this paper, we propose a sufficient and necessary condition for the boundedness of all the solutions for the equation $\ddot{x}+n^{2}x+g(x)=p(t)$ with the critical situation that $|{\int }_0^{2\pi }p(t)e^{?int}dt|=2|g(+\infty )?g(?\infty )|$ on g and p, where $n\in {\mathbb{N}}^{+}$, $p(t)$ is periodic and $g(x)$ is bounded.     

Sobolev Stability of Plane Wave Solutions to the Nonlinear Schrödinger Equation

This article explores the questions of long time orbital stability in high order Sobolev norms of plane wave solutions to the NLSE in the defocusing case.     

基于DIS数字信息化系统对透光物质透光性能的研究

采用DIS数字信息化系统,对不同浓度的蓝墨水溶液在激光光源照射下的透射平均照度及照度分布图像进行实验研究,得到了平均照度值随溶液浓度变化的规律。对不同颜色塑料膜片对白炽灯光源透过照度值及照度分布图像进行实验研究得到及其相关之规律。     

Efficient Collocation Schemes for Singular Boundary Value Problems

We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point.     

Algebra matrix and similarity classification of operators

In this paper, by the Gelfand representation theory and the Silov idempotents theorem, we first obtain a central decomposition theorem related to a unital semi-simple n-homogeneous Banach algebra, and then give a similarity classification of two strongly irreducible Cowen-Douglas operators using this theorem.     

The Chang-Łoś-Suszko theorem in a topological setting

The Chang-Łoś-Suszko theorem of first-order model theory characterizes universal-existential classes of models as just those elementary classes that are closed under unions of chains. This theorem can then be used to equate two model-theoretic closure conditions for elementary classes; namely unions of chains and existential substructures. In the present paper we prove a topological analogue and indicate some applications.     

A rational approximation and its applications to nonlinear partial differential equations on the whole line

An orthogonal system of rational functions is discussed. Some inverse inequalities, imbedding inequalities and approximation results are obtained. Two model problems are considered. The stabilities and convergences of proposed rational spectral schemes and rational pseudospectral schemes are proved. The techniques used in this paper are also applicable to other problems on the whole line. Numerical results show the efficiency of this approach.