The blind source separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical independence between outputs. Since global maximization may be difficult without exhaustive search, criteria for which all the local maxima correspond to an acceptable solution of the BSS problem are of interest. It is known that some BSS criteria used in a deflation procedure ...

A blind equalization method based on the theory of independent component analysis is presented. The blind equalization of an unknown FIR channel with possibly non-minimum phase is formulated as a blind separation problem. The inputs to the equalizer are formed by stacking the fractional samples of the channel outputs. New on-line blind equalization algorithms are developed from on-line blind se...

Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model property. We exploit this property to give an encoding of this fragment into a first-order logic containing only the propositional connectives, quantification over the natural numbers and equality. This result is the first...

In this paper we study various properties of complements of sets and the Efremovič separation property in a symmetric pre–apartness space.

We recover the rays in the tensor product of Hilbert spaces within a larger class of so called ‘states of compoundness’, structured as a complete lattice with the ‘state of separation’ as its top element. At the base of the construction lies the assumption that the cause of actuality of a property of one individual entity is actuality of a property of the other.

The article considers the problem of segmenting interrelated terminals a transport network into fixed number relatively autonomous hubs when solving technical problems. There has been proposed most common and simple option for graph partition problems - by r-partitioning. Useful practical approaches to are studied. an assessing version developing segmentation procedures their content-richness. ...

We introduce a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP to allow temporal dependencies in the hidden variables. We use this stochastic process to build a nonparametric extension of the factorial hidden Markov model. After constructing an inference scheme which combines sli...

Abstract The game-theoretical approach to non-extensive entropy measures of statistical physics is based on an abstract measure of complexity from which the entropy measure is derived in a natural way. A wide class of possible complexity measures is considered and a property of factorization investigated. The property reflects a separation between the system being observed and the observer. App...

It was proved in [4] that interpolation properties of propositional normal modal logics (n.m.l.) are closely connected with amalgamation properties of associated varieties of modal algebras. In this paper we find an algebraic equivalent of the Hallden property in modal logics, namely, we prove that the Hallden-completeness in any n.m.l. is equivalent to the so-called Super-Embedding Property of...