This paper presents an original definition of data representativeness. The representativeness of each datum in a dataset is a meaningful notion quantified by a degree computed by aggregating fuzzy subsets. These fuzzy subsets are obtained by fuzzifying data in a robust way. We illustrate the usefulness of the representativeness by presenting applications for statistical location estimation,and ...

In this paper, the fuzzy nonlinear programming problem is discussed. In order to obtain more accurate solution, the properties of fuzzy set and fuzzy number with linear membership function and fuzzy maximum decision maker is utilized to fuzzifying the crisp problem . An example is provided to show the effectiveness of the proposed method.

in this paper we study the concept of latin-majorizati-on. geometrically this concept is different from other kinds of majorization in some aspects. since the set of all $x$s latin-majorized by a fixed $y$ is not convex, but, consists of :union: of finitely many convex sets. next, we hint to linear preservers of latin-majorization on $ mathbb{r}^{n}$ and ${m_{n,m}}$.

The coordination sequence of a lattice L encodes the word-length function with respect toM , a set that generates L as a monoid. We investigate the coordination sequence of the cyclotomic lattice L = Z[ζm], where ζm is a primitive m th root of unity and where M is the set of all m roots of unity. We prove several conjectures by Parker regarding the structure of the rational generating function ...

In this paper we study the problem of minimizing condition numbers over a compact convex subset of the cone of symmetric positive semidefinite n × n matrices. We show that the condition number is a Clarke regular strongly pseudoconvex function. We prove that a global solution of the problem can be approximated by an exact or an inexact solution of a nonsmooth convex program. This asymptotic ana...

We introduce two new classes of graphs which we call convex-round, respectively concave-round graphs. Convex-round (concave-round) graphs are those graphs whose vertices can be circularly enumerated so that the (closed) neighborhood of each vertex forms an interval in the enumeration. Hence the two classes transform into each other by taking complements. We show that both classes of graphs have...