An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x 6= y of vertices such that both xy and yx are in D. In this paper, we consider certain well-known classes of strong digraphs, each member D of which has an orientation with diameter not exceeding the diameter of D by more than a small constant.

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

objectives: the aim of this study was to survey relationship between religious orientation and happiness in elderly man and woman in tehran. methods and materials: the present study was descriptive and causal- comparative. in order to survey the relationship between religious orientation and happiness among the elderly men and women in tehran 389 aged people above 60 years including 247 men and...

In contrast to the abundant literature investigating how orientation coding depends on edges defined by various image features, relatively little is known about how coding of orientation might also depend on the two distinct functional roles that oriented edges commonly play. Oriented lines can delineate outline contours of a figure or they can form texture. The results of five experiments usin...

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

We consider maximum likelihood estimation of finite mixture of uniform distributions. We prove that maximum likelihood estimator is strongly consistent, if the scale parameters of the component uniform distributions are restricted from below by exp(−nd), 0 < d < 1, where n is the sample size.