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

计算机工程 ›› 2010, Vol. 36 ›› Issue (18): 250-252. doi: 10.3969/j.issn.1000-3428.2010.18.087

• 开发研究与设计技术 • 上一篇    下一篇

基于记忆模型的两阶段Web服务发现算法

袁铁柱,王 磊   

  1. (西安理工大学计算机科学与工程学院,西安 710048)
  • 出版日期:2010-09-20 发布日期:2010-09-30
  • 作者简介:袁铁柱(1983-),男,硕士研究生,主研方向:面向服务计算,智能计算;王 磊,教授、博士
  • 基金资助:
    国家自然科学基金资助项目(60603026)

Web Service Discovery Algorithm at Two-stages Based on Memory Model

YUAN Tie-zhu, WANG Lei   

  1. (Faculty of Computer Science & Engineering, Xi’an University of Technology, Xi’an 710048, China)
  • Online:2010-09-20 Published:2010-09-30

摘要: 针对当前服务发现系统的查准率及用户满意度偏低的问题,提出采用记忆强度机制对得到的服务历史记录进行分析,进而更新记忆库中的服务信息。根据服务请求记忆库会得到具有一定顺序的服务列表,将此列表与通过请求UDDI服务中心基于关键字匹配得到的服务集合进行语义匹配,得到用户需要的服务列表。实验结果表明,该模型能够有效改善服务发现系统的查准率和用户满意度。

关键词: Web服务, 服务发现, 服务列表, 记忆强度

Abstract: With regarded to the problem that the current system’s recall ration and users’ satisfaction usually appears low during service discovery, this paper presents a method that takes the mechanism of memory strength to analyze the received history records of Web service in order to update service information of the memory vault. According to the request, the memory vault can get the ordinal service list and match it and another service set provided by the service center of the UDDI matched to based on keys to get the service list required by the clients by means of semantic, and finally the system provides service list to meet users. Experimental results indicate that the new model can improve the recall ration and users’ satisfaction of Web service discovery.

Key words: Web service, service discovery, service list, memory strength

中图分类号: