Epidemiological studies have reported process-specific elevated prevalence of beryllium sensitization (BeS) and chronic beryllium disease (CBD) among workers. However, exposure-response relationships have been inconsistent, possibly due to incomplete characterization of many biologically relevant aspects of exposure, including particle size. In 1999, two surveys were conducted 3-5 months apart ...

It is well-known that for Hilbert space linear operators 0 ≤ A and 0 ≤ C, inequality C ≤ A does not imply C ≤ A. We introduce a strong order relation 0 ≤ B≪ A, which guarantees that C ≤ BAB for all 0 ≤ C ≤ B, and that C ≤ A when B commutes with A. Connections of this approach with the arithmetic-geometric mean inequality of Bhatia–Kittaneh as well as the Kantorovich constant of A are mentioned.

T his article describes an important improvement in the calculation of the Consumer Price Index (CPI). The Bureau of Labor Statistics plans to use a new geometric mean formula for calculating most of the basic components of the Consumer Price Index for all Urban Consumers (CPI-U) and the Consumer Price Index for Urban Wage Earners and Clerical Workers (CPI-W). This change will become effective ...

Academics and practitioners usually optimize portfolios on the basis of mean and variance. They set the goal of maximizing risk-adjusted returns measured by the Sharpe ratio and thus determine their optimal exposures to the assets considered. However, there is an alternative criterion that has an equally plausible underlying idea; geometric mean maximization aims to maximize the growth of the c...

To establish comprehensive criteria for detecting restenosis and remodeling, inter- and intraobserver reproducibility of quantitative arteriography in the analysis of 20 lesions immediately after and 6 months after percutaneous transluminal coronary angioplasty (PTCA) were assessed. Geometric single-plane (minimum, maximum, mean diameter and percent diameter stenosis), biplane (absolute and rel...

It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with n vertices is spherical in O(n) time.