最小费用最大流维度拓展及其在反洗钱中的应用研究

本文借助最小费用最大流理论对时间压力下最小风险最大流问题进行了研究,分析了最小风险、最大流路径下的最短时间,构建了基于时间压力条件下的最小风险最大流模型,利用多目标规划方法给出了求解该模型的算法,最后通过实例验证了该方法的有效性.     

两类与等差数列有关的组合恒等式

巧妙地构造出一个多项式,利用著名的Lagrange插值公式和L′Hospital法则,得到了两类与等差数列有关的新颖而深刻的组合恒等式.     

Harrington’s conservation theorem redone

Leo Harrington showed that the second-order theory of arithmetic WKL ₀ is -conservative over the theory RCA ₀. Harrington’s proof is model-theoretic, making use of a forcing argument. A purely proof-theoretic proof, avoiding forcing, has been eluding the efforts of researchers. In this short paper, we present a proof of Harrington’s result using a cut-elimination argument.      

Mean-value theorems and extensions of the Elliott-Daboussi theorem on additive arithmetic semigroups

We present more general forms of the mean-value theorems established before for multiplicative functions on additive arithmetic semigroups and prove, on the basis of these new theorems, extensions of the Elliott-Daboussi theorem. Let be an additive arithmetic semigroup with a generating set ℘ of primes p. Assume that the number G(m) of elements a in with “degree” ∂(a)=m satisfies

基于神经网络的TDOA定位改进算法研究

针对传统的Chan算法在实际的非视距环境中性能将会受到很大影响这一问题,提出了一种基于神经网络的TDOA定位改进算法,这种算法通过对非视距误差进行修正,使其具有更好的定位效果.仿真实验结果表明,与传统的Chan算法相比,这种算法具有更好的定位精度和收敛速度,是一种有效的定位算法.     

关于2个算术函数的一个混合均值

设素数p,ep(n)表示整除n的p最大指数,即ep(n)=max{α∶pα|n}.对任意正整数n,k≥2为给定整数,Smarandache Ceil函数的对偶函数Sk(n)=max{x∶x N,xk|n},利用解析的方法,研究了算术函数ep(n)Sk(n)均值分布性质,并给出一个渐近公式.     

Computation of exact inertia and inclusions of eigenvalues (singular values) of tridiagonal (bidiagonal) matrices

This report may be considered as a non-trivial extension of an unpublished report by William Kahan (Accurate Eigenvalues of a symmetric tri-diagonal matrix, Technical Report CS 41, Computer Science Department, Stanford University, 1966). His interplay between matrix theory and computer arithmetic led to the development of algorithms for computing accurate eigenvalues and singular values. His report is generally considered as the precursor for the development of IEEE standard 754 for binary arithmetic. This standard has been universally adopted by virtually all PC, workstation and midrange hardware manufactures and tens of billions of such machines have been produced. Now we use the features in this standard to improve the original algorithm.In this paper, we describe an algorithm in floating-point arithmetic to compute the exact inertia of a real symmetric (shifted) tridiagonal matrix. The inertia, denoted by the integer triplet (π, ν, ζ), is defined as the number of positive, negative and zero eigenvalues of a real symmetric (or complex Hermitian) matrix and the adjective exact refers to the eigenvalues computed in exact arithmetic. This requires the floating-point computation of the diagonal matrix D of the LDL^t factorization of the shifted tridiagonal matrix T − τI with +∞ and −∞ rounding modes defined in IEEE 754 standard. We are not aware of any other algorithm which gives the exact answer to a numerical problem when implemented in floating-point arithmetic in standard working precisions. The guaranteed intervals for eigenvalues are obtained by bisection or multisection with this exact inertia information. Similarly, using the Golub-Kahan form, guaranteed intervals for singular values of bidiagonal matrices can be computed. The diameter of the eigenvalue (singular value) intervals depends on the number of shifts with inconsistent inertia in two rounding modes. Our algorithm not only guarantees the accuracy of the solutions but is also consistent across different IEEE 754 standard compliant architectures. The unprecedented accuracy provided by our algorithms could be also used to debug and validate standard floating-point algorithms for computation of eigenvalues (singular values). Accurate eigenvalues (singular values) are also required by certain algorithms to compute accurate eigenvectors (singular vectors).We demonstrate the accuracy of our algorithms by using standard matrix examples. For the Wilkinson matrix, the eigenvalues (in IEEE double precision) are very accurate with an (open) interval diameter of 6 ulps (units of the last place held of the mantissa) for one of the eigenvalues and lesser (down to 2 ulps) for others. These results are consistent across many architectures including Intel, AMD, SGI and DEC Alpha. However, by enabling IEEE double extended precision arithmetic in Intel/AMD 32-bit architectures at no extra computational cost, the (open) interval diameters were reduced to one ulp, which is the best possible solution for this problem. We have also computed the eigenvalues of a tridiagonal matrix which manifests in Gauss-Laguerre quadrature and the results are extremely good in double extended precision but less so in double precision. To demonstrate the accuracy of computed singular values, we have also computed the eigenvalues of the Kac₃₀ matrix, which is the Golub-Kahan form of a bidiagonal matrix. The tridiagonal matrix has known integer eigenvalues. The bidiagonal Cholesky factor of the Gauss-Laguerre tridiagonal is also included in the singular value study.     

A verified method for bounding clusters of zeros of analytic functions

In this paper, we propose a verified method for bounding clusters of zeros of analytic functions. Our method gives a disk that contains a cluster of m   zeros of an analytic function f(z)$f(z)$. Complex circular arithmetic is used to perform a validated computation of n  -degree Taylor polynomial p(z)$p(z)$ of f(z)$f(z)$. Some well known formulae for bounding zeros of a polynomial are used to compute a disk containing a cluster of zeros of p(z)$p(z)$. A validated computation of an upper bound for Taylor remainder series of f(z)$f(z)$ and a lower bound of p(z)$p(z)$ on a circle are performed. Based on these results, Rouché's theorem is used to verify that the disk contains the cluster of zeros of f(z)$f(z)$. This method is efficient in computation of the initial disk of a method for finding validated polynomial factor of an analytic function. Numerical examples are presented to illustrate the efficiency of the proposed method.     

油资源运移聚集并行数值模拟和分析

多层油资源运移聚集并行数值模拟,其功能是重建油气盆地的运移聚集演化史,对于油资源的评价,确度油藏位置,估计油藏贮量均具有重要的价值.从生产实际出发,提出数学模型,构造大规模精细并行计算的耦合算子分裂隐式迭代格式,设计了并行计算程序和并行计算的信息传递和交替方向网格剖分方法.并对不同的网格步长进行了并行计算和分析.对滩海地区进行精细数值模拟,计算结果在油田位置等方面和实际情况相吻合.对模型问题(非线型性耦合问题)进行数值分析,得到最佳阶L²误差估计,解决了这一计算渗流力学和石油地质的困难问题.