Locally Periodic Versus Globally Periodic Infinite Words

We call a one-way infinite word w over a finite alphabet (ρ,l)-repetitive if all long enough prefixes of w contain as a suffix a ρth power (or more generally a repetition of order ρ) of a word of length at most l. We show that each (2,4)-repetitive word is ultimately periodic, as well as that there exist continuum many, and hence also nonultimately periodic, (2,5)-repetitive words. Further, we characterize nonultimately periodic (2,5)-repetitive words both structurally and algebraically.     

用于波分复用系统的多峰干涉滤光片

介绍了用于波分复用系统的多峰干涉滤光片的设计原理,提出了滤光片透射峰位置的确定方法,讨论了影响滤光片半宽度和截止度的因素,给出了滤光片的膜厚容差分析结果,表明透射率监控标准偏差在<0.5%范围内,可以得到波形良好的多峰滤光片,最后给出了实验结果.     

具有开发的非自治单种群生态系统研究

研究了具有开发的单种群非自治周期系统．利用非自治微分方程理论．以及变分法理论和泛函极值的Euler方程方法,得到了该开发系统的持续生存性．周期解存在性，全局渐近稳定性．研究了在开发情况下的最大收获量问题，以及取得最大经济效益下的收获问题等．     

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.     

The structure of invertible substitutions on a three-letter alphabet

We study the structure of invertible substitutions on three-letter alphabet. We show that there exists a finite set of invertible substitutions such that any invertible substitution can be written as I_wσ₁σ₂σ_k, where I_w is the inner automorphism associated with w, and for 1jk. As a consequence, M is the matrix of an invertible substitution if and only if it is a finite product of non-negative elementary matrices.     

Three-Step Predictor-Corrector of Exponential Fitting Method for Nonlinear Schroedinger Equations

We develop the three-step explicit and implicit schemes of exponential fitting methods. We use the three- step explicit exponential fitting scheme to predict an approximation, then use the three-step implicit exponential fitting scheme to correct this prediction. This combination is called the three-step predictor-corrector of exponential fitting method. The three-step predictor-corrector of exponential fitting method is applied to numerically compute the coupled nonlinear Schroedinger equation and the nonlinear Schroedinger equation with varying coefficients. The numerical results show that the scheme is highly accurate.     

ITERATIVE APPROXIMATION OF FIXED POINTS OF NON-LIPSCHITZIAN ASYMPTOTICALLY PSEUDOCONTRACTIVE MAPPINGS

The purpose of this paper is to investigate the problem of approximating fixed points of non-Lipschitizian asymptotically pseudocontractive mappings in an arbitrary real Banach space by the modified Ishikawa iterative sequences with errors.     

大直径长钻孔桩孔底压浆技术的探讨

分析了某工程桩底缺陷形成的原因,介绍了桩底补强过程中的造孔、清淤、压浆及验证的具体做法。     

A test problem for molecular dynamics integrators

We derive a test problem for evaluating the ability of time-steppingmethods to preserve the statistical properties of systems inmolecular dynamics. We consider a family of deterministic systemsconsisting of a finite number of particles interacting on acompact interval. The particles are given random initial conditionsand interact through instantaneous energy- and momentum-conservingcollisions. As the number of particles, the particle density,and the mean particle speed go to infinity, the trajectory ofa tracer particle is shown to converge to a stationary Gaussianstochastic process. We approximate this system by one describedby a system of ordinary differential equations and provide numericalevidence that it converges to the same stochastic process. Wesimulate the latter system with a variety of numerical integrators,including the symplectic Euler method, a fourth-order Runge-Kuttamethod, and an energyconserving step-and-project method. Weassess the methods' ability to recapture the system's limitingstatistics and observe that symplectic Euler performs significantlybetter than the others for comparable computational expense.     

X波段六腔渡越管振荡器的高频特性研究

 从麦克斯韦方程出发，采用时域有限差分法（FDTD）和离散傅里叶变换（DFFT）相结合的方法，通过数值计算得出了六腔开放式谐振腔中前四个谐振频率和场分布，计算出的谐振频率与实验测量结果基本相同。比较了开放腔和封闭腔谐振频率，验证了TEM波吸收边界条件，并在实际编程计算中得以应用。计算结果为六腔渡越管振荡器的机理研究提供了依据。