基于优势关系的信息系统与形式概念分析

对形式概念分析在基于优势关系的信息系统中的应用进行了讨论,证明了由基于优势关系的信息系统导出的形式背景中的对象粒与优势类是等价的,同时对象粒协调集与优势协调集是等价的。     

基于计算解语义的逻辑程序测试和调试框架

逻辑程序开发过程中需要花费大量的时间用以程序调试,原因之一是调试通常包含大量的用户交互.减少对调试过程不必要的调用能够提高软件开发的效率.程序测试中得到的由同一个错误引发的多个症状是引发对调试过程不必要调用的因素之一.给出了一种逻辑程序测试和调试框架,其中测试用例的生成、症状的发现和调试(包括诊断和改错)交叉进行,由同一个错误引发的症状只有一个可引发调试过程执行,并以此方式避免了对调试过程不必要的调用.然后,利用一种基于约束的Prolog计算解语义,该框架被实例化为一种Prolog程序的测试和调试算法,本实例表明了该算法的应用.     

一种自动提取中国书画作品中印章图像的方法

在分析了中国书画印章图像特点的基础上,针对基于内容的书画作品图像检索领域中存在的"语义鸿沟"问题,提出了一种自动提取中国书画作品中印章图像的方法,并设计实现了该算法.通过对提取效果进行分析,证明该方法有较高提取率,这对书画作品中图像语义和特定图像鉴别的研究有重要意义.     

Toward a programming theory for rational agents

An important problem in agent verification is a lack of proper understanding of the relation between agent programs on the one hand and agent logics on the other. Understanding this relation would help to establish that an agent programming language is both conceptually well-founded and well-behaved, as well as yield a way to reason about agent programs by means of agent logics. As a step toward bridging this gap, we study several issues that need to be resolved in order to establish a precise mathematical relation between a modal agent logic and an agent programming language specified by means of an operational semantics. In this paper, we present an agent programming theory that provides both an agent programming language as well as a corresponding agent verification logic to verify agent programs. The theory is developed in stages to show, first, how a modal semantics can be grounded in a state-based semantics, and, second, how denotational semantics can be used to define the mathematical relation connecting the logic and agent programming language. Additionally, it is shown how to integrate declarative goals and add precompiled plans to the programming theory. In particular, we discuss the use of the concept of higher-order goals in our theory. Other issues such as a complete axiomatization and the complexity of decision procedures for the verification logic are not the focus of this paper and remain for future investigation. Part of this research was carried out while the first author was affiliated with the Nijmegen Institute for Cognition and Information, Radboud University Nijmegen.     

System-on-chip design by proof-based refinement

Systems-on-chip (SoCs) and SoC architectures provide a collection of challenging problems related to specification, modelling techniques, security issues and structuring questions. We describe a design methodology integrating the event B method and characterized by the incremental and proof-controlled construction of SoC models. The essence of the methodology is the refinement of models, starting from system requirements and producing event B models for characterizing the system under development. The refinement is a unifying concept that ensures the consistency of the different models produced and our contribution is an illustration through a case study, namely a system for measuring the parameters of audio/video quality in the digital video broadcasting (DVB) set of digital TV standards. The first part is the derivation of an architecture of parameters from the document ETSI TR 101 290 and the validation of the architecture using invariants of B models. The second part is the proposal of B models of the SystemC scheduler and an instantiation of these abstract models of the simulation semantics by parameters of the SystemC codes automatically translated from the B models of the DVB system. Finally, the third part relies upon a proof-based methodology for deriving an operational semantics of a given system that is expressed by an event B model including invariant properties.     

Transfinite Semantics in the Form of Greatest Fixpoint

Transfinite semantics is a semantics according to which program executions can continue working after an infinite number of steps. Such a view of programs can be useful in the theory of program transformations.So far, transfinite semantics have been succesfully defined for iterative loops. This paper provides an exhaustive definition for semantics that enable also infinitely deep recursion.The definition is actually a parametric schema that defines a family of different transfinite semantics. As standard semantics also match the same schema, our framework describes both standard and transfinite semantics in a uniform way.All semantics are expressed as greatest fixpoints of monotone operators on some complete lattices. It turns out that, for transfinite semantics, the corresponding lattice operators are cocontinuous. According to Kleene’s theorem, this shows that transfinite semantics can be expressed as a limit of iteration which is not transfinite.     

产品语义学在包装设计中的应用

本文把产品领域的产品语义学理论引入到包装设计中来,寻求其在包装设计中应用的可能性和前景。通过相关的分析和讨论,发现产品语义学在包装设计领域也是完全适用和可行的。产品语义学的引入为包装设计提供了新的观念和方法,开拓了包装设计新的领域,为包装设计的创新和实践提供了新的理论依据。     

知识创造视阈下的艺术设计教育

艺术设计教育的核心是创设性思维过程的形成和培养,其整个过程中含有的大量暗默知识如何与形式知识互动转换,产生创设性的思维是艺术设计创作和教育的难点。因此设计教育应该放在知识创造的视阈下进行思考。本文基于野中郁次郎和竹内弘高认为的"人类知识是通过暗默知识与形式知识之间的社会化相互作用而创造和扩展出来的"观点,分析探讨艺术设计创作和教育中的暗默知识与形式知识互动转换以及创设性思维过程的形成和培养。     

属性探索算法研究

Baader等人于2004～2007年将FCA方法引入描述逻辑中,建立了初步的属性探索算法。介绍了他们提出的属性探索算法,研究了该算法会产生冗余计算的可能情形。从相关性的角度提出了两种改进算法,并证明了它们的正确性。改进的算法在一定程度上避免了冗余,简化了计算。     

LS-SVM：一种有效的新闻主题追踪方法

新闻主题追踪是对主体所感兴趣的新闻主题的发展趋势进行动态追踪,其优势在于对所感兴趣的主题基于文本模型及理解的动态追踪,因此更多地涉及文本表示与语义理解。LS-SVM首先将文本利用LSI(隐含语义分析)进行分析,完成对文本基于语义的特征降维及文本表示;然后将隐含语义文本表示的结果输出给SVM进行主题追踪,从而实现从语义层次上的新闻主题追踪。实验结果表明,与传统的主题追踪相比较,该方法能够有效提高主题追踪的性能,减少追踪的错报率和漏报率。