首页 > 最新文献

2011 IEEE World Congress on Services最新文献

英文 中文
Reputation-Based Web Service Selection for Composition 基于声誉的组合Web服务选择
Pub Date : 2011-07-04 DOI: 10.1109/SERVICES.2011.96
S. Bansal, A. Bansal
The success and acceptance of Web service composition depends on computing solutions comprised of trustworthy services. In this paper, we extend our Web service Composition framework to include selection and ranking of services based on their reputation score. With the increasing popularity of Web-based Social Networks like Linked in, Facebook, and Twitter, there is great potential in determining the reputation score of a particular service provider using Social Network Analysis. We present a technique to calculate a reputation score per service using centrality measure of Social Networks. We use this score to produce composition solutions that consist of services provided by trust-worthy and reputed providers.
Web服务组合的成功和接受取决于由可信服务组成的计算解决方案。在本文中,我们扩展了我们的Web服务组合框架,以包括基于其信誉评分的服务选择和排名。随着基于web的社交网络(如Linked in、Facebook和Twitter)的日益普及,使用社交网络分析来确定特定服务提供商的声誉评分具有很大的潜力。我们提出了一种使用社交网络的中心性度量来计算每个服务的声誉得分的技术。我们使用这个分数来生成组合解决方案,这些解决方案由值得信赖和声誉良好的提供商提供的服务组成。
{"title":"Reputation-Based Web Service Selection for Composition","authors":"S. Bansal, A. Bansal","doi":"10.1109/SERVICES.2011.96","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.96","url":null,"abstract":"The success and acceptance of Web service composition depends on computing solutions comprised of trustworthy services. In this paper, we extend our Web service Composition framework to include selection and ranking of services based on their reputation score. With the increasing popularity of Web-based Social Networks like Linked in, Facebook, and Twitter, there is great potential in determining the reputation score of a particular service provider using Social Network Analysis. We present a technique to calculate a reputation score per service using centrality measure of Social Networks. We use this score to produce composition solutions that consist of services provided by trust-worthy and reputed providers.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"84 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114010362","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}
引用次数: 8
Externalizing the Autopoietic Part of Software to Achieve Self-Adaptability 外部化软件自创生部分实现自适应
Pub Date : 2011-07-04 DOI: 10.1109/SERVICES.2011.69
Romina Torres, H. Astudillo
The autopietic/allopietic duality has been proposed to address the fact that Software systems must look to their own survival besides their successful mission completion. To the best of our knowledge, there are no explicit computational models to operationalize and test this distinction. This article describes a framework to add autopietic capabilities to composite Software systems, by using an external self-organized market full of service providers willing to provide services for satisfying new requirements and recovering actions. The approach is exemplified when a QoS agreement violation occurs in a composite application system.
自成体/异形体的二元性被提出来解决这样一个事实,即软件系统除了成功完成任务之外,还必须关注自身的生存。据我们所知,没有明确的计算模型来操作和测试这种区别。本文描述了一个框架,通过使用一个外部的自组织市场,这个市场充满了愿意为满足新需求和恢复行动提供服务的服务提供商,从而为复合软件系统添加自创生能力。以复合应用系统中发生QoS协议冲突为例,说明了该方法的可行性。
{"title":"Externalizing the Autopoietic Part of Software to Achieve Self-Adaptability","authors":"Romina Torres, H. Astudillo","doi":"10.1109/SERVICES.2011.69","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.69","url":null,"abstract":"The autopietic/allopietic duality has been proposed to address the fact that Software systems must look to their own survival besides their successful mission completion. To the best of our knowledge, there are no explicit computational models to operationalize and test this distinction. This article describes a framework to add autopietic capabilities to composite Software systems, by using an external self-organized market full of service providers willing to provide services for satisfying new requirements and recovering actions. The approach is exemplified when a QoS agreement violation occurs in a composite application system.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114186777","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}
引用次数: 1
TrustCloud: A Framework for Accountability and Trust in Cloud Computing TrustCloud:云计算中的问责和信任框架
Pub Date : 2011-07-04 DOI: 10.1109/SERVICES.2011.91
R. Ko, Peter Jagadpramana, M. Mowbray, Siani Pearson, M. Kirchberg, Q. Liang, Bu-Sung Lee
The key barrier to widespread uptake of cloud computing is the lack of trust in clouds by potential customers. While preventive controls for security and privacy are actively researched, there is still little focus on detective controls related to cloud accountability and audit ability. The complexity resulting from large-scale virtualization and data distribution carried out in current clouds has revealed an urgent research agenda for cloud accountability, as has the shift in focus of customer concerns from servers to data. This paper discusses key issues and challenges in achieving a trusted cloud through the use of detective controls, and presents the Trust Cloud framework, which addresses accountability in cloud computing via technical and policy-based approaches.
广泛采用云计算的主要障碍是潜在客户对云缺乏信任。虽然对安全和隐私的预防性控制措施进行了积极研究,但对与云问责制和审计能力相关的检测控制措施的关注仍然很少。在当前的云中进行大规模虚拟化和数据分发所带来的复杂性揭示了云责任的紧迫研究议程,正如客户关注的焦点从服务器转移到数据一样。本文讨论了通过使用检测控制实现可信云的关键问题和挑战,并提出了可信云框架,该框架通过技术和基于策略的方法解决了云计算中的问责制问题。
{"title":"TrustCloud: A Framework for Accountability and Trust in Cloud Computing","authors":"R. Ko, Peter Jagadpramana, M. Mowbray, Siani Pearson, M. Kirchberg, Q. Liang, Bu-Sung Lee","doi":"10.1109/SERVICES.2011.91","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.91","url":null,"abstract":"The key barrier to widespread uptake of cloud computing is the lack of trust in clouds by potential customers. While preventive controls for security and privacy are actively researched, there is still little focus on detective controls related to cloud accountability and audit ability. The complexity resulting from large-scale virtualization and data distribution carried out in current clouds has revealed an urgent research agenda for cloud accountability, as has the shift in focus of customer concerns from servers to data. This paper discusses key issues and challenges in achieving a trusted cloud through the use of detective controls, and presents the Trust Cloud framework, which addresses accountability in cloud computing via technical and policy-based approaches.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122103808","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}
引用次数: 520
Rapid 3D Seismic Source Inversion Using Windows Azure and Amazon EC2 使用Windows Azure和Amazon EC2快速三维震源反演
Pub Date : 2011-07-04 DOI: 10.1109/SERVICES.2011.90
Vedaprakash Subramanian, Hongyi Ma, Liqiang Wang, En-Jui Lee, Po Chen
With its rapid development, cloud computing has been increasingly adopted by scientists for large-scale scientific computation. Compared to the traditional computing platforms such as cluster and supercomputer, cloud computing is more elastic in the support of real-time computation and more powerful in the management of large-scale datasets. This paper presents our experience on designing and implementing seismic source inversion on both cluster (specifically, MPI-based) and cloud computing (specifically, Amazon EC2 and Microsoft Windows Azure). Our experiment shows that applying cloud computing to seismic source inversion is feasible and has its advantages. In addition, we notice that both cluster and Amazon EC2 have obviously better performance than Windows Azure. Cloud computing is suited for real-time processing scientific applications but it (especially Azure) does not work well for tightly-coupled applications.
随着云计算的快速发展,越来越多的科学家采用云计算进行大规模的科学计算。与集群、超级计算机等传统计算平台相比,云计算在支持实时计算方面更具弹性,在管理大规模数据集方面更强大。本文介绍了我们在集群(特别是基于mpi的)和云计算(特别是Amazon EC2和Microsoft Windows Azure)上设计和实现震源反演的经验。实验表明,将云计算应用于震源反演是可行的,具有一定的优势。此外,我们注意到集群和Amazon EC2的性能都明显优于Windows Azure。云计算适合于实时处理科学应用程序,但它(尤其是Azure)不适用于紧密耦合的应用程序。
{"title":"Rapid 3D Seismic Source Inversion Using Windows Azure and Amazon EC2","authors":"Vedaprakash Subramanian, Hongyi Ma, Liqiang Wang, En-Jui Lee, Po Chen","doi":"10.1109/SERVICES.2011.90","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.90","url":null,"abstract":"With its rapid development, cloud computing has been increasingly adopted by scientists for large-scale scientific computation. Compared to the traditional computing platforms such as cluster and supercomputer, cloud computing is more elastic in the support of real-time computation and more powerful in the management of large-scale datasets. This paper presents our experience on designing and implementing seismic source inversion on both cluster (specifically, MPI-based) and cloud computing (specifically, Amazon EC2 and Microsoft Windows Azure). Our experiment shows that applying cloud computing to seismic source inversion is feasible and has its advantages. In addition, we notice that both cluster and Amazon EC2 have obviously better performance than Windows Azure. Cloud computing is suited for real-time processing scientific applications but it (especially Azure) does not work well for tightly-coupled applications.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"5 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123650303","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}
引用次数: 25
On Performance Modeling and Prediction in Support of Scientific Workflow Optimization 支持科学工作流优化的性能建模与预测
Pub Date : 2011-07-04 DOI: 10.1109/SERVICES.2011.37
C. Wu, Vivek Datla
The computing modules in distributed scientific workflows must be mapped to computer nodes in shared network environments for optimal workflow performance. Finding a good workflow mapping scheme critically depends on an accurate prediction of the execution time of each individual computational module in the workflow. The time prediction of a scientific computation does not have a silver bullet as it is determined collectively by several dynamic system factors including concurrent loads, memory size, CPU speed, and also by the complexity of the computational program itself. This paper investigates the problem of modeling scientific computations and predicting their execution time based on a combination of both hardware and software properties. We employ statistical learning techniques to estimate the effective computational power of a given computer node at any point of time and estimate the total number of CPU cycles needed for executing a given computational program on any input data size. We analytically derive an upper bound of the estimation error for execution time prediction given the hardware and software properties. The proposed statistical analysis-based solution to performance modeling and prediction is validated and justified by experimental results measured on the computing nodes that vary significantly in terms of the hardware specifications.
分布式科学工作流中的计算模块必须映射到共享网络环境中的计算机节点上,才能获得最佳的工作流性能。找到一个好的工作流映射方案关键取决于对工作流中每个单独计算模块的执行时间的准确预测。科学计算的时间预测没有灵丹妙药,因为它是由几个动态系统因素共同决定的,包括并发负载、内存大小、CPU速度,以及计算程序本身的复杂性。本文研究了基于硬件和软件特性相结合的科学计算建模和执行时间预测问题。我们使用统计学习技术来估计给定计算机节点在任何时间点的有效计算能力,并估计在任何输入数据大小上执行给定计算程序所需的CPU周期总数。在给定硬件和软件特性的情况下,我们解析地导出了执行时间预测估计误差的上界。本文提出的基于统计分析的性能建模和预测解决方案通过在硬件规格差异很大的计算节点上测量的实验结果进行了验证和证明。
{"title":"On Performance Modeling and Prediction in Support of Scientific Workflow Optimization","authors":"C. Wu, Vivek Datla","doi":"10.1109/SERVICES.2011.37","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.37","url":null,"abstract":"The computing modules in distributed scientific workflows must be mapped to computer nodes in shared network environments for optimal workflow performance. Finding a good workflow mapping scheme critically depends on an accurate prediction of the execution time of each individual computational module in the workflow. The time prediction of a scientific computation does not have a silver bullet as it is determined collectively by several dynamic system factors including concurrent loads, memory size, CPU speed, and also by the complexity of the computational program itself. This paper investigates the problem of modeling scientific computations and predicting their execution time based on a combination of both hardware and software properties. We employ statistical learning techniques to estimate the effective computational power of a given computer node at any point of time and estimate the total number of CPU cycles needed for executing a given computational program on any input data size. We analytically derive an upper bound of the estimation error for execution time prediction given the hardware and software properties. The proposed statistical analysis-based solution to performance modeling and prediction is validated and justified by experimental results measured on the computing nodes that vary significantly in terms of the hardware specifications.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123352045","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}
引用次数: 22
Service Adaptation at Message Level 消息级的服务适应
Pub Date : 2011-07-04 DOI: 10.1109/SERVICES.2011.76
Jianmin Jiang, Shi Zhang, Ping Gong, Zhong Hong
In SOA, adaptation techniques aim to automatically generate adapters. However, the generation of the adapter is a complicated task and requires extra knowledge to resolve all kinds of mismatches. We propose a novel model, called a protocol structure, which is used to model services and adapters and detect the mismatches among services. Once developers present interface mappings among services, adapters can be derived from the interface mappings.
在SOA中,适应技术旨在自动生成适配器。然而,适配器的生成是一项复杂的任务,需要额外的知识来解决各种不匹配。我们提出了一种称为协议结构的新模型,用于对服务和适配器建模并检测服务之间的不匹配。一旦开发人员提供了服务之间的接口映射,适配器就可以从接口映射派生出来。
{"title":"Service Adaptation at Message Level","authors":"Jianmin Jiang, Shi Zhang, Ping Gong, Zhong Hong","doi":"10.1109/SERVICES.2011.76","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.76","url":null,"abstract":"In SOA, adaptation techniques aim to automatically generate adapters. However, the generation of the adapter is a complicated task and requires extra knowledge to resolve all kinds of mismatches. We propose a novel model, called a protocol structure, which is used to model services and adapters and detect the mismatches among services. Once developers present interface mappings among services, adapters can be derived from the interface mappings.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122947177","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}
引用次数: 3
Analyzing Execution Dynamics of Scientific Workflows for Latency Minimization in Resource Sharing Environments 资源共享环境下最小化延迟的科学工作流执行动态分析
Pub Date : 2011-07-04 DOI: 10.1109/SERVICES.2011.54
Yi Gu, C. Wu, N. Rao
Many computation-intensive scientific applications feature complex workflows of distributed computing modules with intricate execution dependencies. Such scientific workflows must be mapped and executed in shared environments to support distributed scientific collaborations. We formulate workflow mapping as an optimization problem for latency minimization, whose difficulty essentially arises from the topological matching nature in the spatial domain, which is further compounded by the resource sharing complicacy in the temporal dimension. We conduct a rigorous analysis of the resource sharing dynamics in workflow executions, which constitutes the base for a workflow mapping algorithm to minimize the end-to-end delay. The correctness of the dynamics analysis is verified in comparison with an approximate solution, a dynamic system simulation program, and a real network deployment, and the performance superiority of the proposed mapping solution is illustrated by extensive comparisons with existing methods using both simulations and experiments.
许多计算密集型科学应用程序具有复杂的分布式计算模块工作流和复杂的执行依赖关系。这样的科学工作流程必须在共享环境中进行映射和执行,以支持分布式的科学协作。我们将工作流映射描述为最小化延迟的优化问题,其难点主要来自于空间域的拓扑匹配特性,以及时间维度的资源共享复杂性。我们对工作流执行过程中的资源共享动态进行了严格的分析,为最小化端到端延迟的工作流映射算法奠定了基础。通过与近似解、动态系统仿真程序和实际网络部署的比较,验证了动力学分析的正确性,并通过仿真和实验与现有方法进行了广泛的比较,说明了所提出的映射解的性能优越性。
{"title":"Analyzing Execution Dynamics of Scientific Workflows for Latency Minimization in Resource Sharing Environments","authors":"Yi Gu, C. Wu, N. Rao","doi":"10.1109/SERVICES.2011.54","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.54","url":null,"abstract":"Many computation-intensive scientific applications feature complex workflows of distributed computing modules with intricate execution dependencies. Such scientific workflows must be mapped and executed in shared environments to support distributed scientific collaborations. We formulate workflow mapping as an optimization problem for latency minimization, whose difficulty essentially arises from the topological matching nature in the spatial domain, which is further compounded by the resource sharing complicacy in the temporal dimension. We conduct a rigorous analysis of the resource sharing dynamics in workflow executions, which constitutes the base for a workflow mapping algorithm to minimize the end-to-end delay. The correctness of the dynamics analysis is verified in comparison with an approximate solution, a dynamic system simulation program, and a real network deployment, and the performance superiority of the proposed mapping solution is illustrated by extensive comparisons with existing methods using both simulations and experiments.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126817542","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}
引用次数: 13
A Measure Standard for Ontology-Based Service Recommendation 基于本体的服务推荐度量标准
Pub Date : 2011-07-04 DOI: 10.1109/SERVICES.2011.39
Zhi Yang, Budan Wu, Junliang Chen
Web Service is becoming the next generation of web-based application. With enhancement of quality of services and increasing quantity of services, how to recommend the suitable services according to personalized requirement becomes an urgent question. In the existing approaches of service recommendation, the result of service recommendation is the service list in which there is no evaluation standard that we can use to distinguish services with high relevancy and low relevancy. So in real-world, the user may obtain low relative services. To address the problem, in this paper, membership function is analyzed and recommendation measure standard is proposed. With dynamic programming theory, an ontology based approach of service recommendation is provided. In the result of service recommendation, membership as measure index is used to divide high relative services, medium relative services and low relative services. High relative services are recommended to the user. So the recommended services are accurate and available.
Web服务正在成为下一代基于Web的应用程序。随着服务质量的提高和服务数量的增加,如何根据个性化需求推荐适合的服务成为一个迫切需要解决的问题。在现有的服务推荐方法中,服务推荐的结果是服务列表,服务列表中没有可以用来区分高相关性和低相关性服务的评价标准。因此,在现实世界中,用户可能会获得低相对服务。针对这一问题,本文分析了隶属函数,提出了推荐度量标准。利用动态规划理论,提出了一种基于本体的服务推荐方法。在服务推荐结果中,以隶属度作为度量指标划分高相对服务、中相对服务和低相对服务。向用户推荐高相对服务。因此,推荐的服务是准确的和可用的。
{"title":"A Measure Standard for Ontology-Based Service Recommendation","authors":"Zhi Yang, Budan Wu, Junliang Chen","doi":"10.1109/SERVICES.2011.39","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.39","url":null,"abstract":"Web Service is becoming the next generation of web-based application. With enhancement of quality of services and increasing quantity of services, how to recommend the suitable services according to personalized requirement becomes an urgent question. In the existing approaches of service recommendation, the result of service recommendation is the service list in which there is no evaluation standard that we can use to distinguish services with high relevancy and low relevancy. So in real-world, the user may obtain low relative services. To address the problem, in this paper, membership function is analyzed and recommendation measure standard is proposed. With dynamic programming theory, an ontology based approach of service recommendation is provided. In the result of service recommendation, membership as measure index is used to divide high relative services, medium relative services and low relative services. High relative services are recommended to the user. So the recommended services are accurate and available.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133578857","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}
引用次数: 4
Meaningful Service Classifications for Flexible Service Descriptions 灵活服务描述的有意义服务分类
Pub Date : 2011-07-04 DOI: 10.1109/SERVICES.2011.79
Sudhir Agarwal, M. Junghans
We present a formal underpinning for textit{Web service classes} by viewing them as a set of services that fulfill a logical combination of constraints on functional and non-functional properties. A hierarchy of service classes is automatically derived by their formal definition and can be exploited for an efficient service retrieval. In addition, we show in this paper how service classes can be used (i) to create service descriptions without specifying precise property values and (ii) to create service requests that can use service classes to express ranges of desired property values.
我们通过将textit{Web服务类视为一组服务}来实现功能性和非功能性属性约束的逻辑组合,从而为Web服务类提供了一个正式的基础。服务类的层次结构由其正式定义自动派生,并可用于有效的服务检索。此外,我们在本文中展示了如何使用服务类(i)在不指定精确属性值的情况下创建服务描述,以及(ii)创建可以使用服务类来表示所需属性值范围的服务请求。
{"title":"Meaningful Service Classifications for Flexible Service Descriptions","authors":"Sudhir Agarwal, M. Junghans","doi":"10.1109/SERVICES.2011.79","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.79","url":null,"abstract":"We present a formal underpinning for textit{Web service classes} by viewing them as a set of services that fulfill a logical combination of constraints on functional and non-functional properties. A hierarchy of service classes is automatically derived by their formal definition and can be exploited for an efficient service retrieval. In addition, we show in this paper how service classes can be used (i) to create service descriptions without specifying precise property values and (ii) to create service requests that can use service classes to express ranges of desired property values.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115152394","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}
引用次数: 3
Balava: Federating Private and Public Clouds Balava:联合私有云和公共云
Pub Date : 2011-07-04 DOI: 10.1109/SERVICES.2011.21
A. Nordal, Åge Kvalnes, J. Hurley, D. Johansen
Balava is a new system for managing computations that span multiple clouds and involve data with confidentiality constraints. This paper describes the design, implementation and initial performance evaluation of Balava building-blocks. We detail the run-time developed to interconnect private and public clouds, and present a storage overlay built on top of this run-time. To support low-overhead execution of Balava computations, we are investigating alternative approaches to virtualization. We present a new hyper visor that supports light-weight virtual environments, while also preserving application binary interfaces.
Balava是一个新系统,用于管理跨多个云的计算,并涉及具有机密性约束的数据。本文介绍了Balava构件的设计、实现和初步性能评价。我们详细介绍了为互连私有云和公共云而开发的运行时,并介绍了构建在此运行时之上的存储覆盖层。为了支持Balava计算的低开销执行,我们正在研究虚拟化的替代方法。我们提出了一个新的超级遮阳板,它支持轻量级虚拟环境,同时还保留了应用程序二进制接口。
{"title":"Balava: Federating Private and Public Clouds","authors":"A. Nordal, Åge Kvalnes, J. Hurley, D. Johansen","doi":"10.1109/SERVICES.2011.21","DOIUrl":"https://doi.org/10.1109/SERVICES.2011.21","url":null,"abstract":"Balava is a new system for managing computations that span multiple clouds and involve data with confidentiality constraints. This paper describes the design, implementation and initial performance evaluation of Balava building-blocks. We detail the run-time developed to interconnect private and public clouds, and present a storage overlay built on top of this run-time. To support low-overhead execution of Balava computations, we are investigating alternative approaches to virtualization. We present a new hyper visor that supports light-weight virtual environments, while also preserving application binary interfaces.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116158600","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}
引用次数: 29
期刊
2011 IEEE World Congress on Services
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1