多模态公理化系统的可分离性研究

多模态逻辑包含两种或两种以上模态算子,且算子间不可归约。多模态公理化系统的可分离性是指已知任意多模态公理化系统及其语言中的任意算子O,能否得到与O相关的子公理化系统？或者,具有何种性质的多模态逻辑系统可以看作是多个（单）模态逻辑系统的叠加？通过考察多模态公理化系统及其子系统的性质,表明不包含交互作用的多模态公理化系统是可分离的。     

公理化设计在可在轨组装飞行器总体设计中的应用

为有效实施在轨组装服务,将公理化设计理论引入可在轨组装飞行器的总体设计,给出了一种基于功能需求的结构化设计方法。基于对组装服务的需求的了解,定义满足这些需求所需解决的问题,通过综合分析任务需求产生或选择解决方案,并进行工序设计。通过设计实例验证,为可在轨组装飞行器的具体设计提供了一种新的思路。     

Barbed Congruence of Asymmetry and Mismatch

The X calculus is a model of concurrent and mobile systems. It emphasizes that communications are information exchanges. In the paper, two constructions are incorporated into the framework of the chi calculus, which are asymmetric communication and mismatch condition widely used in applications. Since the barbed bisimilarity has proved its generality and gained its popularity as an effective approach to generating a reasonable observational equivalence, we study both the operational and algebraic properties of the barbed bisimilarity in this enriched calculus. The investigation supports an improved understanding of the bisimulation behaviors of the model. It also gives a general picture of how the two constructions affect the observational theory.     

Barbed congruence of the asymmetric chi calculus

Theχ-calculus was proposed by Fu[1, 2]with twomotivations. One is to simplifyπ-calculus structurally,and the other is to materialize a communication-as-cut-elimination viewpoint[3]. Parrow and Victor independ-ently proposed Update Calculus[4]and Fusion Calcu-lus[5], which are actually the asymmetric and polyadicχ-calculus, respectively. They shared the motivation onsimplification, but had another different intention togive a more directinterpretation of concurrentconstraintprogramming[6].…     

区间直觉模糊信息系统中的信息粒度

区间直觉模糊信息系统比一般信息系统更能全面、细致、直观地描述和刻画决策信息,对其进行不确定性研究具有重要的意义。利用信息粒度对区间直觉模糊信息系统的不确定性进行了刻画,给出了区间直觉模糊粒度结构的交、并、差、补等四种运算。提出了区间直觉模糊粒度结构上的三种偏序关系,并建立了它们之间的联系。定义了区间直觉模糊信息粒度和区间直觉模糊信息粒度的公理化,并研究它们的性质。     

行列式公理化定义的另一种形式

文献〔1〕给出了行列式公理化定义,本文给出了行列式公理化定义的另一种形式。     

Relational similarity-based model of data part 2: dependencies in data

This paper is a sequel to our previous paper on relational similarity-based model of data and its fundamental query systems. The present paper elaborates on the dependency theory in the similarity-based model, focusing mainly on similarity-based functional dependencies, their semantic entailment, model-theoretic properties, complete axiomatizations, characterization of nonredundant bases, computational issues, and related algorithms. The paper shows that various aspects of dependencies in ranked data tables over domains with similarities can be properly formalized using complete residuated lattices as structures for similarities and ranks. In addition to their theoretical importance, the results can be directly applied in the areas of similarity-based constraints, query result analysis, and knowledge discovery from relational data which involves similarity-based reasoning. We assume that readers are acquainted with the prequel of this paper.     

The Relational Structure of Belief Networks

This paper demonstrates the relational structure of belief networks by establishing an extended relational data model which can be applied to both belief networks and relational applications. It is demonstrated that a Markov network can be represented as a generalized acyclic join dependency (GAJD) which is equivalent to a set of conflict-free generalized multivalued dependencies (GMVDs). A Markov network can also be characterized by an entropy function, which greatly facilitates the manipulation of GMVDs. These results are extensions of results established in relational theory. It is shown that there exists a complete set of inference rules for the GMVDs. This result is important from a probabilistic perspective. All the above results explicitly demonstrate that there is a unified model for relational database and probabilistic reasoning systems. This is not only important from a theoretical point of view in that one model has been developed for a number of domains, but also from a practical point of view in that one system can be implemented for both domains. This implemented system can take advantage of the performance enhancing techniques developed in both fields. Thereby, this paper serves as a theoretical foundation for harmonizing these two important information domains.     

一种新的引出熵函数的绝热法

本文提出了一种新的绝热法，和一般绝热法所不同的是，该方法不仅环境角度出发，故不需要选择被考察体系的独立变量，也不需要引入关于体系性质的各种不一定具有普遍意义的假定或猜测，体系的任意性由此可得到保证。为了使环境的任意性也能得到保证，本文对环境热源的性质了不作任何限制，本文还从逻辑学的角度对热力学的一些结论作了考察，指出某些条件的非必要性，并给出了熵增原理等一些重要结论的充分必要条件，本文还通过对可设计假定的分析，指出了公理化热力学应有的特点。