Graphoid properties of epistemic irrelevance and independence

This paper investigates Walley's concepts of epistemic irrelevance and epistemic independence for imprecise probability models. We study the mathematical properties of irrelevance and independence, and their relation to the graphoid axioms. Examples are given to show that epistemic irrelevance can violate the symmetry, contraction and intersection axioms, that epistemic independence can violate contraction and intersection, and that this accords with informal notions of irrelevance and independence.     

Strong Conditional Independence for Credal Sets

This paper investigates the concept of strong conditional independence for sets of probability measures. Couso, Moral and Walley [7] have studied different possible definitions for unconditional independence in imprecise probabilities. Two of them were considered as more relevant: epistemic independence and strong independence. In this paper, we show that strong independence can have several extensions to the case in which a conditioning to the value of additional variables is considered. We will introduce simple examples in order to make clear their differences. We also give a characterization of strong independence and study the verification of semigraphoid axioms.     

一种带传递关系的认知描述逻辑研究

描述逻辑是语义Web的逻辑基础,它是形式化表达领域知识的一种工具.描述逻辑是一阶逻辑的可判定子集,适合对领域知识的概念术语进行建模.因为某些应用程序的需要和领域知识难以完全描述的因素,Web上有大量的不完全知识.描述逻辑基于开放世界假设,只能表达单调推理,不能处理不完全知识.在描述逻辑中加入认知运算符K可以得到认知描述逻辑.认知描述逻辑因其非单调特性和良好的时间复杂度等特点在处理不完全知识方面有较好的优势.在认知描述逻辑ALCK的基础上加入传递关系属性提出了新的认知描述逻辑语言ALCKR+,保留了描述逻辑原有的优点,增强了表达能力并通过认知查询拥有了非单调推理的能力.设计了ALCKR+的语法、语义以及表算法,给出了表算法的正确性以及可判定性证明,证明表算法的时间复杂度为PSPACE-tomplete.     

An Interpretation of Default Logic in Minimal Temporal Epistemic Logic

When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in this area is Reiter's Default Logic (1980). A characteristic of this formalism is that the applicability of default (inference) rules can only be verified in the future of the reasoning process. We describe an interpretation of default logic in temporal epistemic logic which makes this characteristic explicit. It is shown that this interpretation yields a semantics for default logic based on temporal epistemic models. A comparison between the various semantics for default logic will show the differences and similarities of these approaches and ours.     

Robust inference of trees

This paper is concerned with the reliable inference of optimal tree-approximations to the dependency structure of an unknown distribution generating data. The traditional approach to the problem measures the dependency strength between random variables by the index called mutual information. In this paper reliability is achieved by Walley's imprecise Dirichlet model, which generalizes Bayesian learning with Dirichlet priors. Adopting the imprecise Dirichlet model results in posterior interval expectation for mutual information, and in a set of plausible trees consistent with the data. Reliable inference about the actual tree is achieved by focusing on the substructure common to all the plausible trees. We develop an exact algorithm that infers the substructure in time O(m ⁴), m being the number of random variables. The new algorithm is applied to a set of data sampled from a known distribution. The method is shown to reliably infer edges of the actual tree even when the data are very scarce, unlike the traditional approach. Finally, we provide lower and upper credibility limits for mutual information under the imprecise Dirichlet model. These enable the previous developments to be extended to a full inferential method for trees.     

JAVA实时处理能力改进的研究

实时系统的多样性与复杂性迫切需要一种与平台无关的程序设计语言，而JAVA语言的跨平台性使其首先在网络应用中大放异彩，但却无法满足实时计算的要求。本文分析了实时计算设计的现状与JAVA语言的性能改进，并从七个方面介绍了对JAVA进行的实时扩展来适应实时设计的需要。     

二元截集下Vague集的表现定理及扩展原理

在Fuzzy集和Vague集理论的基础上,根据二元截集下集合套的概念和Vague集的分解定理,得出新的Vague集的表现定理、扩展原理,并且讨论了相关的代数性质,清楚地表现了经典集与Vague集之间的联系。     

基于单片机的空调控制器抗干扰措施研究

文章介绍了基于单片机的空调控制器原理,详细阐述了为保证空调控制器工作的安全性和稳定性,从软件和硬件两方面如何采取措施,优化设计,提高控制器的抗干扰能力。     

On partitions of functions on finite sets

Let D and R be finite sets with cardinality n and m respectivelyR ^D be the set of all functions from D into R, and G and H be permutation groups acting on D and R respectively. Two functions f and g in R ^D are said to be related if there exists a σ in G and a τ in H with f(σd) = τg(d) for every d in D. Since the relation is an equivalence relation, R ^D is partitioned into disjoint classes. Roughly, by using the cycle indices of G and H, de Bruijn's theorem determines the number of equivalence classes, and Pólya's theorem, with H being the identity group, gives the function counting series, Pólya-de Bruijn's theorem has many applications (for instance, see Pólya and Read [6]). The theorem and its applications, basically, centered around the partitions of functions. Here, we present an algorithm to determine which functions in R ^D belong to the same equivalent class. Our algorithm does not use the cycle indices of G and H (to compute the cycle index of a given group, in general, is difficult), but it uses the generators of G and H, and the m-nary numbers to code the functions in R ^D . Our algorithm also gives the function counting series and the number of equivalence classes. An important application is that for each positive integer n, we use our algorithm and the symmetric group S _n to determine all isomorphic and nonisomorphic graphs and directed graphs with n vertices.     

Approximation of sets based on partial covering

In this current paper we reveal a mathematical tool that helps us to comprehend certain natural phenomena. The main idea of this tool is a possible generalization of approximations of sets relying on the partial covering of the universe of discourse.Our starting point will be an arbitrary nonempty family B of subsets of an arbitrary nonempty universe U. On the analogy of the definition of Pawlak’s type σ-algebra σ(U/ε) over a finite universe, let D_B denote the family of subsets of U which contains the empty set and every set in B and it is closed under unions. However, D_Bneither covers the universe nor is closed under intersections in general. Our notions of lower and upper approximations are straightforward point-free generalizations of Pawlak’s same approximations which are imitations of the ε-equivalence class based formulations. Both of them belong to D_B. Our discussion will be within an overall approximation framework along which the common features of rough set theory and our approach can be treated uniformly.To demonstrate the relationship of our approach with natural computing, we will show an example relying on the so-called MÉTA program which is a recognition and evaluation program of the actual state of the natural and semi-natural vegetation heritage of Hungary.     

基于USB总线技术的ATS信号调理平台硬件设计

针对开放式通用ATS信号调理平台进行研究,提出了基于USB总线技术的信号调理平台设计方案。本系统采用Cypress公司推出的EZ-USB单片机中的AN2131QC芯片作为接口控制芯片,EZ-USB的软配置特性可以实现系统硬件的通用化,针对不同的被测对象编制不同的固件程序,当被测对象发生变化时,可以通过加载不同的固件来满足测试要求。针对复杂的信息控制与数据交换,采用了ALTERA公司推出的EPM7128SLC84芯片作为核心控制部分。系统具有可靠性高,可测试性好等优点。     

基于EIP-CDIO理念下培养学生独立性与创新性的研究与实践

本文简要介绍汕头大学工学院结合我国的工程教育实际,在CDIO国际工程教育与人才培养模式的基础上提出的EIP-CDIO培养模式,提出在EIP-CDIO教学理念实施过程中培养学生的自主创新能力是最基本的培养内容,给出在EIP-CDIO教学实践中进行独立性与创新性教学的几个教学案例,并指出在EIP-CDIO教学实践中应用教育心理学的重要性和必要性。     

Construction of checking sequences based on characterization sets

A general model for constructing checking sequences employing a characterization set for a given finite state machine is proposed. Some existing methods are shown to be special cases of the proposed model and are proven to construct checking sequences. Examples are provided as applications of the general model and its special cases.     

Minimization of axiom sets on fuzzy approximation operators

Axiomatic characterization of approximation operators is an important aspect in the study of rough set theory. In this paper, we examine the independence of axioms and present the minimal axiom sets characterizing fuzzy rough approximation operators and rough fuzzy approximation operators.     

Case studies on passivity-based stabilisation of closed sets

We present a novel control design procedure for the passivity-based stabilisation of closed sets which leverages recent theoretical advances. The procedure involves using part of the control freedom in order to enforce a detectability property, while the remaining part is used for passivity-based stabilisation. The procedure is illustrated in four case studies of path following coordination for one or two kinematic unicycles, and variations of these problems. Among other things, we present a smooth global path following controller making the unicycle converge to an arbitrary closed and strictly convex curve, and a coordinated path following controller for two unicycles.     

Analysis of K sets of data, with differential emphasis on agreement between and within sets

A general class of methods for (partial) rotation of a set of (loading) matrices to maximal agreement has been available in the literature since the 1980s. It contains a generalization of canonical correlation analysis as a special case. However, various other generalizations of canonical correlation analysis have been proposed. A new general class of methods for each such alternative generalization of canonical correlation is proposed. Together, these general classes of methods form a superclass of methods that strike a compromise between explaining the variance within sets of variables and explaining the agreement between sets of variables, as illustrated in some examples. Furthermore, one general algorithm for finding the solutions for all methods in all general classes is offered. As a consequence, for all methods in the superclass of methods, algorithms are available at once. For the existing methods, the general algorithm usually reduces to the standard algorithms employed in these methods, and thus the algorithms for all these methods are shown to be related to each other.     

马尔柯夫链在陶瓷产品市场预测与决策中的应用

对销售市场来说,影响陶瓷产品销售的因素是多方面的,有自身的因素,同时还有外界的随机因素,这些因素会造成陶瓷商品销售量很大的波动幅度,用简单的回归方法难以预测,而马尔柯夫链不受上述因素的影响。本文利用马尔柯夫链理论对陶瓷产品销售市场的未来趋势进行建模,分析陶瓷产品在市场上的状态分布,得到了比较稳定的预测值,从而为提高陶瓷企业的市场竞争力、预测能力及其产品的市场占有率提供了理论依据。     

基于分形分辨率无关性的应用研究

针对解码图像的方块效应,提出了一种基于分形编码分辨率无关性的新的解决方案。在低分辨率下解码图像后,结合双线性与最近邻点插值方法还原图像。在不改变原编码的前提下,该算法有效地减少了解码图像的方块效应。     

Analysis and extension of decision trees based on imprecise probabilities: Application on noisy data

An analysis of a procedure to build decision trees based on imprecise probabilities and uncertainty measures, called CDT, is presented. We compare this procedure with the classic ones based on the Shannon’s entropy for precise probabilities. We found that the handling of the imprecision is a key part of obtaining improvements in the method’s performance, as it has been showed for class noise problems in classification. We present a new procedure for building decision trees extending the imprecision in the CDT’s procedure for processing all the input variables. We show, via an experimental study on data set with general noise (noise in all the input variables), that this new procedure builds smaller trees and gives better results than the original CDT and the classic decision trees.