Van Douwen's problem on 0-dimensional images of ordered compacta

A compact 0-dimensional space has a -separating rank 1 family of clopen sets iff it is the continuous image of a compact 0-dimensional linearly ordered space.

     

On the triple jump of the set of atoms of a Boolean algebra

We prove the following result concerning the degree spectrum of the atom relation on a computable Boolean algebra. Let be a computable Boolean algebra with infinitely many atoms and be the Turing degree of the atom relation of . If is a c.e. degree such that , then there is a computable copy of where the atom relation has degree . In particular, for every c.e. degree , any computable Boolean algebra with infinitely many atoms has a computable copy where the atom relation has degree .

     

On the Boolean Model of Wiener Sausages

The Boolean model of Wiener sausages is a random closed set that can be thought of as a random collection of parallel neighborhoods of independent Wiener paths in space. It describes e.g. the target detection area of a network of sensors moving according to the Brownian dynamics whose initial locations are chosen in the medium at random. In the paper, the capacity functional of this Boolean model is given. Moreover, the one- and two-point coverage probabilities as well as the contact distribution function and the specific surface area are studied. In and , the one- and two-point coverage probabilities are calculated numerically by Monte Carlo simulations and as a solution of the heat conduction problem. The corresponding approximation formulae are given and the error of approximation is analyzed. Research supported by the grant GACR 201/06/0302.     

(s,l)-叠加码的构作及其性质

一个二元叠加(s,l)-码在许多领域有着极为广泛的应用.利用有限集[n]的子集构作了一个(0,1)-矩阵C,并证明了它是一个(s,l)-码,给出了(s,l)-码的性质.     

Decompositions of the free additive convolution

We introduce and study a new type of convolution of probability measures, denoted μν and called the s-free additive convolution, which is defined by the subordination functions associated with the free additive convolution. We derive an alternating decomposition of μν for compactly supported μ and ν, using another convolution called orthogonal additive convolution. This decomposition leads to two types of ‘complete’ alternating decompositions of the free additive convolution μ?ν. More importantly, we develop an operatorial approach to the subordination property and introduce the associated notion of s-free independence. Moreover, we establish relations between convolutions associated with the main notions of noncommutative independence (free, monotone and boolean). Finally, our result leads to natural decompositions of the free product of rooted graphs.     

The Rivest–Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables

A Boolean function f(x₁, …, x_n) is elusive if every decision tree evaluating f must examine all n variables in the worst case. Rivest and Vuillemin conjectured that every nontrivial monotone weakly symmetric Boolean function is elusive. In this note, we show that this conjecture is true for n=10.     

Partition Complete Boolean Algebras and Almost Compact Cardinals

For an infinite cardinal K a stronger version of K-distributivity for Boolean algebras, called k-partition completeness, is defined and investigated (e. g. every K-Suslin algebra is a K-partition complete Boolean algebra). It is shown that every k-partition complete Boolean algebra is K-weakly representable, and for strongly inaccessible K these concepts coincide. For regular K ≥ u, it is proved that an atomless K-partition complete Boolean algebra is an updirected union of basic K-tree algebras. Using K-partition completeness, the concept of γ-almost compactness is introduced for γ ≥ K. For strongly inaccessible K we show that K is K-almost compact iff K is weakly compact, and if K is 2^K-almost compact, then K is measurable. Further K is strongly compact iff it is γ-almost compact for all γ ≥ K.     

The preservation of Sahlqvist equations in completions of Boolean algebras with operators

Monk [1970] extended the notion of the completion of a Boolean algebra to Boolean algebras with operators. Under the assumption that the operators of such an algebra are completely additive, he showed that the completion of always exists and is unique up to isomorphisms over . Moreover, strictly positive equations are preserved under completions a strictly positive equation that holds in must hold in the completion of . In this paper we extend Monk’s preservation theorem by proving that certain kinds of Sahlqvist equations (as well as some other types of equations and implications) are preserved under completions. An example is given that shows that arbitrary Sahlqvist equations need not be preserved. Received May 3, 1998; accepted in final form October 7, 1998.     

数字逻辑的稳健神经网络实现

多层二进前向神经网络或布尔神经网络作为典型的人工神经网络模型，研究和应用的十分广泛，这里在分析数字逻辑基本运算和神经元关系后，提出了一种改进的利用三层前向感知器神经网络实现任意数字逻辑函数的新算法，该算法由稳健的感知器构造神经网络，并引入汉明距离化简、卡诺图化简和最小项抑制来降低网络的复杂性，由此算法构造的神经网络不但具有稳健性能，而且消除了对数字输入变量所作的变换，使其更加简单、规范，容错能力更强，可广泛应用于对数字电路设计、编码密码的研究。     

Weakly o‐Minimal Expansions of Boolean Algebras

We propose a definition of weak o‐minimality for structures expanding a Boolean algebra. We study this notion, in particular we show that there exist weakly o‐minimal non o‐minimal examples in this setting.