发布求助
文献互助 智能选刊 最新文献

2012 IEEE 19th International Conference on Web Services最新文献

筛选
英文 中文
A Dynamic Web Service Composition Method Based on Viterbi Algorithm 基于Viterbi算法的动态Web服务组合方法
2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.118
Li-zhen Cui, Jian Li, Yongqing Zheng
{"title":"A Dynamic Web Service Composition Method Based on Viterbi Algorithm","authors":"Li-zhen Cui, Jian Li, Yongqing Zheng","doi":"10.1109/ICWS.2012.118","DOIUrl":"https://doi.org/10.1109/ICWS.2012.118","url":null,"abstract":"In cloud computing, it is an urgent problem to provide stable composition service which can satisfy the personalized requirements for large scale users. This paper takes several aspects of web service into consideration, including Quality of Service (QoS), user preference and the service relationships and proposes a method based viterbi algorithm to reason out the global optimal solution of web composition service. Result shows our method holds executive efficiency, stability as well as outstanding selecting result.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124014834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Multi-objective Service Composition with Time- and Input-Dependent QoS 具有时间和输入依赖QoS的多目标服务组合
2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.40
Florian Wagner, Adrian Klein, B. Klöpper, F. Ishikawa, S. Honiden
{"title":"Multi-objective Service Composition with Time- and Input-Dependent QoS","authors":"Florian Wagner, Adrian Klein, B. Klöpper, F. Ishikawa, S. Honiden","doi":"10.1109/ICWS.2012.40","DOIUrl":"https://doi.org/10.1109/ICWS.2012.40","url":null,"abstract":"Optimizing the Quality-of-Service (QoS) levels of a service workflow is essential for the user satisfaction in Service-oriented Computing. For that purpose, QoS computation models are applied to reflect the actual QoS experienced by the user during service execution. Current QoS models ignore the possible dependencies of QoS attributes, such as the dependency on the time of the execution or on the input data supplied to the service. Apart from that, composition approaches consider only single workflows during service selection, narrowing the number of possible compositions. Thus, we introduce a novel QoS model that covers QoS dependencies and discuss how this model can be used to consider multiple workflows at the same time. Moreover, we adopt a multi-objective optimization approach to offer solutions varying in QoS such as finishing time and price, allowing the user to make fine-grained decisions.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124554167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 49
Popularity Based Web Service Search 基于人气的Web服务搜索
2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.87
S. Elfirdoussi, Zahi Jarir, M. Quafafou
{"title":"Popularity Based Web Service Search","authors":"S. Elfirdoussi, Zahi Jarir, M. Quafafou","doi":"10.1109/ICWS.2012.87","DOIUrl":"https://doi.org/10.1109/ICWS.2012.87","url":null,"abstract":"Web service discovery is a main challenge despite the enhanced proposed methods based on information retrieval techniques (word sense disambiguation, stemming, etc.), domain knowledge and ontology. Unfortunately, the proposed approaches are, however, complex in practice. Despite the addition of extra information to WSDL documents, discovering a required web service looks like finding a needle in a haystack. Thus, we propose in this paper a seamless way to discover a more appropriate web service independently of its type (simple, composed or semantic). In fact, we consider the usage of the service and more particularly, users' requirements, and we invoke it using a generated GUI. This approach concerning a Web service search engine based on popularity is implemented and validated by performing an experiment.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114567456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Shapley Value Based Impression Propagation for Reputation Management in Web Service Composition 基于Shapley值的印象传播在Web服务组合中的声誉管理
2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.85
An Liu, Qing Li, Liusheng Huang, Shiting Wen
{"title":"Shapley Value Based Impression Propagation for Reputation Management in Web Service Composition","authors":"An Liu, Qing Li, Liusheng Huang, Shiting Wen","doi":"10.1109/ICWS.2012.85","DOIUrl":"https://doi.org/10.1109/ICWS.2012.85","url":null,"abstract":"Reputation is useful for establishing trust between Web service (WS) providers and WS consumers. In the context of WS composition, a challenging issue of reputation management is to propagate a user's impression of a composite WS (i.e., the user's feedback rating) to its component WSs. In this paper, we propose a Shapley value based approach which can achieve fair impression propagation, that is, the reputation of a component WS is never awarded (or penalized) for the good (or bad) performances of the other peer component WSs in the same composite WS. The fairness of the proposed approach is validated through theoretical analysis and experimental results.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114732566","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Checking Compatibility of Web Services Using SOGs 使用SOGs检查Web服务的兼容性
2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.113
Kais Klai, Hanen Ochi
{"title":"Checking Compatibility of Web Services Using SOGs","authors":"Kais Klai, Hanen Ochi","doi":"10.1109/ICWS.2012.113","DOIUrl":"https://doi.org/10.1109/ICWS.2012.113","url":null,"abstract":"This work deals with services composition. We propose an approache based on Symbolic Observation Graphs (SOG) allowing to decide whether two (ore more) web services can cooperate safely. The compatibility between two web services is defined by the well known soundness property on open workflow nets and checked on the composition of SOGs instead of the original web services composition. This allows to respect the privacy of the services since SOGs are base on collaborative activities only and hide the internal structure and behavior of the corresponding service.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"345 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123316088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Efficient Correlation-Aware Service Selection 高效的关联感知服务选择
2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.62
L. Barakat, S. Miles, Michael Luck
{"title":"Efficient Correlation-Aware Service Selection","authors":"L. Barakat, S. Miles, Michael Luck","doi":"10.1109/ICWS.2012.62","DOIUrl":"https://doi.org/10.1109/ICWS.2012.62","url":null,"abstract":"Accounting for quality correlations among web services when performing service composition is essential to obtain more accurate quality estimations of service combinations, thus providing users with better composite solutions. Yet, most current composition approaches fail to address such correlations by assuming independence between services regarding their quality values. In response, this paper presents a correlation-aware composition approach, where quality dependencies among services are modelled and considered during composite service selection. Moreover, to improve selection efficiency, correlation-aware search space reduction techniques are introduced, which prune out uninteresting service compositions prior to selection. The effectiveness of the approach, in terms of time and optimality, is demonstrated via experimental results.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116743257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 58
RESTful Web Service Mashup Based Coal Mine Safety Monitoring and Control Automation with Wireless Sensor Network 基于rest式Web Service Mashup的无线传感器网络煤矿安全监控自动化
2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.106
Cheng Bo, Xiuquan Qiao, Wu Budan, Xiaokun Wu, Ruisheng Shi, Junliang Chen
{"title":"RESTful Web Service Mashup Based Coal Mine Safety Monitoring and Control Automation with Wireless Sensor Network","authors":"Cheng Bo, Xiuquan Qiao, Wu Budan, Xiaokun Wu, Ruisheng Shi, Junliang Chen","doi":"10.1109/ICWS.2012.106","DOIUrl":"https://doi.org/10.1109/ICWS.2012.106","url":null,"abstract":"Due to complex environment of the coal mine, it's necessary to monitor the information of underground environment, device and miner instantly in order to ensure the safety of coal mine production. However, the exiting coal mine can not meet the requirements of coverage without blind spots as it is developed by the wired network. This paper proposes a RESTful Web services mashup augmented coal mine safety monitoring and control automation using ZigBee wireless sensor network, which can collect the underground temperature, humidity methane values and personal position through sensor nodes in the coal mine, and also collects the personnel position information inside the mine, and then implement a RESTful Application Programming Interface (API) on sensor nodes to provide access to sensors and actuators, allowing for them to be easily combined with other enterprise information resources based on the success of mashup applications. We also illustrated three different of scenarios for RESTful Web service mashups representing for coal mine safety monitoring and control automation. Finally, we give the conclusions.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126680893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Trust Computation in Web Service Compositions Using Bayesian Networks 基于贝叶斯网络的Web服务组合信任计算
2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.100
M. Motallebi, F. Ishikawa, S. Honiden
{"title":"Trust Computation in Web Service Compositions Using Bayesian Networks","authors":"M. Motallebi, F. Ishikawa, S. Honiden","doi":"10.1109/ICWS.2012.100","DOIUrl":"https://doi.org/10.1109/ICWS.2012.100","url":null,"abstract":"The concept of trust in web services mainly deals with the degree of belief that a client or a group of clients have over services functioning satisfactorily and providing the expected results. With services being invoked in composition with each other, computing the trust of the composition and selecting services that deliver the highest trust for it becomes a desired goal. In this paper we demonstrate how using Bayesian networks and its supporting queries, we can select the set of services among all candidates that would provide highest global trust.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128034234","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Identifying Test Requirements by Analyzing SLA Guarantee Terms 通过分析SLA保证条款确定测试需求
2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.78
Marcos Palacios, J. García-Fanjul, J. Tuya, G. Spanoudakis
{"title":"Identifying Test Requirements by Analyzing SLA Guarantee Terms","authors":"Marcos Palacios, J. García-Fanjul, J. Tuya, G. Spanoudakis","doi":"10.1109/ICWS.2012.78","DOIUrl":"https://doi.org/10.1109/ICWS.2012.78","url":null,"abstract":"Service Level Agreements (SLAs) are used to specify the negotiated conditions between the provider and the consumer of services. In this paper we present a stepwise method to identify and categorize a set of test requirements that represent the potential situations that can be exercised regarding the specification of each isolated guarantee term of an SLA. This identification is addressed by means of devising a set of coverage levels that allow grading the thoroughness of the tests. The utilization of these test requirements would focus on twofold objectives: (1) the generation of a test suite that allows exercising the situations described in the test requirements and (2) the support for the derivation of a monitoring plan that checks the compliance of these requirements at runtime. The approach is illustrated over an eHealth case study.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121288196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Automatic Abstract Service Generation from Web Service Communities 从Web服务社区自动生成抽象服务
2012 IEEE 19th International Conference on Web Services Pub Date : 2012-06-24 DOI: 10.1109/ICWS.2012.41
Xumin Liu, Hua Liu
{"title":"Automatic Abstract Service Generation from Web Service Communities","authors":"Xumin Liu, Hua Liu","doi":"10.1109/ICWS.2012.41","DOIUrl":"https://doi.org/10.1109/ICWS.2012.41","url":null,"abstract":"The concept of abstract services has been widely adopted in service computing to specify the functionality of certain types of Web services. It significantly benefits key service management tasks, such as service discovery and composition, as these tasks can be first applied to a small number of abstract services and then mapped to the large scale actual services. However, how to generate abstract services is non-trivial. Current approaches either assume the existence of abstract services or adopt a manual process that demands intensive human intervention. We propose a novel approach to fully automate the generation of abstract services from a service community that consists of a set of functionally similar services. A set of candidate outputs are first discovered based on predefined support ratio, which determines the minimum number of services that produce the outputs. Then, the matching inputs are identified to form the abstract services. We propose a set of heuristics to effectively prune a large number of candidate abstract services. An comprehensive experimental study on real world web service data is conducted to demonstrate the effectiveness and efficiency of the proposed approach.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126398210","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书