We prove that every tree T = (V,E) on n vertices with edges of unit length can be embedded in the plane with distortion O( √ n); that is, we construct a mapping f :V → R such that ρ(u, v) ≤ ‖f(u) − f(v)‖ ≤ O( √ n) · ρ(u, v) for every u, v ∈ V , where ρ(u, v) denotes the length of the path from u to v in T . The embedding is described by a simple and easily computable formula. This is asymptotic...

the aim of this study was to compare the intensity of pre-competition emotion in athletes with type a and b behavior patterns. out of 108 wrestlers participating in iranian national championships (2005), 32 wrestlers were selected as subjects by global bortner scale. then, 16 subjects with high scores (mean 6.45±0.31) formed type a athletes group and 16 with low scores (mean 3.69 ± 0.47) were c...

Explaining the connection, if any, between simplicity and truth is among the deepest problems facing the philosophy of science, statistics, and machine learning. Say that an efficient truth finding method minimizes worst case costs en route to converging to the true answer to a theory choice problem. Let the costs considered include the number of times a false answer is selected, the number of ...

In this paper, we improve the idea of the near-optimal alignments. Though the near optimal alignments increase the possibility to find the correct alignment, too many of them may confuse the biologists. So we present the filter scheme for the near-optimal alignments. An easy method to trace the nearoptimal alignments and an algorithm to filter those alignments are proposed.1 The time complexity...