This paper presents a method to mathematically analyze the nerve impulse propagation in nonuniform axons. Starting from the general, nonlinear one-dimensional cable equations with spatially varying cable diameter, the problem is shown to be eqiuvalent (under some variable transformations) to the case of uniform axons. Characterized by the same normal form, six functions for analytically treatab...

The in vitro activities of metronidazole, nimorazole, and tinidazole were compared against 69 strains of obligately anaerobic Gram-negative bacilli. Geometric mean MICs were 0-34, 1-05, and 0-28 mug/ml respectively. Thirty-six strains were also tested by the disk method. Correlation between MIC and diameter of the zones of inhibition was poor.

This paper answers a query of S. Vincze (Acta Univ. Szeged, Sect. Sci. Math. 12 A (1950) 136–142): find the convex octagon with unit-length sides and minimum diameter. It also shows that the solution is -unique. The proof uses geometric arguments and a global optimization algorithm to solve a nonconvex quadratic program.

We model imprecise points as regions in which one point must be located. We study computing the largest and smallest possible values of various basic geometric measures on sets of imprecise points, such as the diameter, width, closest pair, smallest enclosing circle, and smallest enclosing bounding box. We give efficient algorithms for most of these problems, and identify the hardness of others.

Let P be a non positively curved polygon of nite groups The group P acts on a contractible complex XP and we prove that this complex is a building if and only if the links have angular diameter When P has zero group theoretic curvature a geometric argument shows that the periodic apartments are dense in the set of all apartments

We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dynamic algorithms for a number of geometric problems, including closest/farthest neighbor searching, fixed dimension linear programming, bi-chromatic closest pair, diameter, and Euclidean minimum spanning tree.

We point out geometric upper and lower bounds on the masses of bosonic and fermionic Kaluza-Klein excitations in the context of theories with large extra dimensions. The characteristic compactification length scale is set by the diameter of the internal manifold. Based on geometrical and topological considerations, we find that certain choices of compactification manifolds are more favoured for...

An automatic algorithm capable of segmenting the whole vessel tree and calculate vessel diameter and orientation in a digital ophthalmologic image is presented in this work. The algorithm is based on a parametric model of a vessel that can assume arbitrarily complex shape and a simple measure of match that quantifies how well the vessel model matches a given angiographic image. An automatic ves...

BACKGROUND Mitral regurgitation is the most common valvular heart disease worldwide. Magnetic resonance may be a useful tool to analyze mitral valve parameters. OBJECTIVE To distinguish mitral valve geometric patterns in patients with different severities of mitral regurgitation (MR) based on cardiovascular magnetic resonance imaging. METHODS Sixty-three patients underwent cardiovascular ma...