低汉明重量序列的分布

数n的汉明重量是指n的二进制字符串表达式中数字1的个数,用Ham(n)来表示.低汉明重量序列在密码系统和编码理论中有非常广泛的应用.本文建立了低汉明重量数的序列表达式,并且利用指数和的上界以及Erdos-Turan不等式证明低汉明重量序列的均匀分布性质,从而确保密码算法的随机性和运算效率.     

Yukawa potentials in systems with partial periodic boundary conditions. II. Lekner sums for quasi-two-dimensional systems

Yukawa potentials may be long-ranged when the Debye screening length is large. In computer simulations, such long-ranged potentials have to be taken into account with convenient algorithms to avoid systematic bias in the sampling of the phase space. Recently, we provided Ewald sums for quasi-two-dimensional systems with Yukawa interaction potentials [J. Chem. Phys. 126, 056101 (2007); Molec. Phys. paper I of this series]. Sometimes, Lekner sums are used as an alternative to Ewald sums for Coulomb systems. In the present work, we derive the Lekner sums for quasi-two-dimensional systems with Yukawa interaction potentials and we give numerical tests for practical implementations. The main result of this paper is to emphasize that Lekner sums cannot be considered as an alternative to Ewald sums for Yukawa potentials. As a conclusion to this work: Lekner sums should not be used for quasi-two-dimensional systems with Yukawa interaction potentials.     

Character sums and nonlinear recurrence sequences

We obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequences over arbitrary finite rings.     

Divisibility properties of a class of binomial sums

We study congruence and divisibility properties of a class of combinatorial sums that involve products of powers of two binomial coefficients, and show that there is a close relationship between these sums and the theorem of Wolstenholme. We also establish congruences involving Bernoulli numbers, and finally we prove that under certain conditions the sums are divisible by all primes in specific intervals.     

Tail behavior of conditional sojourn times in Processor-Sharing queues

We investigate the tail behavior of the sojourn-time distribution for a request of a given length in an M/G/1 Processor-Sharing (PS) queue. An exponential asymptote is proven for general service times in two special cases: when the traffic load is sufficiently high and when the request length is sufficiently small. Furthermore, using the branching process technique we derive exact asymptotics of exponential type for the sojourn time in the M/M/1 queue. We obtain an equation for the asymptotic decay rate and an exact expression for the asymptotic constant. The decay rate is studied in detail and is compared to other service disciplines. Finally, using numerical methods, we investigate the accuracy of the exponential asymptote. AMS 2000 Subject Classifications Primary:60K25,Secondary: 60F10,68M20,90B22     

关于素变数丢番图方程组与不等式组（英文）

本文研究了和素数有关的方程组和不等式组，通过更细致的指数和估计，我们改进了以前的结果。     

NA序列广义Jamison型加权和的几乎处处收敛性

本文从随机变量序列广义Ｊａｍｉｓｏｎ型加权和的一个系数指标函数自身性质出发，讨论了广义Ｊａｍｉｓｏｎ型加权和的强稳定性，避免了控制函数的引入， 进一步还得到了更一般的ＮＡ序列广义Ｊａｍｉｓｏｎ型加权和的几乎处处收敛的条件，并将前人的若干结论包含为特例．     

不同分布NA序列加权和的完全收敛性

本文讨论了不同分布NA随机变量序列加权和的完全收敛性，获得了较[7]中的定理1及定理A更为一般的安全收敛性，并得到了完全收敛速度与矩条件之间的等价关系。     

Periodic interpolation and wavelets on sparse grids

Nested spaces of multivariate periodic functions forming a non-stationary multiresolution analysis are investigated. The scaling functions of these spaces are fundamental polynomials of Lagrange interpolation on a sparse grid. The approach based on Boolean sums leads to sample and wavelet spaces of significantly lower dimension and good approximation order. The algorithms for complete decomposition and reconstruction are of simple structure and low complexity. This revised version was published online in June 2006 with corrections to the Cover Date.     

具有非负Fourier系数的Fourier和逼近的一个注记

给出了具有非负Fourier系数的连续周期偶函数的Fourier和的逼近达到其最佳逼近阶的一个充分条件。