2011 IEEE International Conference on Web Services最新文献_第4页

An Effective Web Service Recommendation Method Based on Personalized Collaborative Filtering 一种基于个性化协同过滤的Web服务推荐方法

2011 IEEE International Conference on Web Services Pub Date : 2011-07-04 DOI: 10.1109/ICWS.2011.38

Yechun Jiang, Jianxun Liu, Mingdong Tang, Xiaoqing Frank Liu

{"title":"An Effective Web Service Recommendation Method Based on Personalized Collaborative Filtering","authors":"Yechun Jiang, Jianxun Liu, Mingdong Tang, Xiaoqing Frank Liu","doi":"10.1109/ICWS.2011.38","DOIUrl":"https://doi.org/10.1109/ICWS.2011.38","url":null,"abstract":"Collaborative filtering is one of widely used Web service recommendation techniques. There have been several methods of Web service selection and recommendation based on collaborative filtering, but seldom have they considered personalized influence of users and services. In this paper, we present an effective personalized collaborative filtering method for Web service recommendation. A key component of Web service recommendation techniques is computation of similarity measurement of Web services. Different from the Pearson Correlation Coefficient (PCC) similarity measurement, we take into account the personalized influence of services when computing similarity measurement between users and personalized influence of services. Based on the similarity measurement model of Web services, we develop an effective Personalized Hybrid Collaborative Filtering (PHCF) technique by integrating personalized user-based algorithm and personalized item-based algorithm. We conduct series of experiments based on real Web service QoS dataset WSRec [11] which contains more than 1.5 millions test results of 150 service users in different countries on 100 publicly available Web services located all over the world. Experimental results show that the method improves accuracy of recommendation of Web services significantly.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125736268","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}

引用次数: 205

Runtime Monitoring of Data-centric Temporal Properties for Web Services Web服务以数据为中心的时间属性的运行时监控

2011 IEEE International Conference on Web Services Pub Date : 2011-07-04 DOI: 10.1109/ICWS.2011.124

Guoquan Wu, Jun Wei, Chunyang Ye, Xiao-dong Shao, Hua Zhong, Tao Huang

{"title":"Runtime Monitoring of Data-centric Temporal Properties for Web Services","authors":"Guoquan Wu, Jun Wei, Chunyang Ye, Xiao-dong Shao, Hua Zhong, Tao Huang","doi":"10.1109/ICWS.2011.124","DOIUrl":"https://doi.org/10.1109/ICWS.2011.124","url":null,"abstract":"Runtime monitoring of Web service compositions has been widely acknowledged as a significant approach to understand and guarantee the quality of services. However, existing runtime monitoring solutions consider only the constraints on the sequence of messages exchanged between partner services and ignore the actual data contents inside the messages. As a result, it is difficult to monitor some dynamic properties such as how message data of interest is processed between different participants. To address this issue, we propose an efficient, non-intrusive online monitoring approach to dynamically analyze data-centric properties for service-oriented applications involving multiple participants. By introducing Par-BCL - a Parametric Behavior Constraint Language for web services - to define monitoring parameters, various data-centric temporal behavior properties for Web services can be specified and monitored. This approach broadens the monitored patterns to include not only message exchange orders, but also the data contents bound to the parameters. To reduce runtime overhead, we statically analyze the monitored properties to generate parameter state machine from the event pattern automata to optimize monitoring. The experiments show that our solution is efficient and promising.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130919740","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}

引用次数: 8

A Dynamic Resource Allocation Algorithm for Database-as-a-Service 面向数据库即服务的动态资源分配算法

2011 IEEE International Conference on Web Services Pub Date : 2011-07-04 DOI: 10.1109/ICWS.2011.64

Jie Zhu, Bo Gao, Zhi Hu Wang, B. Reinwald, Changjie Guo, Xiaoping Li, Wei Sun

引用次数: 10

WS-Eventing SOAP-over-UDP Multicast Extension ws - eventingsoap -over- udp组播扩展

2011 IEEE International Conference on Web Services Pub Date : 2011-07-04 DOI: 10.1109/ICWS.2011.92

David Gregorczyk

引用次数: 6

A Multi-tenant Architecture for Business Process Executions 用于业务流程执行的多租户体系结构

2011 IEEE International Conference on Web Services Pub Date : 2011-07-04 DOI: 10.1109/ICWS.2011.99

M. Pathirage, S. Perera, I. Kumara, S. Weerawarana

引用次数: 73

QoS-Aware Automatic Service Composition by Applying Functional Clustering 基于功能聚类的qos感知自动服务组合

2011 IEEE International Conference on Web Services Pub Date : 2011-07-04 DOI: 10.1109/ICWS.2011.32

Florian Wagner, F. Ishikawa, S. Honiden

{"title":"QoS-Aware Automatic Service Composition by Applying Functional Clustering","authors":"Florian Wagner, F. Ishikawa, S. Honiden","doi":"10.1109/ICWS.2011.32","DOIUrl":"https://doi.org/10.1109/ICWS.2011.32","url":null,"abstract":"With the steadily growing number of service providers the competition becomes more and more intense. In order to find a distinctive edge over other competitors, automatic service composition can be applied to further adapt to the requirements of the users. Most of the current composition approaches can be categorized as either planning or selection algorithms. The former automatically create workflows and tend to neglect Quality-of-Service (QoS) concerns, drawing compositions useless if user constraints are violated. Selection algorithms on the other hand optimize the QoS but provide no functional flexibility. In this paper we show how the strengths of both approaches can be combined by leveraging common characteristics of service registries. Therefore we utilize a data structure which arranges functionally similar services in clusters and computes the QoS of each cluster. Our planning tool composes workflows consisting of these clusters, taking the QoS of the clusters into account. This way, the utility in general and the reliability of the composed workflows are significantly increased. We prove the feasibility and the benefits of our functional clustering in our detailed evaluation.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133494012","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}

引用次数: 88

Web Service Selection for Resolving Conflicting Service Requests 解决服务请求冲突的Web服务选择

2011 IEEE International Conference on Web Services Pub Date : 2011-07-04 DOI: 10.1109/ICWS.2011.37

Guosheng Kang, Jianxun Liu, Mingdong Tang, Xiaoqing Frank Liu, K. K. Fletcher

{"title":"Web Service Selection for Resolving Conflicting Service Requests","authors":"Guosheng Kang, Jianxun Liu, Mingdong Tang, Xiaoqing Frank Liu, K. K. Fletcher","doi":"10.1109/ICWS.2011.37","DOIUrl":"https://doi.org/10.1109/ICWS.2011.37","url":null,"abstract":"Web service selection based on quality of service (QoS) has been a research focus in an environment where many similar web services exist. Current methods of service selection usually focus on a single service request at a time and the selection of a service with the best QoS at the user's own discretion. The selection does not consider multiple requests for the same functional web services. Usually, there are multiple service requests for the same functional web service in practice. In such situations, conflicts occur when too many requesters select the same best web service. This paper aims at solving these conflicts and developing a global optimal service selection method for multiple related service requesters, thereby optimizing service resources and improving performance of the system. It uses Euclidean distance with weights to measure degree of matching of services based on QoS. A 0-1 integral programming model for maximizing the sum of matching degree is created and consequently, a global optimal service selection algorithm is developed. The model, together with a universal and feasible optimal service selection algorithm, is implemented for global optimal service selection for multiple requesters (GOSSMR). Furthermore, to enhance its efficiency, Skyline GOSSMR is proposed. Time complexity of the algorithms is analyzed. We evaluate performance of the algorithms and the system through simulations. The simulation results demonstrate that they are more effective than existing ones.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114659767","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}

引用次数: 74

2011 IEEE International Conference on Web Services Pub Date : 2011-07-04 DOI: 10.1109/ICWS.2011.62

Haibin Zhang, Yan Wang, Xiuzhen Zhang

{"title":"Transaction Similarity-Based Contextual Trust Evaluation in E-Commerce and E-Service Environments","authors":"Haibin Zhang, Yan Wang, Xiuzhen Zhang","doi":"10.1109/ICWS.2011.62","DOIUrl":"https://doi.org/10.1109/ICWS.2011.62","url":null,"abstract":"The trust of sellers and transactions is a very important issue in e-commerce and e-service environments. At some e-commerce websites (such as eBay1), the trust management mechanism can compute a trust value of a seller, which is based on the ratings of past transactions given by buyers. This trust value, however, is static and can only reflect the general or global trust status of a seller, and it is not directly bound to a new transaction. As a result, a buyer maybe easily cheated by a malicious seller in a new transaction with the notorious value imbalance problem [5], i.e., the malicious seller can build up a good reputation by selling cheap products/services and then start to cheat buyers by selling expensive products/services. Instead of providing such a static trust value, in order to provide more objective trust result for anew potential transaction, a trust evaluation mechanism should based on the ratings of past transactions, the nature of both past transactions and the new transaction. In this paper, we propose a new contextual trust evaluation method. Our method compares the transaction context similarity between the new transaction and past transactions, from which the trust value of the new transaction can be determined. Our method can identify and prevent potentially malicious transactions with the value imbalance problem.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114885913","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}

引用次数: 34

Collaborative Filtering Based Service Ranking Using Invocation Histories 使用调用历史的基于协同过滤的服务排序

2011 IEEE International Conference on Web Services Pub Date : 2011-07-04 DOI: 10.1109/ICWS.2011.61

Qiong Zhang, Chen Ding, Chi-Hung Chi

引用次数: 58

Dynamic Composition of Pervasive Process Fragments 普适过程片段的动态组合

2011 IEEE International Conference on Web Services Pub Date : 2011-07-04 DOI: 10.1109/ICWS.2011.70

Adina Sirbu, A. Marconi, M. Pistore, Hanna Eberle, F. Leymann, Tobias Unger

引用次数: 22