用于语义服务发现的两层P2P模型

Zhi-zhong Liu, Yulan Liu, Yihui He
{"title":"用于语义服务发现的两层P2P模型","authors":"Zhi-zhong Liu, Yulan Liu, Yihui He","doi":"10.1360/JOS181922","DOIUrl":null,"url":null,"abstract":"Semantic-enabled service discovery aggravating the load of service register and decrease the performance of service matching while increasing the recall and precision of service discovery. To decrease the load of register and the performance of service discovery, a two layered P2P model, is introduced in this article. Based on the model, a service discovery algorithm composed of two stages and three steps is proposed. The model is suitable for open environment with multiple coexistent ontologies. And experimental results show that given appropriate setting, the model makes a tradeoff between recall and responding time during service discovery. In addition, the model decreases the mean load of registers efficiently while holding Recall.","PeriodicalId":250833,"journal":{"name":"4th International Conference on New Trends in Information Science and Service Science","volume":"2 s1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"A two-layered P2P model for semantic service discovery\",\"authors\":\"Zhi-zhong Liu, Yulan Liu, Yihui He\",\"doi\":\"10.1360/JOS181922\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Semantic-enabled service discovery aggravating the load of service register and decrease the performance of service matching while increasing the recall and precision of service discovery. To decrease the load of register and the performance of service discovery, a two layered P2P model, is introduced in this article. Based on the model, a service discovery algorithm composed of two stages and three steps is proposed. The model is suitable for open environment with multiple coexistent ontologies. And experimental results show that given appropriate setting, the model makes a tradeoff between recall and responding time during service discovery. In addition, the model decreases the mean load of registers efficiently while holding Recall.\",\"PeriodicalId\":250833,\"journal\":{\"name\":\"4th International Conference on New Trends in Information Science and Service Science\",\"volume\":\"2 s1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"4th International Conference on New Trends in Information Science and Service Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1360/JOS181922\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"4th International Conference on New Trends in Information Science and Service Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1360/JOS181922","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

摘要

支持语义的服务发现在提高服务发现的召回率和精度的同时,加重了服务注册器的负载,降低了服务匹配的性能。为了降低注册器的负载和服务发现的性能,本文提出了一种双层P2P模型。在此基础上,提出了一种两阶段三步骤的服务发现算法。该模型适用于多个本体共存的开放环境。实验结果表明,在适当的设置下,该模型在服务发现的召回和响应时间之间进行了权衡。此外,该模型在保持召回率的同时有效地降低了寄存器的平均负载。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A two-layered P2P model for semantic service discovery
Semantic-enabled service discovery aggravating the load of service register and decrease the performance of service matching while increasing the recall and precision of service discovery. To decrease the load of register and the performance of service discovery, a two layered P2P model, is introduced in this article. Based on the model, a service discovery algorithm composed of two stages and three steps is proposed. The model is suitable for open environment with multiple coexistent ontologies. And experimental results show that given appropriate setting, the model makes a tradeoff between recall and responding time during service discovery. In addition, the model decreases the mean load of registers efficiently while holding Recall.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An empirical investigation of research productivity on Text Mining — in bibliometrics view Trustable web services with dynamic confidence time interval Obscene image detection algorithm using high-and low-quality images Modeling social ties with an object oriented approach A two-layered P2P model for semantic service discovery
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1