Customizing verb definitions for specific semantic domains

We examine the functions performed by verb definitions in the process of semantic interpretation in PUNDIT, and the changes in the interpretation process that are caused by different uses of the same verb. We give detailed examples of how the interpretation process is affected by changes in thematic roles, selection restrictions and semantic predicates in the decompositions that constitute the verb definitions. In addition we introduce the notion of a change-of-state inference that must be drawn by reference resolution and argue that it plays an equally important function in capturing distinctions among verb senses. We demonstrate the role of the change-of-state inference with several different concrete representations of varying senses of the verb break.Rebecca Passonneau and Carl Weir have made major contributions to the theory and implementation of verb semantics in the PUNDIT system. Marcia Linebarger has provided invaluable insights into verb semantics illustrated by innumerable examples without which the last two sections of this paper would not exist. Also, Bonnie Webber made substantial contributions to the representations of the verb break.     

XML＋RDF＋Ontology——实现Web数据语义的描述

本文首先给出了语义Web的体系结构，继而分析了XML结合RDF与Ontology怎样用于实现Web数据语义的描述．最后总结了全文。     

Describing businesses with data dictionaries

A data dictionary not only describes the computer processes and data within a computer system but also the business processes and data which they represent. In this way a computer system actually mirrors the way the user's business works and is not merely a reflection of the way the systems analysts perceive it. The use of entity modelling for building the data dictionary and the development of application generators are also described.     

Describing Team Work with Activity Theory

The proposal that activity theory might serve as a model or theory for computer-supported cooperative working remains an open question. Here we demonstrate the usefulness of activity theory in elucidating a series of small group software design meetings. The structure and dynamics of the meetings are presented, as are the work processes of transformation and mediation. Finally, we show how a contradictions analysis can support the derivation of requirements on a system to support the design meetings.     

远程控制指令的XML描述及实现

尝试使用XML描述远程控制指令,对XML指令结构进行讨论,提出一套指令被分析执行的方案,并通过案例验证了该方案的可行性。     

远程控制指令的XML描述及实现

尝试使用XML描述远程控制指令,对XML指令结构进行讨论,提出一套指令被分析执行的方案,并通过案例验证了该方案的可行性.     

Experiments with semantic paramodulation

A semantic restriction is presented for use with paramodulation in automated theorem-proving programs. The method applies to first-order formulas with equality whole clause forms are Horn sets. In this method, an interpretation is given to the program along with the set of clauses to be refuted. The intention is to have the interpretation serve as an example to guide the search for a refutation. The semantic restriction was incorporated into an existing automated theorem-proving program, and a number of experiments were conducted on theorems in abstract algebra. Semantic paramodulation is an extension of set-of-support paramodulation. A comparison of the two strategies was used as the basis for experimentation. The semantic searches performed markedly better than the corresponding set-of-support searches in many of the comparisons. The semantic restriction seems to make the program less sensitive to the choice of rewrite rules and supported clauses.     

集成RGB-D语义分割网络的室内语义地图构建

针对传统视觉SLAM准确度低、实时性差、缺乏语义的问题,提出一种全新的RGB-D语义分割网络,利用室内场景中受光照等条件影响较小的深度信息来提高分割的准确性,并且设计了轻量级多尺度残差模块(MRAM)和空间金字塔池化模块(ASPP)来轻量化分割网络、提高分割的精度。首先输入的图像序列进入ORB-SLAM2网络进行关键帧筛选,之后关键帧送入语义分割网络得到二维语义标签,再将二维语义信息映射到三维点云空间,最后使用贝叶斯算法更新三维地图得到全局一致的三维点云语义地图。实验采用NYUv2数据集验证语义分割网络性能,采用TUM数据集构建点云语义地图,结果表明,提出的语义分割网络性能和速度优于现有的模型,且此语义分割网络与视觉SLAM相结合可以满足高精度、实时的稠密三维语义点云地图构建要求。     

Tree kernel-based semantic relation extraction with rich syntactic and semantic information

This paper proposes a novel tree kernel-based method with rich syntactic and semantic information for the extraction of semantic relations between named entities. With a parse tree and an entity pair, we first construct a rich semantic relation tree structure to integrate both syntactic and semantic information. And then we propose a context-sensitive convolution tree kernel, which enumerates both context-free and context-sensitive sub-trees by considering the paths of their ancestor nodes as their contexts to capture structural information in the tree structure. An evaluation on the Automatic Content Extraction/Relation Detection and Characterization (ACE RDC) corpora shows that the proposed tree kernel-based method outperforms other state-of-the-art methods.     

Ontology matching with semantic verification

Automated Semantic Matching of Ontologies with Verification (ASMOV) is a novel algorithm that uses lexical and structural characteristics of two ontologies to iteratively calculate a similarity measure between them, derives an alignment, and then verifies it to ensure that it does not contain semantic inconsistencies. In this paper, we describe the ASMOV algorithm, and then present experimental results that measure its accuracy using the OAEI 2008 tests, and that evaluate its use with two different thesauri: WordNet, and the Unified Medical Language System (UMLS). These results show the increased accuracy obtained by combining lexical, structural and extensional matchers with semantic verification, and demonstrate the advantage of using a domain-specific thesaurus for the alignment of specialized ontologies.     

Fuzzy clustering with semantic interpretation

In the framework of Axiomatic Fuzzy Set (AFS) theory, we propose a new approach to data clustering. The objective of this clustering is to adhere to some principles of grouping exercised by humans when determining a structure in data. Compared with other clustering approaches, the proposed approach offers more detailed insight into the cluster's structure and the underlying decision making process. This contributes to the enhanced interpretability of the results via the representation capabilities of AFS theory. The effectiveness of the proposed approach is demonstrated by using real-world data, and the obtained results show that the performance of the clustering is comparable with other fuzzy rule-based clustering methods, and benchmark fuzzy clustering methods FCM and K-means. Experimental studies have shown that the proposed fuzzy clustering method can discover the clusters in the data and help specify them in terms of some comprehensive fuzzy rules.     

XYZ／AE描述程序性质的探讨

为保证程序的正确性，程序在投入使用前需要检验其是否满足规定的性质，那么程序的性质需要用一种语言来描述。XYZ／AE是时序逻辑系统XYZ的一个子语言，用此语言描述程序性质有很多优点。XYZ／AE不仅能描述所有的程序性质且简单易懂，另外它能与可执行语言XYZ／EE结合，描绘程序中间程度的抽象性，具有很好的扩展性。文章从上述几方面探讨了XYZ／AE描述程序性质的能力。     

Describing the MMI demonstrators with the IMMPS reference model

The architecture of the MMI demonstrators is presented, firstly as described by the authors and then in terms of the Reference Model for Intelligent Multimedia Presentation Systems (IMMPS). The analysis shows that the presentation pipeline of the MMI² architecture can be readily described in terms of the Reference Model, without either significant parts of the Reference Model being unused, or parts of the architecture remaining undescribed. The Reference Model would have to be extended to accommodate the input components of the MMI² architecture, but these are explicitly outside its scope. The exercise has shown some minor limitations in the coordination and layout control in the MMI² architecture which were not evident before.