In this paper we have introduced a class of decision rules related to simple majority, by considering individual intensities of preference. These intensities will be shown by means of linguistic labels. In order to compare the amount of opinion obtained by each alternative, we have considered the total ordered monoid generated by the sums of the original labels, according to an addition and an ...

This paper defines a class of designs which generalise t-designs, resolvable designs, and orthogonal arrays. For the parameters t = 2, k = 3 and λ = 1, the designs in the class consist of Steiner triple systems, Latin squares, and 1-factorisations of complete graphs. For other values of t and k, we obtain t-designs, Kirkman systems, large sets of Steiner triple systems, sets of mutually orthogo...

The purpose of this paper is to study the classification problem of discrete time and continuous time Markov processes of matrix M/G/1 type with a tree structure. We begin this paper by developing a computational method to find whether a Markov process of matrix M/G/1 type with a tree structure is positive recurrent, null recurrent, or transient. The method is then used to study the impact of t...

This paper presents a multi-scale generative model for representing animate shapes and extracting meaningful parts of objects. The model assumes that animate shapes (2D simple closed curves) are formed by a linear superposition of a number of shape bases. These shape bases resemble the multi-scale Gabor bases in image pyramid representation, are well localized in both spatial and frequency doma...

This paper presents a multi-scale generative model for representing animate shapes and extracting meaningful parts of objects. The model assumes that animate shapes (2D simple closed curves) are formed by a linear superposition of a number of shape bases. These shape bases resemble the multi-scale Gabor bases in image pyramid representation, are well localized in both spatial and frequency doma...

We analyze a class of random spanning trees built on a realization of an homogeneous Poisson point process of the plane. This tree has a local construction rule and a radial structure with the origin as its root We first use stochastic geometry arguments to analyze local functionals of the random tree such as the distribution of the length of the edges or the mean degree of the vertices. Far aw...

The energy scaling laws of multihop data fusion networks for distributed inference are considered. The fusion network consists of randomly located sensors independently distributed according to a general spatial distribution in an expanding region. Among the class of data fusion schemes that enable optimal inference at the fusion center for Markov random field hypotheses, the minimum per-sensor...

Recently Peres and Shields discovered a new method for estimating the order of a stationary fixed order Markov chain [15]. They showed that the estimator is consistent by proving a threshold result. While this threshold is valid asymptotically in the limit, it is not very useful for DNA sequence analysis where data sizes are moderate. In this paper we give a novel interpretation of the Peres-Sh...

We consider a process in which information is transmitted from a given root node on a noisy d-ary tree network T . We start with a uniform symbol taken from an alphabet A. Each edge of the tree is an independent copy of some channel (Markov chain) M , where M is irreducible and aperiodic on A. The goal is to reconstruct the symbol at the root from the symbols at the nth level of the tree. This ...

We consider unsupervised estimation of mixtures of discrete graphical models, where the class variable corresponding to the mixture components is hidden and each mixture component over the observed variables can have a potentially different Markov graph structure and parameters. We propose a novel approach for estimating the mixture components, and our output is a tree-mixture model which serve...