In this article we present a fuzzy logic based method for the construction of thoughts of artificial animals (animats). Due to the substantial increase of the processing power of personal computers in the last decade there was a notable progress in the field of animat construction and simulation. Regardless of the achieved results, the coding of the animat’s behaviour is very inaccurate and can...

Suppose that A E (]J',n is a block p-cyclic consistently ordered matrix and let Band Sw denote , respectively, the black Jacobi and the block Symmetric Successive Overrelaxation (SSOR) iteration matrices associated with A. Neumaier a.nd Varga found (in the (p(IBI),w)-plane) the exact convergence and divergence domains of the SSOR method for the class of H-matrice8. Hadjidimos and Neumann applie...

Suppose M is a countable first-order structure with a ‘rich’ automorphism group Aut(M). We will study Aut(M) both as a group and as a topological group, where the topology is that of pointwise convergence. This involves a mixture of model theory, group theory, combinatorics, descriptive set theory and topological dynamics. Here, ‘rich’ is undefined and depends on the context, but examples which...

The expectation-maximization (EM) algorithm for maximum-likelihood image recovery is guaranteed to converge, but it converges slowly. Its ordered-subset version (OS-EM) is used widely in tomographic image reconstruction because of its order-of-magnitude acceleration compared with the EM algorithm, but it does not guarantee convergence. Recently the ordered-subset, separable-paraboloidal-surroga...

and Applied Analysis 3 Lemma 3. Let (X; ≽) be a Banach lattice. Then the positive coneX is weakly closed. Proof. It is clear that the positive coneX of the Banach lattice X is convex. We have mentioned that the positive coneX of the Banach latticeX is norm closed. ApplyingMazur’s lemma (see [12] or [15]), we have in a Banach space, a convex set is norm closed if and only if it is weakly closed....

We use language technology to develop corpus measures of lexical and acoustic/prosodic convergence. We show that these measures successfully discriminate randomized from naturally ordered data, and demonstrate both lexical and acoustic/prosodic convergence in our corpus of human/human tutoring dialogs.

A gradient-type algorithm for the parametric identification of a nonlinear structure (L-N-L), comprising of a linear FIR filter in front of a set of nonlinear functions is investigated with respect to its robustness. The set of nonlinear functions is represented by a weighted sum of basis functions. Specifically, a feedback structure, describing the update-part of the adaptive algorithm, is dev...

We prove a general finite convergence theorem for “upward-guarded” fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual convergence of fixpoint computations. In particular, we are able to directly obtain several new decidability results on lossy channel systems.

Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library 1 We show how some c...

A concept of multi-valued cognitive maps is introduced in this paper. The expands the fuzzy one. However, all variables and weights are not linearly ordered concept, but only partially-ordered. Such an approach allows us to operate with partially-ordered linguistic directly, without vague fuzzification/defuzzification methods. Hence, we may consider more subtle differences degrees experts' unce...