网格服务发现的FOI匹配算法研究  

Research of FOI Matchmaking Algorithm for Grid Services Discovery

作　　者：罗永红[1,2] 陈特放[1] 张友生[3] 

机构地区：[1]中南大学,湖南长沙410083 [2]长沙理工大学,湖南长沙410076 [3]湖南师范大学,湖南长沙410081

出　　处：《中南林业科技大学学报》2009年第2期145-150,共6页Journal of Central South University of Forestry & Technology

基　　金：湖南省教育厅科研基金项目(06C126)

摘　　要：提出了一个用于网格服务的语义发现的匹配系统,该系统通过对请求服务和已发布服务的匹配来发现最合适的用户服务.该匹配系统中所采用的FOI(Functionality,Output,Input)匹配算法主要考虑请求服务的功能和已发布服务的功能是否匹配作为关键因素进行快速而精确地服务发现,该算法利用合适的Algernon推理规则对功能本体和领域本体进行处理,从而就可以推断出已发布服务和请求服务的FOI相似性.This paper proposes a matchmaking system that performs matchmaking of requested grid services with that of advertised ones to discover the best suitable services. The FOI matchmaking algorithm implemented in the matchmaking system considers functionality of the requested service as critical factor for faster and accurate discovery of services. In the algorithm, suitable Algernon axioms are adopted to interact with function and domain ontology and the similarity degree between FOI of advertised and requested ones is inferred.

关 键 词：匹配系统 FOI匹配算法 功能本体 领域本体 相似度 

分 类 号：TP393.11[自动化与计算机技术—计算机应用技术]