{"title":"Resources Allocation Method on Cloud Computing","authors":"Wei Ming, Chunyan Zhang, Qiu Feng, C. Yu, Qiangqiang Sui, Wanbing Ding","doi":"10.1109/ICSS.2014.50","DOIUrl":"https://doi.org/10.1109/ICSS.2014.50","url":null,"abstract":"To improve the efficiency of resource allocation cloud computing, as while as to improve resource utilization for the service provider, the paper has raised a polymorphic algorithm of Ant Colony Optimization, which can assure the quality of cloud service, and also dynamically change the list that contain nodes information. When the user submits the task, the algorithm will transfer it to the Cloud Control Queen by Master. And then, according to the functions, the ant colony will be divided into test ant colony, reconnaissance ant colony, cleared ant colony and workers ant colony. The algorithm can achieve the minimum average completion time gradually, and may reduce local optima, by forecasting the completion time and other pheromone.","PeriodicalId":206490,"journal":{"name":"2014 International Conference on Service Sciences","volume":"228 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130852006","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":"Customer Participation Psychology Mechanisms Based on Self-Efficacy and Emotion Contagion Theories","authors":"Cao Hua-rui, Zheng Qiu-ying, Li Huifan","doi":"10.1109/ICSS.2014.47","DOIUrl":"https://doi.org/10.1109/ICSS.2014.47","url":null,"abstract":"Customer participation in service is important in performance of service organizations and customers, such as service productivity, perceived service quality and loyalty. However, quantitative study has just began, there are not many studies on internal factors such as psychology mechanism of customer participation. At the same time, customer participation lacks of specific influence research of other customers. Therefore, the present research explores psychology mechanism of customer participation in service production and delivery, and attempts to construct and test the model of customer participation psychology mechanism. We find that participation self-efficacy and positive emotion change of customer are core factors that make customer to participate in service. Behaviors of employee and other customers as well as persuasion between customers are important in inducing participation self-efficacy and positive emotion.","PeriodicalId":206490,"journal":{"name":"2014 International Conference on Service Sciences","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126406395","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 Collaborative Filtering Recommendation Algorithm Based on User Preferences on Service Properties","authors":"Wenzhong Mu, F. Meng, Dianhui Chu","doi":"10.1109/ICSS.2014.45","DOIUrl":"https://doi.org/10.1109/ICSS.2014.45","url":null,"abstract":"In the service recommendation, the data of user ratings are usually very sparse. In the case of data sparsity, item similarity which is based on user ratings in the traditional item-based collaborative filtering algorithm ignores the situation that users are different in regarding various item properties. That results in the low accuracy when predicting. Based on this point, this paper proposed a collaborative filtering algorithm based on user preferences on service properties to solve the data sparsity problem in the service recommendation. This method firstly builds the service property preference model for each user based on information theory. Secondly, computes the service similarity correction factors of each user on any two services with service properties similarity. And finally the similarity of two services is the sum of service similarity correction factor and the Pearson correlation coefficient of them. The experiment results suggest that the proposed algorithm can efficiently improve the recommendation accuracy in the case of data sparsity.","PeriodicalId":206490,"journal":{"name":"2014 International Conference on Service Sciences","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125206957","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 Study on Visualizations of New Product Trends on Online Social Networks","authors":"Xiu Li, Hongwei Qin","doi":"10.1109/ICSS.2014.35","DOIUrl":"https://doi.org/10.1109/ICSS.2014.35","url":null,"abstract":"This study examines the new product information spreading issue from a data visualization perspective. Different from previous research, this study demonstrate how choosing proper visualization methods benefits the promotion of new products via online social network. With the adoption of proper visualization methods, the information flow can become intuitionistic, such as the topic trends, the customer satisfaction, and even why consumers choose competitors' products instead of this one. We adopt Area Chart visualization and propose Dynamic Gauge visualization approaches based on D3 library to demonstrate the importance of visualization method choosing and applying for iPhone 5S topic trends. We identify in our study that topic trends differ in different cultures, the trends change over time during the new product release cycle, and different features of the product get various attention. Under these circumstances, a proper visualization method can help company make decisions according to the topic trends instantly. Based on these findings, company managers can make full use of online social network, recognize opportunities, identify issues, and better accomplish Product Lifecycle Management (PLM).","PeriodicalId":206490,"journal":{"name":"2014 International Conference on Service Sciences","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123394901","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}
Boyang Han, Xinyang Liu, Jing Wang, Chen Liu, Roland M. Wagner
{"title":"Service Mashup in a Mobile Environment","authors":"Boyang Han, Xinyang Liu, Jing Wang, Chen Liu, Roland M. Wagner","doi":"10.1109/ICSS.2014.10","DOIUrl":"https://doi.org/10.1109/ICSS.2014.10","url":null,"abstract":"The paper presents a solution that empowers Android users with service mash up. While the solution has a practical background of mediating visitors and exhibitors for trading exhibitions, it also reflects a number of challenges in service modeling and composition in such mobile environments. Besides such issues as system architecture, implementation and case study, the focus of the paper is on how to compose services and utilize composed services on mobile devices in an easy-to-use manner.","PeriodicalId":206490,"journal":{"name":"2014 International Conference on Service Sciences","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121041741","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":"Improved Post-Processing for Human Detection in Railroad Surveillance","authors":"Xueying Xin, Zhenhua Guo, Bo Yuan, Jie Zhou","doi":"10.1109/ICSS.2014.11","DOIUrl":"https://doi.org/10.1109/ICSS.2014.11","url":null,"abstract":"Foreground detection (FD) has been widely used for moving object detection such as human detection. The practical performance of FD methods varies significantly in different real-world environments. Post-processing methods can improve the effectiveness of FD algorithms by providing high quality foreground masks for further detection. The accuracy of human detection in railroad surveillance is often limited due to occlusion and noise, causing incomplete objects in foreground masks. In this work, we introduce a novel integration step into the post-processing module following FD. We take priori knowledge into account and apply specific rules when combining the labeled components, resulting in significant improvement in the accuracy of human detection.","PeriodicalId":206490,"journal":{"name":"2014 International Conference on Service Sciences","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121255756","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":"Manage Web Educational Knowledge Based on Knowledge Dimension Model","authors":"Jinyue Peng, Dongxing Jiang, Xinyu Zhang","doi":"10.1109/ICSS.2014.43","DOIUrl":"https://doi.org/10.1109/ICSS.2014.43","url":null,"abstract":"With the development of open online courses, the quantity of educational knowledge on the internet is growing fast. Building tree-structured catalogue and establishing full text search engine based on keywords are two main methods for information retrieval on a website. However, managing knowledge from various websites is still difficult. Due to the heterogeneous tree structure and diverse description format, it is difficult to integrate key information from different websites. This paper introduced a knowledge dimension model to solve the problems. By analyzing the dimensions of tree structure and description text, all the basic information about the materials was extracted and put into a shareable knowledge dimension model in order to manage the public materials on websites and build a knowledge base for knowledge utilization. This paper also used online courses data to verify the validity of the method.","PeriodicalId":206490,"journal":{"name":"2014 International Conference on Service Sciences","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114857517","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":"Privacy-Aware Web Services Selection and Composition","authors":"Tianyang Li, T. He","doi":"10.1109/ICSS.2014.26","DOIUrl":"https://doi.org/10.1109/ICSS.2014.26","url":null,"abstract":"Privacy protection is still a key challenge in the Web service composition area. The user and Web service provider frequently share their privacy data with other Web service will increase the risk of misuse and disclosure of privacy. In this paper, we first analyze the privacy protection problem according to define four types shared data within Web service composition, and then present Web service composition and privacy models, our models allow user and Web service provider to define user's privacy preference and Web service's privacy policy specification. An algorithm is presented to check the policy compliance on the dependency edge and select a set of policy compliant Web services with compositing a well privacy protection Web service composition. Experiments demonstrate the applicability of our models and algorithm.","PeriodicalId":206490,"journal":{"name":"2014 International Conference on Service Sciences","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127026633","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 Dynamic Weight-Based Dynamic Requests Scheduling Model in Multi-core Web Server","authors":"Guohua You, Ying Zhao","doi":"10.1109/ICSS.2014.20","DOIUrl":"https://doi.org/10.1109/ICSS.2014.20","url":null,"abstract":"In order to improve performance of handling user requests, most of Web servers adopt multi-core processors. However, traditional requests scheduling algorithms, such as FCFS, don't consider the characteristics of multi-core processors and the distribution of the dynamic requests service time. Therefore, the scheduling algorithms couldn't fully exploit the performance of multi-core processors. To solve this problem, we proposed the new requests scheduling algorithm based on the dynamic weights of request queues. Simulation experiments have been done to evaluate the new algorithm. The experiment results show that the proposed algorithm could solve the load imbalance between cores in long period and avoid the problem of ping-pong effect in multi-core systems.","PeriodicalId":206490,"journal":{"name":"2014 International Conference on Service Sciences","volume":"69 805-806 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116542965","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 VOP-based Value Analysis and Optimization Method for Service Selection and Composition","authors":"Chao Ma, Xiaofei Xu, Zhongjie Wang","doi":"10.1109/ICSS.2014.36","DOIUrl":"https://doi.org/10.1109/ICSS.2014.36","url":null,"abstract":"Service selection and composition are important issues to realize IT-enabled service systems. Service stakeholders obtain different service values in the solutions of service selection and composition with the same function but different QoS. The service value achieved from service systems is a critical factor to evaluate and to select the suitable services for the solution of service selection and composition. A value analysis and optimization method for service selection and composition based on value-oriented priority (VOP) is presented in this paper. Firstly, the quantitative analysis method of VOP-based service elements is presented, which includes value contribution analysis, sensitivity analysis and trade-off point analysis. Then the value optimization model for minimal cost is given for solving the problems between expected service values and the constraints of service systems. In order to solve this service value optimization problem, a VOP-based artificial bee colony (VOPABC) algorithm is proposed. Finally, the validity of VOPABC algorithm is proved through simulation experiments.","PeriodicalId":206490,"journal":{"name":"2014 International Conference on Service Sciences","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129958130","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}