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...

We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that the two cycle matroids, the finite-cycle matroid and the cycle matroid, in which also infinite cycles are taken into account, have the same connectivity function. As an application we re-prove that, also for infinite graphs, Tutte-connectivity is invariant under taking dual graphs.

In this paper we provide two recognition algorithms for the class of signed-graphic matroids along with necessary and sufficient conditions for a matroid to be signed-graphic. Specifically, we provide a polynomial-time algorithm which determines whether a given binary matroid is signed-graphic and an algorithm which determines whether a general matroid given by an independece oracle is binary s...

Gioan introduced the circuit-cocircuit reversal system of an oriented matroid and showed that its cardinality equals the number of bases when the underlying matroid is regular. We prove that the equality fails whenever the underlying matroid is not regular, hence giving a new characterization of regular matroids.

In mathematics and computer science, connectivity is one of the basic concepts of matroid theory: it asks for the minimum number of elements which need to be removed to disconnect the remaining nodes from each other. It is closely related to the theory of network flow problems. The connectivity of a matroid is an important measure of its robustness as a network. Therefore, it is very necessary ...

Given a matroid equipped with a utility vector to define a matroid optimization problem, the corresponding inverse problem is to modify the utility vector as little as possible so that a given base of the matroid becomes optimal to the matroid optimization problem. The modifications can be measured by various distances. In this article, we consider the inverse matroid problem under the bottlene...

Let M = (E,F) be a matroid on a set E, and B one of its bases. A closed set θ ⊆ E is saturated with respect to B when |θ ∩B| = r(θ), where r(θ) is the rank of θ. The collection of subsets I of E such that |I ∩ θ| ≤ r(θ) for every closed saturated set θ turns out to be the family of independent sets of a new matroid on E, called base-matroid and denoted by MB . In this paper we prove that a grap...

For any nite point set S in Ed, an oriented matroid DOM(S) can be de ned in terms of how S is partitioned by Euclidean hyperspheres. This oriented matroid is related to the Delaunay triangulation of S and is realizable, because of the lifting property of Delaunay triangulations. We prove that the same construction of a Delaunay oriented matroid can be performed with respect to any smooth, stric...