Displaying similar documents to “Cycle-free cuts of mutual rank probability relations”

On an algorithm for testing T4 solvability of max-plus interval systems

Helena Myšková (2012)

Kybernetika

Similarity:

In this paper, we shall deal with the solvability of interval systems of linear equations in max-plus algebra. Max-plus algebra is an algebraic structure in which classical addition and multiplication are replaced by ⊕ and ⊗ , where a ⊕ b = max { a , b } , a ⊗ b = a + b . The notation 𝔸 ⊗ x = 𝕓 represents an interval system of linear equations, where 𝔸 = [ b ¯ , A ¯ ] and 𝕓 = [ b ̲ , b ¯ ] are given interval matrix and interval vector, respectively. We can define several types of solvability of interval systems. In this paper, we define the T4 solvability and...

Equivalence of compositional expressions and independence relations in compositional models

Francesco M. Malvestuto (2014)

Kybernetika

Similarity:

We generalize Jiroušek’s (right) composition operator in such a way that it can be applied to distribution functions with values in a “semifield“, and introduce (parenthesized) compositional expressions, which in some sense generalize Jiroušek’s “generating sequences” of compositional models. We say that two compositional expressions are equivalent if their evaluations always produce the same results whenever they are defined. Our first result is that a set system ℋ is star-like with...

An iterative algorithm for computing the cycle mean of a Toeplitz matrix in special form

Peter Szabó (2013)

Kybernetika

Similarity:

The paper presents an iterative algorithm for computing the maximum cycle mean (or eigenvalue) of n × n triangular Toeplitz matrix in max-plus algebra. The problem is solved by an iterative algorithm which is applied to special cycles. These cycles of triangular Toeplitz matrices are characterized by sub-partitions of n - 1 .