Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems

This paper examines the complexity of global verification for MAX-SAT, MAX-k-SAT (for k3), Vertex Cover, and Traveling Salesman Problem. These results are obtained by adaptations of the transformations that prove such problems to be NP-complete. The class of problems PGS is defined to be those discrete optimization problems for which there exists a polynomial time algorithm such that given any solution , either a solution can be found with a better objective function value or it can be concluded that no such solution exists and is a global optimum. This paper demonstrates that if any one of MAX-SAT, MAX-k-SAT (for k3), Vertex Cover, or Traveling Salesman Problem are in PGS, then P=NP.     

Structure of Degenerate Block Algebras

Given a non-trivial torsion-free abelian group (A,+,Q), a field F of characteristic 0, and a non-degenerate bi-additive skew-symmetric map : A A F, we define a Lie algebra = (A, ) over F with basis {e_x | x A/{0}} and Lie product [e_x,e_y] = (x,y)e_x+y. We show that is endowed uniquely with a non-degenerate symmetric invariant bilinear form and the derivation algebra Der of is a complete Lie algebra. We describe the double extension D( , T) of by T, where T is spanned by the locally finite derivations of , and determine the second cohomology group H²(D( , T),F) using anti-derivations related to the form on D( , T). Finally, we compute the second Leibniz cohomology groups HL²( , F) and HL²(D( , T), F).2000 Mathematics Subject Classification: 17B05, 17B30This work was supported by the NNSF of China (19971044), the Doctoral Programme Foundation of Institution of Higher Education (97005511), and the Foundation of Jiangsu Educational Committee.     

Waiting time problems for a sequence of discrete random variables

Let X ₁, X ₂,... be a sequence of nonnegative integer valued random variables.For each nonnegative integer i, we are given a positive integer k _i . For every i = 0, 1, 2,..., E _i denotes the event that a run of i of length k _i occurs in the sequence X ₁, X ₂,.... For the sequence X ₁, X ₂,..., the generalized pgf's of the distributions of the waiting times until the r-th occurrence among the events % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiiYdd9qrFfea0dXdf9vqai-hEir8Ve% ea0de9qq-hbrpepeea0db9q8as0-LqLs-Jirpepeea0-as0Fb9pgea% 0lrP0xe9Fve9Fve9qapdbaqaaeGacaGaaiaabeqaamaabaabcaGcba% WaaiWabeaacaWGfbWaaSbaaSqaaiaadMgaaeqaaaGccaGL7bGaayzF% aaWaa0baaSqaaiaadMgacqGH9aqpcaaIWaaabaGaeyOhIukaaaaa!43D8!\[\left\{ {E_i } \right\}_{i = 0}^\infty\]are obtained. Though our situations are general, the results are very simple. For the special cases that X's are i.i.d. and {0, 1}-valued, the corresponding results are consistent with previously published results.This research was partially supported by the ISM Cooperative Research Program (90-ISM-CRP-11) of the Institute of Statistical Mathematics.     

二次波面干涉的剪切散斑干涉计量术

提出了一种新的剪切散斑干涉方法─—二次波面干涉的剪切散斑干涉计量术．这一方法将被测物体变形前后波面的第一次干涉信息分别储存在两张全息干板上，通过光学信息处理实现波面的第二次干涉．两次波面干涉分别消除了位移和位移的一阶导数场对波面位相的影响，得到仅反映位移二阶导数场的条纹图．     

厚翅片管内流体流动和传热的数值分析

本文应用Ｐａｔａｎｋａｒ等人［１］研究薄翅片管的湍流模型，对一种工业化的厚翅片管内的流体流动和传热进行了数值分析。计算范围包括了层流和湍流（Ｒｅ＝１０１～１０６），所得计算结果与较窄范围内实验所测的传热与阻力数据相当符合，本计算结果具有较大的推广价值。     

森林发展系统的一个非线性半离散模型

本文建立了森林发展系统的一类非线性林龄面积结构的半离散模型 ,并讨论了半离散系统解的存在唯一性 ,给出了线性半离散系统稳定的一些充分条件     

正交变换在重积分中某些应用

正交变换是代数学的基本内容 ,其用途十分广泛 .重积分的计算往往存在技术性的困难 ,若利用“正交变换”的有关理论去解决某些重积分的计算问题是颇有功效的 .本文将以“正交变换”为工具 ,简洁的处理重积分的某些问题     

拓扑遍历与拓扑双重遍历

令X为紧致度量空间,f:X→X为连续映射,U,V为X的任意非空开集,若{n>0|fn(U)∩V≠ )为正上密度集,则称f拓扑遍历.f拓扑双重遍历意味着f×f拓扑遍历.本文在[2]的基础上进一步讨论拓扑遍历与拓扑双重遍历映射的性质.     

Maximum norm stability of difference schemes for parabolic equations on overset nonmatching space-time grids

In this paper, theoretical results are described on the maximum norm stability and accuracy of finite difference discretizations of parabolic equations on overset nonmatching space-time grids. We consider parabolic equations containing a linear reaction term on a space-time domain which is decomposed into an overlapping collection of cylindrical subregions of the form , for . Each of the space-time domains are assumed to be independently grided (in parallel) according to the local geometry and space-time regularity of the solution, yielding space-time grids with mesh parameters and . In particular, the different space-time grids need not match on the regions of overlap, and the time steps can differ from one grid to the next. We discretize the parabolic equation on each local grid by employing an explicit or implicit -scheme in time and a finite difference scheme in space satisfying a discrete maximum principle. The local discretizations are coupled together, without the use of Lagrange multipliers, by requiring the boundary values on each space-time grid to match a suitable interpolation of the solution on adjacent grids. The resulting global discretization yields a large system of coupled equations which can be solved by a parallel Schwarz iterative procedure requiring some communication between adjacent subregions. Our analysis employs a contraction mapping argument.

Applications of the results are briefly indicated for reaction-diffusion equations with contractive terms and heterogeneous hyperbolic-parabolic approximations of parabolic equations.

     

既不离散也不连续的随机变量

讨论了既不离散也不连续的随机变量 ,并纠正了有关文献中关于连续型随机变量定义中的错误 .