基于区域分解的CRS算法

本文针对带有盒子约束的非线性规划问题提出一种算法，该算法把解空间分成几个区域，根据每个区域上解的信息定义其选择概率，再根据轮盘赌选择法选择某个区域，在选择的区域上进行CRS（Control Random Search）算法操作。该方法能够缩小搜索空间，从而提高算法的搜索能力及算法的收敛速度，特别是在算法的后期效果更加明显。最后把提出的算法应用到两个典型的函数优化问题中，数值结果表明，算法是可行的、有效的。     

线性约束下的共轭投影梯度法及其超线性收敛性

本文考虑线性约束非线性规划问题，提出了一类共轭投影梯度法，证明了算法的全局收敛性，并对算法的二次终止性，超线性收敛特征进行了分析，算法的优点是（１）采用计算机上实现的Ａｒｍｉｊｏ线性搜索规则，（２）初始点不要求一定是可行点，可以不满足线性等式约束，（３）具有较快的收敛速度。     

大规模多设施Weber问题的改进Cooper算法

 多设施Weber问题（multi-source Weber problem,MWP）是设施选址中的重要模型之一,而Cooper算法是求解MWP最为常用的数值方法.Cooper算法包含选址步和分配步,两步交替进行直至达到局部最优解.本文对Cooper算法的选址步和分配步分别引入改进策略,提出改进Cooper算法：选址步中将Weiszfeld算法和adaptive Barzilai-Borwein （ABB）算法结合,提出收敛速度更快的ABB-Weiszfeld算法求解选址子问题;分配步中提出贪婪簇分割策略来处理退化设施,由此进一步提出具有更好性质的贪婪混合策略.数值实验表明本文提出的改进策略有效地提高了Cooper算法的计算效率,改进算法有着更好的数值表现.     

一般罚分(或得分)矩阵下的SPA算法

本文在一般罚分（或得分）矩阵条件下推广SPA（Super Pairwise Alignment）算法，该算法是一种次优算法，与Smith-Waterman算法比较，计算速度有明显改进（计算复杂度随序列长度线性增长）．     

求最短路问题的改进算法

本对图论中含有负权的最短路问题的算法进行了讨论，给出了一个具有“可节省存储空间、提高运算速度、易编程实现”等优点的改进算法（算法三），并通过例题进一步验证了该改进算法的优越性，具有一定的现实意义。     

求解线性方程组和一种迭代解法

本文对任意线性方程组ＡＸ＝Ｂ（Ａ∈Ｒ（ｎ×ｍ），Ｂ∈Ｒｎ），在文［１］基础上给出了一种迭代算法。其收敛速度比文［１］方法快，并证明了该算法的收敛性。最后，通过几个算例说明了本文算法的有效性。     

模拟时滞化学反应系统的自适应τ-Leap算法

本文发展了一种模拟时滞化学反应系统的自适应τ-Leap算法（DAr—Leap）．该算法将后验τ-Leap算法应用到时滞化学反应系统，能够自动调节τ使得在时间区间[t，t＋τ）内发生多次反应事件并且精确地满足Leap条件，从而避免了负分子数目的产生，较大地提高了模拟速度．     

鞍点问题的修正对称超松弛迭代算法

为了提高求解鞍点问题的迭代算法的速度,通过设置合适的加速变量,对修正超松弛迭代算法（简记作MSOR-like算法）和广义对称超松弛迭代算法（简记作GSSOR-like算法）进行了修正,给出了修正对称超松弛迭代算法,即MSSOR-like （modified symmetric successiveover-relaxation）算法,并研究了该算法收敛的充分必要条件.最后,通过数值例子表明,选择合适的参数后,新算法的迭代速度和迭代次数均优于MSOR-like （modified successive overrelaxation）和GSSOR-like （generalized symmetric successive over-relaxation）算法,因此,它是一种较好的解决鞍点问题的算法.     

基于BP神经网络的手写体数字的识别方法研究

对手写体数字的识别问题进行了讨论,提出一种基于BP神经网络的识别方法.从而提高了识别效率.主要就在识别时,数字在图片上的位置和数字本身大小方面做了改进,发现数字在图片上的大小和其在图片上的位置直接影响识别效果.具体做的是,首先提取了图片的轮廓,然后归一化成28×28的图像.这样做,不仅使得图像数字区域大小相同,而且都在图像中心上,使得识别结果变的更加理想化,达到了高识别的目的.另外,选择了容错性较好的BP网络,以200组手写体数字图像作为输入向量,以其他的110组进行识别,效率达到了90%.     

广义块Toeplitz特征值问题的基于sine变换的预处理子

在求块Toeplitz矩阵束（Amn，Bmn）特征值的Lanczos过程中，通过对移位块Toepltz矩阵Amn-ρBmn进行基于sine变换的块预处理，从而改进了位移块Toeplitz矩阵的谱分布，加速了Lanczos过程的收敛速度．该块预处理方法能通过快速算法有效快速执行．本文证明了预处理后Lanczos过程收敛迅速，并通过实验证明该算法求解大规模矩阵问题尤其有效．     

Friedman numbers have density 1

A Friedman number is a positive integer which is the result of an expression combining all of its own digits by use of the four basic operations, exponentiation and digit concatenation. One of the fundamental questions regarding Friedman numbers, first raised by Erich Friedman in August 2000, is how common they are among the integers. In this paper, we prove that Friedman numbers have density 1. We further prove that the density of Friedman numbers remains 1 regardless of the base of representation.     

Prime numbers and the first digit phenomenon

The set of primes which have lead digit 1 does not have relative natural density in the prime numbers. However, Bombieri has shown that this set does have relative Zeta density equal to log₁₀ 2. This means that a prime chosen at random (w.r.t. the Zeta distribution) will have lead digit 1 with the determined probability. Here the question, Is this a special property of Zeta density or a more universal property of primes? is answered. It is shown that for any generalization of relative natural density (obeying a few basic assumptions) if a value is assigned to the relative density of primes of lead digit 1 then this value is always log₁₀ 2. Another density which does converge on this set is also exhibited. Additionally the relative densities of primes beginning with any specified string of digits are found.     

Asymptotic properties of digit sequences of random numbers

We consider several aspects of the relationship between a [0, 1]‐valued random variable X and the random sequence of digits given by its m‐ary expansion. We present results for three cases: (a) independent and identically distributed digit sequences; (b) random variables X with smooth densities; (c) stationary digit sequences. In the case of i.i.d. an integral limit thorem is proved which applies for example to relative frequencies, yielding asymptotic moment identities. We deal with occurrence probabilities of digit groups in the case that X has an analytic Lebesgue density. In the case of stationary digits we determine the distribution of X in terms of their transition functions. We study an associated [0, 1]‐valued Markov chain, in particular its ergodicity, and give conditions for the existence of stationary digit sequences with prespecified transition functions. It is shown that all probability measures induced on [0, 1] by such sequences are purely singular except for the uniform distribution. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

基于模糊集值映射的粗糙近似算子

给出基于模糊集值映射F的模糊集的下(上)近似等概念,研究F-下(上)近似算子aprF(aprF)的性质,探讨求它们的方法,得到若干结果.     

Numbers with fixed sum of digits in linear recurrent number systems

We study the set of integers with a given sum of digits with respect to a linear recurrent digit system. An asymptotic formula for the number of integers ≤N with given sum of digits is determined, and the distribution in residue classes is investigated, thus generalizing results due to Mauduit and Sárközy. It turns out that numbers with fixed sum of digits are uniformly distributed in residue classes under some very general conditions. Namely, the underlying linear recurring sequence must have the property that there is no prime factor P of the modulus such that all but finitely many members of the sequence leave the same residue modulo P. The key step in the proof is an estimate for exponential sums using known theorems from Diophantine approximation.     

基于非平稳性度量的彩票数据实证分析

非平稳性度量是衡量时间序列平稳程度的方法.利用非平稳度量,给出了C检验,并结合非平稳性度量值,对我国体彩"排列五"、"七星彩"及美国亚利桑那州的博彩"Pick3"的历史数据进行分析,发现博彩各数位上整数"0~9"出现都拥有稳定的概率,但并不是以等概率1/10出现,其分布与i.i.d均匀分布稍有差异,其中"七星彩"均匀性最好,"Pick3"的均匀性次之,"排列五"均匀性稍差.     

Positional number systems with digits forming an arithmetic progression

A novel digit system that arises in a natural way in a graph-theoretical problem is studied. It is defined by a set of positive digits forming an arithmetic progression and, necessarily, a complete residue system modulo the base b. Since this is not enough to guarantee existence of a digital representation, the most significant digit is allowed to come from an extended set. We provide explicit formul? for the j th digit in such a representation as well as for the length. Furthermore, we study digit frequencies and average lengths, thus generalising classical results for the base-b representation. For this purpose, an appropriately adapted form of the Mellin-Perron approach is employed.     

A distributional limit law for the continued fraction digit sum

We consider the continued fraction digits as random variables measured with respect to Lebesgue measure. The logarithmically scaled and normalised fluctuation process of the digit sums converges strongly distributional to a random variable uniformly distributed on the unit interval. For this process normalised linearly we determine a large deviation asymptotic. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Minimal expansions in redundant number systems: Fibonacci bases and Greedy algorithms

We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6].     

Singular approximation in polydiscs by summability process

In this paper, we approximate a continuous function in a polydisc by means of multivariate complex singular operators which preserve the analytic functions. In this singular approximation, we mainly use a regular summability method (process) from the summability theory. We show that our results are non-trivial generalizations of the classical approximations. At the end, we display an application verifying the singular approximation via summation process, but not the usual sense.