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.     

The energy-critical nonlinear wave equation with an inverse-square potential

We study the energy-critical nonlinear wave equation in the presence of an inverse-square potential in dimensions three and four. In the defocussing case, we prove that arbitrary initial data in the energy space lead to global solutions that scatter. In the focusing case, we prove scattering below the ground state threshold.     

两个DEA的逆问题的解法的探讨

文[1]提出了两个DEA的逆问题，并用搜索法来解．而本文根据所证的定理，对每个问题一般只要解二、三个线性规划问题就能得到答案．     

双掺(Tm3+,Tb3+)LiYF4激光器1.5 μm波长激光阈值分析

由速率方程推出了双掺（Tm^3 ,Tb^3 ）离子准四能级系统的激光阈值解析式，讨论了Tm^3 和Tb^3 离子之间的相互作用。分析了1.5μm波长附近的激光阈值和Tm^3 、Tb^3 离子的掺杂原子数分数及晶体长度的关系。结果表明，对于对应Tm^3 离子^3H4→^3F4跃迁的约1.5μm波长的激光，激活离子Tm^3 的掺杂原子数分数过大时，交叉弛豫作用将使系统阈值迅速增加。Tb^3 离子的加入，一方面能抽空激光下能级，起到降低阈值的作用；另一方面亦减少了激光上能级的寿命，使阈值升高。故Tb^3 离子有最佳掺杂原子数分数。对于Tm原子数分数为y=0.01的Tm:LiYF4晶体，Tb^3 离子的最佳掺杂原子数分数为0.002左右，同时表明，激光阈值与晶体长度有关。最佳晶体长度与Tm^3 、Tb^3 离子的掺杂原子数分数以及晶体的衍射损耗和吸收损耗有关。     

The number of powers of 2 in a representation of large even integers II

It is proved that for any integerk≥ 54 000, there isN _k >0 depending onk only such that every even integer ≥N _k is a sum of two odd prime numbers andk powers of 2. Project partially supported by RGC Research Grant (No.HKU 7122/97P) and Post-Doctoral Fellowship of the University of Hong Kong.     

Equivalence of variational inequality problems to unconstrained minimization

In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions, the variational inequality problem is cast as unconstrained minimization problem. We estimate the growth rate of these merit functions and give conditions under which the stationary points of these functions are the solutions of VI. This work was supported by the state key project “Scientific and Engineering Computing”.     

关于混合型多项式Hammerstein积分方程正解迭代求法

本文给出了混合型多项式Ｈａｍｍｅｒｓｔｅｉｎ积分方程正解的迭代求法，并将所得结果应用到二阶非线性常微分方程的边值问题     

A semi-analytical numerical method for time-dependent radiative transfer problems in slab geometry with coherent isotropic scattering

We describe a semi-analytical numerical method for coherent isotropic scattering time-dependent radiative transfer problems in slab geometry. This numerical method is based on a combination of two classes of numerical methods: the spectral methods and the Laplace transform (LTS_N) methods applied to the radiative transfer equation in the discrete ordinates (S_N) formulation. The basic idea is to use the essence of the spectral methods and expand the intensity of radiation in a truncated series of Laguerre polynomials in the time variable and then solve recursively the resulting set of “time-independent” S_N problems by using the LTS_N method. We show some numerical experiments for a typical model problem.