A condition-based algorithm for solving polyhedral feasibility problems

It is known that Polyhedral Feasibility Problems can be solved via interior-point methods whose real number complexity is polynomial in the dimension of the problem and the logarithm of a condition number of the problem instance. A limitation of these results is that they do not apply to ill-posed instances, for which the condition number is infinite. We propose an algorithm for solving polyhedral feasibility problems in homogeneous form that is applicable to all problem instances, and whose real number complexity is polynomial in the dimension of the problem instance and in the logarithm of an “extended condition number” that is always finite.     

Characterizations of competition multigraphs

The notion of a competition multigraph was introduced by C. A. Anderson, K. F. Jones, J. R. Lundgren, and T. A. McKee [C. A. Anderson, K. F. Jones, J. R. Lundgren, and T. A. McKee: Competition multigraphs and the multicompetition number, Ars Combinatoria 29B (1990) 185-192] as a generalization of the competition graphs of digraphs.In this note, we give a characterization of competition multigraphs of arbitrary digraphs and a characterization of competition multigraphs of loopless digraphs. Moreover, we characterize multigraphs whose multicompetition numbers are at most m, where m is a given nonnegative integer and give characterizations of competition multihypergraphs.     

A stabilized formulation for the advection–diffusion equation using the Generalized Finite Element Method

This paper presents a stable formulation for the advection–diffusion equation based on the Generalized (or eXtended) Finite Element Method, GFEM (or X‐FEM). Using enrichment functions that represent the exponential character of the exact solution, smooth numerical solutions are obtained for problems with steep gradients and high Péclet numbers in one‐ and two‐dimensions. In contrast with traditional stabilized methods that require the construction of stability parameters and stabilization terms, the present work avoids numerical instabilities by improving the classical Galerkin solution with enrichment functions (that need not be polynomials) using GFEM, which is an instance of the partition of unity framework. This work also presents a strategy for constructing enrichment functions for problems involving complex geometries by employing a global–local‐type approach. Representative numerical results are presented to illustrate the performance of the proposed method. Copyright © 2010 John Wiley & Sons, Ltd.     

受驱动的关联发射激光:双模亚泊松光

如果在关联发射的基础之上再引入原子相干，这样的系统可产生明亮的双模亚泊松光。运用Ｓｃｕｌｙ－Ｌａｍｂ理论计算ＭａｎｄｅｌＱ因子，一方面，当相对相位和相对振幅的量子噪声被抑制到真空噪声水平时，平均模呈现亚泊松光子分布；或者当平均相位和平均振幅的量子噪声被抑制到真空噪声水平时，相对模呈现亚泊松光子分布，ＭａｎｄｅｌＱ因子的最佳值均可达到－０．５。在上述两种情况下，每个关联发射激光（ＣＥＬ）模呈现亚泊松光子分布，ＭａｎｄｅｌＱ因子的最佳值均可达到－０．２５。     

On Small Contractible Subgraphs in 3-connected Graphs of Small Average Degree

We study the distribution of small contractible subgraphs in 3-connected graphs under local regularity conditions.     

Two Typical Examples of Scaling Ionic Partition Scheme for Estimating Correlation Energy of A2 Type Molecules

Based on the calculation results of pair correlation energy contributions of the various electron pairs in Na2 and H2NNH2 systems and the application of the scaling ionic partition scheme for symmetrical A2 type systems, the total correlation energies of Na2 and H2NNH2 have been reproduced by using this simple scheme. The two results show that the absolute deviations are within an acceptable range of error, however, in this way, more than 90% of computational work can be saved. The most attractive result in present paper is that, in these two molecules the coefficients c1 and c2 in the estimation equation can be obtained by the proportion of correlation energy of A^- to that of A^ singlet system. Therefore, it is believed that the proposed ionic partition scheme for symmetrical A2 molecules would be very useful to estimate the correlation energies of large symmetrical molecules.     

命题公式集F(S)的基于R0-算子的16类分划

利用R₀-蕴涵算子对命题公式集F(S)进行分类,得出了F(S)的一个16类分划,并证明了这种分类关于非运算是同余分类.最后讨论了各类关于MP运算与HS运算的封闭性.     

与k1∪Pm0的补图有相同色划分的图

本应用色项式的性质讨论了K1∪Pm0的补图的色划分，并完全刻画了与此类图有相同色划分的图。     

ON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE

The authors discuss the partition of a finite set of points in the plane into empty convex polygons, and improve some upper bound and lower bound in the related enumeration problems.