有序二叉决策图在防火墙规则库设计中的应用

在防火墙规则库的设计中利用有序二叉决策图（ordered binary decision diagram，OBDD）来表示防火墙的访问控制规则集，改变了传统的顺序存储规则的规则库设计方法，以增加预处理时间为代价，有效地提高了规则的匹配速度，从而提高了防火墙的性能及其安全性．     

关于交换环的V-赋值的几个结果

定义了V-赋值的比较，给出了定理2．2：若Aω是关于Av的中间集，则(ω，A)≥(v，Γ)。研究了布尔V-幺半群，得到：若Γ为布尔V-幺半群，则(v，Γ)是形式有限的。证明了：设(B，M)为环R的非浅显Manis赋值对，则B为实环当且仅当R为实环。进一步，给出一个反例用来说明，命题2对于V-赋值对而言未必成立。     

Periodic interpolation and wavelets on sparse grids

Nested spaces of multivariate periodic functions forming a non-stationary multiresolution analysis are investigated. The scaling functions of these spaces are fundamental polynomials of Lagrange interpolation on a sparse grid. The approach based on Boolean sums leads to sample and wavelet spaces of significantly lower dimension and good approximation order. The algorithms for complete decomposition and reconstruction are of simple structure and low complexity. This revised version was published online in June 2006 with corrections to the Cover Date.     

基于布尔偏导数的组合电路双故障检测的新方法

分析了布尔偏导数与布尔差分的关系，给出了基于布尔偏导数的组合电路双故障测试集的方程，引入了奇集合的概念．在此基础上提出了基于布尔偏导数的组合电路双故障检测的新方法．实例表明该方法具有思路清晰、操作简单及易于掌握的优点．     

Some equivalents of AC in algebra II

We show that the axiom of choice AC is equivalent to the statement Any quotient group of any abelian group has a selector. We also show that the multiple choice axiom MC is equivalent to the assertion: Any filter in any Boolean ring has a well ordered filterbase. Received October 3, 1996; accepted in final form May 1, 1998.     

Unsupported Boolean algebras and forcing

If κ is an infinite cardinal, a complete Boolean algebra B is called κ‐supported if for each sequence 〈b_β : β < κ〉 of elements of B the equality _{α<κ β>α} b_β = equation/tex2gif-inf-5.gif _β∈A b_β holds. Combinatorial and forcing equivalents of this property are given and compared with the other forcing related properties of Boolean algebras (distributivity, caliber, etc.). The set of regular cardinals κ for which B is not κ‐supported is investigated. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Some Boolean Algebras with Finitely Many Distinguished Ideals I

We consider the theory Th_prin of Boolean algebras with a principal ideal, the theory Th_max of Boolean algebras with a maximal ideal, the theory Th_ac of atomic Boolean algebras with an ideal where the supremum of the ideal exists, and the theory Th_sa of atomless Boolean algebras with an ideal where the supremum of the ideal exists. First, we find elementary invariants for Th_prin and Th_sa. If T is a theory in a first order language and α is a linear order with least element, then we let Sentalg(T) be the Lindenbaum-Tarski algebra with respect to T, and we let intalg(α) be the interval algebra of α. Using rank diagrams, we show that Sentalg(Th_prin) ? intalg(ω⁴), Sentalg(Th_max) ? intalg(ω³) ? Sentalg(Th_ac), and Sentalg(Th_sa) ? intalg(ω² + ω²). For Th_max and Th_ac we use Ershov's elementary invariants of these theories. We also show that the algebra of formulas of the theory Tx of Boolean algebras with finitely many ideals is atomic.     

关于Robbins代数与Heyting代数的类似性质

Ｓ．Ｗｉｎｋｅｒ在文〔１〕中给出了Ｒｏｂｂｉｎｓ代数成为Ｂｏｏｌｅａｎ代数的一个较弱的条件。本文将讨论Ｈｅｙｔｉｎｇ代数成为Ｂｏｏｌｅａｎ代数的条件，我们发现Ｈｅｙｉｎｇ代数成为Ｂｏｏｌｅａｎ代数的条件与Ｒｏｂｂｉｎｓ代数成为Ｂｏｏｌｅａｎ代数的条件相似，从而提示了Ｈｅｙｔｉｎｇ代数与Ｒｏｂｂｉｎｓ代数之间具有一定的关系。     

Using a similarity measure for credible classification

This paper concerns classification by Boolean functions. We investigate the classification accuracy obtained by standard classification techniques on unseen points (elements of the domain, {0,1}ⁿ, for some n) that are similar, in particular senses, to the points that have been observed as training observations. Explicitly, we use a new measure of how similar a point x∈{0,1}ⁿ is to a set of such points to restrict the domain of points on which we offer a classification. For points sufficiently dissimilar, no classification is given. We report on experimental results which indicate that the classification accuracies obtained on the resulting restricted domains are better than those obtained without restriction. These experiments involve a number of standard data-sets and classification techniques. We also compare the classification accuracies with those obtained by restricting the domain on which classification is given by using the Hamming distance.