期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
A Components Library System Model and the Support Tool
1
作者 MIAOHuai-kou LIUHui LIUJing LIXiao-bo 《Wuhan University Journal of Natural Sciences》 EI CAS 2004年第5期722-730,共9页
Component-based development needs a well-designed components library and a set of support tools. This paper prasents the design and implementation of a components library system model and its support tool UMLCASE, A s... Component-based development needs a well-designed components library and a set of support tools. This paper prasents the design and implementation of a components library system model and its support tool UMLCASE, A set of practical CASE tools is constructed. UMLCASE can use UML to design Use Case Diagram, Class Diagram etc. And it integrates with components library system. Key words component technology - components library - support tool for components library CLC number TP 311. 52 - TP 311 Foundation item: Supported by the National Natural Science Fundation of China (60373072) and National 973 Program (2002CB312001)Biography: MIAO Huai-kou (1953-), male. Professor, research direction: formal methods, software engineering and automatic reasoning. 展开更多
关键词 component technology components library support tool for components library
在线阅读 下载PDF
Lane of parallel through carry in ternary optical adder 被引量:32
2
作者 JINYi HEHuacan AILirong 《Science in China(Series F)》 2005年第1期107-116,共10页
At the present 50 to 100 microseconds are necessary for a liquid crystal to change its state from opacity to clarity; 1.14×10-5 microseconds are however proved to be enough for light to pass through a clarity liq... At the present 50 to 100 microseconds are necessary for a liquid crystal to change its state from opacity to clarity; 1.14×10-5 microseconds are however proved to be enough for light to pass through a clarity liquid crystal device. Rooted from this great difference in time, an optical adder was constructed with parallel through carry lanes (PTCL) composed of liquid crystals. Because all carries in PTCL process in parallel, the carry delay in the ternary optical computer's adder is avoided. Eliminating the carry delay in adder of ternary optical computer by physical means, the PTCL is also applicable for other types of optical adders. Moreover a light diagram of the adder and one PTCL structure are provided. 展开更多
关键词 optical computer TERNARY ADDER through carry lane.
原文传递
基于二进制编码的蚁群优化算法及其收敛性分析 被引量:1
3
作者 Tian-MingBu Song-NianYu Hui-WeiGuan 《Journal of Computer Science & Technology》 SCIE EI CSCD 2004年第C00期17-17,共1页
蚁群优化算法(ACO)是一种解组合优化问题的“元启发式”算法,也是一种结合了正反馈和贪婪搜索的基于种群的新方法。其思想及其应用产生于上个世纪90年代,而“蚁群优化(Ant Colony Optimization)”的确切提出则只有5年左右的时间。作... 蚁群优化算法(ACO)是一种解组合优化问题的“元启发式”算法,也是一种结合了正反馈和贪婪搜索的基于种群的新方法。其思想及其应用产生于上个世纪90年代,而“蚁群优化(Ant Colony Optimization)”的确切提出则只有5年左右的时间。作为一种全新的启发式搜索算法,它在TSP,二次分配(Quadratic Assignment)和网络路由上所获得的结果完全可以与其他最优的启发式算法相媲美,甚至超越它们,并已成为当前最成功的群体智能系统之一。 展开更多
关键词 蚁群优化算法 群体智能 启发式搜索算法 收敛性分析 网络路由 启发式算法 最优 组合优化问题 二进制编码 TSP
原文传递
Binary-Coding-Based Ant Colony Optimization and Its Convergence 被引量:1
4
作者 Tian-MingBu Song-NianYu Hui-WeiGuan 《Journal of Computer Science & Technology》 SCIE EI CSCD 2004年第4期472-478,共7页
Ant colony optimization (ACO for short) is a meta-heuristics for hard combinatorial optimization problems. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. In thi... Ant colony optimization (ACO for short) is a meta-heuristics for hard combinatorial optimization problems. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. In this paper, genetic algorithm's (GA for short) ideas are introduced into ACO to present a new binary-coding based ant colony optimization. Compared with the typical ACO, the algorithm is intended to replace the problem's parameter-space with coding-space, which links ACO with GA so that the fruits of GA can be applied to ACO directly. Furthermore, it can not only solve general combinatorial optimization problems, but also other problems such as function optimization. Based on the algorithm, it is proved that if the pheromone remainder factor rho is under the condition of rho greater than or equal to 1, the algorithm can promise to converge at the optimal, whereas if 0 < rho < 1, it does not. 展开更多
关键词 ant colony optimization genetic algorithm binary-coding CONVERGENCE HEURISTIC function optimization
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部