检索结果-南通市图书馆

Hybrid QoS-aware semantic web service composition strategies

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science in China(Series F) 2008年第11期51卷 1822-1840页

作者： YANG FangChun SU Sen LI Zhen State Key Lab of Networking & Switching Beijing University of Posts & Telecommunications Beijing100088 China

Hybrid QoS model which consists of certain and uncertain expressions has strong power of semantic QoS description. For solving the hybrid QoS-aware semantic web service composition problem, this paper presents an Uncertain Multi-attribute decision making based Composition algorithm （UMC）. The UMC includes two parts. First, UMC-Core can be used to synthetically evaluate the hybrid service quality information. Second, UMC-DH （Distributed and Heuristic framework for UMC） aims at enhancing the run-time performance of UMC when the problem space increases. The simulation results show that the UMC has lower execution cost, higher approximation ratio and success ratio than other similar approaches.

关键词： quality of service (QoS) semantic web service service composition theory of uncertainties multi-attribute decision making theory heuristic algorithm

Efficient semantic web service matching using common ontology

在线全文

学校读者我要写书评

暂无评论

Journal of Southeast University(English Edition) 2012年第3期28卷 292-298页

作者：曹玖新秦屹张松刘波东方东南大学计算机科学与工程学院南京211189 东南大学网络和信息集成教育部重点实验室南京211189 南京师范大学南京210042

To solve the bottleneck problem in centralized service discovery methods,a novel architecture based on domain ontology for semantic service discovery is *** distributed architecture can adjust the domain partition and allocate system resources *** characteristics of this mechanism are analyzed,including scalability,self-organization and *** this mechanism,semantic web service discovery is separated into two ***,under balance tree topology,registry proxy can rapidly forward requests to the objective registry center,and avoid the bottleneck ***,a semantic distance based service matching algorithm is proposed to promote the effect of service *** results of simulation experiments show that the proposed mechanism can serve as a scalable solution for semantic web service publication and *** the improved matching algorithm has higher recall and precision than other algorithms.

关键词： service discovery domain ontology semantic web service semantic distance

An automatic subdigraph renovation plan for failure recovery of composite semantic web services

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2013年第6期7卷 894-913页

作者： Hadi SABOOHI Sameem ABDUL KAREEM Department of Artificial Intelligence Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur 50603 Malaysia

A web service-based system never fulfills a user＇s goal unless a failure recovery approach exists. It is inevitable that several web services may either perish or fail before or during transactions. The completion of a composite process relies on the smooth execution of all constituent web services. A mediator acts as an intermediary between providers and consumers to monitor the execution of these services. If a service fails, the mediator has to recover the whole composite process or else jeopardize achieving the intended goals. The atomic replacement of a perished web service usually does not apply because the process of locating a matched web service is unreliable. Even the system cannot depend on the replacement of the dead service with a com- posite service. In this paper, we propose an automatic renova- tion plan for failure recovery of composite semantic services based on an approach of subdigraph replacement. A replacement subdigraph is posed in lieu of an original subdigraph, which includes the failed service. The replacement is done in two separate phases, ofltine and online, to make the recovery faster. The ofitine phase foresees all possible subdigraphs, pre-calculates them, and ranks several possible replacements. The online phase compensates the unwanted effects and executes the replacement subdigraph in lieu of the original subdigraph. We have evaluated our approach during an experiment and have found that we could recover more than half of the simulated failures. These achievements show a significant improvement compared to current approaches

关键词： semantic web service composite services fail- ure recovery subdigraph replacement

Efficient Composition of semantic web services with End-to-End QoS Optimization

在线全文

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2010年第6期15卷 678-686页

作者：许斌罗森闫奕歆 Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University

The efficiency of QoS-aware service composition is important since most service composition problems are known to be NP-hard. With the growing number of web services, service composition is like a decision problem on selecting services or/and execution plans to satisfy the users＇ end-to-end QoS requirements （e.g. response time, throughput）. Composite services with the same functionality may have dif-ferent execution plans, which may cause different end-to-end QoS. This paper presents a model combining semantic data-links and QoS, which leads to an efficient approach to automatic construction of a composite service with optimal end-to-end QoS. The approach is based on a greedy algorithm to select both services and execution plans for composite services. Empirical and theoretical analyses of the approach show that its time complexity is O（mn2） for a repository with n services and an ontology with m concepts. Moreover, the approach increases linearly in time when using an index to search services in the repository. Tests with a repository with 20 000 services and an ontology with 300 000 concepts show that the algorithm significantly outperforms current existing algorithms in terms of composition efficiency while achieving optimal end-to-end QoS.

关键词： semantic web service web service composition QoS optimization

Capability matchmaking of semantic web services with preconditions and effects

在线全文

学校读者我要写书评

暂无评论

Journal of Southeast University(English Edition) 2009年第4期25卷 464-467页

作者：王海李增智范琳西安交通大学计算机系统结构与网络研究所西安710049 西安邮电学院计算机科学与技术系西安710061

In order to solve the problem that the current matchmaking methods for semantic web service mainly focus on the matchmaking of IO （inputs, outputs） descriptions which may result in one-sidedness, a description-logic-based IOPE （inputs, outputs, preconditions, effects） description and matchmaking method is proposed for semantic web service. The description logic concept is used to annotate service IO and the description logic assertion is employed to describe service PE（preconditions, effects）. TBox subsumption checking is used to measure the subsumption relationship between IO descriptions of service request and advertising; ABox consistency checking is used for checking the logical implication between PE descriptions of service request and advertising. Based upon the logical implication, four kinds of PE matching degrees are proposed to measure and compare the pros and cons of the results of matchmaking. They are the exact, perfect, side-effect and common match. Experiments show that the method has a higher precision rate under the same recall rate compared with the existing method.

关键词： capability matchmaking semantic web service precondition and effect

An Edge-Based Approach for semantic Matchmaking of service Capabilities

在线全文

学校读者我要写书评

暂无评论

Computer Technology and Application 2011年第8期2卷 667-673页

作者： Adala Asma Tabbane Nabil Tabbane Sami Multimedia Mobile Radio Networks Research Unit （MEDIATRON） Higher School of Communication of Tunis （Sup Corn） University of Carthage Ariana Tunisia

semantic web services is an emerging technology that promises to enable dynamic, execution-time discovery, composition, and invocation of web services. semantic matchmaking plays a vital role in the automated and dynamic discovery process of semantic web services and consists in measuring the semantic distance between a requested service and an advertised one. In this paper, an innovative approach to effectively compute the semantic distance between Ontology web Language for services （OWL-S） annotated services is proposed. First, an edge-based method for measuring the semantic distance between web Ontology Language （OWL） concepts is presented. Then, a comparison of the proposed measure and the one presented in a recent related work is made in order to show that our method is more efficient and fine-grained. Finally, some equations to compute semantic matchmaking of service capabilities, which are expressed in terms of inputs and outputs, are presented.

关键词： semantic web semantic web service semantic distance matchmaking service discovery OWL-S (ontology web language for services) ontology.

Executable Petri Nets Model for semantic web services

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Executable Petri Nets Model for Semantic Web Services

Ontology-Based service-Oriented Architecture for Enterprise Application Integration

2011 International Conference on Computer Science and Information Technology(ICCSIT 2011)

作者： Xu Yinglei Ma Bingxian School of Computer Science Shandong University of Finance School of Information Science and Engineering University of Jinan

ISBN: (纸本)9781612848334

A new approach that using Petri net to model composite semantic web service is put forward oriented to the implementation of semantic web services. Atomic semantic web service is described as a transition element and its input, output, pre-condition and effect as place elements of Petri net, each place element has its place id, name and semantic markup (domain ontology definition) according to parameter’s domain ontology. Composite semantic web service Petri net model could be constructed through sharing composition operation of atomic web services Petri nets with ontology reasoning on place semantic markups and its Petri net should allow self-loop, be acyclic and 1-safe.

关键词： semantic web service PETRI net DOMAIN ONTOLOGY semantic MARKUP

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Ontology-Based Service-Oriented Architecture for Enterprise ...

作者：戴海慧浙江大学

学位级别：硕士

随着数十年来信息技术的发展,企业不断地利用各种不同平台和不同数据源建立信息系统来处理相关业务。整合现有系统和各种数据源以建立一条完整的业务工作流已成为企业的迫切需求。企业应用集成(EAI)技术可以通过中间件作为粘合剂来连接... 详细信息

随着数十年来信息技术的发展,企业不断地利用各种不同平台和不同数据源建立信息系统来处理相关业务。整合现有系统和各种数据源以建立一条完整的业务工作流已成为企业的迫切需求。企业应用集成(EAI)技术可以通过中间件作为粘合剂来连接企业内外各种业务相关的异构系统、应用以及数据源,从而满足E-commerce、ERP、CRM、SCM、OA、数据库、数据仓库等重要系统之间无缝共享和交换数据的需要。由于web service基于XML文档进行服务描述,服务请求和反馈结果可以在Internet上通过HTTP协议进行传递,因此web service可以很容易的被访问和返回结果。同时,由于web service的相关标准都是W3C的开放协议,与平台和操作系统无关,不同的平台和操作系统上的web service的实现在很大程度上可以做到互操作。因此web服务为异构平台上的系统集成问题提供了一个良好的解决方案。然而,web服务并没有很好地解决当前EAI技术在语义方面碰到的难题。 Ontology定义了类的结构以及各个类之间的关系。不管何种数据源及数据以何种形式存储,Ontology模型可以像词典一样为某一领域提供统一的本体描述。这种统一的描述方式为描述数据语义提供了强有力的支持。目前,很多数据集成方案基于ontology技术。在本文中,讨论一种结合了web服务和本体两种技术优势的框架:基于本体的SOA框架结构.在这个web服务框架中,Ontology作为标准数据模型,为企业在全局范围内定义词汇。同时,本文还提出关于这个框架的一系列后续工作,解决本体定义过程中的语义冲突,以及为web服务提供语义性的描述等。

关键词： SOA web service semantic web semantic web service EAI WSDL RDF OWL Ontology

An Approach for service Composition based on OWL-S Process Model

同方学位论文库评论

在线全文

同方学位论文库

学校读者我要写书评

暂无评论

An Approach for Service Composition based on OWL-S Process M...