利用双种群遗传算法进行数值试井自动拟合

遗传算法以随机化技术为指导，通过对整个解空间的高效搜索而得到全局最优解，当解空间较大时，常规遗传算法难以同时保证搜索速度和最优解的精度。针对这种缺陷提出了应用双种群遗传算法，即利用具有不同搜索策略的2个种群进行联合搜索，既保证了最优解的精度，又提高了搜索速度，将其应用于数值试井自动拟合解释，比常规遗传算法能节省50％以上的计算时间。     

改进的用于半导体器件综合系统的遗传算法

本文对应用于器件综合系统的遗传算法GENOCOP进行了改进.将实数设计空间根据参数的工艺精度影响转换为整型空间,并加入适应性复合算子利用已经得到的点来扩展和开发准可行空间.使其保持有效搜索到可行解的特性的同时,在同等的算法设置下,提高了对可行空间的覆盖率(约2.87倍),可以帮助设计人员更有效的设计可工作的器件.     

Generation of adaptive gait patterns for quadruped robot with CPG network including motor dynamic model

This paper describes the generation of adaptive gait patterns using new Central Pattern Generators (CPGs) including motor dynamic models for a quadruped robot under various environments. The CPGs act as the flexible oscillators of the joints and adjust joint angles to required values. The CPGs are interconnected with each other and sets of their coupling parameters are adjusted by a genetic algorithm so that the quadruped robot can realize stable and adequate gait patterns. Generation of gait patterns results in the formation of the CPG networks suitable for the formation of not only a straight walking pattern but also of rotating gait patterns. Experimental results demonstrate that the proposed CPG networks are effective for the automatic adjustment of the adaptive gait patterns for the tested quadruped robot under various environments. Furthermore, the target tracking control based on image processing is achieved by combining the general gait patterns. © 2006 Wiley Periodicals, Inc. Electr Eng Jpn, 155(1): 35–43, 2006; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.20225     

Trade-offs in scan path and BIST implementations for RAMs

In this article we propose efficient scan path and BIST schemes for RAMs. Tools for automatic generation of these schemes have been implemented. They reduce the design effort and thus allow the designer to select the more appropriate scheme with respect to various constraints.     

网带式连续烧结炉炉温及网带速度微机控制系统

本文介绍一个基于ＳＴＤ总线的单片机网带式连续烧结炉炉温及网带速度控制系统，详细叙述了系统的硬件结构和控制算法。     

均匀设计在遗传算法中的应用研究

通过分析均匀设计和遗传算法的内在关系，指出从某个角度上可以把均匀设计看作是遗传算法的一种特例，并针对遗传算法初始参数众多、难配置的问题，提出了利用均匀设计优化配置选择参数的方法，在一定程度上可以避免遗传算法参数配置的盲目性．仿真试验结果证明了该方法是合理、可行的。     

基于遗传算法的图像边缘信息链表匹配技术

提出了一种基于遗传算法的图像边缘信息链表匹配方法。首先,采用CANNY算子的方法提取图像边缘;然后,将图像边缘信息链表化;最后,基于链表化结果利用遗传算法进行链表匹配。该方法能够减少匹配过程中的计算量,且能实现高效匹配。通过仿真实验,验证了该方法的性能。     

On finding optimal and near-optimal lineal spanning trees

The search for good lineal, or depth-first, spanning trees is an important aspect in the implementation of a wide assortment of graph algorithms. We consider the complexity of findingoptimal lineal spanning trees under various notions of optimality. In particular, we show that several natural problems, such as constructing a shortest or a tallest lineal tree, are NP-hard. We also address the issue of polynomial-time, near-optimization strategies for these difficult problems, showing that efficient absolute approximation algorithms cannot exist unlessP = NP.This author's research was supported in part by the Sandia University Research Program and by the National Science Foundation under Grant M IP-8603879.This author's research was supported in part by the National Science Foundation under Grants ECS-8403859 and MIP-8603879.