介词结构语序研究回顾与展望

介词结构语序在现代汉语中违背了中心语边缘原则,对普遍语法理论提出了挑战,自《马氏文通》以来一直是学者研究的热点。现代汉语缺少形态标记,语序问题常常又与句法关系联在一起,因此本文首先回顾介词结构的句法功能探讨,然后综述介词结构语序特点的历时和共时研究,同时梳理介词结构语序研究的理论维度。文章最后指出,介词结构语序研究在理论视角、系统性以及对语序变异原因的深入挖掘等方面还存在不足。     

容错的网络声明式程序

介绍了基于递归规则的网络声明式语言Netlog的语法和分布式不动点语义,定义了强良好的程序,并证明了强良好的程序的计算结果对有限的消息丢失不敏感.     

一种扩展双极辩论模型

提出一种扩展双极辩论模型EBAF(extended bipolar argumentation framework).该模型不仅包括攻击和支援两种独立的语义关系,还允许攻击和支援的递归交互,即对攻击和支援关系进行攻击或支援,且递归次数不受限制.围绕该模型的可接受集合的确定问题,首先将该模型中的攻击和支援关系进行分离,得到攻击辩论框架和支援辩论框架;然后将攻击关系和支援关系作为实体,把递归攻击和递归支援转化为关系视角下的攻击和支援.在此基础上,定义了EBAF的基本语义概念和可接受集合,并给出了可接受集合的确定算法.最后将EBAF与其他相关辩论模型进行了比较.     

基于联结语义的概念结构建模方法研究

针对零件结构中几何元素与附着于几何元素之上的设计意图的统一表示问题，提出了基于联结语义的概念结构建模方法.该方法在零件概念结构抽象和分解的基础上，以更符合设计者表达习惯的语义形式简洁地表示零件结构间的约束关系.分析了在结构设计过程中的联结语义及其蕴涵的约束信息，建立了联结语义的约束规则集描述方法.采用联结语义关联图给出了面向概念设计的零件结构模型，实现了结构联结约束信息的抽象表达.实例研究结果表明，该建模方法使设计者可以更直观、自然地在高层次的语义层表达产品设计信息，实现工程语义的形式化表述.     

基于分类语义的Web信息检索系统

在海量数据空间中快速、准确地获取用户所需Web信息成为检索系统研究的焦点．将一种全新的网页自动分类技术引入WWW信息抽取领域来解决网上信息有效获取的问题。设计一个基于分类语义的搜索引擎系统——SESC系统．通过Web数据抽取机制以及Web信息分类技术实现检索结果的分类和层次化展示，使得用户快捷地从WWW上获取所需信息．     

The cascaded nature of lexical selection and integration in auditory sentence processing.

An event-related brain potential experiment was carried out to investigate the temporal relationship between lexical selection and the semantic integration in auditory sentence processing. Participants were presented with spoken sentences that ended with a word that was either semantically congruent or anomalous. Information about the moment in which a sentence-final word could uniquely be identified, its isolation point (IP), was compared with the onset of the elicited N400 congruity effect, reflecting semantic integration processing. The results revealed that the onset of the N400 effect occurred prior to the IP of the sentence-final words. Moreover, the factor early or late IP did not affect the onset of the N400. These findings indicate that lexical selection and semantic integration are cascading processes, in that semantic integration processing can start before the acoustic information allows the selection of a unique candidate and seems to be attempted in parallel for multiple candidates that are still compatible with the bottom-up acoustic input. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

基于抽象机模式的Java虚拟机设计

Java虚拟机（JVM）作为Java程序与操作系统之间的桥梁，解决了Java程序在异构操作系统上运行的问题．但现有JVM功能模块之间的强耦合性，给JVM结构和指令集的扩展带来了困难．本文基于抽象机模式设计的JVM．通过将JVM的静态特性和动态特性定义为分离组件来分散关注点，以及抽象机模式与JVM固有特性的结合实现的JVM具有松散的耦合度．可扩展的结构和指令集．以及易分配的指令语义．     

Semantic-Based Information Retrieval for Content Management and Security

An information retrieval system has to retrieve all and only those documents that are relevant to a user query, even if index terms and query terms are not matched exactly. However, term mismatches between index terms and query terms have been a serious obstacle to the enhancement of retrieval performance. In this article, we discuss automatic term normalization between words and phrases in text corpora and their application to a Korean information retrieval system. We perform three new types of term normalizations: transliterated word normalization, noun phrase normalization, and context-based term normalization. Transliterated words are normalized into equivalence classes by using contextual similarity to alleviate lexical term mismatches. Then, noun phrases are normalized into phrasal terms by segmenting compound nouns as well as normalizing noun phrases. Moreover, context-based terms are normalized by using a combination of mutual information and word context to establish word similarities. Next, unsupervised clustering is done by using the K-means algorithm and cooccurrence clusters are identified to alleviate semantic term mismatches. These term normalizations are used in both the indexing and the retrieval system. The experimental results show that our proposed system can alleviate three types of term mismatches and can also provide the appropriate similarity measurements. As a result, our system can improve the retrieval effectiveness of the information retrieval system.     

Probabilistic Belief Logic and Its Probabilistic Aumann Semantics

In this paper, we present a logic system for probabilistic belief named PBL,which expands the language of belief logic by introducing probabilistic belief. Furthermore, we give the probabilistic Aumann semantics of PBL. We also list some valid properties of belief and probabilistic belief, which form the deduction system of PBL. Finally, we prove the soundness and completeness of these properties with respect to probabilistic Aumann semantics.     

A residualizing semantics for the partial evaluation of functional logic programs

Recent proposals for multi-paradigm declarative programming combine the most important features of functional, logic and concurrent programming into a single framework. The operational semantics of these languages is usually based on a combination of narrowing and residuation. In this paper, we introduce a non-standard, residualizing semantics for multi-paradigm declarative programs and prove its equivalence with a standard operational semantics. Our residualizing semantics is particularly relevant within the area of program transformation where it is useful, e.g., to perform computations during partial evaluation. Thus, the proof of equivalence is a crucial result to demonstrate the correctness of (existing) partial evaluation schemes.