For a partial cube G its crossing graph G is the graph with vertices representing Θ-classes of G, two classes being adjacent if they cross on some cycle in G. The following problem posed in [11, Problem 7.1] is considered: what can be said about the partial cube G if G is the join A⊕B of not edge-less graphs A and B? It is proved that for arbitrary graphs A and B, where at least one of them con...

We show that in the absence of any information about the ‘hidden’ target in terms of the observed sample path, and irrespectively of the distribution law of the observed process, the ‘median’ rule is optimal in both the space domain and the time domain. While the fact that the median rule minimises the spatial expectation can be seen as a direct extension of the well-known median characterisati...

Results: Cephaloauricular angle measurements of patients before the operation ranged from 46 to 57-degree. The median cephaloauricular angle was 51-degree. The recorded upper pole-to-mastoid distance ranged from 15 to 27 mm. The median upper pole-to-mastoid distance was 20 mm. After the operation, the median upper pole-to-mastoid distance was 12 mm. The postoperative median cephaloauricular ang...

We generalize the Tukey depth to use cones instead of halfspaces. We prove a generalization of the center point theorem that for S ⊂ R, there is a point s ∈ S, with depth at least n d+1 for cones of half-angle 45 . This gives a notion of data depth for which an approximate median can always be found among the original set.

9 Abstract In rapidly growing urban areas, it is deemed vital to expand (or contract) 10 an existing network of public facilities to meet anticipated changes in the level of 11 demand. We present a multi-period capacitated median model for school network 12 facility location planning that minimizes transportation costs, while functional costs 13 are subject to a budget constraint. The proposed ...

In the context of the provision of one pure public good, we study how large a preference domain can be to allow for the existence of strategy-proof rules satisfying the no vetoer condition. This question is qualified by the additional requirement that a domain should include ``a minimally rich domain.'' We first characterize generalized median voter schemes as the unique class of strategy-proof...

This paper contains a new algorithm that recognizes whether a given graph G is a Hamming graph , i . e . a Cartesian product of complete graphs , in O ( m ) time and O ( n 2 ) space . Here m and n denote the numbers of edges and vertices of G , respectively . Previously this was only possible in O ( m log n ) time . Moreover , we present a survey of other recognition algorithms for Hamming grap...

This paper develops an algorithm that identifies and decomposes a median graph of a triangulation of a 2-dimensional (2D) oriented bordered surface and in addition restores all corresponding triangulation whenever they exist. The algorithm is based on the consecutive simplification of the given graph by reducing degrees of its nodes. From the paper \cite{FST1}, it is known that such graphs can ...

Automatic human face detection is considered as the initial process of any fully automatic system that analyzes the information contained in human faces (e.g., identity, gender, expression, age, race and pose). In this paper, color segmentation is used as a first step in the human face detection process followed by grouping likely face regions into clusters of connected pixels. Median filtering...

Spatio-temporal analyses of yield variability are required to delineate areas of stable yield patterns for application of precision farming techniques. Spatial structure and temporal stability patterns were studied using 19951997 yield data for a 25-ha field located near Story City, Iowa. Corn was grown during 1995-1996, and soybean in 1997. The yield data were collected on nine east-west trans...