FORECASTING MINERAL SUPPLY FROM MINERAL RENT DATA

An optimal control model of exhaustible resources is used to clarify the long run relationship between mineral rent and depletion cost at the industry level. A standard first order condition of the time rate of change of rents is reformulated to reveal that rent data may be used to help forecast the rise in extraction costs resulting from resource depletion. This application of the theory of exhaustible resources is illustrated using historical mineral industry rent and extraction cost data. A forecast of U.S. coal extraction costs, following the method proposed in this paper, suggests that future rates of extraction cost increases will be similar to rates experienced in the past.     

Uniform bounds under increment conditions

We apply a majorizing measure theorem of Talagrand to obtain uniform bounds for sums of random variables satisfying increment conditions of the type considered in Gál-Koksma Theorems. We give some applications.

     

Pion correlations and resonance effects in \bar{p}p annihilation to 4\pi^0 at rest

We study correlations in the exclusive reaction at rest with complete reconstruction of the kinematics for each event. The inclusive distribution is fairly flat at small invariant mass of the pion pair while a small enhancement in the double differential distribution is observed for small invariant masses of both pion pairs. Dynamical models with resonances in the final state are shown to be consistent with the data while the stochastic HBT mechanism is not supported by the present findings. Received: 26 February 2002 / Revised version: 22 July 2002 / Published online: 30 August 2002     

Almost Sure Convergence and Square Functions of Averages Of Riemann Sums

Under a very moderate assumption on the Fourier coefficients of a periodic function, we show the convergence almost everywhere of the sequence of averages of its associated Riemann sums. The structure of the set of averages is analyzed by proving a spectral regularization type inequality, which allows to control the corresponding Littlewood-Paley square function.     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.     

Elektrische Charakterisierung von Hochfrequenz-Niederdruck-Gasentladungen

In recent years there has emerged significant interest in low pressure radio frequency (rf) glow discharges which are used widely particulary in IC fabrication. Various parameters of the rf glow discharge have been found to be useful for its electrical characterization; however, there is no uniformity and agreement. Extensive experimental investigations on various discharge systems have shown, that the self-bias on the rf driven electrode, the complex conductivity and the breakdown characteristic are preferable parameters of rf discharges. Advantageously the self-bias and the complex conductivity should be presented in dependence on the pressure and the applied rf voltage. The discharge current cannot be measured quite accurately due to currents via leaky capacitors and the deviations from a sinusoidal form of the current due to nonlinearities.     

On Lattices of Uniformities

We study lattice theoretical properties of lattices of uniformities such as modularity, distributive laws and the existence of (relative) complements. For this the concepts of permutable uniformities (see Definition 3.1) and independent uniformities (see Definition 4.1) are important. Moreover, we show that e.g. the lattice of all lattice uniformities on a lattice L is a closed sublattice of the lattice of all uniformities on L.     

C 1 Quintic Splines on Type-4 Tetrahedral Partitions

Starting with a partition of a rectangular box into subboxes, it is shown how to construct a natural tetrahedral (type-4) partition and associated trivariate C ¹ quintic polynomial spline spaces with a variety of useful properties, including stable local bases and full approximation power. It is also shown how the spaces can be used to solve certain Hermite and Lagrange interpolation problems.     

Approximating weak Chebyshev subspaces by Chebyshev subspaces

We examine to what extent finite-dimensional spaces defined on locally compact subsets of the line and possessing various weak Chebyshev properties (involving sign changes, zeros, alternation of best approximations, and peak points) can be uniformly approximated by a sequence of spaces having related properties.