Inverse Process with Independent Positive Increments: Finite-Dimensional Distributions

An inverse process with independent positive increments is considered. For such a process, the first hitting time τ_x of level x as a function of x ≥ 0 is a proper process with independent positive increments. In terms of first hitting times and their Levy measures, multidemensional distribution densities and Laplace transformations are derived. Stationary distributions of increments of the process are investigated. Bibliography: 8 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 311, 2004, pp. 286–297.     

Application of rainbow schlieren deflectometry to measure temperature and oxygen concentration in a laminar gas-jet diffusion flame

The quantitative rainbow schlieren deflectometry (RSD) technique was applied to measure temperature and oxygen concentration in an axisymmetric hydrogen gas-jet diffusion flame burning in quiescent air at fuel jet exit Reynolds number of 70. Schlieren measurements were compared with conventional measurements using a thermocouple and a gas-sampling probe. Good agreement between the two measurement techniques was achieved on the fuel-lean side of the flame.     

On a conjecture of Cox and Katz

This note shows that a certain toric quotient of the quintic Calabi-Yau threefold in provides a counterexample to a recent conjecture of Cox and Katz concerning nef cones of toric hypersurfaces. Received: 8 February 2001; in final form: 17 September 2001 / Published online: 1 February 2002     

Effect of trapping centers of luminescent properties of bismuth orthogermanate

Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 54, No. 6, pp. 970–975, June, 1991.     

A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost

A firm's logistics cost, including shipping and inventory-carrying, is a substantial percentage of its sales. Nevertheless, typical inventory-control methods ignore or insufficiently represent the shipping cost. This paper describes a recursive algorithm that determines the reorder cycle-time that minimizes total logistics cost. It allows for a realistic accounting of shipping cost, which is modelled here as a function of shipping distance and weight. The algorithm uses a relaxation procedure to identify a suitable initial approximation to the optimal order cycle-time and then, through a series of recursive steps, moves to the optimal result. We demonstrate the algorithm with a single item, with a group of items that share a common order cycle, and with multi-items when item demands are random variables. Experience with this algorithm indicates that it converges to the optimal result in a very few steps.