A. Longo, M. Zappatore, Mario Alessandro Bochicchio, S. Navathe
Local transportation services are an essential component of all modern urban infrastructures. The constantly growing requirements and expectations from several stakeholders, ranging from public authorities, service providers and customers, demand a deep rethinking of the entire system. Such services must be oriented towards sustainability and everyday living, thus needing significant Quality of Service (QoS) improvement in this sector. This paper aims at highlighting the main challenges for modeling and implementing the relationships between the stakeholders in the public transportation sector and proposes a systemic modeling approach that would serve to design, implement, and monitor a QoS-regulatory document. A taxonomy of quality indicators and service levels are proposed along with metrics on the basis of athe European and Italian regulatory background as well as of the public transportation service lifecycle model. The proposed approach has been validated by developing a service analytics system deployed at the regional transportation agency in the Apulia administrative region of Southern Italy.
{"title":"Modeling and Evaluating Relationships and Service Contracts in Public Transportation: A Pilot Project in Italy","authors":"A. Longo, M. Zappatore, Mario Alessandro Bochicchio, S. Navathe","doi":"10.1109/SCC.2016.72","DOIUrl":"https://doi.org/10.1109/SCC.2016.72","url":null,"abstract":"Local transportation services are an essential component of all modern urban infrastructures. The constantly growing requirements and expectations from several stakeholders, ranging from public authorities, service providers and customers, demand a deep rethinking of the entire system. Such services must be oriented towards sustainability and everyday living, thus needing significant Quality of Service (QoS) improvement in this sector. This paper aims at highlighting the main challenges for modeling and implementing the relationships between the stakeholders in the public transportation sector and proposes a systemic modeling approach that would serve to design, implement, and monitor a QoS-regulatory document. A taxonomy of quality indicators and service levels are proposed along with metrics on the basis of athe European and Italian regulatory background as well as of the public transportation service lifecycle model. The proposed approach has been validated by developing a service analytics system deployed at the regional transportation agency in the Apulia administrative region of Southern Italy.","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":"128555235","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}
Social networking sites (SNSs), such as Facebook, have become part of everyday use. While many individuals and organizations use SNSs to maintain contact and to do a variety of services, attackers may see them as a prime target for performing different types of attacks. Phishing is one of the most common attacks, and one of the most challenging problems in SNSs. Existing human behaviours literature related to social capital, habitual usage, and risk perception shows a strong indication that it is possible to predict Facebook users' susceptibility to phishing victimization based on their demographics, anonymity, social capital, and risk perception. Using quantitative survey, this paper aims to predict Facebook users' susceptibility to phishing victimization based on these factors. Among the hypothesized factors, we found that it is possible to predict user's susceptibility to phishing victimization based on the user's anonymity status, the number of all friends the user is connected to, the number of strangers that the user is connected to, and the number of close friends that the user is connected to.
{"title":"Toward Predicting Susceptibility to Phishing Victimization on Facebook","authors":"Z. Alqarni, A. Algarni, Yue Xu","doi":"10.1109/SCC.2016.61","DOIUrl":"https://doi.org/10.1109/SCC.2016.61","url":null,"abstract":"Social networking sites (SNSs), such as Facebook, have become part of everyday use. While many individuals and organizations use SNSs to maintain contact and to do a variety of services, attackers may see them as a prime target for performing different types of attacks. Phishing is one of the most common attacks, and one of the most challenging problems in SNSs. Existing human behaviours literature related to social capital, habitual usage, and risk perception shows a strong indication that it is possible to predict Facebook users' susceptibility to phishing victimization based on their demographics, anonymity, social capital, and risk perception. Using quantitative survey, this paper aims to predict Facebook users' susceptibility to phishing victimization based on these factors. Among the hypothesized factors, we found that it is possible to predict user's susceptibility to phishing victimization based on the user's anonymity status, the number of all friends the user is connected to, the number of strangers that the user is connected to, and the number of close friends that the user is connected to.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"12 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":"124688882","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}
Molka Rekik, Khouloud Boukadi, Nour Assy, Walid Gaaloul, H. Ben-Abdallah
A configurable process model is a generic model from which an enterprise can derive and execute process variants that meet its specific needs and contexts. With the advent of cloud computing and its economic pay-per-use model, enterprises are increasingly outsourcing partially or totally their process variants to cloud providers, and recently to cloud federations. A main challenge in this regard is to allocate optimally cloud resources to the process variants' activities. More specifically, an enterprise may be interested in outsourcing only those that result in an optimal deployment. Due to the diversity of the enterprise QoS requirements, the heterogeneity of resources offered by the cloud federation and the large number of possible configurations in a configurable process model, finding the optimal process variant deployment becomes a highly challenging problem. In this paper, we propose a novel approach to solve this problem through a binary/(0-1) linear program with a quadratic objective function under a set of constraints pertinent to both the enterprise and cloud federation requirements. Our prototypical implementation demonstrates the feasibility and the results of our experiments highlight the effectiveness of our proposed solution.
{"title":"A Linear Program for Optimal Configurable Business Processes Deployment into Cloud Federation","authors":"Molka Rekik, Khouloud Boukadi, Nour Assy, Walid Gaaloul, H. Ben-Abdallah","doi":"10.1109/SCC.2016.31","DOIUrl":"https://doi.org/10.1109/SCC.2016.31","url":null,"abstract":"A configurable process model is a generic model from which an enterprise can derive and execute process variants that meet its specific needs and contexts. With the advent of cloud computing and its economic pay-per-use model, enterprises are increasingly outsourcing partially or totally their process variants to cloud providers, and recently to cloud federations. A main challenge in this regard is to allocate optimally cloud resources to the process variants' activities. More specifically, an enterprise may be interested in outsourcing only those that result in an optimal deployment. Due to the diversity of the enterprise QoS requirements, the heterogeneity of resources offered by the cloud federation and the large number of possible configurations in a configurable process model, finding the optimal process variant deployment becomes a highly challenging problem. In this paper, we propose a novel approach to solve this problem through a binary/(0-1) linear program with a quadratic objective function under a set of constraints pertinent to both the enterprise and cloud federation requirements. Our prototypical implementation demonstrates the feasibility and the results of our experiments highlight the effectiveness of our proposed solution.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"70 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":"116579989","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}
E. Ahvar, S. Ahvar, Z. Mann, N. Crespi, Joaquín García, R. Glitho
Distributed clouds have recently attracted many cloud providers and researchers as a topic of intensive interest. High energy costs and carbon emissions are two significant problems in distributed clouds. Due to the geographic distribution of data centers (DCs), there are a variety of resources, energy prices and carbon emission rates to consider in a distributed cloud, which makes the placement of virtual machines (VMs) for cost and carbon efficiency even more critical than in centralized clouds. Most previous work in this field investigated either optimizing cost without considering the amount of produced carbon or vice versa. This paper presents a cost and carbon emission-efficient VM placement method (CACEV) in distributed clouds. CACEV considers geographically varying energy prices and carbon emission rates as well as optimizing both network and server resources at the same time. By combining prediction-based A* algorithm with Fuzzy Sets technique, CACEV makes an intelligent decision to optimize cost and carbon emission for providers. Simulation results show the applicability and performance of CACEV.
{"title":"CACEV: A Cost and Carbon Emission-Efficient Virtual Machine Placement Method for Green Distributed Clouds","authors":"E. Ahvar, S. Ahvar, Z. Mann, N. Crespi, Joaquín García, R. Glitho","doi":"10.1109/SCC.2016.43","DOIUrl":"https://doi.org/10.1109/SCC.2016.43","url":null,"abstract":"Distributed clouds have recently attracted many cloud providers and researchers as a topic of intensive interest. High energy costs and carbon emissions are two significant problems in distributed clouds. Due to the geographic distribution of data centers (DCs), there are a variety of resources, energy prices and carbon emission rates to consider in a distributed cloud, which makes the placement of virtual machines (VMs) for cost and carbon efficiency even more critical than in centralized clouds. Most previous work in this field investigated either optimizing cost without considering the amount of produced carbon or vice versa. This paper presents a cost and carbon emission-efficient VM placement method (CACEV) in distributed clouds. CACEV considers geographically varying energy prices and carbon emission rates as well as optimizing both network and server resources at the same time. By combining prediction-based A* algorithm with Fuzzy Sets technique, CACEV makes an intelligent decision to optimize cost and carbon emission for providers. Simulation results show the applicability and performance of CACEV.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"337 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":"115806051","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 lack of a framework that provides for business process outsourcing to the cloud hinders the widespread adoption of this emerging computing environment. Unlike the multiple decision methods related to outsourcing classical applications in a cloud environment, there is no standard dealing with the outsourcing of business processes starting from the enterprise business concerns to select the appropriate business process to be outsourced, to a finer level of decision to select the business process fragments to be supported by the cloud. In this paper, we first present an end-to-end framework that addresses some of these shortages. The presented framework, entitled Business Process Outsourcing to the cloud (BPO2C), covers the outsourcing process lifecyle. Indeed, the BPO2C framework elaborates several phases pertinent to the outsourcing decision, starting from the elaboration of the enterprise business motivations to identify the implied business process in the outsourcing decision, to the identification of outsourceable process fragments to minimize the business process costs, duration and to mitigate cloud risks.
{"title":"A Comprehensive Framework for Business Process Outsourcing to the Cloud","authors":"M. Rekik, Khouloud Boukadi, H. Ben-Abdallah","doi":"10.1109/SCC.2016.30","DOIUrl":"https://doi.org/10.1109/SCC.2016.30","url":null,"abstract":"The lack of a framework that provides for business process outsourcing to the cloud hinders the widespread adoption of this emerging computing environment. Unlike the multiple decision methods related to outsourcing classical applications in a cloud environment, there is no standard dealing with the outsourcing of business processes starting from the enterprise business concerns to select the appropriate business process to be outsourced, to a finer level of decision to select the business process fragments to be supported by the cloud. In this paper, we first present an end-to-end framework that addresses some of these shortages. The presented framework, entitled Business Process Outsourcing to the cloud (BPO2C), covers the outsourcing process lifecyle. Indeed, the BPO2C framework elaborates several phases pertinent to the outsourcing decision, starting from the elaboration of the enterprise business motivations to identify the implied business process in the outsourcing decision, to the identification of outsourceable process fragments to minimize the business process costs, duration and to mitigate cloud risks.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"36 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":"122402054","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}
Marlon Cordeiro Domenech, Leonardo R. P. Rauta, Marcelo Dornbusch Lopes, Paulo H. Da Silva, R. C. Silva, Benjamin W. Mezger, Michelle S. Wangham
Remote monitoring and intelligent intervention of machines are essentials in a smart industrial environment. However, the heterogeneity of machines makes it difficult to construct solutions for this purpose. This work aims to describe how to provide smart industrial environments using Smart Gateways, RESTful Web Services, and Cloud Computing. In the proposed solution, a Smart Gateway is responsible for representing a given machines' resources as RESTful Web Services for clients and Web applications, sending monitored data to a persistence service in a Cloud, while also allowing for the remote control of these machines. As a proof of concept, a smart industrial environment was developed from the considerations of a real case study at an apparel factory. Functional testing and performance evaluation confirmed the feasibility of the solution in this case study.
{"title":"Providing a Smart Industrial Environment with the Web of Things and Cloud Computing","authors":"Marlon Cordeiro Domenech, Leonardo R. P. Rauta, Marcelo Dornbusch Lopes, Paulo H. Da Silva, R. C. Silva, Benjamin W. Mezger, Michelle S. Wangham","doi":"10.1109/SCC.2016.89","DOIUrl":"https://doi.org/10.1109/SCC.2016.89","url":null,"abstract":"Remote monitoring and intelligent intervention of machines are essentials in a smart industrial environment. However, the heterogeneity of machines makes it difficult to construct solutions for this purpose. This work aims to describe how to provide smart industrial environments using Smart Gateways, RESTful Web Services, and Cloud Computing. In the proposed solution, a Smart Gateway is responsible for representing a given machines' resources as RESTful Web Services for clients and Web applications, sending monitored data to a persistence service in a Cloud, while also allowing for the remote control of these machines. As a proof of concept, a smart industrial environment was developed from the considerations of a real case study at an apparel factory. Functional testing and performance evaluation confirmed the feasibility of the solution in this case study.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"14 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":"123515682","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}
Takao Nakaguchi, Yohei Murakami, Donghui Lin, T. Ishida
Service composition is the technique of creating new services by combining several existing services. Composite services can be also combined with other composite services to form nested or hierarchical services. Given that service composition depends on the interoperability created by using common network protocols and invocation interfaces, a composite service can have an impractically large number of variations depending of the number of available services and the composite's structure. It is hard to enumerate and maintain all variations possible. To solve this problem, we introduce a higher-order function that can take functions as parameters to allow function invocation. In concrete terms, we propose the following methods: (1) a hierarchical service composition description by introducing higher-order functions and (2) a method to implement (1) in an existing composite service execution system. As a test, we apply the proposals to Language Grid, and evaluate the results. They show that our methods can reduce the number of variations that need to be registered and managed even though their overheads are quite practical.
{"title":"Higher-Order Functions for Modeling Hierarchical Service Bindings","authors":"Takao Nakaguchi, Yohei Murakami, Donghui Lin, T. Ishida","doi":"10.1109/SCC.2016.110","DOIUrl":"https://doi.org/10.1109/SCC.2016.110","url":null,"abstract":"Service composition is the technique of creating new services by combining several existing services. Composite services can be also combined with other composite services to form nested or hierarchical services. Given that service composition depends on the interoperability created by using common network protocols and invocation interfaces, a composite service can have an impractically large number of variations depending of the number of available services and the composite's structure. It is hard to enumerate and maintain all variations possible. To solve this problem, we introduce a higher-order function that can take functions as parameters to allow function invocation. In concrete terms, we propose the following methods: (1) a hierarchical service composition description by introducing higher-order functions and (2) a method to implement (1) in an existing composite service execution system. As a test, we apply the proposals to Language Grid, and evaluate the results. They show that our methods can reduce the number of variations that need to be registered and managed even though their overheads are quite practical.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"85 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":"122113469","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}
Hafida Naim, Mustapha Aznag, M. Quafafou, Nicolas Durand
The number of community detection algorithms is growing continuously adopting a topological based approach to discover optimal subgraphs or communities. In this paper, we propose a new method combining both topology and semantic to evaluate and rank community detection algorithms. To achieve this goal we consider a probabilistic topic based approach to define a new measure called semantic divergence of communities. Combining this measure with others related to prior knowledge, we compute a score for each algorithm to evaluate the effectiveness of its communities and propose a ranking method. We have evaluated our approach considering communities of real web services.
{"title":"Semantic Divergence Based Evaluation of Web Service Communities","authors":"Hafida Naim, Mustapha Aznag, M. Quafafou, Nicolas Durand","doi":"10.1109/SCC.2016.101","DOIUrl":"https://doi.org/10.1109/SCC.2016.101","url":null,"abstract":"The number of community detection algorithms is growing continuously adopting a topological based approach to discover optimal subgraphs or communities. In this paper, we propose a new method combining both topology and semantic to evaluate and rank community detection algorithms. To achieve this goal we consider a probabilistic topic based approach to define a new measure called semantic divergence of communities. Combining this measure with others related to prior knowledge, we compute a score for each algorithm to evaluate the effectiveness of its communities and propose a ranking method. We have evaluated our approach considering communities of real web services.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"13 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":"114774893","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}
Business process dynamics in services computing has become more and more important to satisfy today's variable enterprise requirements. Existing business process systems lack support for business process flexibility in practice, it has become increasingly difficult to cope with variable enterprise needs. To solve this problem, a dynamic business process model is introduced in this paper, and a dynamic business process generation algorithm is proposed. The verification of the generated business process is based on the Kripke structure to verify the proposed correctness properties specified in Computational Tree Logic (CTL). We implement a dynamic expansion module for dynamic business process engine based on jBPM5, in that way, a black box in the business process definition can be generated dynamically according to the Drools rules. We demonstrate the proposed approach in a real auditing business process system project. Our approach is generic and can reduce the maintenance costs and the risks during the project.
为了满足当今多变的企业需求，服务计算中的业务流程动态变得越来越重要。现有的业务流程系统缺乏对业务流程灵活性的支持，在实践中越来越难以应对多变的企业需求。为了解决这一问题，本文引入了动态业务流程模型，并提出了动态业务流程生成算法。生成的业务流程的验证基于Kripke结构，以验证在计算树逻辑(Computational Tree Logic, CTL)中指定的建议正确性属性。我们实现了基于jBPM5的动态业务流程引擎的动态扩展模块，这样就可以根据Drools规则动态生成业务流程定义中的黑盒。我们在一个实际的审计业务流程系统项目中演示了所建议的方法。我们的方法是通用的，可以减少项目期间的维护成本和风险。
{"title":"Dynamic Business Process Generation and Verification","authors":"Budan Wu, Rongheng Lin, Pengjie Wang, Junliang Chen","doi":"10.1109/SCC.2016.118","DOIUrl":"https://doi.org/10.1109/SCC.2016.118","url":null,"abstract":"Business process dynamics in services computing has become more and more important to satisfy today's variable enterprise requirements. Existing business process systems lack support for business process flexibility in practice, it has become increasingly difficult to cope with variable enterprise needs. To solve this problem, a dynamic business process model is introduced in this paper, and a dynamic business process generation algorithm is proposed. The verification of the generated business process is based on the Kripke structure to verify the proposed correctness properties specified in Computational Tree Logic (CTL). We implement a dynamic expansion module for dynamic business process engine based on jBPM5, in that way, a black box in the business process definition can be generated dynamically according to the Drools rules. We demonstrate the proposed approach in a real auditing business process system project. Our approach is generic and can reduce the maintenance costs and the risks during the project.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"98 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":"122622334","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}
Process behavioral similarity calculation is widely used in many activities of business process management, such as process mining, process clustering and process retrieval. However, most existing process behavioral similarity measurement methods do not consider variable constraints (e.g. time constraints) in process models. Since the variable constraints of tasks, especially time constraints, are crucial to quantify the differences between the executions of tasks with the same or similar labels in process models, it is significant to calculate exact process behavioral similarity with the consideration of their impacts in process models. In this paper, we formally define the process behavioral similarity with time constraints and propose a time-aware method to efficiently compute the process behavioral similarity based on the ordering relations with time constraints. Experiments illustrate that our proposal can significantly improve the rationality and accuracy of process behavioral similarity measurement.
{"title":"A Time-Aware Method to Process Behavioral Similarity Calculation","authors":"Hua Huang, Rong Peng, Zaiwen Feng","doi":"10.1109/SCC.2016.58","DOIUrl":"https://doi.org/10.1109/SCC.2016.58","url":null,"abstract":"Process behavioral similarity calculation is widely used in many activities of business process management, such as process mining, process clustering and process retrieval. However, most existing process behavioral similarity measurement methods do not consider variable constraints (e.g. time constraints) in process models. Since the variable constraints of tasks, especially time constraints, are crucial to quantify the differences between the executions of tasks with the same or similar labels in process models, it is significant to calculate exact process behavioral similarity with the consideration of their impacts in process models. In this paper, we formally define the process behavioral similarity with time constraints and propose a time-aware method to efficiently compute the process behavioral similarity based on the ordering relations with time constraints. Experiments illustrate that our proposal can significantly improve the rationality and accuracy of process behavioral similarity measurement.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"3 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":"116166877","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
扫码关注我们
求助内容：
应助结果提醒方式：