{"title":"A Recommendation Algorithm Based on Dynamic User Preference and Service Quality","authors":"Yanmei Zhang, Ya Qian, Yan Wang","doi":"10.1109/ICWS.2018.00019","DOIUrl":"https://doi.org/10.1109/ICWS.2018.00019","url":null,"abstract":"In the field of service computing, user preferences and service quality may change with time, environment and other factors. A recommendation algorithm that considers both the dynamic characteristics of users and the dynamic quality of services (QoS) is proposed in this paper. On the one hand, this algorithm uses the temporal LDA (Latent Dirichlet Allocation) model to mine dynamic user preferences. On the other hand, it considers the dynamic changes of QoS and focuses on the latest QoS. The service recommendation list is then generated for the user based on dynamic user preferences and dynamic QoS. Experimental results on a real-world dataset show that the proposed algorithm outperforms some classic algorithms and the state-of-the-art algorithms in terms of accuracy, recall and diversity.","PeriodicalId":231056,"journal":{"name":"2018 IEEE International Conference on Web Services (ICWS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122581623","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}
Derek Jacoby, N. Preston, Madhav Malhotra, Y. Coady
{"title":"Web Services for Emergencies: Multi-Transport, Multi-Cloud, Multi-Role","authors":"Derek Jacoby, N. Preston, Madhav Malhotra, Y. Coady","doi":"10.1109/ICWS.2018.00054","DOIUrl":"https://doi.org/10.1109/ICWS.2018.00054","url":null,"abstract":"In an emergency, response services require guaranteed availability regardless of failures in data transport layer and cloud service providers. In the work-in-progress reported here, we discuss three projects that have requirements that stress web infrastructure in preparing for and responding to emergencies. Our goal is to highlight the tradeoffs in costs and benefits of web services in each case, and to provide an indication of our approaches in addressing these issues.","PeriodicalId":231056,"journal":{"name":"2018 IEEE International Conference on Web Services (ICWS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122901531","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}
Yong-Yang Cheng, Shuai Zhao, B. Cheng, Junliang Chen
{"title":"A Service-Based Fog Execution Environment for the IoT-Aware Business Process Applications","authors":"Yong-Yang Cheng, Shuai Zhao, B. Cheng, Junliang Chen","doi":"10.1109/ICWS.2018.00052","DOIUrl":"https://doi.org/10.1109/ICWS.2018.00052","url":null,"abstract":"With the fast development of Internet of Things (IoT), a large amount of services are being generated continuously by different business process applications hosted on edge devices. In order to facilitate seamless access and service life cycle management of large, distributed and heterogeneous IoT services, service computing and fog computing have been widely used as the promising technologies. However, an execution environment integrating IoT services into these two technologies is still an open research challenge. In this paper, we proposed a novel service-based fog execution environment to make the business process applications fit in the dynamic IoT service environment. The proposed IoT execution environment promises a full-life cycle management of the IoT services, a low latency response of the edge devices and a distributed execution of the business process applications. An actual running intelligent medical case is given to validate our proposed IoT execution environment.","PeriodicalId":231056,"journal":{"name":"2018 IEEE International Conference on Web Services (ICWS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116877637","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}
{"title":"Improving Service Recommendation by Alleviating the Sparsity with a Novel Ontology-Based Clustering","authors":"R. Rupasingha, Incheon Paik","doi":"10.1109/ICWS.2018.00059","DOIUrl":"https://doi.org/10.1109/ICWS.2018.00059","url":null,"abstract":"Web service recommendation in an efficient and accurate manner has become a significant tool with information overload and an increasingly urgent demand to provide appropriate recommendations to users. Among the service recommendation algorithms, Collaborative Filtering (CF) gives credence to user inputs by comparing user's correlations. Performance of the service recommendation approaches becomes deficient due to the data sparsity and cold-start issues, which make the incomplete and inadequate information to analyze a user predicament on Web services. This paper proposes a CF-based recommendation approach that first alleviates the sparsity problem using a novel ontology-based clustering approach that used domain specificity and service similarity for the ontology generation. Then, we propose a trustbased user rating prediction by determining the trust value between users by calculating the correlation of users. The experimental results indicate that the proposed approach can effectively alleviate the sparsity and cold-start problems by lower prediction error compared with existing sparsity managing mechanisms in service recommendations.","PeriodicalId":231056,"journal":{"name":"2018 IEEE International Conference on Web Services (ICWS)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134082952","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}
{"title":"(WIP) Correlation-Driven Service Event Routing for Predictive Industrial Maintenance","authors":"Meiling Zhu, Chen Liu, Shouli Zhang, Yanbo Han","doi":"10.1109/ICWS.2018.00044","DOIUrl":"https://doi.org/10.1109/ICWS.2018.00044","url":null,"abstract":"Predictive industrial maintenance promotes proactive scheduling of maintenance to minimize unexpected device faults. A fault is not always isolated and may be formed by a propagation of trivial anomalies, which are regarded as service events herein. In this paper, we firstly propose an algorithm for generating service event correlation. Such correlations can show us lots of clues to the anomaly/fault propagation. The correlations are encapsulated into service hyperlinks as our previous works did, and thus we depict the anomaly/fault propagation as service event routing among services via the refined service hyperlinks. Our scenario illustrates that a trivial anomaly may propagate into different faults under different service event correlations. It indicates that the destination of a service event is often uncertain. Therefore, this paper further proposes a heuristic approach to handle the uncertainty problem. Extensive experiments have been made to verify the effectiveness of the approach.","PeriodicalId":231056,"journal":{"name":"2018 IEEE International Conference on Web Services (ICWS)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133005930","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}
Xiulin Li, Shijun Liu, Li Pan, Yuliang Shi, Xiangxu Meng
{"title":"Performance Analysis of Service Clouds Serving Composite Service Application Jobs","authors":"Xiulin Li, Shijun Liu, Li Pan, Yuliang Shi, Xiangxu Meng","doi":"10.1109/ICWS.2018.00036","DOIUrl":"https://doi.org/10.1109/ICWS.2018.00036","url":null,"abstract":"Performance analysis is important for service clouds serving composite service application jobs containing parallelizable tasks, for optimizing the degree of parallelism (DOP) and resource allocation schemes could improve performance obviously. In this paper, we describe a novel tandem queuing network with a parallel multi-station multi-server system as an analytical model for service clouds serving composite service application jobs. We design a partition method (termed the 'pleasing partition') to help us propose an analytical model for parallelizable service which is the vital fraction of composite service. After that, we could obtain a complete probability distribution of response time, waiting time and other important performance metrics calculated by our proposed analytical model. Thus, to use this model, cloud operators could determine proper job configurations and resource allocation schemes, for achieving specific QoS (Quality of Service). Extensive simulations are conducted to validate that our analytical model has high accuracy in predicting performance metrics of composite service application jobs.","PeriodicalId":231056,"journal":{"name":"2018 IEEE International Conference on Web Services (ICWS)","volume":"837 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133349148","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}
{"title":"A Probabilistic Model for Service Clustering - Jointly Using Service Invocation and Service Characteristics","authors":"Dongxiao He, Xue Yang, Zhiyong Feng, Shizhan Chen, Keman Huang, Zhenzhu Wang, F. Fogelman-Soulié","doi":"10.1109/ICWS.2018.00047","DOIUrl":"https://doi.org/10.1109/ICWS.2018.00047","url":null,"abstract":"Service clustering is the foundation of service discovery, recommendation and composition. Most of the existing methods mainly use service attribute information and ignore the semantic-based invocation relationships among service users. In fact, mutual invocation relationships between services occur on operations of the corresponding services, while service attributes are the whole service description. Our main challenge may be to effectively combine these two kinds of data for service clustering. To address this issue, we propose a new probabilistic generative model which contains two closely connected parts, one characterizing operation community memberships by using operation invocation relationships, and the other characterizing service cluster memberships by utilizing service attributes. The correlations between these two parts are characterized by the relationships between operation communities and service clusters. To train this model, we provide a nested expectation-maximization algorithm. Experimental results show its superior performance over the existing methods for service clustering.","PeriodicalId":231056,"journal":{"name":"2018 IEEE International Conference on Web Services (ICWS)","volume":" 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113950250","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}
{"title":"A Service Annotation Quality Improvement Approach Based on Efficient Human Intervention","authors":"Xuehao Sun, Shizhan Chen, Zhiyong Feng, Weimin Ge, Keman Huang","doi":"10.1109/ICWS.2018.00021","DOIUrl":"https://doi.org/10.1109/ICWS.2018.00021","url":null,"abstract":"Semantic Annotation plays an essential role in automatic service discovery and composition. However, existing approaches and tools cannot achieve high annotation quality to ensure the semantic service application. Meanwhile, the semi-automatic strategies for improving the annotation quality are time-consuming. To further improve the efficiency as well as the quality of the annotation, this paper presents an effective method involving human-computer interaction to further optimize the annotation procedure. Besides employing the feedback and propagation strategy to semi-automatically improve the annotation quality, the strategy to involve the manual annotation is developed when the efficiency of semi-automatically strategy is related low. To optimize the manual annotation procedure, a clustering based approach is presented to select the most impacted candidates to optimize the annotation improvement. In addition, to help the annotators to choose the correct annotation, the local ontology restriction based method is further designed to improve the recommendation performance. The experiments show that our approach effectively involving the human intervention can significantly improve the annotation quality, faster the quality improvement procedure and reduce the manual load by increasing the recommendation accuracy.","PeriodicalId":231056,"journal":{"name":"2018 IEEE International Conference on Web Services (ICWS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127645819","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}
{"title":"QCSS: A QoE-Aware Control Plane for Adaptive Streaming Service over Mobile Edge Computing Infrastructures","authors":"Lingyan Zhang, Shangguang Wang, Rong N. Chang","doi":"10.1109/ICWS.2018.00025","DOIUrl":"https://doi.org/10.1109/ICWS.2018.00025","url":null,"abstract":"Mobile Edge Computing (MEC) is designed to extend the edge of the cloud network to decrease latency and network congestion, which would significantly improve the quality of experience (QoE) of adaptive streaming service for mobile users. This paper proposes QCSS, a QoE-aware control plane for adaptive streaming service over MEC infrastructures. QCSS aims to assure high QoE delivery of online streaming service to mobile users. The design of QCSS features: 1) a timeslot system with a look-ahead window for calculating cost of edge node switch and video quality adaption (to balance network load and reduce latency); 2) conducting service adaption via a set of cooperative action components running on client devices, edge nodes, and center nodes (to ensure a smooth viewing experience); 3) constructing a flexible QoE model and extending the scope and meaning of user-perceived experience. The effectiveness of QCSS has been validated via three real datasets. The validation results show that the proposed QCSS can improve QoE performance and network load performance for adaptive streaming service over MEC Infrastructures.","PeriodicalId":231056,"journal":{"name":"2018 IEEE International Conference on Web Services (ICWS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128817281","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}
{"title":"An Efficient Distributed-Computing Framework for Association-Rule-Based Recommendation","authors":"Changsheng Li, Weichao Liang, Zhiang Wu, Jie Cao","doi":"10.1109/ICWS.2018.00056","DOIUrl":"https://doi.org/10.1109/ICWS.2018.00056","url":null,"abstract":"The association-rule-based recommendation model is one of the most widely used commercial recommendation engines in e-commerce websites. Existing studies mostly focus on how to select eligible rules to enhance the recommendation performance, but the efficiency of recommendation has been paid few attentions. To remedy this, this paper develops a distributed-computing framework for improving the computational efficiency of rule-based recommendation. Specifically, a tree-typed structure called Ordered-Patterns Forest (OPF) is designed to compress and store frequent patterns. Then, we transform eligible rules mining to a path-searching problem on OPF, and present a path-searching algorithm running on single machine. Finally, a load-balanced strategy for data partitioning is clarified. Experimental results demonstrate that the efficiency improved remarkably by the proposed OPF, compared with the traditional Brute-Force method.","PeriodicalId":231056,"journal":{"name":"2018 IEEE International Conference on Web Services (ICWS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128559088","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}