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

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

New poly(butylene succinate)/layered silicate nanocomposites. II. Effect of organically modified layered silicates on structure,properties, melt rheology,and biodegradability

A series of new poly(butylene succinate) (PBS)/layered silicate nanocomposites were prepared successfully by simple melt extrusion of PBS and organically modified layered silicates (OMLS). Three different types of OMLS were used for the preparation of nanocomposites: two functionalized ammonium salts modified montmorillonite and a phosphonium salt modified saponite. The structure of the nanocomposites in the nanometer scale was characterized with wide-angle X-ray diffraction and transmission electron microscopic observations. With three different types of layered silicates modified with three different types of surfactants, the effect of OMLS in nanocomposites was investigated by focusing on four major aspects: structural analysis, materials properties, melt rheological behavior, and biodegradability. Interestingly, all these nanocomposites exhibited concurrent improvements of material properties when compared with pure PBS. © 2003 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 41: 3160–3172, 2003     

线性均衡约束最优化的一个广义投影强次可行方向法

本文讨论带线性均衡约束最优化问题,首先利用摄动技术和一个互补函数将问题等价转化为一般约束最优化问题,然后结合广义投影技术和强次可行方向法思想,建立了问题的一个新算法.算法在迭代过程中保证搜索方向不为零,从而使得每次迭代只需计算一次广义投影.在适当的条件下,证明了算法的全局收敛性,并对算法进行了初步的数值试验.     

Vanadium(III) chloride catalyzed Biginelli condensation: solution phase library generation of dihydropyrimidin-(2H)-ones

The three component condensation of an aldehyde, a β-keto ester and urea (thiourea) in the presence of a catalytic amount of VCl₃ is disclosed for the solution phase synthesis of dihydropyrimidinones. The ease of synthesis and work-up allowed the parallel synthesis of a 48-membered library of dihydropyrimidinones quickly and efficiently in good yields.     

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     

多壁碳纳米管膜湿敏特性的研究

研究了多壁碳纳米管(MWNTs)薄膜的湿敏特性，实验所用的多壁碳纳米管是用热灯丝化学气相沉积法(CVD)合成的.分别对未修饰和修饰的多壁碳纳米管膜温度和湿度特性进行研究后发现，修饰的多壁碳纳米管对温度和湿度非常敏感，且对湿度的响应时间和恢复时间短，重复性好.而未修饰的多壁碳纳米管对温度和湿度不太敏感.对修饰多壁碳纳米管的湿敏特性进行了理论分析，给出了其理论表示式. 关键词： 多壁碳纳米管 化学修饰 湿敏特性 物理吸附     

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

Boundary position feedback control of Kirchhoff's non‐linear strings

This paper is concerned with global stabilization of an undamped non‐linear string in the case where any velocity feedback is not available. The linearized system has an infinite number of poles and zeros on the imaginary axis. In the case where any velocity feedback is not available, a parallel compensator is effective. The stabilizer is constructed for the augmented system which consists of the controlled system and a parallel compensator. It is proved that the string can be stabilized by linear boundary control. Copyright © 2003 John Wiley & Sons, Ltd.