Semiring and semimodule issues in MV-algebras

In this paper we propose a semiring-theoretic approach to MV-algebras based on the connection between such algebras and idempotent semirings - such an approach naturally imposing the introduction and study of a suitable corresponding class of semimodules, called MV-semimodules. We present several results addressed toward a semiring theory for MV-algebras. In particular we show a representation of MV-algebras as a subsemiring of the endomorphism semiring of a semilattice, the construction of the Grothendieck group of a semiring and its functorial nature, and the effect of Mundici categorical equivalence between MV-algebras and lattice-ordered Abelian groups with a distinguished strong order unit upon the relationship between MV-semimodules and semimodules over idempotent semifields.Comment: This version contains some corrections to some results at the end of Section

Reachability problems for products of matrices in semirings

We consider the following matrix reachability problem: given $r$ square matrices with entries in a semiring, is there a product of these matrices which attains a prescribed matrix? We define similarly the vector (resp. scalar) reachability problem, by requiring that the matrix product, acting by right multiplication on a prescribed row vector, gives another prescribed row vector (resp. when multiplied at left and right by prescribed row and column vectors, gives a prescribed scalar). We show that over any semiring, scalar reachability reduces to vector reachability which is equivalent to matrix reachability, and that for any of these problems, the specialization to any $r\geq 2$ is equivalent to the specialization to $r=2$. As an application of this result and of a theorem of Krob, we show that when $r=2$, the vector and matrix reachability problems are undecidable over the max-plus semiring $(Z\cup\{-\infty\},\max,+)$. We also show that the matrix, vector, and scalar reachability problems are decidable over semirings whose elements are ``positive'', like the tropical semiring $(N\cup\{+\infty\},\min,+)$.Comment: 21 page

Activating Generalized Fuzzy Implications from Galois Connections

This paper deals with the relation between fuzzy implications and Galois connections, trying to raise the awareness that the fuzzy implications are indispensable to generalise Formal Concept Analysis. The concrete goal of the paper is to make evident that Galois connections, which are at the heart of some of the generalizations of Formal Concept Analysis, can be interpreted as fuzzy incidents. Thus knowledge processing, discovery, exploration and visualization as well as data mining are new research areas for fuzzy implications as they are areas where Formal Concept Analysis has a niche.F.J. Valverde-Albacete—was partially supported by EU FP7 project LiMoSINe, (contract 288024). C. Peláez-Moreno—was partially supported by the Spanish Government-CICYT project 2011-268007/TEC.Publicad

Large Scale Cross-Correlations in Internet Traffic

The Internet is a complex network of interconnected routers and the existence of collective behavior such as congestion suggests that the correlations between different connections play a crucial role. It is thus critical to measure and quantify these correlations. We use methods of random matrix theory (RMT) to analyze the cross-correlation matrix C of information flow changes of 650 connections between 26 routers of the French scientific network `Renater'. We find that C has the universal properties of the Gaussian orthogonal ensemble of random matrices: The distribution of eigenvalues--up to a rescaling which exhibits a typical correlation time of the order 10 minutes--and the spacing distribution follow the predictions of RMT. There are some deviations for large eigenvalues which contain network-specific information and which identify genuine correlations between connections. The study of the most correlated connections reveals the existence of `active centers' which are exchanging information with a large number of routers thereby inducing correlations between the corresponding connections. These strong correlations could be a reason for the observed self-similarity in the WWW traffic.Comment: 7 pages, 6 figures, final versio

Small-world networks: Evidence for a crossover picture

Watts and Strogatz [Nature 393, 440 (1998)] have recently introduced a model for disordered networks and reported that, even for very small values of the disorder $p$ in the links, the network behaves as a small-world. Here, we test the hypothesis that the appearance of small-world behavior is not a phase-transition but a crossover phenomenon which depends both on the network size $n$ and on the degree of disorder $p$. We propose that the average distance $\ell$ between any two vertices of the network is a scaling function of $n / n^*$. The crossover size $n^*$ above which the network behaves as a small-world is shown to scale as $n^*(p \ll 1) \sim p^{-\tau}$ with $\tau \approx 2/3$.Comment: 5 pages, 5 postscript figures (1 in color), Latex/Revtex/multicols/epsf. Accepted for publication in Physical Review Letter

Dynamic analysis of repetitive decision-free discreteevent processes: The algebra of timed marked graphs and algorithmic issues

A model to analyze certain classes of discrete event dynamic systems is presented. Previous research on timed marked graphs is reviewed and extended. This model is useful to analyze asynchronous and repetitive production processes. In particular, applications to certain classes of flexible manufacturing systems are provided in a companion paper. Here, an algebraic representation of timed marked graphs in terms of reccurrence equations is provided. These equations are linear in a nonconventional algebra, that is described. Also, an algorithm to properly characterize the periodic behavior of repetitive production processes is descrbed. This model extends the concepts from PERT/CPM analysis to repetitive production processes.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/44155/1/10479_2005_Article_BF02248590.pd