Elaheh Shafieibavani, M. Ebrahimi, R. Wong, Fang Chen
It can be time consuming to search Internet news, due to multiple sources reporting repetitive information. Given a query and a set of relevant text articles, query-focused multi-document summarization (QMDS) aims to generate a fluent, well-organized, and compact summary that answers the query. While QMDS helps to summarize search results, most top-performing systems for this purpose remain largely extractive. Extractive summarization extracts a group of sentences and concatenates them. In this paper, we propose a summarization service based on abstractive QMDS using multi-sentence compression (MSC). Our proposed service generates a novel summary representing the gist of the content of the source document(s). Experiments using popular summarization benchmark datasets demonstrate the effectiveness of the proposed service.
{"title":"A Query-Based Summarization Service from Multiple News Sources","authors":"Elaheh Shafieibavani, M. Ebrahimi, R. Wong, Fang Chen","doi":"10.1109/SCC.2016.13","DOIUrl":"https://doi.org/10.1109/SCC.2016.13","url":null,"abstract":"It can be time consuming to search Internet news, due to multiple sources reporting repetitive information. Given a query and a set of relevant text articles, query-focused multi-document summarization (QMDS) aims to generate a fluent, well-organized, and compact summary that answers the query. While QMDS helps to summarize search results, most top-performing systems for this purpose remain largely extractive. Extractive summarization extracts a group of sentences and concatenates them. In this paper, we propose a summarization service based on abstractive QMDS using multi-sentence compression (MSC). Our proposed service generates a novel summary representing the gist of the content of the source document(s). Experiments using popular summarization benchmark datasets demonstrate the effectiveness of the proposed service.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122548241","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}
D. Schäfer, A. Weiss, M. Tariq, V. Andrikopoulos, Santiago Gómez Sáez, Lukas Krawczyk, K. Rothermel
The workflow technology is the de facto standard for managing business processes. Today, workflows are even used for automating interactions and collaborations between business partners, e.g., for enabling just-in-time production. Every workflow that is part of such a collaboration needs to be highly available. Otherwise, the business operations, e.g., the production, might be hindered or even stopped. Since today's business partners are scattered across the globe, the workflows are executed in a highly distributed and heterogeneous environment. Those environments are, however, failure-prone and, thus, providing availability is not trivial. In this work, we improve availability by replicating workflow executions, while ensuring that the outcome is the same as in a non-replicated execution. For making workflow replication easily usable with current workflow technology, we derive the requirements for modeling a workflow replication system. Then, we propose the HAWKS system, which adheres to the previously specified requirements and is compatible with current technology. We implement a proof-of-concept in the open-source workflow execution engine Apache ODE for demonstrating this compatibility. Finally, we extensively evaluate the impact of using HAWKS in terms of performance and availability in the presence of failures.
{"title":"HAWKS: A System for Highly Available Executions of Workflows","authors":"D. Schäfer, A. Weiss, M. Tariq, V. Andrikopoulos, Santiago Gómez Sáez, Lukas Krawczyk, K. Rothermel","doi":"10.1109/SCC.2016.24","DOIUrl":"https://doi.org/10.1109/SCC.2016.24","url":null,"abstract":"The workflow technology is the de facto standard for managing business processes. Today, workflows are even used for automating interactions and collaborations between business partners, e.g., for enabling just-in-time production. Every workflow that is part of such a collaboration needs to be highly available. Otherwise, the business operations, e.g., the production, might be hindered or even stopped. Since today's business partners are scattered across the globe, the workflows are executed in a highly distributed and heterogeneous environment. Those environments are, however, failure-prone and, thus, providing availability is not trivial. In this work, we improve availability by replicating workflow executions, while ensuring that the outcome is the same as in a non-replicated execution. For making workflow replication easily usable with current workflow technology, we derive the requirements for modeling a workflow replication system. Then, we propose the HAWKS system, which adheres to the previously specified requirements and is compatible with current technology. We implement a proof-of-concept in the open-source workflow execution engine Apache ODE for demonstrating this compatibility. Finally, we extensively evaluate the impact of using HAWKS in terms of performance and availability in the presence of failures.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"66 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114016829","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}
The concept of containerization and virtualization is getting traction in the cloud based IT environments. Docker engine is popular implementation for simplifying and streamlining containerization technology. IT industry realizes numerous automation and acceleration features and facilities through the embracement of the Docker-sponsored containerization paradigm, which is an operating system (OS)-level and lightweight virtualization. However the security issues affect the widespread and confident usage of Docker platform. In this paper, we have discussed important security issues of the Docker containers as well as the related work that is being carried out in this area. Also we have proposed security algorithms and methods to address DoS attacks related issues in the Docker container technology. The preliminary experiments and testing of the security methods are promising.
{"title":"Securing Docker Containers from Denial of Service (DoS) Attacks","authors":"Jeeva Chelladhurai, P. Chelliah, S. Kumar","doi":"10.1109/SCC.2016.123","DOIUrl":"https://doi.org/10.1109/SCC.2016.123","url":null,"abstract":"The concept of containerization and virtualization is getting traction in the cloud based IT environments. Docker engine is popular implementation for simplifying and streamlining containerization technology. IT industry realizes numerous automation and acceleration features and facilities through the embracement of the Docker-sponsored containerization paradigm, which is an operating system (OS)-level and lightweight virtualization. However the security issues affect the widespread and confident usage of Docker platform. In this paper, we have discussed important security issues of the Docker containers as well as the related work that is being carried out in this area. Also we have proposed security algorithms and methods to address DoS attacks related issues in the Docker container technology. The preliminary experiments and testing of the security methods are promising.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125022380","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}
Enterprises today are keen to unlock new business values of their legacy services towards new trends (e.g., cloud and mobile). To accelerate such process, automatic feature location techniques can enable developers to rapidly locate/understand implementations of certain services (e.g., services to expose, transform or improve). Existing feature location techniques [1-3, 5-10, 32] provide a good foundation but have several key limitations: limited leverage of description sources, less considerations of internal behaviors, and ineffectiveness for the identification of service-relevant code entries. To address these limitations, we propose a behavior model based feature location approach and implement a tool named BMLocator. In the offline phase, BMLocator applies Natural Language Processing (NLP) techniques and static code analysis to extract “behavior models” of code units via considering multiple information sources. While in the online phase, given a service description, BMLocator first extracts its behavior model and then recommends service-relevant code units/entries by matching its behavior model with code units under analysis. Through evaluations with public service requests of open-source projects (e.g., Tomcat and Hadoop), we show that the approach is more effective in recommending service-relevant code entries (e.g., most of entries are prioritized as the first ones) than existing techniques (i.e., TopicXP[37], CVSSearch[6]).
{"title":"What Code Implements Such Service? A Behavior Model Based Feature Location Approach","authors":"Guangtai Liang, Yabin Dang, Hao Chen, Lijun Mei, Shaochun Li, Yi-Min Chee","doi":"10.1109/SCC.2016.23","DOIUrl":"https://doi.org/10.1109/SCC.2016.23","url":null,"abstract":"Enterprises today are keen to unlock new business values of their legacy services towards new trends (e.g., cloud and mobile). To accelerate such process, automatic feature location techniques can enable developers to rapidly locate/understand implementations of certain services (e.g., services to expose, transform or improve). Existing feature location techniques [1-3, 5-10, 32] provide a good foundation but have several key limitations: limited leverage of description sources, less considerations of internal behaviors, and ineffectiveness for the identification of service-relevant code entries. To address these limitations, we propose a behavior model based feature location approach and implement a tool named BMLocator. In the offline phase, BMLocator applies Natural Language Processing (NLP) techniques and static code analysis to extract “behavior models” of code units via considering multiple information sources. While in the online phase, given a service description, BMLocator first extracts its behavior model and then recommends service-relevant code units/entries by matching its behavior model with code units under analysis. Through evaluations with public service requests of open-source projects (e.g., Tomcat and Hadoop), we show that the approach is more effective in recommending service-relevant code entries (e.g., most of entries are prioritized as the first ones) than existing techniques (i.e., TopicXP[37], CVSSearch[6]).","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125318850","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}
Kugamoorthy Gajananan, Aly Megahed, M. Abe, Taiga Nakamura, Mark A. Smith
Information technology (IT) service providers competing for high valued contracts need to produce a compelling proposal with competitive price. The traditional approach to pricing IT service deals, which builds up the bottom-up costs from the hierarchy of services, is often time consuming, resource intensive, and only available late as it requires granular information of a solution. Recent work on top-down pricing approach enables efficient and early estimates of cost and prices using high level services to overcome and complement these problems. In this paper, we describe an extended pricing method for top-down pricing using the secondary service level. The method makes use of data lower level services to calculate improved estimates, yet still requires minimal input. We compare the previous and new approaches based on industrial data on historical and market deals, and demonstrate that the new approach can generate more accurate estimates. In addition, we also show that mining historical data would yield more accurate estimation than using market data for services, experimental results are in consistent with our findings in previous work.
{"title":"A Top-Down Pricing Algorithm for IT Service Contracts Using Lower Level Service Data","authors":"Kugamoorthy Gajananan, Aly Megahed, M. Abe, Taiga Nakamura, Mark A. Smith","doi":"10.1109/SCC.2016.99","DOIUrl":"https://doi.org/10.1109/SCC.2016.99","url":null,"abstract":"Information technology (IT) service providers competing for high valued contracts need to produce a compelling proposal with competitive price. The traditional approach to pricing IT service deals, which builds up the bottom-up costs from the hierarchy of services, is often time consuming, resource intensive, and only available late as it requires granular information of a solution. Recent work on top-down pricing approach enables efficient and early estimates of cost and prices using high level services to overcome and complement these problems. In this paper, we describe an extended pricing method for top-down pricing using the secondary service level. The method makes use of data lower level services to calculate improved estimates, yet still requires minimal input. We compare the previous and new approaches based on industrial data on historical and market deals, and demonstrate that the new approach can generate more accurate estimates. In addition, we also show that mining historical data would yield more accurate estimation than using market data for services, experimental results are in consistent with our findings in previous work.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128428184","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}
Mohamed Mohamed, Obinna Anya, T. Sakairi, S. Tata, N. Mandagere, Heiko Ludwig
Managing service quality in heterogeneous Cloud environments is complex: different Cloud providers expose different management interfaces. To manage Service Level Agreements (SLAs) in this context, we have developed the rSLA framework that enables fast setup of SLA monitoring in dynamic and heterogeneous Cloud environments. The rSLA framework is made up of three main components: the rSLA language to formally represent SLAs, the rSLA Service, which interprets the SLAs and implements the behavior specified in them, and a set of Xlets - lightweight, dynamically bound adapters to monitoring and controlling interfaces. In this paper, we present the rSLA framework, and describe how it enables the monitoring and enforcement of service level agreements for heterogeneous Cloud services.
{"title":"The rSLA Framework: Monitoring and Enforcement of Service Level Agreements for Cloud Services","authors":"Mohamed Mohamed, Obinna Anya, T. Sakairi, S. Tata, N. Mandagere, Heiko Ludwig","doi":"10.1109/SCC.2016.87","DOIUrl":"https://doi.org/10.1109/SCC.2016.87","url":null,"abstract":"Managing service quality in heterogeneous Cloud environments is complex: different Cloud providers expose different management interfaces. To manage Service Level Agreements (SLAs) in this context, we have developed the rSLA framework that enables fast setup of SLA monitoring in dynamic and heterogeneous Cloud environments. The rSLA framework is made up of three main components: the rSLA language to formally represent SLAs, the rSLA Service, which interprets the SLAs and implements the behavior specified in them, and a set of Xlets - lightweight, dynamically bound adapters to monitoring and controlling interfaces. In this paper, we present the rSLA framework, and describe how it enables the monitoring and enforcement of service level agreements for heterogeneous Cloud services.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131684913","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}
Jinhui Yao, M. Shepherd, Jing Zhou, Lina Fu, Dennis Quebe, J. Echols, Xuejin Wen
Service-oriented thinking is one of the fastest growing paradigms in information technology, with relevance to many other disciplines. Service-oriented analytic workflows can bring together various analytic computing tools and compute resources offered as services to answer complex research questions. The current healthcare system in United States is experiencing fundamental transformation as it moves from a volume-based business to a value-based business. One strategy that healthcare organizations start to deploy is leveraging their healthcare data to gain insights for optimizing their operation. Therefore it is perfectly logical to extend the application of service-oriented analytic workflows to population health studies, as these rely on both medical expertise and processing of large data sets to serve end users of various backgrounds and skill sets. However, in the practical application of such service oriented approach, the user often finds it difficult to choose the right services or workflows that can help them to find the answers to their questions. To tackle this problem, we propose a heuristic recommendation method based on the feature significance. The user submits an enquiry, then based on which, the system will recommend the services and compositions that are likely to produce meaningful answers. In this paper, we will elaborate the interactions between different roles in a service oriented analytic system, develop the modeling to illustrate the relations among enquiry, features, services and workflows, propose the algorithm for service recommendation, architect the system and show a reference implementation of a prototype.
{"title":"Recommending Analytic Services for Population Health Studies Based on Feature Significance","authors":"Jinhui Yao, M. Shepherd, Jing Zhou, Lina Fu, Dennis Quebe, J. Echols, Xuejin Wen","doi":"10.1109/SCC.2016.67","DOIUrl":"https://doi.org/10.1109/SCC.2016.67","url":null,"abstract":"Service-oriented thinking is one of the fastest growing paradigms in information technology, with relevance to many other disciplines. Service-oriented analytic workflows can bring together various analytic computing tools and compute resources offered as services to answer complex research questions. The current healthcare system in United States is experiencing fundamental transformation as it moves from a volume-based business to a value-based business. One strategy that healthcare organizations start to deploy is leveraging their healthcare data to gain insights for optimizing their operation. Therefore it is perfectly logical to extend the application of service-oriented analytic workflows to population health studies, as these rely on both medical expertise and processing of large data sets to serve end users of various backgrounds and skill sets. However, in the practical application of such service oriented approach, the user often finds it difficult to choose the right services or workflows that can help them to find the answers to their questions. To tackle this problem, we propose a heuristic recommendation method based on the feature significance. The user submits an enquiry, then based on which, the system will recommend the services and compositions that are likely to produce meaningful answers. In this paper, we will elaborate the interactions between different roles in a service oriented analytic system, develop the modeling to illustrate the relations among enquiry, features, services and workflows, propose the algorithm for service recommendation, architect the system and show a reference implementation of a prototype.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122351497","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}
Suman Roy, A. Sajeev, A. Gopichand, A. Bhattacharya
Business process models expressed in languages such as BPMN (Business Process Model and Notation) play a critical role in implementing the workflows in modern organizations. However, control flow errors such as deadlock and lack of synchronization as well as syntactic errors arising out of poor modeling practices often occur in industrial process models. In this paper, we provide an empirical diagnostic analysis of such errors for real-life industrial process models. The investigation involved models from different application domains. It turns out that error frequency has non-linear relation with error depth (the maximum depth at which an error occurred) across models from all domains. Error occurrence has statistically significant correlations (p <; 0.0001) with the size of sub-processes as well as with the swim-lane interactions, however only the former correlation is strong (Spearman's ρ = 0.579). We also develop a logistic regression model to estimate error probability in terms of the following metrics: sub-process size, coefficient of connectivity, sequentiality and structuredness; the predictive model fits well with the data (χ2(4, N = 1261) = 720.68, p <; 0.001).
用BPMN(业务流程模型和符号)等语言表示的业务流程模型在实现现代组织中的工作流方面发挥着关键作用。然而，控制流错误(如死锁和缺乏同步)以及由不良建模实践引起的语法错误经常发生在工业流程模型中。在本文中，我们为现实工业过程模型提供了这种误差的实证诊断分析。调查涉及来自不同应用领域的模型。结果表明，在所有领域的模型中，错误频率与错误深度(错误发生的最大深度)呈非线性关系。错误发生率与统计学显著相关(p <;0.0001)与子过程的大小以及泳道相互作用有关，但只有前者的相关性很强(斯皮尔曼ρ = 0.579)。我们还开发了一个逻辑回归模型，根据以下指标来估计错误概率:子过程大小、连通性系数、顺序性和结构性;预测模型与数据拟合良好(χ2(4, N = 1261) = 720.68, p <;0.001)。
{"title":"An Empirical Analysis of Diagnosis of Industrial Business Processes at Sub-process Levels","authors":"Suman Roy, A. Sajeev, A. Gopichand, A. Bhattacharya","doi":"10.1109/SCC.2016.33","DOIUrl":"https://doi.org/10.1109/SCC.2016.33","url":null,"abstract":"Business process models expressed in languages such as BPMN (Business Process Model and Notation) play a critical role in implementing the workflows in modern organizations. However, control flow errors such as deadlock and lack of synchronization as well as syntactic errors arising out of poor modeling practices often occur in industrial process models. In this paper, we provide an empirical diagnostic analysis of such errors for real-life industrial process models. The investigation involved models from different application domains. It turns out that error frequency has non-linear relation with error depth (the maximum depth at which an error occurred) across models from all domains. Error occurrence has statistically significant correlations (p <; 0.0001) with the size of sub-processes as well as with the swim-lane interactions, however only the former correlation is strong (Spearman's ρ = 0.579). We also develop a logistic regression model to estimate error probability in terms of the following metrics: sub-process size, coefficient of connectivity, sequentiality and structuredness; the predictive model fits well with the data (χ2(4, N = 1261) = 720.68, p <; 0.001).","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128406837","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}
Simulation is known to be an effective technique to understand and manage traffic in cities of developed countries. However, in developing countries, traffic management is lacking due to a wide diversity of vehicles on the road, their chaotic movement, little instrumentation to sense traffic state and limited funds to create IT and physical infrastructure to ameliorate the situation. Under these conditions, in this paper, we present our approach of using the Megaffic traffic simulator as a service to gain actionable insights for two use-cases and cities in India, a first. Our approach is general to be readily used in other use cases and cities, and our results give new insights: (a) using demographics data, traffic demand can be reduced if timings of government offices are altered in Delhi, (b) using a mobile company's Call Data Record (CDR) data to mine trajectories anonymously, one can take effective traffic actions while organizing events in Mumbai at local scale.
{"title":"Case Studies in Managing Traffic in a Developing Country with Privacy-Preserving Simulation as a Service","authors":"B. Srivastava, M. Pallan, M. Madhavan, Ravi Kokku","doi":"10.1109/SCC.2016.130","DOIUrl":"https://doi.org/10.1109/SCC.2016.130","url":null,"abstract":"Simulation is known to be an effective technique to understand and manage traffic in cities of developed countries. However, in developing countries, traffic management is lacking due to a wide diversity of vehicles on the road, their chaotic movement, little instrumentation to sense traffic state and limited funds to create IT and physical infrastructure to ameliorate the situation. Under these conditions, in this paper, we present our approach of using the Megaffic traffic simulator as a service to gain actionable insights for two use-cases and cities in India, a first. Our approach is general to be readily used in other use cases and cities, and our results give new insights: (a) using demographics data, traffic demand can be reduced if timings of government offices are altered in Delhi, (b) using a mobile company's Call Data Record (CDR) data to mine trajectories anonymously, one can take effective traffic actions while organizing events in Mumbai at local scale.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128819399","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}
The realization of business process with services has gain more importance in the last decade. Several organizations are focusing nowadays in the modeling and execution of their business processes, seizing the advantages provided by both the BPMN 2.0 notation which allows these models to be executed, and the emergence of BPMS platforms which are able to execute business processes invoking internal and external services from partners and/or the cloud when needed. Although many lifecycle proposals exist to guide the definition and management of both business process and services, there is no clear relationship defined between them, i.e. how services should be defined and managed to support business processes. This is a key element that should be taken into account when implementing services for this kind of systems, in order to systematize the work and obtain better results. In this paper we present a service lifecycle to support business processes, which helps developing services for business process systems.
{"title":"A Services Lifecycle to Support the Business Processes Lifecycle: From Modeling to Execution and Beyond","authors":"Andrea Delgado","doi":"10.1109/SCC.2016.117","DOIUrl":"https://doi.org/10.1109/SCC.2016.117","url":null,"abstract":"The realization of business process with services has gain more importance in the last decade. Several organizations are focusing nowadays in the modeling and execution of their business processes, seizing the advantages provided by both the BPMN 2.0 notation which allows these models to be executed, and the emergence of BPMS platforms which are able to execute business processes invoking internal and external services from partners and/or the cloud when needed. Although many lifecycle proposals exist to guide the definition and management of both business process and services, there is no clear relationship defined between them, i.e. how services should be defined and managed to support business processes. This is a key element that should be taken into account when implementing services for this kind of systems, in order to systematize the work and obtain better results. In this paper we present a service lifecycle to support business processes, which helps developing services for business process systems.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115046959","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：