In this paper the Maximal Diameter Theorem of Riemannian geometry is proven for Riemannian orbifolds. In particular, it is shown that a complete Riemannian orbifold with Ricci curvature bounded below by (n− 1) and diameter = π, must have constant sectional curvature 1, and must be a quotient of the sphere (S, can) of constant sectional curvature 1 by a subgroup of the orthogonal group O(n+1) ac...

Different functions, each in the form of a modified Weibull cumulative distribution function (cdf), were joined together to form a segmented cdfto approximate diameter distributions in forest stands. Estimates of five percentile points (the 0th, 25th, 50th, 75th, and 100th percentiles) were used to determine a segmented cdf. The segmented cdf and the Weibull distribution were fit to diameter da...

A set V and a collection of (possibly non-disjoint) subsets are given. Also given is a real matrix describing distances between elements of V. A cover is a subset of V containing at least one representative from each subset. The multiple-choice minimum diameter problem is to select a cover of minimum diameter. The diameter is deened as the maximum distance of any pair of elements in the cover. ...

One of the basic requirements of service providers is to deliver fast processing, highly available, scalable, redundant and unobtrusive AAA services. In this paper we present incorporation of Diameter service into a legacy switching system. Our approach is based on a component architecture and the use of open source software to speed-up the development cycle. The main idea is to multiply critic...

To date, the tightest upper and lower-bounds for the active learning of general concept classes have been in terms of a parameter of the learning problem called the splitting index. We provide, for the first time, an efficient algorithm that is able to realize this upper bound, and we empirically demonstrate its good performance.