IMTL代数上的素布尔滤子格

本文研究IMTL代数M上的索布尔滤子的运算性质。令FB（M）为膨上全体素布尔滤子集，FB（M）=FB（M）∪{φ}，通过在集合FB（M）引进格并、交运算和逆序对合对应，证明了FB（M）构成一个拟布黎代数。进一步在FB（M）可定义一个伴随对，证明FB（M）也构成一个剩余格。     

布尔函数的c导数及其在组合电路故障检测中的应用

提出了布尔函数c导数的定义和性质,并给出了部分性质的证明. 在此基础上,提出了求解“或”搭接及“与”搭接故障测试矢量的2个定理. 通过实例讨论了布尔函数c导数在组合逻辑电路故障检测中的应用.所提出的c导数是对布尔函数的布尔导数和e导数研究的补充与完善.     

关于高阶e导数性质之研究

e导数在组合电路故障检测、揭示H布尔函数的密码学性质和确保密码学系统安全性中具有重要的作用.首先阐述了布尔函数1阶e导数的定义和性质,在此基础上,提出了布尔函数高阶e导数的概念,参照布尔代数2阶及k 阶布尔差分的定义,给出了2阶及k 阶e导数的定义与性质,并给出了证明.将1阶e导数性质推广至n 变量布尔函数任意k 阶e导数,推动与完善了关于e导数的研究.     

基于最小项表计算e导数的方法

给出了布尔函数的e导数、高阶e导数以及e偏导数的定义,在此基础上提出了基于布尔函数1值最小项表计算布尔函数的e导数、高阶e导数以及e偏导数的表格方法.该方法具有简单、不受变量数限制以及易于计算机编程操作等优点.     

计算逻辑函数布尔差分及布尔偏导数的表格方法

分析了用图形方法计算逻辑函数的布尔差分与布尔偏导数存在的问题,在分析布尔差分与布尔偏导数的定义的基础上提出了计算布尔差分与布尔偏导数的表格方法,讨论了在1值最小项数较多时用7计算布尔差分与布尔偏导数的表格方法．本文提出的表格方法与图形方法相比,具有不需画图,操作方便,易于计算机编程操作以及可用于多变量逻辑函数等优点．     

On the communication complexity oft-intersection problems in generalized Boolean algebras

We consider the following game: Two players independently choose a chain in a partially ordered set. How many bits of information have to be communicated until at least one of the players knows whether the chains have exactlyt elements in common? This model generalizes thet-intersection problem for subsets of a finite set. We establish the deterministic communication complexity in general. For the special cases of generalized Boolean algebras, we present improved nondeterministic and probabilistic protocols that are of optimal order of complexity for classes with fixed widthq.     

Subset-conjunctive rules for breast cancer diagnosis

The objective of this study was to distinguish within a population of patients with and without breast cancer. The study was based on the University of Wisconsin's dataset of 569 patients, of whom 212 were subsequently found to have breast cancer. A subset-conjunctive model, which is related to Logical Analysis of Data, is described to distinguish between the two groups of patients based on the results of a non-invasive procedure called Fine Needle Aspiration, which is often used by physicians before deciding on the need for a biopsy. We formulate the problem of inferring subset-conjunctive rules as a 0-1 integer program, show that it is NP-Hard, and prove that it admits no polynomial-time constant-ratio approximation algorithm. We examine the performance of a randomized algorithm, and of randomization using LP rounding. In both cases, the expected performance ratio is arbitrarily bad. We use a deterministic greedy algorithm to identify a Pareto-efficient set of subset-conjunctive rules; describe how the rules change with a re-weighting of the type-I and type-II errors; how the best rule changes with the subset size; and how much of a tradeoff is required between the two types of error as one selects a more stringent or more lax classification rule. An important aspect of the analysis is that we find a sequence of closely related efficient rules, which can be readily used in a clinical setting because they are simple and have the same structure as the rules currently used in clinical diagnosis.     

On some properties of base-matroids

Let M=(E,F) be a rank-n matroid on a set E and B one of its bases. A closed set θ⊆E is saturated with respect to B, or B-saturated, when |θ∩B|=r(θ), where r(θ) is the rank of θ.The collection of subsets I of E such that |I∩θ|?r(θ), for every closed B-saturated set θ, turns out to be the family of independent sets of a new matroid on E, called base-matroid and denoted by M_B. In this paper we prove some properties of M_B, in particular that it satisfies the base-axiom of a matroid.Moreover, we determine a characterization of the matroids M which are isomorphic to M_B for every base B of M.Finally, we prove that the poset of the closed B-saturated sets ordered by inclusion is isomorphic to the Boolean lattice B_n.     

Quantum logics with the Riesz Interpolation Property

We study the quantum logics which satisfy the Riesz Interpolation Property. We call them the RIP logics. We observe that the class of RIP logics is considerable large—it contains all lattice quantum logics and, also, many (infinite) non‐lattice ones. We then find out that each RIP logic can be enlarged to an RIP logic with a preassigned centre. We continue, showing that the “nearly” Boolean RIP logics must be Boolean algebras. In a somewhat surprising contrast to this, we finally show that the attempt for the σ‐complete formulation of this result fails: We show by constructing an example that there is a non‐Boolean nearly Boolean σ‐RIP logic. As a result, there are interesting σ‐RIP logics which are intrinsically close to Boolean σ‐algebras. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

布尔函数Walsh变换的非零取值个数

设Wf(y)(y∈F2^r)是布尔函数f：F2^r→F2的Walsh变换．Sf为Wf(y)≠0的y个数，S为所有Sf的并集(其中f过所有可能的布尔函数)．决定集合S是通信和信息安全领域一个重要问题．本文利用群环工具给出研究这一问题的新方法．用这种方法以统一方式证明了[4]中的结果．并利用群环方法给出了关于集合S的一系列新结果．