平面Laplace问题的等价间接变量边界积分方程

利用变分法证明平面调和函数的外问题的确切形式；在此基础上，建立外问题的具有间接变量的等价边界积分方程；传统的外问题及边界积分方程不具有普遍适用性，本文对此进行了详细的讨论．     

差分吸收光谱法测量大气痕量气体浓度误差分析及改善方法

差分吸收光谱技术(DOAS)中采用线性最小二乘拟合方法,用痕量气体标准差分吸收截面对测量得到的差分吸收光谱进行拟合,得出大气中痕量气体的浓度.计算结果的准确性不仅取决于光谱的测量精度,而且受标准差分吸收截面以及仪器函数和温度等诸多因素的影响.详细地分析了计算误差的产生原因,提出了用高浓度样品池得到标准吸收截面的方法,针对光谱固有结构,以及温度对标准吸收截面的影响,改进了浓度反演算法.大量的实验表明,综合运用上述方法,即便对低浓度的样气,相对测量误差也能降低到10%以下.     

The auction algorithm for the transportation problem

The auction algorithm is a parallel relaxation method for solving the classical assignment problem. It resembles a competitive bidding process whereby unassigned persons bid simultaneously for objects, thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. This paper generalizes the auction algorithm to solve linear transportation problems. The idea is to convert the transportation problem into an assignment problem, and then to modify the auction algorithm to exploit the special structure of this problem. Computational results show that this modified version of the auction algorithm is very efficient for certain types of transportation problems.     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.     

On the stability of Riemannian manifold with parallel spinors

Inspired by the recent work [HHM03], we prove two stability results for compact Riemannian manifolds with nonzero parallel spinors. Our first result says that Ricci flat metrics which also admit nonzero parallel spinors are stable (in the direction of changes in conformal structures) as the critical points of the total scalar curvature functional. Our second result, which is a local version of the first one, shows that any metric of positive scalar curvature cannot lie too close to a metric with nonzero parallel spinor. We also prove a rigidity result for special holonomy metrics. In the case of SU(m) holonomy, the rigidity result implies that scalar flat deformations of Calabi-Yau metric must be Calabi-Yau. Finally we explore the connection with a positive mass theorem of [D03], which presents another approach to proving these stability and rigidity results. Dedicated to Jeff Cheeger for his sixtieth birthday     

Partially isometric dilations of noncommuting -tuples of operators

Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.