We consider the problem of constructing a multicast tree that connects a group of source nodes to a group of sink nodes (receivers) and minimizes the maximum end-to-end delay between any pair of source/sink nodes. This is known as the minimum eccentricity multicast tree problem, and is directly related to the quality of service requirements of real multipoint applications. We deal directly with...

Although the depth-of-focus in the foveal region has been well investigated, knowledge regarding the effect of retinal eccentricity on blur detection and sensitivity is limited. In the present study, the depth-of-focus at the fovea and in the near retinal periphery (0 degrees -8 degrees ) was assessed psychophysically in 7 human subjects using a 5 mm artificial pupil with accommodation paralyze...

This paper presents adaptive algorithms to compensate roll eccentricity perturbations in web transport systems. Roll eccentricity creates tension disturbances whose frequencies may be slowly varying due to the change of radius of the roll. The magnitude and phase of these perturbations are estimated through an adaptive algorithm that cancels the effect of these perturbations. The ability of the...

Contrast thresholds of vertical Gabor patterns were measured as a function of their eccentricity, size, shape, and phase using a 2AFC method. The patterns were 4 c/deg and they were presented for 90 or 240 ms. Log thresholds increase linearly with eccentricity at a mean rate of 0.47 dB/wavelength. For patterns centered on the fovea, thresholds decrease as the area of the pattern increases over ...

In this paper, we calculate the eccentric connectivity index and the eccentricity sequence of two infinite classes of fullerenes with 50 + 10k and 60 + 12k (k in N) carbon atoms.

Let G be a connected graph. The eccentricity of path P, denoted by eccG(P), is the maximum distance from P to any vertex in G. In Central (CP) problem, our aim find minimum eccentricity. This problem was introduced Cockayne et al., 1981, study different centrality measures on graphs. They showed that CP can solved linear time trees, but it known NP-hard many classes graphs such as chordal bipar...

5 To be submitted to Paleoceanography. The accuracy of geologic chronologies can, in principle, be improved through 6 orbital tuning, the systematic adjustment of a chronology to bring the as-7 sociated record into greater alignment with an orbitally derived signal. It would 8 be useful to have a general test for the success of orbital tuning, and one pro-9 posal has been that eccentricity ough...