{"title":"Enabling Advanced Loading Strategies for Data Intensive Web Services","authors":"Quirino Zagarese, G. Canfora, E. Zimeo, F. Baude","doi":"10.1109/ICWS.2012.30","DOIUrl":"https://doi.org/10.1109/ICWS.2012.30","url":null,"abstract":"Improving performance of Web services interactions is an important factor to burst the adoption of SOAin mission-critical applications, especially when they deal with large business objects whose transfer time is not negligible. Designing messages dynamic granularity (offloading) is a key challenge for achieving good performances. This requires the server being able to predict the pieces of data actually used by clients in order to send only such data. However, exact prediction is not easy, and consequently lazy interactions are needed to transfer additional data whenever the prediction fails. To preserve semantics, lazy accesses to the results of a Web service interaction need to work on a dedicated copy of the business object stored as application state. Thus, dynamic offloading can experience an overhead due to a prediction failure, which is the sum of round-trip and storage access delays, which could compromise the benefits of the technique. This paper improves our previous work enabling dynamic offloading for both IN and OUT parameters, and analyses how attributes copies impact on the technique, by comparing the overheads introduced by different storage technologies in a real implementation of a Web services framework that extends CXF. More specifically, we quantitatively characterize the execution contexts that make dynamic offloading effective, and the expected accuracy of the predictive strategy to have a gain in term of response time compared to plain services invocations. Finally, the paper introduces the Attribute Loading Delegation technique that enables optimized data-transfers for those applications where data-intensive multiple-interactions take place.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131692491","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":"Decision Tree Learning from Incomplete QoS to Bootstrap Service Recommendation","authors":"Qi Yu","doi":"10.1109/ICWS.2012.90","DOIUrl":"https://doi.org/10.1109/ICWS.2012.90","url":null,"abstract":"Collaborative Filtering (CF) has been increasingly employed as an effective vehicle for providing personalized service recommendations in service computing. CF exploits historical user-service interaction information to predict the preference of service users. A key challenge faced by CF is to handle new users with no previous interaction information. We present a novel strategy that integrates Matrix Factorization (MF) with decision tree learning to bootstrap service recommendation systems. The proposed strategy first employs MF to partition existing users into a set of user groups. In practice, only a small amount of user-service interaction information is observed. The MF based user partitioning scheme also provides a way to estimate the missing interaction information based on the group structure. The tree learning algorithm then leverages these estimated information and exploits user groups as class labels to learn a decision tree. Few highly discriminative services are identified as tree nodes to adaptively query a new user based on the interaction results with the prior services in the tree. Through a short and intuitive bootstrapping process, the new user is classified into one of the user groups, via which the user's preference is predicted. We conduct a set of experiments on real-world service data to demonstrate the effectiveness of the proposed bootstrapping strategy.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131067579","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":"Web Services Composition Verification Using Satisfiability Solving","authors":"Ehtesham Zahoor, O. Perrin, C. Godart","doi":"10.1109/ICWS.2012.75","DOIUrl":"https://doi.org/10.1109/ICWS.2012.75","url":null,"abstract":"In this paper, we propose an approach for the verification of declarative Web services composition processes using satisfiability solving. The need for the satisfiability solving approach stems from the nature of declarative processes which are defined by only specifying the constraints that mark the boundary of the solution to the composition process. As a result the state space of a declarative process can be significantly large, as the process is only partially defined and all the transitions have not been explicitly defined. Further, as the conflict clauses returned by the SAT solver can be significantly large for complex processes and verification requirements, we propose a filtering criteria and defined patterns for identifying the clauses of interest for process verification.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126735065","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":"Verifying GSM-Based Business Artifacts","authors":"P. Gonzalez, Andreas Griesmayer, A. Lomuscio","doi":"10.1109/ICWS.2012.31","DOIUrl":"https://doi.org/10.1109/ICWS.2012.31","url":null,"abstract":"Business artifacts allow to manage operations of business processes by capturing the key concepts and relevant information to guide their work flow. The Guard-Stage- Milestone (GSM) meta-model is a novel formalism for designing business artifacts that features declarative description of the intended behaviour without requiring an explicit specification of the control flow. Its concept of hierarchical structures of stages and explicit rules for the fulfilment of their guards and milestones supports the designing process but poses a challenge for formal verification. We show here how to approach the verification problem by developing a symbolic representation amenable to model checking. The feasibility of the approach is demonstrated by presenting a case study on the direct verification of a GSM model using a tool implementation.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121516214","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}
Hua Liu, Yasmine Charif, Gueyoung Jung, Andres Quiroz, Frank Goetz, Naveen Sharma
{"title":"Towards Simplifying and Automating Business Process Lifecycle Management in Hybrid Clouds","authors":"Hua Liu, Yasmine Charif, Gueyoung Jung, Andres Quiroz, Frank Goetz, Naveen Sharma","doi":"10.1109/ICWS.2012.88","DOIUrl":"https://doi.org/10.1109/ICWS.2012.88","url":null,"abstract":"Business Process Management (BPM) software provides visibility into business processes in organizations of all sizes and helps increase process efficiency continuously. However, the time and effort involved in modeling, deploying and executing a business process is tremendous and as a result organizations struggle to agilely adapt business processes to dynamic business requirements. On the other hand, the growing popularity of cloud computing poses opportunities and challenges on how business processes can leverage resource outsourcing and elasticity. In light of the above, this paper presents a business process management platform that assists business analysts lacking necessary programming expertise by automating manual steps and providing guidance and recommendations to quickly and efficiently design, implement, deploy and execute business processes in a hybrid cloud environment.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116622581","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":"Analytic Profit Optimization of Service-Based Systems","authors":"Xianzhi Wang, Zhongjie Wang, Xiaofei Xu","doi":"10.1109/ICWS.2012.114","DOIUrl":"https://doi.org/10.1109/ICWS.2012.114","url":null,"abstract":"Service computing has become a dominant paradigm enabling the building of complex service-oriented systems, with the aim of business added-value. Because these systems are inevitably based on uncontrollable services on the unpredictable Internet, it is important to find effective ways of maximizing the profit of service-oriented systems in such unreliable environment. In this paper, we propose an analytic approach that employs a build-time analysis of the runtime dynamics of service execution to maximize the net profit from delivering composite services under full probability of uncertainty. We also present methods for improving the optimization efficiency, including reusing intermediate computation results and adopting specialized profit optimization algorithms. The superiority of the proposed approach is both theoretically proved and empirically demonstrated through experiments.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116890172","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":"Linked Social Service: Evolving from an Isolated Service into a Global Social Service Network","authors":"Wuhui Chen, Incheon Paik, R. Komiya","doi":"10.1109/ICWS.2012.21","DOIUrl":"https://doi.org/10.1109/ICWS.2012.21","url":null,"abstract":"In this paper, we propose a methodology to drive innovation from isolated service islands into the global social service network to connect the islands. First, we propose Linked social service-specific principles based on Linked Data principles for publishing services on the open web as linked social services using our new service model, and then an approach is proposed to enable exploitation of a global social service network, providing Linked social service as a service.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129573986","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":"MapReduce-Based Balanced Mining for Closed Frequent Itemset","authors":"Guang-Peng Chen, Yubin Yang, Yao Zhang","doi":"10.1109/ICWS.2012.19","DOIUrl":"https://doi.org/10.1109/ICWS.2012.19","url":null,"abstract":"Mining closed frequent itemset (CFI) plays an essential role in many real-world data mining applications. With the emergence of abundant large-scale data sets, it now turns to be a significant and challenging issue to mine CFI concurrently. This paper proposes a parallel balanced mining algorithm for CFI based on the MapReduce platform. The proposed algorithm adopts Greedy strategy to group items aiming to balance the computation burdens among all parallel tasks, which is consisted of three main steps: (1) Parallel Counting, (2) Global Construction of Frequent List (F_list) and Group Map (G_map), (3) Parallel Mining for Closed Frequent Itemset. Experimental results validate the method and show its effectiveness as satisfied speedup and scalability are both achieved in large-scale CFI mining tasks.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129067833","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-centric Web Services Based on Business Artifacts","authors":"R. Vaculín, F. Heath, R. Hull","doi":"10.1109/ICWS.2012.101","DOIUrl":"https://doi.org/10.1109/ICWS.2012.101","url":null,"abstract":"Existing Web services standards consider data primarily on the level of inputs and outputs specifications, with the major focus on functional aspects of interactions. Majority of applications rely on data sources, but such data sources are not part of the Web service specifications and cannot be accessed directly by clients. The fact that data are treated independently or as second-class citizens severely limits re-use, flexibility, customization and integration options of current Web services. In this paper we suggest to extend the WS specifications by introducing a data-centric Web services model that integrates functional and data perspectives in one coherent framework. The approach is based on Business Artifacts and in particular on the declarative modular Guard-Stage-Milestone (GSM) model. We introduce a Web Data- and Artifact- centric Service (W-DAS) model using GSM in its core which in addition to usual application specific WS operations defines a set of data access interfaces including CRUD operations, artifacts retrieval interface for querying, filtering and sorting data, and operations for arbitrary custom defined ad hoc run-time queries. We discuss W-DAS publish-subscribe mechanisms and implementation.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"10 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120919909","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 Relational Taxonomy of Services for Large Scale Service Repositories","authors":"Yan Wu, Chungang Yan, Zhijun Ding, Pengwei Wang, Changjun Jiang, Mengchu Zhou","doi":"10.1109/ICWS.2012.20","DOIUrl":"https://doi.org/10.1109/ICWS.2012.20","url":null,"abstract":"With the rapid development of service-oriented computing (SOC) and service-oriented architecture (SOA), the number of services is rapidly increasing. How to organize and manage services effectively in repositories to improve the efficiency of service discovery and composition is important. This paper proposes three categorization rules to classify services for a large scale repository to form a relational taxonomy. The service retrieve scope can be drastically narrowed by this taxonomy. Therefore, the efficiency of service discovery and service composition can be greatly improved. We evaluate and compare the performance of the proposed method and other related ones via a publicly available test set, ICEBE05. The experimental results validate the effectiveness and high efficiency of the proposed one.","PeriodicalId":226237,"journal":{"name":"2012 IEEE 19th International Conference on Web Services","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122365472","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}