Xiuwei Zhang, K. He, Chong Wang, Zhao Li, Jianxiao Liu
Composing and reusing services is the main advantage of Service Oriented Software Engineering (SOSE). Faced with the large amount of Web services which are available on World Wide Web, how to select and recommend suitable Web services becomes a key issue in service computing. The most popular service recommendation technique is QoS-based Collaborate Filtering (CF) with user-service QoS matrix. However, it cannot well capture the new interests of users and handle the cold start problem. In this paper we propose an interest-driven recommendation approach which leverage User Interest Profile (UIP) to represent users' interests. UIP is generated in accordance with an ISO standard named as MFI-7. The similarity between UIPs is used to produce users' nearest neighbors. The Top-K recommendations will be generated from these neighbors' mostly-used services. To show the effectiveness of our approach, a developed Web service registry and repository platform is used as a testbed to produce preliminary evaluation results.
{"title":"Interest-Driven Web Service Recommendation Based on MFI-7","authors":"Xiuwei Zhang, K. He, Chong Wang, Zhao Li, Jianxiao Liu","doi":"10.1109/SCC.2013.69","DOIUrl":"https://doi.org/10.1109/SCC.2013.69","url":null,"abstract":"Composing and reusing services is the main advantage of Service Oriented Software Engineering (SOSE). Faced with the large amount of Web services which are available on World Wide Web, how to select and recommend suitable Web services becomes a key issue in service computing. The most popular service recommendation technique is QoS-based Collaborate Filtering (CF) with user-service QoS matrix. However, it cannot well capture the new interests of users and handle the cold start problem. In this paper we propose an interest-driven recommendation approach which leverage User Interest Profile (UIP) to represent users' interests. UIP is generated in accordance with an ISO standard named as MFI-7. The similarity between UIPs is used to produce users' nearest neighbors. The Top-K recommendations will be generated from these neighbors' mostly-used services. To show the effectiveness of our approach, a developed Web service registry and repository platform is used as a testbed to produce preliminary evaluation results.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131565007","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}
Service compositions are established to implement complex functionality based on elementary services in different application areas. The execution time of a service composition is crucial in many application domains. A service composition is said to be time-critical when its execution time is restricted. Because of uncertain response times, the execution time restriction of a time-critical service composition can be violated. Several reconfiguration approaches dealing with service failures and deviating QoS values were recently proposed, but because of their general purpose, they do not consider specific characteristics that occur in the presence of uncertain response times. In this paper, a time-sensitive reconfiguration is proposed that takes into account the uncertainty of response times and the temporal conditions found at execution time of a time-critical service composition. It is shown that a reliable execution of time-critical service compositions is achieved with only slightly increased cost.
{"title":"Reliable Service Reconfiguration for Time-Critical Service Compositions","authors":"René Ramacher, L. Mönch","doi":"10.1109/SCC.2013.44","DOIUrl":"https://doi.org/10.1109/SCC.2013.44","url":null,"abstract":"Service compositions are established to implement complex functionality based on elementary services in different application areas. The execution time of a service composition is crucial in many application domains. A service composition is said to be time-critical when its execution time is restricted. Because of uncertain response times, the execution time restriction of a time-critical service composition can be violated. Several reconfiguration approaches dealing with service failures and deviating QoS values were recently proposed, but because of their general purpose, they do not consider specific characteristics that occur in the presence of uncertain response times. In this paper, a time-sensitive reconfiguration is proposed that takes into account the uncertainty of response times and the temporal conditions found at execution time of a time-critical service composition. It is shown that a reliable execution of time-critical service compositions is achieved with only slightly increased cost.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131814059","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}
Service Oriented Computing Systems can be considered as a type of complex systems consisting of a number of loosely coupled autonomous and adaptive components (i.e., service components). Service quality depends on the performance of the "service group", and many dynamic factors including the expectation of service consumers, the availability of resources, etc. Trust is an important factor for determining the interrelationships among service components. In this paper, we consider the dynamic factors in service composition, and propose a trust management approach, which adopts related methods in information theory, to enable more reliable service composition in dynamic environments. From the experimental results, we claim that the proposed approach can effectively handle dynamic factors in open environments, and obtain better service composition results.
{"title":"Correlated Contribution Analysis for Service Composition in Dynamic Environments","authors":"Jing Jiang, Q. Bai","doi":"10.1109/SCC.2013.85","DOIUrl":"https://doi.org/10.1109/SCC.2013.85","url":null,"abstract":"Service Oriented Computing Systems can be considered as a type of complex systems consisting of a number of loosely coupled autonomous and adaptive components (i.e., service components). Service quality depends on the performance of the \"service group\", and many dynamic factors including the expectation of service consumers, the availability of resources, etc. Trust is an important factor for determining the interrelationships among service components. In this paper, we consider the dynamic factors in service composition, and propose a trust management approach, which adopts related methods in information theory, to enable more reliable service composition in dynamic environments. From the experimental results, we claim that the proposed approach can effectively handle dynamic factors in open environments, and obtain better service composition results.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133398006","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}
Existing search services are inadequate for machine-based web searches since it is more difficult for machines to perceive the results of a search. This work presents an approach creating a search service that is tailored towards machine-based web search, while avoiding some of the problems associated with search results that are derived from link-based ranking algorithms. In this approach, the content of search results is enhanced by incorporating additional information which is derived from processing a set of web documents that are relevant to the search phrase. Ranking of the web pages is then based on this derived information. The search result is composed in a manner that is designed to promote relevance and aid immediate comprehension of search results.
{"title":"Towards a Service for Machine Consumable Web Search Results","authors":"O. Ezenwoye, Minakshi Pokharel","doi":"10.1109/SCC.2013.19","DOIUrl":"https://doi.org/10.1109/SCC.2013.19","url":null,"abstract":"Existing search services are inadequate for machine-based web searches since it is more difficult for machines to perceive the results of a search. This work presents an approach creating a search service that is tailored towards machine-based web search, while avoiding some of the problems associated with search results that are derived from link-based ranking algorithms. In this approach, the content of search results is enhanced by incorporating additional information which is derived from processing a set of web documents that are relevant to the search phrase. Ranking of the web pages is then based on this derived information. The search result is composed in a manner that is designed to promote relevance and aid immediate comprehension of search results.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127086766","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}
Service Oriented Architectures are nowadays used in a wide range of organizations to support critical daily operations. Although the underlying services should behave in a secure manner, they are often deployed with bugs that can be maliciously exploited. The characteristics of service-based environments open the door to security challenges that must be handled properly, including services under the control of multiple providers and dynamism of interactions and compositions. This paper presents an extensible tool able to widely test such infrastructures for vulnerabilities. The tool is based in an iterative process that uses interface monitoring to automatically monitor and discover the existing services, resources and interactions, and applies different testing approaches depending on the level of access to each existing services. Two case studies has been developed do demonstrate the tool, and results show that the tool can effectively be used in different service-based scenarios, under different access conditions to the target services.
{"title":"SOA-Scanner: An Integrated Tool to Detect Vulnerabilities in Service-Based Infrastructures","authors":"Nuno Antunes, M. Vieira","doi":"10.1109/SCC.2013.28","DOIUrl":"https://doi.org/10.1109/SCC.2013.28","url":null,"abstract":"Service Oriented Architectures are nowadays used in a wide range of organizations to support critical daily operations. Although the underlying services should behave in a secure manner, they are often deployed with bugs that can be maliciously exploited. The characteristics of service-based environments open the door to security challenges that must be handled properly, including services under the control of multiple providers and dynamism of interactions and compositions. This paper presents an extensible tool able to widely test such infrastructures for vulnerabilities. The tool is based in an iterative process that uses interface monitoring to automatically monitor and discover the existing services, resources and interactions, and applies different testing approaches depending on the level of access to each existing services. Two case studies has been developed do demonstrate the tool, and results show that the tool can effectively be used in different service-based scenarios, under different access conditions to the target services.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"41 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131457114","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}
Mashup, a way to compose a new service from existing services, is expected to play a great role in internet of things (IoT) environment. Many recent researches suggest that mashup in IoT environment is possible with existing web mashup technology if each thing exposes its functionalities as a web service. However, this approach may have limitations in dealing with many heterogeneous devices and computation scalability in the presence of large number of things involved. In this paper, we propose a cloud-based IoT mashup service model, called IoT Mashup as a Service (IoTMaaS), to overcome heterogeneity of devices by following the model driven architecture principles and computational scalability based on cloud computing paradigm. We also design a cloud platform on which IoTMaaS be executed in harmony with stakeholders such as end users, device manufacturers, and cloud computing providers. We proved the concept of the architecture by implementing a prototype platform with an vacant room detection application.
Mashup是一种将现有服务组合成新服务的方法，有望在物联网(IoT)环境中发挥重要作用。最近的许多研究表明，如果每个事物都将其功能暴露为web服务，那么在物联网环境中使用现有的web mashup技术是可能的。然而，这种方法在处理许多异构设备和涉及大量事物的计算可伸缩性方面可能存在局限性。本文提出了一种基于云的物联网混搭服务模型，称为物联网混搭即服务(IoT mashup as a service, IoTMaaS)，通过遵循模型驱动的架构原则和基于云计算范式的计算可扩展性来克服设备的异构性。我们还设计了一个云平台，在这个平台上，物联网maas可以与终端用户、设备制造商和云计算提供商等利益相关者和谐地执行。我们通过实现一个带有空房检测应用程序的原型平台来验证该体系结构的概念。
{"title":"IoT Mashup as a Service: Cloud-Based Mashup Service for the Internet of Things","authors":"Janggwan Im, S. Kim, Daeyoung Kim","doi":"10.1109/SCC.2013.68","DOIUrl":"https://doi.org/10.1109/SCC.2013.68","url":null,"abstract":"Mashup, a way to compose a new service from existing services, is expected to play a great role in internet of things (IoT) environment. Many recent researches suggest that mashup in IoT environment is possible with existing web mashup technology if each thing exposes its functionalities as a web service. However, this approach may have limitations in dealing with many heterogeneous devices and computation scalability in the presence of large number of things involved. In this paper, we propose a cloud-based IoT mashup service model, called IoT Mashup as a Service (IoTMaaS), to overcome heterogeneity of devices by following the model driven architecture principles and computational scalability based on cloud computing paradigm. We also design a cloud platform on which IoTMaaS be executed in harmony with stakeholders such as end users, device manufacturers, and cloud computing providers. We proved the concept of the architecture by implementing a prototype platform with an vacant room detection application.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114385184","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}
Kahina Bessai, S. Youcef, A. Oulamara, C. Godart, S. Nurcan
Matching and scheduling problem proved to be a critical problematic in different domains including Cloud computing. Therefore, to ensure the commercial success of the Cloud computing paradigm, it is necessary to develop methods that allow users to optimize the use of resources. Even though there are several algorithms for scheduling applications in heterogeneous environment such as grid computing, they cannot benefit from the recent advent of Cloud computing. Indeed, these algorithms assume that the number of resources available to users is bounded, this is against the illusion of infinite resources of Cloud computing. Also, only the execution time (makespan) is taken into account. However, Cloud computing business model is based on pay as you go. Accordingly, execution cost begot using a set of resources should be considered. To overcome the limitations of existing works, this paper propose new strategies for matching and scheduling business process instances in the Cloud context. The proposed strategies aim at scheduling business process instances while minimizing two conflicting criteria on the one hand, and ensuring fairness between the considered instances on the other hand. A serie of experiments demonstrate that they present good performances.
{"title":"Business Process Scheduling Strategies in Cloud Environments with Fairness Metrics","authors":"Kahina Bessai, S. Youcef, A. Oulamara, C. Godart, S. Nurcan","doi":"10.1109/SCC.2013.94","DOIUrl":"https://doi.org/10.1109/SCC.2013.94","url":null,"abstract":"Matching and scheduling problem proved to be a critical problematic in different domains including Cloud computing. Therefore, to ensure the commercial success of the Cloud computing paradigm, it is necessary to develop methods that allow users to optimize the use of resources. Even though there are several algorithms for scheduling applications in heterogeneous environment such as grid computing, they cannot benefit from the recent advent of Cloud computing. Indeed, these algorithms assume that the number of resources available to users is bounded, this is against the illusion of infinite resources of Cloud computing. Also, only the execution time (makespan) is taken into account. However, Cloud computing business model is based on pay as you go. Accordingly, execution cost begot using a set of resources should be considered. To overcome the limitations of existing works, this paper propose new strategies for matching and scheduling business process instances in the Cloud context. The proposed strategies aim at scheduling business process instances while minimizing two conflicting criteria on the one hand, and ensuring fairness between the considered instances on the other hand. A serie of experiments demonstrate that they present good performances.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124066863","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}
Cloud computing is a new computing paradigm that takes all resources as services, and it is not only agile, but also scalable. With the development of cloud computing, video on demand has become one of the most popular applications over the Internet. Currently, there is a trend of using cloud data centers and virtualization technologies to expand large-scale video streaming services with higher quality and lower expense. In this paper, we present CSM (Cloud Stream Media), a scheme that books the minimum resources from global data centers to match its demand and dynamically adjusts all resources to effectively meet the users' requests and guarantee a certain kind of quality of service, thus enhances the utilization and decreases the cost. CSM first predicts the stream media's future demand and data center's workload by using ARIMA model, and then performs a locality-aware resource booking (LARB) algorithm to lease the necessary resource from globalized cloud service providers in a long time. In order to handle prediction inaccuracy and the short-term demand peeks, CMS also introduces an inaccurate prediction handle strategy and performs auto scaling. We evaluate our scheme by combining both real world data and simulation. The results show good accuracy of our prediction and about 20% cut of total cost.
{"title":"CloudStreamMedia: A Cloud Assistant Global Video on Demand Leasing Scheme","authors":"Da Deng, Zhihui Lu, Wei Fang, Jie Wu","doi":"10.1109/SCC.2013.91","DOIUrl":"https://doi.org/10.1109/SCC.2013.91","url":null,"abstract":"Cloud computing is a new computing paradigm that takes all resources as services, and it is not only agile, but also scalable. With the development of cloud computing, video on demand has become one of the most popular applications over the Internet. Currently, there is a trend of using cloud data centers and virtualization technologies to expand large-scale video streaming services with higher quality and lower expense. In this paper, we present CSM (Cloud Stream Media), a scheme that books the minimum resources from global data centers to match its demand and dynamically adjusts all resources to effectively meet the users' requests and guarantee a certain kind of quality of service, thus enhances the utilization and decreases the cost. CSM first predicts the stream media's future demand and data center's workload by using ARIMA model, and then performs a locality-aware resource booking (LARB) algorithm to lease the necessary resource from globalized cloud service providers in a long time. In order to handle prediction inaccuracy and the short-term demand peeks, CMS also introduces an inaccurate prediction handle strategy and performs auto scaling. We evaluate our scheme by combining both real world data and simulation. The results show good accuracy of our prediction and about 20% cut of total cost.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122620481","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}
Rongdong Hu, Jingfei Jiang, Guangming Liu, Lixin Wang
Cloud provider should ensure QoS while maximizing resources utilization. One optimal strategy is to timely allocate resources in a fine-grained mode according to the actual resources demand of applications. The necessary precondition of this strategy is obtaining future load information in advance. We propose a multi-step-ahead load forecasting method, KSwSVR, based on statistical learning theory which is suitable for the complex and dynamic characteristics of the cloud computing environment. It integrates an improved support vector regression algorithm and Kalman smoother. Public trace data taken from multi-types of resources were used to verify its prediction accuracy, stability and adaptability, comparing with AR, BPNN and standard SVR. CPU allocation experiment indicated that KSwSVR can effectively reduce resources consumption while meeting Service Level Agreements requirement.
{"title":"KSwSVR: A New Load Forecasting Method for Efficient Resources Provisioning in Cloud","authors":"Rongdong Hu, Jingfei Jiang, Guangming Liu, Lixin Wang","doi":"10.1109/SCC.2013.67","DOIUrl":"https://doi.org/10.1109/SCC.2013.67","url":null,"abstract":"Cloud provider should ensure QoS while maximizing resources utilization. One optimal strategy is to timely allocate resources in a fine-grained mode according to the actual resources demand of applications. The necessary precondition of this strategy is obtaining future load information in advance. We propose a multi-step-ahead load forecasting method, KSwSVR, based on statistical learning theory which is suitable for the complex and dynamic characteristics of the cloud computing environment. It integrates an improved support vector regression algorithm and Kalman smoother. Public trace data taken from multi-types of resources were used to verify its prediction accuracy, stability and adaptability, comparing with AR, BPNN and standard SVR. CPU allocation experiment indicated that KSwSVR can effectively reduce resources consumption while meeting Service Level Agreements requirement.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122764616","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}
When designing scientific workflows, users often face the so-called shimming problem when connecting two related but incompatible components. The problem is addressed by inserting a special kind of adaptors, called shims, that perform appropriate data transformations to resolve data type inconsistencies. However, existing shimming techniques provide limited automation and burden users with having to define ontological mappings, generate data transformations, and even manually write shimming code. In addition, these approaches insert many visible shims that clutter workflow design and distract user's attention from functional components of the workflow. To address these issues, we 1) reduce the shimming problem to a runtime coercion problem in the theory of type systems, 2) propose a scientific workflow model and define the notion of well-typed workflows, 3) develop three algorithms to typecheck workflows by first translating them into equivalent lambda expressions, 4) design two functions that together insert "invisible shims", or runtime coercions into workflows, thereby solving the shimming problem for any well-typed workflow, 5) implement our automated shimming technique, including all the proposed algorithms, lambda calculus, type system, and translation functions in our VIEW system and present a case study to validate the proposed approach.
{"title":"Coercion Approach to the Shimming Problem in Scientific Workflows","authors":"A. Kashlev, Shiyong Lu, Artem Chebotko","doi":"10.1109/SCC.2013.89","DOIUrl":"https://doi.org/10.1109/SCC.2013.89","url":null,"abstract":"When designing scientific workflows, users often face the so-called shimming problem when connecting two related but incompatible components. The problem is addressed by inserting a special kind of adaptors, called shims, that perform appropriate data transformations to resolve data type inconsistencies. However, existing shimming techniques provide limited automation and burden users with having to define ontological mappings, generate data transformations, and even manually write shimming code. In addition, these approaches insert many visible shims that clutter workflow design and distract user's attention from functional components of the workflow. To address these issues, we 1) reduce the shimming problem to a runtime coercion problem in the theory of type systems, 2) propose a scientific workflow model and define the notion of well-typed workflows, 3) develop three algorithms to typecheck workflows by first translating them into equivalent lambda expressions, 4) design two functions that together insert \"invisible shims\", or runtime coercions into workflows, thereby solving the shimming problem for any well-typed workflow, 5) implement our automated shimming technique, including all the proposed algorithms, lambda calculus, type system, and translation functions in our VIEW system and present a case study to validate the proposed approach.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122148593","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
扫码关注我们
求助内容：
应助结果提醒方式：