资源有限的加权总完工时间单机排序问题

本讨论资源有限的加权总工时间单机排序问题，对现在仍为OPEN问题1｜pj=bj-ajuj，∑uj≤U｜∑wjCj给出了一个有关最优解中最优资源分配的重要性质，并利用该性质分别给出了三种情况bj=b,wj=w,aj=a；bj=b,wj=w,uj=u；aj=a,wj=w,uj=u的最优算法。     

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

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

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

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

达草灭对莱茵衣藻(Chlamydomonas reinhardtii) 品系遗传后效应的研究

通过将莱菌衣藻（Chlamydomonas reinhardtii）6种达草灭抗性突变株分别与野生型株、丧失合成叶绿素b能力的cbnI-43等基因突变株和精氨酸依赖型突变株杂交对其后代进行四分析与随机分析，发现在Nfr-4-Nfr-7突变株中达草灭抗性状只有单一核基因遗传的性质，而在Nfr-1、Nfr-3～Nfr-7抗性株的抗性性状都是由同一个nfr-1基因（norflurazon resisanse）的突变所决定的，而Nfr-4抗性株的抗性性状是由另一滚突变等位基因nfr-2所决定的。在Nfr-1和Nfr-3抗性株中除了nfr-1基因的突变还有nfr-3基因突变的参与。     

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     

Robust handling of non‐linear constraints for GA optimization of aerodynamic shapes

A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd.     

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实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的，而如何对问题的解空间进行合理的分解才能是问题的关键。