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

本讨论资源有限的加权总工时间单机排序问题，对现在仍为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的改进是有效可行的，显示出稳健的全局优化、计算量少而解的精度高等特点，具有较高的应用价值。     

Palladium-catalyzed pseudo-domino cyclizations: An easy entry toward polycondensed pyrrolidone derivatives

A new type I palladium-catalyzed pseudo-domino process is developed, in which a single Pd-based catalytic system promotes two mechanistically unrelated, sequential catalytic cycles in chronologically distinct order. Suitable precursors undergo an allylic alkylation and a Heck coupling in sequence, affording polycondensed pyrrolidone derivatives. Depending on the starting precursors, intra/inter or doubly intramolecular processes can be obtained. The allylic alkylation process takes place always very smoothly. On the other hand, the Heck coupling turns out to be rather difficult either when the process is intermolecular, or when an intramolecular process generates polycondensed structures featuring three fused bonds connected to a common carbon atom. In such difficult cases, use of the Herrmann-Beller phosphapalladacycle allowed to catalyze the coupling. This study demonstrates also that allylic alkylations can be catalyzed by the Herrmann-Beller phosphapalladacycle.     

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

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

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     

Phase modulation in dipolar-coupled A2 spin systems: effect of maximum state mixing in H NMR in vivo

Coupling constants of nuclear spin systems can be determined from phase modulation of multiplet resonances. Strongly coupled systems such as citrate in prostatic tissue exhibit a more complex modulation than AX connectivities, because of substantial mixing of quantum states. An extreme limit is the coupling of n isochronous spins (A_n system). It is observable only for directly connected spins like the methylene protons of creatine and phosphocreatine which experience residual dipolar coupling in intact muscle tissue in vivo. We will demonstrate that phase modulation of this “pseudo-strong” system is quite simple compared to those of AB systems. Theory predicts that the spin-echo experiment yields conditions as in the case of weak interactions, in particular, the phase modulation depends linearly on the line splitting and the echo time.     

Nickel Chloride Promoted Glaser Coupling Reaction in Hot Water

A Glaser coupling reaction of terminal alkynes in the presence of nickel chloride withoutany organics and bases in hot water has been developed, which produces the correspondinghomo-coupling products in good yields.     

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