发布求助
文献互助 智能选刊 最新文献

IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07)最新文献

筛选
英文 中文
Clean Slate Design of Internet for Supporting Service-Oriented Computing and Applications 支持面向服务的计算和应用的因特网的全新设计
IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07) Pub Date : 2007-06-19 DOI: 10.1109/SOCA.2007.13
D. Du
{"title":"Clean Slate Design of Internet for Supporting Service-Oriented Computing and Applications","authors":"D. Du","doi":"10.1109/SOCA.2007.13","DOIUrl":"https://doi.org/10.1109/SOCA.2007.13","url":null,"abstract":"Summary form only given. The Internet today was designed four decades ago. The scale of the Internet has grown to enormously large. With the rapid technology advancement, we now have cheap and small devices with high computing power and large storage capacity. These devices are designed to improve our daily life by monitoring our environment, collecting critical data, and executing special instructions. These devices have gradually become an essential part of our future Internet. Unprecedented amount of data are collected by these devices. How to manage and look for the desired information becomes a great challenge. At the same time, many emerging applications like service-oriented, security and real-time applications demand much better support than the current Internet can offer. To meet these challenges, NSF research funding directions for NeTS (Networking Research Cluster) and Cyber Trust Program have been adjusted. NSF also starts a major effort, called GENI (Global Environment for Networking Innovations) to redesign the Internet from scratch. GENI consists of two major components: an experimental facility and a research program called FIND (Future Internet Design). We will discuss the current status of GENI, research funding directions of NOSS (Networks Of Sensor Systems) and FIND. At the University of Minnesota we are developing an intelligent storage approach that taking advantage of the technology advancement by migrating several key features from file systems and the layers above into storage devices. The research issues and potential benefits of this approach will also be briefly discussed. This serves as one of the examples of rethinking the required framework and architecture of the future Internet.","PeriodicalId":226255,"journal":{"name":"IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130675600","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}
引用次数: 5
On Complexity of The Tightening Problem for Web Service Discovery Web服务发现收紧问题的复杂性研究
IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07) Pub Date : 2007-06-19 DOI: 10.1109/SOCA.2007.33
Zhongnan Shen, Jianwen Su
{"title":"On Complexity of The Tightening Problem for Web Service Discovery","authors":"Zhongnan Shen, Jianwen Su","doi":"10.1109/SOCA.2007.33","DOIUrl":"https://doi.org/10.1109/SOCA.2007.33","url":null,"abstract":"A goal of the service oriented paradigm/SOA is to facilitate automated service composition. Motivated by scenarios in e-business and e-science, the automated composition problem starts with a specification of a \"goal\" service and a set of searchable existing services. The composition problem relies on discovering relevant services at the semantic level, mainly, through entry/exit conditions, and assembling them into a \"realization\" of the goal service. Based on this framework, we study in this paper a tightening problem which strengthens service discovery queries formulated from conditions in the goal service. A tighter condition can find more relevant services while a looser one may exclude the possibility of assembling a goal realization. The tightening problem is studied for conditions in different logic languages, mainly, conditions with order constraints and linear arithmetic. The complexity of the tightening problem is given for both integers and real numbers.","PeriodicalId":226255,"journal":{"name":"IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123878572","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
Allocating Services to Applications using Markov Decision Processes 使用马尔可夫决策过程为应用程序分配服务
IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07) Pub Date : 2007-06-19 DOI: 10.1109/SOCA.2007.7
H. Bannazadeh, A. Leon-Garcia
{"title":"Allocating Services to Applications using Markov Decision Processes","authors":"H. Bannazadeh, A. Leon-Garcia","doi":"10.1109/SOCA.2007.7","DOIUrl":"https://doi.org/10.1109/SOCA.2007.7","url":null,"abstract":"In this paper, we outline the problem of allocating instances of services to different applications. We study a simple form of this problem with three types of services and two classes of applications. We address the problem when all instances of services have the same QoS parameters and when they have different QoS parameters. The objective of our problem is to find an optimal policy for accepting requests for each class of application, to maximize the utilization of available instances of services. To do so, we used Markov decision processes and we computed the optimal policy for our problem. Also, we compared the performance of this optimal policy with complete sharing and complete partitioning methods. The results show that using Markov decision processes we can obtain an optimal policy for allocating services to applications which outperforms the other two methods.","PeriodicalId":226255,"journal":{"name":"IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124829915","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}
引用次数: 7
Web Service Middleware - An Infrastructure For Near Future Real Life Web Service Ecosystems Web服务中间件——未来现实生活中Web服务生态系统的基础设施
IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07) Pub Date : 2007-06-19 DOI: 10.1109/SOCA.2007.48
Jan Schulz-Hofen
{"title":"Web Service Middleware - An Infrastructure For Near Future Real Life Web Service Ecosystems","authors":"Jan Schulz-Hofen","doi":"10.1109/SOCA.2007.48","DOIUrl":"https://doi.org/10.1109/SOCA.2007.48","url":null,"abstract":"Free trade and the use of Web services from all over the world and across organizational borders have been an omnipresent vision since the idea of Web services arose in the late nineties. Both WS-* specifications and implementations have matured over the years. However, until now we do not perceive large-scale Web service ecosystems, in which Web services are advertised, bargained, invoked and finally charged and paid for. We believe that introducing a middleware as supporting infrastructure for Web service ecosystems promises to pave the way towards providing a wealth of available Web services to service consumers while allowing service providers to generate revenues from service delivery.","PeriodicalId":226255,"journal":{"name":"IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125743053","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}
引用次数: 9
Authoring Tool for Business Performance Monitoring and Control 用于业务性能监视和控制的创作工具
IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07) Pub Date : 2007-06-19 DOI: 10.1109/SOCA.2007.10
M. Abe, J. Jeng, Teruo Koyanagi
{"title":"Authoring Tool for Business Performance Monitoring and Control","authors":"M. Abe, J. Jeng, Teruo Koyanagi","doi":"10.1109/SOCA.2007.10","DOIUrl":"https://doi.org/10.1109/SOCA.2007.10","url":null,"abstract":"To monitor and warrant the performance of concerned business operations, formal representation for business performance models are needed so business analysts can describe what they expect from business service providers. This paper proposes a metamodel and an authoring tool for describing business performance for business services in the context of SOA. A business performance model explicitly captures the intentions of the consumers of the target business services. The authoring tool simplifies the modeling of the performance models. With our proposed mechanism, computational models for business performance management are generated. The separation of concerns in terms of business performance models and computational models allows for seamless transitions from business level performance models to runtime.","PeriodicalId":226255,"journal":{"name":"IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133183013","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}
引用次数: 9
Structure Matching for Enhancing UDDI Queries Results 用于增强UDDI查询结果的结构匹配
IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07) Pub Date : 2007-06-01 DOI: 10.1109/SOCA.2007.44
Giancarlo Tretola, E. Zimeo
{"title":"Structure Matching for Enhancing UDDI Queries Results","authors":"Giancarlo Tretola, E. Zimeo","doi":"10.1109/SOCA.2007.44","DOIUrl":"https://doi.org/10.1109/SOCA.2007.44","url":null,"abstract":"To enhance UDDI query capability, typically based on taxonomic classification, semantic matching is assuming a key role. Even if we recognize the great importance of semantics in the discovery process, structure-based matching can be very useful in many situations where semantic annotations are not provided at publish time or ontologies are not yet well defined. Moreover, structure matching has a potential application in dynamic binding and invocation to perform correct parameter passing based on syntactic elements obtained from the mapping returned by the structure matching algorithm. The paper discusses the problem of similarity structure matching and proposes and compares different implementations of the algorithm introduced by Wang-Stroulia with the aim of obtaining better performance. We integrated the algorithm in a matchmaking framework based on multiple cascade filters that are able to combine several matchmaking techniques in order to improve precision and recall in a flexible and effective way.","PeriodicalId":226255,"journal":{"name":"IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121186781","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}
引用次数: 9
Creating Web Services From GUI-Based Applications 从基于gui的应用程序创建Web服务
IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07) Pub Date : 2007-06-01 DOI: 10.1109/SOCA.2007.16
M. Grechanik, Kevin M. Conroy, Kishore S. Swaminathan
{"title":"Creating Web Services From GUI-Based Applications","authors":"M. Grechanik, Kevin M. Conroy, Kishore S. Swaminathan","doi":"10.1109/SOCA.2007.16","DOIUrl":"https://doi.org/10.1109/SOCA.2007.16","url":null,"abstract":"Graphical user interface (GUI) applications (GAPs) are ubiquitous and provide various services. However, it is difficult to make GAPs exchange information (i.e., interoperate) especially if they are closed and monolithic. Unlike GAPs, Web services are applications that are designed to interoperate over the Internet. Thus a fundamental problem of interoperability is how to reengineer GAPs into Web services efficiently and noninvasively. We propose a novel generic approach for creating Web services from GAPs. This approach combines a nonstandard use of accessibility technologies for accessing and controlling GAPs in a uniform way with a visualization mechanism that enables nonprogrammers to create Web services by performing point-and-click, drag-and-drop operations on GAPs. We built a tool based on our approach and created Web services that control two closed and monolithic commercial GAPs with this tool. Our evaluation suggests that our approach is effective and it can be used to create Web services from nontrivial GAPs.","PeriodicalId":226255,"journal":{"name":"IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134171992","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}
引用次数: 9
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信