1. In three human subjects, we measured the latency of pursuit and saccadic eye movements made to an eccentric target after a fixated central target was extinguished. In one set of experiments, we varied the time interval between the extinction of the central target and the appearance of the eccentric target ("gap duration"). In a second set of experiments, we varied the eccentricity at which t...

A proper vertex coloring of a simple graph is k-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than k. A graph is k-forested qchoosable if for a given list of q colors associated with each vertex v, there exists a k-forested coloring of G such that each vertex receives a color from its own list. In this paper, we prove that the k-fore...

Topological indices (TIs) assign a numeric value to graph or molecular structure. Due their ability predict the physiochemical properties of graph, several TIs have been introduced and studied, mainly based on degree distance. For vertex v , maximum distance id="M2">v from any other in id="M3">G</m...

OBJECTIVE The objective of this study was to compare the diagnostic role of features reflecting the geometry of clusters with features reflecting the shape of the individual microcalcification in a mammographic computer-aided diagnosis system. MATERIALS AND METHODS Three hundred twenty-four cases of clustered microcalcifications with biopsy-proven results were digitized at 42-microm resolutio...

Abstract A crucial, both from theoretical and practical points of view, problem in preference modelling is the number questions to ask decision maker. We focus on incomplete pairwise comparison matrices based graphs whose average degree approximately 3 (or a bit more), i.e., each item compared three others average. In range matrix sizes we considered, $$n=5,6,7,8,9,10$$ <mml:math xmlns:mml="htt...