{"title":"POC: An Optimization Strategy of EV Efficient Travelling","authors":"Jiayuan Li, Jinglin Li, Zhihan Liu","doi":"10.1109/APSCC.2014.17","DOIUrl":"https://doi.org/10.1109/APSCC.2014.17","url":null,"abstract":"The popularity of electric vehicles (EVs) provides great help to solve the increasingly serious energy issues and environmental problems, but it also has limitation such as short driving range and long charging time. This paper proposed an optimization strategy for EVs to travel more efficiently called planed ordered charging (POC for short), that is, spending more time on driving and necessary charging instead of waiting or overcharge. An energy reachable graph is built firstly to protect vehicles from breaking down in the midway. Travel time, including driving time, charging time and waiting time, is taken as the optimization goal. The modeling and solution of travel time is presented. One of the most important contributions of this paper is the proposal of charging station load and how it can be calculated, which well describes waiting time from a macro view. Besides, reservation mechanism for charging is also introduced to achieve the global optimization. Then the planning of efficient travel can be converted to a general graph theory problem by putting time cost onto edge weight of the graph. According to the simulation and experiment, the strategy proposed in this paper is superior to other compared strategies in many aspects.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133906148","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":"Adaptive Web Services Composition for Multi-user","authors":"Yu Lei, Jiantao Zhou","doi":"10.1109/APSCC.2014.33","DOIUrl":"https://doi.org/10.1109/APSCC.2014.33","url":null,"abstract":"In a composite service for multiple users, network position of multiple users are different, leading to users perceptions to one service are different. In addition, network parameter values, which vary due to many reasons (such as network congestions), influence QoS of Web services. We propose a reliable service composition method which uses multiple candidate services to process service requests for a variety of users. Initially, multiple service execution paths for each kind of user requests are calculated. In runtime, the optimal services are chosen according to the current network state. We present an application scenarios for the method.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133684560","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":"Joint Subcarrier Pairing and Power Allocation in OFDMA Cooperative Relay Networks","authors":"Songtao Guo, Jianji Hu, Chunrong He","doi":"10.1109/APSCC.2014.19","DOIUrl":"https://doi.org/10.1109/APSCC.2014.19","url":null,"abstract":"In this paper, we propose a joint subcarrier pairing and power allocation (JS2PA) scheme with fairness based on the Intelligent Water Drop (IWD) optimization method for Orthogonal Frequency Division Multiple Access (OFDMA) cooperative relay networks. The proposed scheme consists of a subcarrier pairing and selection algorithm and a power allocation algorithm. We first formulate the JS2PA problem as a mixed integer programming problem aiming to maximize the total network utility under the constraints of the total and individual power, subcarrier fairness requirement and pairing. To solve the non-convex JS2PA problem, firstly, we propose a subcarrier pairing and selection algorithm based on Hungarian method so as to select the appropriate subcarrier pairs for relaying. Secondly, we provide a power allocation algorithm based on the IWD method (PA-MIWD) in which water drops act as the agents to find the optimal power allocation for each node. Finally, we conduct simulations to validate the proposed algorithms and the results show that the proposed JS2PA scheme outperforms the existing methods in terms of convergence and total network utility.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130134865","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 Petri Net-Based Approach to Service Composition and Monitoring in the IOT","authors":"Rong Yang, Bing Li, Can Cheng","doi":"10.1109/APSCC.2014.11","DOIUrl":"https://doi.org/10.1109/APSCC.2014.11","url":null,"abstract":"Recently, there are many improvements in Internet of Things (IOT). Through the recombination and optimization, the real-world devices can provide their functionality as web services in IOT. However, it is very difficult to cost-effectively access to the Internet of Things due to the environmental changes. In this paper, firstly, a Petri net-based model for service composition in IOT is proposed, which uses a comprehensive performance function rtc (involving reliability, response time and cost) to evaluate the cost-effectiveness. Then, the Find to Optimal algorithm is addressed to find a cost-effective composition path. Furthermore, when environments change dynamically, the FBased Monitor algorithm can well solve the composition. Finally, the experiments prove the soundness and correctness of our model and algorithms.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117154787","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":"Data Organization Patterns for Cloud Enterprise Applications","authors":"Yi Wei, Lei Wu, Shijun Liu, Li Pan, Xiangxu Meng","doi":"10.1109/APSCC.2014.10","DOIUrl":"https://doi.org/10.1109/APSCC.2014.10","url":null,"abstract":"With the popularity of cloud computing and SaaS, enterprises are willing to rent various cloud services and use them in their daily work. However, on-premise applications are still widely used inside enterprises. That is to say, to achieve the goal of business collaboration, a cloud service usually need to obtain business data from multiple sources, which include the relevant on-premise applications and other cloud services. In this paper, we study and summarize data organization and management patterns for cloud enterprise applications from different aspects. Based on these patterns, we propose an innovative cloud-based data organization model (CEDM). Compared with traditional ones, it highlights the characters of resource sharing and reuse. Besides, this model is more convenient for tackling complex data synchronization issues in cloud environment.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"628 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123338944","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 Spatio-temporal Parallel Processing System for Traffic Sensory Data","authors":"Zhuofeng Zhao, Wei Ding, Yanbo Han, Jianwu Wang","doi":"10.1109/APSCC.2014.16","DOIUrl":"https://doi.org/10.1109/APSCC.2014.16","url":null,"abstract":"With the continuous expansion of the scope of traffic sensor networks, traffic sensory data becomes widely available and is continuously being produced. Traffic sensory data gathered by large amounts of sensors show the massive, continuous, streaming and spatio-temporal characteristics compared to traditional traffic data. In order to satisfy the requirements of different applications with these data, we need to have the capability of processing both real-time traffic sensory data in streaming way and historical traffic sensory data in large amount. In this paper, we present an approach and corresponding system for traffic sensory data processing, which is designed to combine spatio-temporal data partition, parallel pipeline processing and stream computing to support traffic sensory data processing in a scalable architecture with real-time guarantee. Three types of applications in real project are also described in detail to show the significant effect gains of the proposed approach and system. Numerical evaluations according to experiment results also show that the system can gain high performance in terms of the processing time of traffic sensory data stream.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128581143","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":"Context-Aware Web Services Recommendation Based on User Preference","authors":"Xiaoliang Fan, Yakun Hu, Ruisheng Zhang","doi":"10.1109/APSCC.2014.20","DOIUrl":"https://doi.org/10.1109/APSCC.2014.20","url":null,"abstract":"Context-Aware Recommender System aims to recommend items not only similar to those already rated with the highest score, but also that could combine the contextual information with the recommendation process. Existing context-aware Web services recommendation methods directly use context as a \"filter\" to discard services that may conflict with the current user's preference. However, the discarded services may be valuable for another user or for the same user under a new context, as one man's trash may be another's treasure. We assume that failing to handle the contextual reasons behind the user preference may introduce inaccurate recommendation, and even significant biases in recommendation. In this work, we propose a novel method dubbed CASR-UP, which aims to exploit the contextual factors of the user preference to improve Quality of Service (QoS) prediction and services recommendation accuracy. Our method consists of three stages: 1) context-aware similarity mining to get the set of users having similar context with the current user, 2) data filtering based on user preference in current context so as to get the invocation records of the services corresponding to the current user's preference, 3) Web services QoS prediction, recommendation and evaluation by Bayesian Inference. Experimental results on WS-Dream dataset is evaluated by both RMSE and MAE. The results show the proposed method improves prediction accuracy and outperforms the compared methods.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116076880","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 Rule-Based Recommendation for Personalization in Social Networks","authors":"Rui Zhang, Yueqi Zhou, Lin Li, Chengming Zou","doi":"10.1109/APSCC.2014.12","DOIUrl":"https://doi.org/10.1109/APSCC.2014.12","url":null,"abstract":"All online social networks gather data that reflects users' profiles, interactive behaviors and shared activities. This data can be used to extract users' interests and make recommendations. According to abundant personal data, recommenders can identify information relevant for individuals. To reveal users' different preferences explicitly, we present a rule-based method which supports different recommendation strategies. Moreover, we also show that this method is effective by conducting experiments on real data.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123322942","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":"Towards Logical Architecture and Formal Analysis of Dependencies between Services","authors":"M. Spichkova, H. Schmidt","doi":"10.1109/APSCC.2014.29","DOIUrl":"https://doi.org/10.1109/APSCC.2014.29","url":null,"abstract":"This paper presents a formal approach to modelling and analysis of data and control flow dependencies between services within remotely deployed distributed systems of services. Our work aims at elaborating for a concrete system, which parts of the system (or system model) are necessary to check a given property. The approach allows services decomposition oriented towards efficient checking of system properties as well as analysis of dependencies within a system.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124496895","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 Multiple Watermarking Scheme with Embedding-Order Identifying Feature","authors":"Z. Jin, Ming Su, G. Wang","doi":"10.1109/APSCC.2014.25","DOIUrl":"https://doi.org/10.1109/APSCC.2014.25","url":null,"abstract":"Digital watermarking is a valid solution to protect copyright of owners. But there is still a difficult problem of copyright disputes as the IBM attack or the interpretation attack when multiple watermarks of multiple authors appear in the same digital media. We provide a new feasible solution, in which a multiple watermarking scheme using complete complementary code based on the spread spectrum is adopted, and the scaling parameters are used to identify embedding-order of different users. The independency of multiple watermarks can also be used to protect privacy of different users.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124540908","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}