we give further results for perron-frobenius theory on the numericalrange of real matrices and some other results generalized from nonnegative matricesto real matrices. we indicate two techniques for establishing the main theorem ofperron and frobenius on the numerical range. in the rst method, we use acorresponding version of wielandt's lemma. the second technique involves graphtheory.

Extending a recent suggestion for hyperon form factors to the nucleon case, dispersion theory is used to relate the low-energy vector-isovector form factors of the nucleon to the pion vector form factor. The additionally required input, i.e. the pion-nucleon scattering amplitudes are determined from relativistic next-to-leading-order (NLO) baryon chiral perturbation theory including the nucleon...

We prove that it is an NP-hard problem to determine the attraction radius of a stable vector in a binary Hoppeld memory network, and even that the attraction radius is hard to approximate. Under synchronous updating, the problems are already NP-hard for two-step attraction radii; direct (one-step) attraction radii can be computed in polynomial time. A Hoppeld memory network 6] consists of n bin...

We consider the planar double pendulum where its center of mass is attached in an elliptic orbit. We case rods have variable length, varying according to radius vector make Hamiltonian view problem, find four linearly stable equilibrium positions and construct boundary curves stability/instability regions space parameters associated with length eccentricity

The study of color transparency (CT) in elastic electroproduction of vector mesons off nuclei encounters the problem of the onset of coherence length (CL) effects. The problem of CT-CL separation arises especially at medium energies, corresponding to HERMES experiment, when the coherence length is of the order of the nuclear radius RA. Only at asymptotic large energies, corresponding to large C...

divided. Suppose the section of FresneVs wave surface by a coordinate plane to consist of a circle and an ellipse and let O be the center of a wave disturbance in the surface of a crystal. Draw any radius vector OBC, cutting the circle at B and the ellipse at C; the intersection of tangents at B and C will be 8, a point on the tangent plane at the point of incidence. Then 8B and SC will be the ...

We prove that it is an NP-hard problem to determine the attraction radius of a stable vector in a binary Hoppeld memory network, and even that the attraction radius is hard to approximate. Under synchronous updating, the problems are already NP-hard for two-step attraction radii; direct (one-step) attraction radii can be computed in polynomial time. A Hoppeld memory network 6] consists of n bin...

This paper deals with the threshold radius that warrants the use of single restraining rail for transit and railroads. Different railways use different threshold radius from 91m to 365m to provide restraining rail. These threshold figures are probably experience driven choices. The need for restraining rail may be related to a so-called derailment alarm coefficient of 1.2 sustained over 2m leng...

background: mal::::union:::: is the most common complication following distal radius fractures. aim of this study was to evaluate the results of distal radius corrective osteotomy and plate fixation by dorsal approach in the mal::::union::::. methods: in this retrospective study, 14 patients with neglected distal radius mal::::union:::: from 2005 to 2011 were studied. all patients were treated ...

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...