作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (16): 13-15. doi: 10.3969/j.issn.1000-3428.2010.16.005

• 博士论文 • 上一篇    下一篇

基于模拟退火算法的构件检索方法

钟 鸣1,2,方存好1,2,田鹏伟1,2,翁林开1,2   

  1. (1. 清华大学信息科学与技术国家实验室,北京 100084;2. 清华大学计算机科学与技术系,北京 100084)
  • 出版日期:2010-08-20 发布日期:2010-08-17
  • 作者简介:钟 鸣(1983-),男,博士研究生,主研方向:软件工程,软件构件技术;方存好,博士后;田鹏伟、翁林开,博士研究生
  • 基金资助:
    国家自然科学基金资助项目(90604027);国家“十五”计划基金资助项目(2005BA115A02)

Component Retrieval Method Based on Simulated Annealing Algorithm

ZHONG Ming1,2, FANG Cun-hao1,2, TIAN Peng-wei1,2, WENG Lin-kai1,2   

  1. (1. National Laboratory of Information Science and Technology, Tsinghua University, Beijing 100084;2. Department of Computer Science and Technology, Tsinghua University, Beijing 100084)
  • Online:2010-08-20 Published:2010-08-17

摘要: 现有构件检索方法在面对用户复杂功能需求时检索时间较长而且检索结果不够准确,针对该问题,提出基于模拟退火算法的构件检索方法,定义构件检索过程中的有序匹配解及其邻域,并结合构件的分类描述特征设计模拟退火指标函数,在此基础上迭代搜索出覆盖用户功能需求且成本近似最低的构件集合。实验比较结果证明,基于模拟退火算法的构件检索方法在检索速度和准确度方面有一定的提高。

关键词: 软件复用, 构件检索, 功能需求, 主动服务

Abstract: Current methods usually take long retrieval time and low accuracy when retrieving components to satisfy user’s complex requirements. This paper presents a novel component retrieval method based on simulated annealing algorithm to quickly and iteratively select approximate optimal set of components. The realization of this method includes the definition of serial matching solution and its neighborhood, the formula of probability of acceptance, as well as the process of iteratively selecting sets of components with the lowest cost. Experiments show positive results in terms of execution time and retrieval accuracy.

Key words: software reuse, component retrieval, functional requirement, active services

中图分类号: