Recently a new graph convexity was introduced, arising from Steiner intervals in graphs that are a natural generalization of geodesic intervals. The Steiner tree of a set W on k vertices in a connected graph G is a tree with the smallest number of edges in G that contains all vertices of W . The Steiner interval I(W ) of W consists of all vertices in G that lie on some Steiner tree with respect...

BACKGROUND Controversies are common in medicine. Some arise when the conclusions of research publications directly contradict each other, creating uncertainty for frontline clinicians. DISCUSSION In this paper, we review how researchers can look at very similar data yet have completely different conclusions based purely on an over-reliance of statistical significance and an unclear understand...

A t-interval is a union of at most t half-open intervals on the real line. An interval is the special case where t = 1. Requests for contiguous allocation of a linear resource can be modeled as a sequence of t-intervals. We consider the problems of online selection of intervals and t-intervals, which show up in Video-on-Demand services, high speed networks and molecular biology, among others. W...

Blood capillaries are thread-like structures that may be considered as an example of a spatial fibre process in three dimensions. At light microscopy, the capillary profiles appear as a planar point process on sections. It has recently been shown that the observed pair correlation function g(r) of the centres of the fibre profiles on two-dimensional sections may be used to estimate the reduced ...

A field experiment was conducted to assess the effects of irrigation and soil mulches on growth, yield quality strawberries in different cultivation environments. There were eight treatments a randomized complete block (RCB) design with three replications used this experiment. Plants grown under white polyethylene grew taller more spread out than those open environment. The experimental sandy l...

A d-track interval is a union of d intervals, one each from d parallel lines. The intersection graphs of d-track intervals are the unions of d interval graphs. The multitrack interval number or simply track number of a graph G is the minimum number of interval graphs whose union is G. The track number for K m;n is determined by proving that the arboricity of K m;n equals its \caterpillar arbori...

Tilapia are a commonly aquacultured fish yet little is known about their normal physiology and response to disease. In this study we determined the results of complete hematologic (n=40) and plasma biochemical profiles (n=63) in production tilapia (Oreochromis hybrids). The fish were raised in recirculating systems with a high stocking density (120 g/L), and were in the middle of a 15-month pro...

Let G(V,E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where each Ii is a closed interval of unit length on the real line. The cubicity of G, denoted by cub(G) is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way ...