基于实数编码的免疫遗传算法研究

针对标准遗传算法(SGA)搜索效率低、收敛速度慢等缺陷，在免疫遗传算法的基础上提出了基于实数编码的免疫遗传算法(RIGA)。研究表明，RIGA对SGA的改进是有效可行的，显示出稳健的全局优化、计算量少而解的精度高等特点，具有较高的应用价值。     

免疫算法在车辆调度问题中的应用

免疫算法是模仿生物体高度进化、复杂的免疫系统仿生的一种智能化启发式算法。本文根据车辆调度问题的具体情况，应用免疫算法解决车辆调度中路线安排问题，并提出了一种基于分组匹配的亲和力的计算方法。实验结果表明，免疫算法能有效地应用于车辆调度中路线安排问题。     

Computing Zeta Functions of Kummer Curves via Multiplicative Characters

We present a practical polynomial-time algorithm for computing the zeta function of a Kummer curve over a finite field of small characteristic. Such algorithms have recently been obtained using a method of Kedlaya based upon Monsky–Washnitzer cohomology, and are of interest in cryptography. We take a different approach. The problem is reduced to that of computing the L-function of a multiplicative character sum. This latter task is achieved via a cohomological formula based upon the work of Dwork and Reich. We show, however, that our method and that of Kedlaya are very closely related.Dedicated to the memory of Gian-Carlo Rota     

On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm

In this paper we focus on the problem of identifying the index sets P(x):=i|x_i>0, N(x):={i|F_i(x)>0 and C(x):=i|x_i=F_i(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10     

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].     

Generating cryptographically strong Boolean functions using partial information

Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered...     

匹配问题实例空间和解空间结构

本文通过研究匹配问题的实例空间，匈牙利算法和解空间三者之间的关系，指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的，而如何对问题的解空间进行合理的分解才能是问题的关键。     

全景图像几何畸变校正的算法研究及其软件实现

对于360°视场的全景图像,本文提出了分别对其进行切向和径向畸变校正的处理算法,并用插值处理提高处理精度。达到了将全景图像恢复为常规视场平面像的目的。它是进一步图像分析的前期工作。     

Single-electron charging spectra: from natural to artificial atoms

We present a theoretical study of the charging spectra in natural and artificial atoms. We apply a model electrostatic potential created by a homogenously charged sphere. This model potential allows for a continuous passage from the Coulomb potential of the nucleus to parabolic confinement potential of quantum dots. We consider electron systems with N=1,…,10 electrons with the use of the Hartree–Fock method. We discuss the qualitative similarities and differences between the chemical potential spectrum of electron systems bound to nucleus and confined in quantum dots.     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.