A vertex v is a boundary vertex of a connected graph G if there exists a vertex u such that no neighbor of v is further away from u than v. Moreover, if no vertex in the whole graph V (G) is further away from u than v, then v is called an eccentric vertex of G. A vertex v belongs to the contour of G if no neighbor of v has an eccentricity greater than the eccentricity of v. Furthermore, if no v...

Visual agnosia is a neuropsychological impairment of visual object recognition despite near-normal acuity and visual fields. A century of research has provided only a rudimentary account of the functional damage underlying this deficit. We find that the object-recognition ability of agnosic patients viewing an object directly is like that of normally-sighted observers viewing it indirectly, wit...

One hundred and forty two neurons in V1 and V2 were quantitatively tested using a multihistogram technique in paralyzed and anesthetized macaque monkeys. V1 neurons with receptive fields within 2 degrees from the fixation point (central V1 sample) and V1 neurons with eccentric receptive fields (15-25 degrees eccentricity, peripheral V1 sample) were compared to assess changes in velocity sensiti...

Double E(2)N(2) scaling, i.e. magnifying size and contrast, allows modelling of the deterioration of face recognition performance with increasing eccentricity (E) and the size (N) of the set from which a target face has to be identified. E(2) and N(2) values represent the eccentricities and set sizes at which stimulus size and contrast must double in order to keep performance unchanged, whilst ...

OBJECTIVE Covert visual spatial attention is a relatively new task used in brain computer interfaces (BCIs) and little is known about the characteristics which may affect performance in BCI tasks. We investigated whether eccentricity and task difficulty affect alpha lateralization and BCI performance. APPROACH We conducted a magnetoencephalography study with 14 participants who performed a co...

In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed n-node radio networks with specified eccentricity D (maximum distance from the source node to any other node). BarYehuda et al. presented an algorithm that for any n-node radio network with eccentricity D completes the broad...

We report the discovery of PSR J1753−2240 in the Parkes Multibeam Pulsar Survey database. This 95-ms pulsar is in an eccentric binary system with a 13.6-day orbital period. Period derivative measurements imply a characteristic age in excess of 1 Gyr, suggesting that the pulsar has undergone an episode of accretion-induced spin-up. The eccentricity and spin period are indicative of the companion...