2015 IEEE International Conference on Web Services最新文献_第2页

Conversion Infrastructure for Maintaining High Availability of Web Services Using Multiple Service Providers 使用多个服务提供者维护Web服务高可用性的转换基础结构

2015 IEEE International Conference on Web Services Pub Date : 2015-06-27 DOI: 10.1109/ICWS.2015.110

P. Melliar-Smith, L. Moser

引用次数: 4

Heuristic Recovery of Missing Events in Process Logs 流程日志中缺失事件的启发式恢复

2015 IEEE International Conference on Web Services Pub Date : 2015-06-27 DOI: 10.1109/ICWS.2015.24

Wei Song, Xiaoxu Xia, H. Jacobsen, Pengcheng Zhang, Hao Hu

引用次数: 17

A Service-Based Framework for Mobile Social Messaging in PaaS Systems PaaS系统中基于服务的移动社交消息传递框架

2015 IEEE International Conference on Web Services Pub Date : 2015-06-27 DOI: 10.1109/ICWS.2015.108

Lijun Mei, Hao Chen, Shaochun Li, Qicheng Li, Guangtai Liang, Jeaha Yang

引用次数: 3

Web Service Composition Based on Reinforcement Learning 基于强化学习的Web服务组合

2015 IEEE International Conference on Web Services Pub Date : 2015-06-27 DOI: 10.1109/ICWS.2015.103

Yu Lei, Jiantao Zhou, Fengqi Wei, Yongqiang Gao, Bo Yang

{"title":"Web Service Composition Based on Reinforcement Learning","authors":"Yu Lei, Jiantao Zhou, Fengqi Wei, Yongqiang Gao, Bo Yang","doi":"10.1109/ICWS.2015.103","DOIUrl":"https://doi.org/10.1109/ICWS.2015.103","url":null,"abstract":"How we manage Web services depends on how we understand their variable parts and invariable parts. Studying them separately could make Web service research much easier and make our software architecture much more loose-coupled. We summarize two variable parts that affect Web service compositions: uncertain invocation results and uncertain quality of services. These uncertain factors affect success rate of service composition. Previous studies model the Web service problem as a planning problem, while this problem is considered as an uncertain planning problem in this paper. Specifically, we use Partially Observable Markov Decision Process to deal with the uncertain planning problem for service composition. According to the uncertain model, we propose a reinforcement learning method, which is an uncertainty planning method, to compose web services. The proposed method does not need to know complete information of services, instead it uses historical data and estimates the successful possibilities that services are composed together with respect to service outcomes and QoS. Simulation experiments verify the validity of the algorithm, and the results also show that our method improves the success rate of the service composition.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121153218","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}

引用次数: 14

Measuring the Potential for Victimization in Malicious Content 测量在恶意内容中受害的可能性

2015 IEEE International Conference on Web Services Pub Date : 2015-06-27 DOI: 10.1109/ICWS.2015.49

M. Hale, R. Gamble, John Hale, Charles Haney, Jessica Lin, Charles Walter

引用次数: 5

Service Mining from Legacy Database Applications 从遗留数据库应用程序中挖掘服务

2015 IEEE International Conference on Web Services Pub Date : 2015-06-27 DOI: 10.1109/ICWS.2015.66

Diptikalyan Saha

引用次数: 5

Using WADL Specifications to Develop and Maintain REST Client Applications 使用WADL规范开发和维护REST客户端应用程序

2015 IEEE International Conference on Web Services Pub Date : 2015-06-27 DOI: 10.1109/ICWS.2015.21

Marios Fokaefs, Eleni Stroulia

引用次数: 13

BiNet: Trust Sub-network Extraction Using Binary Ant Colony Algorithm in Contextual Social Networks 基于二元蚁群算法的上下文社交网络信任子网络提取

2015 IEEE International Conference on Web Services Pub Date : 2015-06-27 DOI: 10.1109/ICWS.2015.51

Xiaoming Zheng, Yan Wang, M. Orgun

{"title":"BiNet: Trust Sub-network Extraction Using Binary Ant Colony Algorithm in Contextual Social Networks","authors":"Xiaoming Zheng, Yan Wang, M. Orgun","doi":"10.1109/ICWS.2015.51","DOIUrl":"https://doi.org/10.1109/ICWS.2015.51","url":null,"abstract":"Online Social Networks (OSNs) have become an integral part of daily life in recent years. OSNs contain important participants, the trust relations between participants, and the contexts in which participants interact with each other. All of these have a great influence on the prediction of the trust between a source participant and a target participant, which is important for a participant's decision-making process in many applications, such as seeking service providers. However, predicting the trust from a source participant to a target one based on the whole social network is not really feasible. Thus, prior to trust prediction, the extraction of a small-scale sub-network containing most of the important nodes and contextual information with a high density rate could make trust prediction more efficient and effective. However, extracting such a sub-network has been proved to be an NP-Complete problem. To address this challenging problem, we propose BiNet: a social context-aware trust sub-network extraction model to search for near-optimal solutions effectively and efficiently. In this model, we first capture important factors that affect the trust between participants in OSNs. Next, we define a utility function to measure the trust factors of each node in a social network. At last, we design a novel binary ant colony algorithm with newly designed initialization and mutation processes for sub-network extraction incorporating the utility function. The experiments, conducted on two popular datasets of Epinion and Slash dot, demonstrate that our approach can extract sub-networks covering important participants and contextual information while keeping a high density rate. Our approach is superior to the state-of-the-art approaches in terms of the quality of extracted sub-networks within the same execution time.","PeriodicalId":250871,"journal":{"name":"2015 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130387996","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}

引用次数: 6

Service Recommendation for Mashup Composition with Implicit Correlation Regularization 隐式关联正则化Mashup组合的服务推荐

2015 IEEE International Conference on Web Services Pub Date : 2015-06-27 DOI: 10.1109/ICWS.2015.38

Lina Yao, Xianzhi Wang, Quan Z. Sheng, Wenjie Ruan, Wei Zhang

引用次数: 35

Enabling the Extraction and Insertion of Reusable Choreography Fragments 支持抽取和插入可重用的编排片段

2015 IEEE International Conference on Web Services Pub Date : 2015-06-27 DOI: 10.1109/ICWS.2015.96

A. Weiss, V. Andrikopoulos, Michael Hahn, D. Karastoyanova

引用次数: 5