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.     

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.     

Meshless acoustic analysis using a weakly singular Burton-Miller boundary integral formulation

The Burton-Miller boundary integral formulation is solved by a complex variable boundary element-free method (CVBEFM) for the boundary-only meshless analysis of acoustic problems with arbitrary wavenumbers. To regularize both strongly singular and hypersingular integrals and to avoid the computation of the solid angle and its normal derivative, a weakly singular Burton-Miller formulation is derived by considering the normal derivative of the solid angle and adopting the singularity subtraction procedures. To facilitate the implementation of the CVBEFM and the approximation of gradients of the boundary variables, a stabilized complex variable moving least-square approximation is selected in the meshless discretization procedure. The results show the accuracy and efficiency of the present CVBEFM and reveal that the method can produce satisfactory results for all wavenumbers, even for extremely large wavenumbers such as k = 10 000.     

一种新的岩石非线性黏弹塑性蠕变模型研究

为了克服传统元件组合模型不能描述岩石蠕变过程中非线性特征的缺陷，首先根据加速蠕变阶段的应变和应变率随蠕变时间急剧增大的特点，建立黏塑性应变与蠕变时间的指数函数关系并提出非线性黏塑性体．将该非线性黏塑性体与广义Burgers蠕变模型串联，建立可以描述岩石全蠕变过程的非线性黏弹塑性蠕变模型，根据叠加原理得到一维应力状态下的轴向蠕变方程．然后基于塑性力学理论指出岩石三维蠕变本构方程建立过程中的不足之处，并给出非线性黏弹塑性蠕变模型合理的三维蠕变方程．最后采用不同应力水平下砂岩轴向蠕变试验对模型合理性进行验证，结果表明：拟合曲线与试验曲线吻合度较高，所建蠕变模型能够很好地描述砂岩在不同应力水平下的蠕变变形规律，尤其对加速蠕变阶段的非线性特征描述效果很好，验证了模型的合理性．     

Spectral estimates for saddle point matrices arising in weak constraint four‐dimensional variational data assimilation

We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds.     

CoFeSiB非晶丝弱磁场测量仪的研制

设计了以Co基非晶丝为敏感元件的传感器探头,多谐振荡励磁电路,信号处理电路,单片机显示电路,且对该磁场测量仪进行了标定。     

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

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