Charged Black Holes and Multidimensional Gravity

A multidimensional generalization of the Reissner-Nordström solution of general relativity is obtained for the case of n Ricci-flat internal spaces. A two-parameter family of black-hole solutions for an arbitrary dimensionality D is selected. Nontrivial black holes with D > 4 are shown to exist only with a nonzero electric charge. Observational consequences are discussed, in particular, a violation of Coulomb's law.     

Investigation of the structure of a melt and molecular dynamics of ortho- and pyrophosphates by Raman spectroscopy

Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 55, No. 4, pp. 535–540, October, 1991.     

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.     

AGE method simulations of a turbulent far‐wake compared to spectral DNS

Turbulent flow simulation methods based on finite differences are attractive for their simplicity, flexibility and efficiency, but not always for accuracy or stability. This paper demonstrates that a good compromise is possible with the advected grid explicit (AGE) method. Starting from the same initial field as a previous spectral DNS, AGE method simulations of a planar turbulent wake were carried out as DNS, and then at three levels of reduced resolution. The latter cases were in a sense large‐eddy simulations (LES), although no specific sub‐grid‐scale model was used. Results for the two DNS methods, including variances and power spectra, were very similar, but the AGE simulation required much less computational effort. Small‐scale information was lost in the reduced resolution runs, but large‐scale mean and instantaneous properties were reproduced quite well, with further large reductions in computational effort. Quality of results becomes more sensitive to the value chosen for one of the AGE method parameters as resolution is reduced, from which it is inferred that the numerical stability procedure controlled by the parameter is acting in part as a sub‐grid‐scale model. Copyright © 2002 John Wiley & Sons, Ltd.     

Ⅱ型三角剖分上二次双周期样条

本文用B-网方法确定了△_(nm)~((2))剖分上二次双周期样条函数空间的维数,给出了插值条件的几种提法,证明了解的存在唯一性.     

Applications of coupled LC-GC: A review

Although coupled liquid chromatographygas chromatography (LC-GC) was first demonstrated ten years ago, only in the last few years has there been a sudden surge of interest in the technique. Approximately 70% of the total number of LC-GC applications have been published in the last two years (1987–88) alone. This review categorizes LC-GC publications into four main application areas: fossil fuels, foods, environmental samples, biologiical/pharmaceutical samples, and miscellaneous samples. Multidimensional separations carried out using other coupled-column chromatographic techniques (such as supercritical fluid chromatography (SFC) with GC, and on-line trace enrichment-GC) have also been included in this review.     

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.