基于显著区域和相关反馈的图像检索算法

针对基于内容的图像检索中遇到的效率低下和语义鸿沟问题,设计并实现了一个交互式的图像检索系统。系统首先结合人类视觉注意机制提取图像显著区域,再对不同的区域进行不同特征或不同权重的描述。最后,在初次检索后应用支持向量机(Support Vector Machine,SVM)和粒子群优化(Particle Swarm Optimization,PSO)算法进行相关反馈(Rele vance Feedback,RF),使检索结果更符合用户目的。实验表明,用SVM进行反馈检索效率有大幅度提高,而PSO在小样本指导下,表现出高效的学习和快速的收敛优势。     

基于k-means算法的本体构造研究

介绍语义Web下本体以及本体构造的一些基本概念,提出一个改进的基于k-means文本聚类算法和本体构造方法,将手工构造的本体和工具构造的本体并进行准确率的计算比较。     

生物本体的研究与应用概况

生物本体是生物领域的科学知识与人工智能领域的本体方法有机结合的产物,用来建立生物科研领域的知识结构和概念模型。生物本体的研究对生物领域内部及相邻领域间的交流与合作具有重要推动作用。本文在简要介绍本体概念的基础上,阐述了生物本体的基本特点与研究意义,并分析了国内外多种生物本体的发展、研究与应用现状。     

换个角度看云计算和教育

谈到云计算,非SaaS、IaaS、PaaS莫属。要说教育,又言必课堂教学、教科书和考试。我们能不能摒弃这些物件,找个另类的观点,加以审视。或许让它们碰撞出异样的光彩,才能发现新的机缘。我想试试。什么是"云计算"?通俗一点说就是不用计算机来干计算机的活儿;干计算机干不了的活儿。计算机是干什么的?是用来计算数据的,不管是文字输入还是多媒体表达或是其他种     

中国计算机学会第十届全国Web信息系统及其应用学术会议第八届全国语义Web与本体论学术研讨会第七届全国电子政务技术及应用学术研讨会

前言 全国Web信息系统及其应用学术会议（WISA）、全国语义Web与本体论学术研讨会（SWON）、全国电子政务技术及应用学术研讨会（EGTA）是中国计算机学会暨办公自动化专委会主办的系列会议。     

基于鱼群算法的异构数据库语义聚类的研究

数据库语义上的异构成为数据整合的重点和难点。针对该问题文章提出一种基于鱼群算法的异构数据库语义聚类算法。其思路是,首先对数据库属性信息进行向量化、矢量化,利用鱼群算法得到一个较优的聚类结果,再根据鱼群算法的结果使用模糊C-均值算法进行调整聚类。实例分析结果证明,该算法具有较高的聚类准确度。     

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

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     

Algorithms for checking channel passing in web service choreography

Web service choreography describes global mod- els of service interactions among a set of participants. For an interaction to be executed, the participants must know the required channel（s） used in the interaction, otherwise the ex- ecution will get stuck. Since channels are composed dynami- cally, the initial channel set of each participant is often insuf- ficient to meet the requirements. It is the responsibility of the participants to pass required channels owned （known） by one to others. Since service choreography may involve many par- ticipants and complex channel constraints, it is hard for de- signers to specify channel passing in a choreography exactly as required. We address the problem of checking whether a service choreography lacks channels or has redundant chan- nels, and how to automatically generate channel passing based on interaction flows of the service choreography in the case of channel absence. Concretely, we propose a sim- ple language Chorc, a channel interaction sub-language for modeling the channel passing aspect of service choreography. Based on the formal operational semantics of Chore, the algo- rithms for static checking of service choreography and gen- erating channel passing are also studied, and the complexity results of algorithms are discussed. Moreover, some illus- trated service choreography examples are presented to show how to formalize and analyze service choreography with channel passing in Chorc.     

文本语义分析的实现及应用

淘宝网每天产生千万级的用户输入文本（简称UGC）,它们是无结构的,因此与结构化数据相比,更难通过语义分析技术进行信息挖掘。然而,UGC的无结构化,又使得其能够挖掘的信息是无限的。本文将讲述如何利用文本语义分析技术来挖掘有价值的信息,并介绍该技术在淘宝网的应用情况。     

一种面向语义Web服务的语义程序变换方法

语义程序变换是面向语义Web服务的软件设计方法的基础,语义程序只有通过程序变换后才能被运行环境执行和调用,然而目前还缺乏有效的语义程序变换方法。针对这一问题,基于语义编程语言SPL,提出了一种面向语义Web服务的语义程序变换方法。该方法通过对语义数据类型、语义规则、语义服务和语义流程等语义信息的有效变换,不仅提高了面向服务的程序设计的灵活性和健壮性,而且有助于提高业务流程的柔性和重用性。