快速语义Web服务发现方法

针对现有的基于本体描述的语义Web服务发现方法发现效率较为低下的问题,提出一种新的服务发现方法.该方法在基于本体距离计算语义Web服务综合相似度的基础上,利用数据挖掘中的聚类算法AGNES对语义Web服务集合进行聚类预处理,形成若干服务簇,然后应用相应服务发现算法根据相似度阈值定位于某一服务簇内进行查找匹配,从而可减少搜索空间.理论与仿真实验结果表明,该方法既可保证服务发现的准确率,又可明显提高服务发现的效率.     

一种基于QoS的Web服务发现模型

当前采用 OWL-S 描述的 Web 服务,主要从服务功能进行描述,缺乏对服务质量的明确刻画,导致服务请求者难以得到最佳服务.针对此问题,本文对 OWL-S 规范扩展,提出一个基于 QoS 的语义 Web 服务发现模型 SWSDM-QoS.该模型支持 QoS 的服务发布、查找和反馈,并在此基础上提出一种 QoS 约束的服务选择算法.本论文创新性之处在于在服务发现过程中加入了服务质量本体信息,使得Web服务在框架内支持QoS约束的语义发现,满足了用户的个性化需求.     

支持QoS约束的语义Web服务发现模型

分析了现有Web服务发现的不足,在系统研究Web服务发现框架的基础上,将QoS模块引入,提出一个支持QoS约束的语义Web服务发现模型SWSDM-QoS.在该模型中,支持QoS的服务发布,查找和反馈,并在此基础上提出一个基于QoS约束的服务选择算法.已经基于Microsoft.NET平台实现了一个原型系统.     

基于移动agent的语义Web服务发现模型

现有的语义Web服务发现机制还很难实现Web服务发布、发现的自动化、智能化,这严重影响了语义Web服务的质量(QoS)和满意度.因此提出了一种分布式UDDI网络环境下基于移动agent的语义Web服务发现模型,性能分析表明该模型具有较高的查全率和查准率,提高了Web服务发布,发现的自动化、智能化,缩短了查询时间,很大程度上满足了用户个性化服务需求.     

基于UDDI的语义Web服务发现研究

目前基于UDDI的Web服务发现机制仅提供了简单的基于关键字的搜索方法,缺乏对语义推理的支持。因此给出了一种基于UDDI的语义Web服务发现的架构,通过把Web服务的语义描述发布到UDDI注册中心,并扩展查询API的规范,在服务查找中加入语义推理,从而增强了UDDI的语义Web服务发现的能力。     

Fuzzy sets and similarity relations for semantic web service matching

Semantic Web Services (SWS) were introduced to facilitate the publication, discovery, and execution of web services. A semantic matchmaker enhances the capability of UDDI service registries in the SWS architecture and it is able to recognize various degrees of matching for web services. On the basis of SWS and fuzzy-set theory, a fuzzy matching approach for semantic web services is proposed, to support a more automated and veracious service discovery process.     

基于语义规则的分阶段语义Web服务发现方法

为解决现有语义Web服务发现方法发现效率较低的问题,针对服务发现过程中服务描述不对称的特点,在现有研究基础上,提出了一种基于语义规则的分阶段语义Web服务发现方法.该方法使用语义规则来刻画服务请求描述,对服务发布本体进行了扩展,并通过分阶段服务发现,实现了服务匹配范围的准确界定,提高了服务发现的效率,保证了服务发现的质量.通过与已有算法在成功率、完成时间等方面的对比模拟实验,表明了该方法的性能.     

基于本体映射的语义Web服务发现框架

分析了语义Web服务中存在的本体异构问题,讨论了语义Web服务发现中输入、输出匹配的方法,以及本体映射中概念相似度计算方法.在已有的Web服务模型基础上,引入语义Web服务发现的机制,提出了一个基于本体映射的语义Web服务发现框架,并阐述了其实现机制.该框架下的本体映射技术的应用能够增强语义Web服务发现的能力.     

基于语义的Web服务发现模型研究

Web服务发现是Web服务系统架构的重要部分,现有的主流Web服务发现方法是采用基于UDDI框架的服务匹配,但由于UDDI注册中心只能提供基于关键字的查询,并且缺乏对语义信息的支持,造成服务的查准率查全率得不到保证.针对目前Web服务发现技术存在的不足,引入了语义技术,并设计了一个基于语义的服务发现原型,来验证提出的基于语义的服务发现方法的可行性.     

Algorithms for integrating PostgreSQL with the semantic web

This paper addresses the integration of the PostgreSQL database management system (DBMS) with the Semantic Web. Integration algorithms based on the use of the DBMS capabilities that do not introduce changes in SQL are proposed. An integration based on one of the algorithms supporting main formats of the Semantic Web is presented. The proposed algorithms can be implemented in different DBMSs supporting triggers (or rules), table functions, and indexing.     

SyMSS: A syntax-based measure for short-text semantic similarity

Sentence and short-text semantic similarity measures are becoming an important part of many natural language processing tasks, such as text summarization and conversational agents. This paper presents SyMSS, a new method for computing short-text and sentence semantic similarity. The method is based on the notion that the meaning of a sentence is made up of not only the meanings of its individual words, but also the structural way the words are combined. Thus, SyMSS captures and combines syntactic and semantic information to compute the semantic similarity of two sentences. Semantic information is obtained from a lexical database. Syntactic information is obtained through a deep parsing process that finds the phrases in each sentence. With this information, the proposed method measures the semantic similarity between concepts that play the same syntactic role. Psychological plausibility is added to the method by using previous findings about how humans weight different syntactic roles when computing semantic similarity. The results show that SyMSS outperforms state-of-the-art methods in terms of rank correlation with human intuition, thus proving the importance of syntactic information in sentence semantic similarity computation.     

A similarity measure for the negotiation in web services

This paper presents a new negotiation approach integrating a similarity-based metric to measure the client’s satisfaction level by quantifying the correspondence between the features required by the client and the ones proposed by the service. This negotiation process is integrated within an adaptation platform for multimedia presentations supporting different types of terminals. The negotiation and adaptation processes are based on the management of user’s and service’s profiles. We also propose an extension of the SIP protocol to ensure the communication between the client and the server by defining new functionalities.     

A semantic service discovery approach for ubiquitous computing

Services in the ubiquitous computing are heterogeneous in nature. To be pervasive, these services should be defined in terms of their functionality and capabilities rather than the meaningless Universally Unique IDentifiers (UUIDs) or types of services. With that, clients can access the proper service based on semantic requests, rather then a pre-configured profile. In this paper, we study the requirements for semantic query to be feasible in service discovery processes. Current discovery protocols and the concept of semantics are brought together to construct a framework to realize the semantic service discovery for ubiquitous computing. Many issues are discussed in relation to service discovery topologies, ontology languages, and semantic query languages.     

一种衡量基因语义相似度的新方法*

利用GO (Gene Ontoloty) 来衡量基因之间的相似度是近年来研究的热点。传统的方法在准确性上有一定的弊端,本文提出了一种新的方法来衡量基因之间的语义相似度。该方法的主要原则是同时依赖于GO拓扑结构图中基因注释项之间的路径长度和基因注释项的公共祖先节点在GO拓扑结构图中的深度。本文用人工数据和取自酵母基因数据库的基因数据进行了实验,结果表明本文的方法比传统方法更有效。     

Joint semantic similarity assessment with raw corpus and structured ontology for semantic-oriented service discovery

Semantic-oriented service matching is one of the challenges in automatic Web service discovery. Service users may search for Web services using keywords and receive the matching services in terms of their functional profiles. A number of approaches to computing the semantic similarity between words have been developed to enhance the precision of matchmaking, which can be classified into ontology-based and corpus-based approaches. The ontology-based approaches commonly use the differentiated concept information provided by a large ontology for measuring lexical similarity with word sense disambiguation. Nevertheless, most of the ontologies are domain-special and limited to lexical coverage, which have a limited applicability. On the other hand, corpus-based approaches rely on the distributional statistics of context to represent per word as a vector and measure the distance of word vectors. However, the polysemous problem may lead to a low computational accuracy. In this paper, in order to augment the semantic information content in word vectors, we propose a multiple semantic fusion (MSF) model to generate sense-specific vector per word. In this model, various semantic properties of the general-purpose ontology WordNet are integrated to fine-tune the distributed word representations learned from corpus, in terms of vector combination strategies. The retrofitted word vectors are modeled as semantic vectors for estimating semantic similarity. The MSF model-based similarity measure is validated against other similarity measures on multiple benchmark datasets. Experimental results of word similarity evaluation indicate that our computational method can obtain higher correlation coefficient with human judgment in most cases. Moreover, the proposed similarity measure is demonstrated to improve the performance of Web service matchmaking based on a single semantic resource. Accordingly, our findings provide a new method and perspective to understand and represent lexical semantics.     

基于Petri网的语义Web服务发现框架的研究

针对目前语义Web服务发现研究中存在的不足,提出一种基于Petri网的语义Web服务发现框架.该框架利用OWL-S本体提供的语义信息及Petir网在系统动态行为方面的验证功能,从服务注册中心发现用户所需的服务组合.Web服务的发现结果不仅满足用户的功能需求,而且保证无死锁并能够正确执行,提高了服务发现的准确性.最后通过实例分析验证了该服务发现框架的有效性.     

基于结构相似性的语义网信息检索

语义网是提高网络信息检索质量的重要途径。利用现在流行的Web信息检索系统,扩展其处理语义Web文档中的苎义评注的能力,采用更有效的文档分类算法,将语义Web文档组织成蔟,提高检索质量。介绍的算法与标准的基于图匹配算法相比,计算代价降低,便于后续的存储、抽取和处理等工作。