Consider a balanced non triangular two-color Pólya-Eggenberger urn process, assumed to be large which means that the ratio σ of the replacement matrix eigenvalues satisfies 1/2 < σ < 1. The composition vector of both discrete time and continuous time models admits a drift which is carried by the principal direction of the replacement matrix. In the second principal direction, this random vector...

Logical formalisms such as first-order logic (FO) and fixpoint logic (FP) are well suited to express in a declarative manner fundamental graph functionalities required in distributed systems. We show that these logics constitute good abstractions for programming distributed systems as a whole, since they can be evaluated in a fully distributed manner with reasonable complexity upper-bounds. We ...

In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, without necessarily being perfect. Such approximate reasoning can be used to exchange solution quality for computation time, known as anytime reasoning. In this paper we study approximate versions of diagnostic reasoning. ...

let $n$ be a submodule of a module $m$ and a minimal primary decomposition of $n$ is known‎. ‎a formula to compute baer's lower nilradical of $n$ is given‎. ‎the relations between classical prime submodules and their nilradicals are investigated‎. ‎some situations in which semiprime submodules can be written as finite intersection of classical prime submodule are stated‎.

Proving tight bounds on information-theoretic indistinguishability is a central problem in symmetric cryptography. This paper introduces a new method for information-theoretic indistinguishability proofs, called “the chi-squared method”. At its core, the method requires upperbounds on the so-called χ2 divergence (due to Neyman and Pearson) between the output distributions of two systems being q...

In computational metrology one needs to compute whether an object satis es speci cations of shape within an acceptable tolerance. To this end positions on the object are measured, resulting in a collection of points in space. From this collection of points one wishes to extract information on atness, roundness, etc. of the object. In this paper we study one particular feature of objects, the an...

Bag Of visual Words (BoW) is widely regarded as the standard representation of visual information present in the images and is broadly used for retrieval and concept detection in videos. The generation of visual vocabulary in the BoW framework generally includes a quantization step to cluster the image features into a limited number of visual words. This quantization achieved through unsupervis...

the aim of this paper is to introduce the concepts of fuzzy upper and fuzzy lower almost continuous, weakly continuous and almost weakly continuous multifunctions. several characterizations and properties of these multifunctions along with their mutual relationships are established in $l$-fuzzy topological spaces