复杂产品的层次语义模型研究

针对复杂产品的设计建模提出了一个层次语义模型。在现有三维CAD系统的基础上，从用户需求、产品设计、零件建模、部件装配各个阶段入手，将其中蕴含的行业知识加以分类、提取、抽象，形成设计语义、建模语义和装配语义，使虚拟样机在建立过程中能够利用并且包含更多的行业知识。对该语义模型的三个层次进行了详细讨论，并结合曲柄压力机的产品实例给出了具体实现。     

基于结构化操作语义的安全协议分析框架研究

操作语义模型是一种用来分析安全协议的新模型,它以操作语义学为基础,结合了多种协议分析模型的优点,能直接分析多个协议的组合问题.本文在对安全协议操作语义模型进行研究的基础上,构建了一个基于结构化操作语义的安全协议分析框架,给出了该框架中的协议规格,协议运行,威胁模型和安全性质等形式化定义.最后,以经典的Needham Schroeder Lowe 协议为例,用该分析框架分析了其机密性和认证性.     

A Survey to View Update Problem

Extensible markup language(XML) has become the de facto standard for representing and interchanging data in web-based applications.And XML view,a virtual window for specified users,has been widely applied.In practical systems,users encounter the so-called view update problem when they need update source data through the view.For a long time,the view update problem is an open question in database community.With the development of various data models,the corresponding view update problem has been widely researched.In this paper,we introduce the conception of view update problem.We survey and compare previous approaches.Especially,we emphasize the role of semantics.Focusing on the problem in XML context,we give a discussion and propose a framework,which collects the semantic information at view definition time.Some related techniques for implementing this framework are further introduced.     

结合单词-字符引导注意力网络的中文旅游文本命名实体识别

传统基于词向量表示的命名实体识别方法通常忽略了字符语义信息、字符间的位置信息,以及字符和单词间的关联关系.提出一种基于单词-字符引导注意力网络(WCGAN)的中文旅游命名实体识别方法,利用单词引导注意力网络获取单词间的序列信息和关键单词信息,采用字符引导注意力网络捕获字符语义信息和字符间的位置信息,增强单词和字符间的关...     

基于语义的电子商务异构信息集成模式研究

电子商务平台是一个基于因特网的多信息融合环境。从本质上来说,该信息环境的数据模式属于一个异构的形式。针对电子商务平台信息融合的特点,本文探讨并研究了信息融合中的异构数据的语义集成及关键技术,提出了一类基于XML的电子商务平台异构信息的语义集成方案。     

一种UML状态图模型检测方法

为在开发过程早期发现系统设计的各种错误与不一致,提出一种UML状态图模型检测方法,用于验证设计模型与需求规约间的一致性.该方法通过元组定义UML状态图的主要元素,给出状态图的中间表示形式SC.基于SC上定义的操作语义,该方法将状态图转换为具有KRIPKE语义结构的状态迁移系统,并将系统需满足的性质表示为线性时序逻辑公式...     

基于位置语义和查询概率的假位置选择算法

针对传统位置隐私保护方案中未充分考虑攻击者拥有背景知识而导致的隐私泄露问题,基于位置语义和查询概率提出一种假位置选择算法。在假位置集中的位置之间满足语义差异性、查询概率相近且地理位置尽量分散的条件下,避免了攻击者结合背景知识过滤假位置,同时保证了查询结果的精确性。仿真实验验证了所提算法能有效保护用户的位置隐私。     

程序设计语言的形式语义研究进展

程序设计语言形式语义描述方法的产生与发展,对程序设计语言的设计和标准化,编译程序的设计和优化,程序推理,以及协议形式化描述、分析验证与设计等都有着重要的意义。回顾形式语义描述方法的研究发展史,介绍当前主要的语义形式描述方法,并给出这些方法的评价标准和比较结果;指出最有发展潜力的语义描述方法以及将来的发展方向。     

Strong equivalence of logic programs under the infinite-valued semantics

We consider the notion of strong equivalence [V. Lifschitz, D. Pearce, A. Valverde, Strongly equivalent logic programs, ACM Transactions on Computational Logic 2 (4) (2001) 526-541] of normal propositional logic programs under the infinite-valued semantics [P. Rondogiannis, W.W. Wadge, Minimum model semantics for logic programs with negation-as-failure, ACM Transactions on Computational Logic 6 (2) (2005) 441-467] (which is a purely model-theoretic semantics that is compatible with the well-founded one). We demonstrate that two such programs are strongly equivalent under the infinite-valued semantics if and only if they are logically equivalent in the corresponding infinite-valued logic. In particular, we show that strong equivalence of normal propositional logic programs is decidable, and more specifically coNP-complete. Our results have a direct implication for the well-founded semantics since, as we demonstrate, if two programs are strongly equivalent under the infinite-valued semantics, then they are also strongly equivalent under the well-founded semantics.     

Defeasible inheritance with doubt index and its axiomatic characterization

This article introduces and uses a representation of defeasible inheritance networks where links in the network are viewed as propositions, and where defeasible links are tagged with a quantitative indication of the proportion of exceptions, called the doubt index. This doubt index is used for restricting the length of the chains of inference.The representation also introduces the use of defeater literals that disable the chaining of subsumption links. The use of defeater literals replaces the use of negative defeasible inheritance links, expressing “most A are not B”. The new representation improves the expressivity significantly.Inference in inheritance networks is defined by a combination of axioms that constrain the contents of network extensions, a heuristic restriction that also has that effect, and a nonmonotonic operation of minimizing the set of defeater literals while retaining consistency.We introduce an underlying semantics that defines the meaning of literals in a network, and prove that the axioms are sound with respect to this semantics. We also discuss the conditions for obtaining completeness.Traditional concepts, assumptions and issues in research on nonmonotonic or defeasible inheritance are reviewed in the perspective of this approach.