CSpace  > 中国科学院计算技术研究所期刊论文  > 英文
A pattern-based approach to facilitating service composition
Hu, HT; Han, YB; Huang, K; Li, G; Zhao, ZF
2004
发表期刊GRID AND COOPERATIVE COMPUTING GCC 2004 WORKSHOPS, PROCEEDINGS
ISSN0302-9743
卷号3252页码:90-98
摘要This paper presents a pattern-based approach to facilitating the composition of Web services, which enables business users to use composite services more effectively. With the support of patterns, business users can construct applications with larger-granularity components, amend and customize their own patterns to meet personalized requirements. The approach is illustrated with a case study. We suggest the patterns be used during the orchestration stage in a service composition process. By doing so, the composition logic built into the pattern can be made available to other users.
收录类别SCI
语种英语
WOS研究方向Computer Science
WOS类目Computer Science, Theory & Methods
WOS记录号WOS:000225062800012
出版者SPRINGER-VERLAG BERLIN
引用统计
被引频次:5[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://119.78.100.204/handle/2XEOYT63/9775
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Hu, HT
作者单位1.Chinese Acad Sci, Inst Comp Technol, Software Div, Beijing 100080, Peoples R China
2.Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
推荐引用方式
GB/T 7714
Hu, HT,Han, YB,Huang, K,et al. A pattern-based approach to facilitating service composition[J]. GRID AND COOPERATIVE COMPUTING GCC 2004 WORKSHOPS, PROCEEDINGS,2004,3252:90-98.
APA Hu, HT,Han, YB,Huang, K,Li, G,&Zhao, ZF.(2004).A pattern-based approach to facilitating service composition.GRID AND COOPERATIVE COMPUTING GCC 2004 WORKSHOPS, PROCEEDINGS,3252,90-98.
MLA Hu, HT,et al."A pattern-based approach to facilitating service composition".GRID AND COOPERATIVE COMPUTING GCC 2004 WORKSHOPS, PROCEEDINGS 3252(2004):90-98.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Hu, HT]的文章
[Han, YB]的文章
[Huang, K]的文章
百度学术
百度学术中相似的文章
[Hu, HT]的文章
[Han, YB]的文章
[Huang, K]的文章
必应学术
必应学术中相似的文章
[Hu, HT]的文章
[Han, YB]的文章
[Huang, K]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。