In this paper we generalize some classical factorizations of a fuzzy relation into a symmetric component (indifference) and an asymmetric and regular component (regular fuzzy strict preference). From the above notions, we establish two properties of any regular fuzzy strict preference of a max-∗-transitive fuzzy relation, which are then used to obtain new fuzzy versions of Gibbard’s oligarchy t...

The problem of counting monomer-dimer coverings of a lattice is a longstanding problem in statistical mechanics. It has only been exactly solved for the special case of dimer coverings in two dimensions ((Kas61), (TF61)). In earlier work, Stanley (Sta85) proved a reciprocity principle governing the number N(m,n) of dimer coverings of an m by n rectangular grid (also known as perfect matchings),...

This paper provides Closed-form expressions for the average channel capacity and probability of outage of dual-branch Selection Combining (SC) over uncorrelated Nakagami-0.5 fading channels. This channel capacity and probability of outage are evaluated under Optimum Power with Rate Adaptation (OPRA) and Truncated Channel Inversion with Fixed Rate transmission (TIFR) schemes. Since, the channel ...

defines a second-order process whenever {z¿} converges to a zero y of f(z) of multiplicity k. The process defined by equation (2) leaves two problems unsolved: (i) In practice k and y are usually not known,* (ii) The ultimate accuracy of the approximation to 7 is limited by the fact that /(«<), f'(Zi) —* 0 as z¿ —> y, provided k S; 2. The unified process, which was developed to meet both of the...

aluminum is present in very small amounts in living organisms but abundant in the environment. a growing literature links with the biochemistry of aluminum and also with a series of diseases in chronic renal failure patients on treatment with hemodialysis. the initial description of potential aluminum toxicity in renal failure patients relates to description of dialysis encephalopathy syndrome ...

We investigate rational relations over trees. Our starting point is the definition of rational tree relations via rational expressions byRaoult (Bull. Belg.Math. Soc. 1997). We develop a new class of automata, called asynchronous tree automata, which recognize exactly these relations. The automata theoretic approach is convenient for the solution of algorithmic problems (like the emptiness prob...