the average distance of a vertex $v$ of a connected graph $g$is the arithmetic mean of the distances from $v$ to allother vertices of $g$. the proximity $pi(g)$ and the remoteness $rho(g)$of $g$ are defined as the minimum and maximum averagedistance of the vertices of $g$. in this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...

Categorical perception (CP) is said to occur when a continuum of equally spaced physical changes is perceived as unequally spaced as a function of category membership (Harnad, S. (Ed.) (1987). Psychophysical and cognitive aspects of categorical perception: A critical overview. Cambridge: Cambridge University Press). A common suggestion is that CP for color arises because perception is qualitati...

PURPOSE To evaluate the penile morphological modifications of pubertal and adult rats chronically treated with supra-physiological doses of anabolic androgenic steroids. METHODS Forty-eight male Wistar rats were distributed into four groups: two control groups, 105- and 65-day-old (C105 and C65, respectively) injected with peanut oil (vehicle); and two treated groups, 105- and 65-day-old (T10...

Using an advanced molecular beam epitaxy system, we have reproducibly synthesized atomically smooth films of high-temperature superconductors and uniform trilayer junctions with virtually perfect interfaces. We found that supercurrent runs through very thick barriers. We can rule out pinholes and microshorts; this "giant proximity effect" (GPE) is intrinsic. It defies the conventional explanati...

We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d∗, remove from S the fewest number of points so that the remaining set has doubling dimension at most d∗. We present a bicriteria approximation for this problem, and extend this algorithm to solve a group of proximity problems.