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.     

Assembling hydrodynamic cloaks to conceal complex objects from drag

Transformation hydrodynamics and the corresponding metamaterials have been proposed as a means to exclude the drag force acting on an object. Here, we report a strategy to deploy the hydrodynamic cloaks in a more practical manner by assembling different-shaped cloaking parts. Our strategy is to first model a square-shaped cloak and a carpet cloak and then combine them to conceal a more complex-shaped space in the three-dimensional hydrodynamic flow. With the derivation of transformation hydrodynamics, the coordinate transformations for each hydrodynamic cloaking are demonstrated with the calculated viscosity tensors. The pressure and velocity fields of the square, triangular (carpet), and exemplary three-dimensional house-shaped cloaks are numerically simulated, thus showing a cloaking effect and reduced drag. This study suggests an efficient way of cloaking complex architectures from fluid-dynamic forces.     

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

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

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.     

应力对M-Z型InP/InGaAsP-EAM偏振

采用Agilent 81910A光子全参量测试仪,首次实验研究了InP/In1－xGaxAs1－yPy-MQW（Multiple-Quantum-Well,MQW）材料与衬底间因应力而产生的M-Z型光调制器的PDL影响以及由此引起的由差分群时延(Differential Group Delay,DGD)表征的偏振模色散(Polarization Mode Dispersion,PMD).研究结果表明,半导体MQW光调制器的PDL与DGD是一致的.因此在半导体光器件的制作过程中,应尽可能地减小衬底与波导芯层之间的因残存应力的存在造成对光器件的高速性能的不利影响.