Measurement results contain different kinds of uncertainty. Besides systematic errors andrandom errors individual measurement results are also subject to another type of uncertainty,so-called emph{fuzziness}. It turns out that special fuzzy subsets of the set of real numbers $RR$are useful to model fuzziness of measurement results. These fuzzy subsets $x^*$ are called emph{fuzzy numbers}. The m...

the importance as well as the diculty of the problem of ranking fuzzy numbers is pointed out. here we consider approaches to the ranking of fuzzy numbers based upon the idea of associating with a fuzzy number a scalar value, its signal/noise ratios, where the signal and the noise are dened as the middle-point and the spread of each a-cut of a fuzzy number, respectively. we use the value of a ...

Let D be a finite and simple digraph with vertex set V (D), and let f : V (D)→ {−1,1} be a two-valued function. If k ≥ 1 is an integer and ∑x∈N−[v] f (x) ≥ k for each v∈V (D), where N−[v] consists of v and all vertices of D from which arcs go into v, then f is a signed k-dominating function on D. A set { f1, f2, . . . , fd} of distinct signed k-dominating functions of D with the property that ∑...

We de ne an analog of signed Eulerian numbers fn,k for involutions of the symmetric group and derive some combinatorial properties of this sequence. In particular, we exhibit both an explicit formula and a recurrence for fn,k arising from the properties of its generating function.

The signed-bit representation of real numbers is like the binary representation, but in addition to 0 and 1 you can also use −1. It lends itself especially well to the constructive (intuitionistic) theory of the real numbers. The first part of the paper develops and studies the signed-bit equivalents of three common notions of a real number: Dedekind cuts, Cauchy sequences, and regular sequence...

Let G be a graph with vertex set V (G). A function f : V (G) → {−1, 1} is a signed dominating function of G if, for each vertex of G, the sum of the values of its neighbors and itself is positive. The signed domination number of a graph G, denoted γs(G), is the minimum value of ∑ v∈V (G) f(v) over all the signed dominating functions f of G. The signed reinforcement number of G, denoted Rs(G), i...

In this paper, a novel method for ranking of fuzzy numbers are proposed. In this method, decision maker is defined based on the center of mass at some cuts of a pair of fuzzy numbers in discreet version and center of mass on all of cuts of a pair of fuzzy numbers in continuous version. Our method can rank more than two fuzzy numbers simultaneously. Also, some properties of methods are described...