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}}$.

Generalised halfspace depth function is proposed. Basic properties of this depth function including the strong consistency are studied. We show, on several examples that our depth function may be considered to be more appropriate for nonsymetric distributions or for mixtures of distributions.

For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...

The paper deals with the best unbiased estimators of the blocked compound symmetric covariance structure for m−variate observations over u sites under the assumption of multivariate normality. The free-coordinate approach is used to prove that the quadratic estimation of covariance parameters is equivalent to linear estimation with a properly defined inner product in the space of symmetric matr...

A k-hypertournament is a complete k-hypergraph with each k-edge endowed with an orientation, that is, a linear arrangement of the vertices contained in the edge. In a k-hypertournament, the score si (losing score ri) of a vertex vi is the number of arcs containing vi in which vi is not the last element (in which vi is the last element). The total score of vi is defined as ti = si − ri. In this ...

For a rank-1 matrix A = a ⊗ b over max algebra, we define the perimeter of A as the number of nonzero entries in both a and b. We characterize the linear operators which preserve the rank and perimeter of rank-1 matrices over max algebra. That is, a linear operator T preserves the rank and perimeter of rank-1 matrices if and only if it has the form T (A) = U ⊗ A ⊗ V , or T (A) = U ⊗ A ⊗ V with ...

SEMI-MARKOV DECISION INCLUDING AN UNKNOWN Masami Kurano Chiba University PROCESSES PARAMETER (Received February 27, 1984: Revised May 8,1985) We consider the problem of minimizing the long-run average (expected) cost per unit time in a semiMarkov decision process including an unknown parameter. In the case of general state and action spaces and compact parameter space we construct the adaptive ...

— The Economics of Happiness is one of the research areas of greatest growth in recent years. Throughout this work, a venture based model in which satisfaction of Spanish entrepreneurs with their professional life is performed. We analyze the responses of 9,989 entrepreneurs using data from the Global Entrepreneurship Monitor (GEM), and six hypothesis are discussed. The results show that, for t...