Numerical solutions of the shallow water equations with discontinuous bed topography

A simple scheme is developed for treatment of vertical bed topography in shallow water flows. The effect of the vertical step on flows is modelled with the shallow water equations including local energy loss terms. The bed elevation is denoted with z_b^‐ for the left and z_b⁺ for the right values at each grid point, hence exactly representing a discontinuity in the bed topography. The surface gradient method (SGM) is generalized to reconstruct water depths at cell interfaces involving a vertical step so that the fluxes at the cell interfaces can accurately be calculated with a Riemann solver. The scheme is verified by predicting a surge crossing a step, a tidal flow over a step and dam‐break flows on wet/dry beds. The results have shown good agreements compared with analytical solutions and available experimental data. The scheme is efficient, robust, and may be used for practical flow calculations. Copyright © 2002 John Wiley & Sons, Ltd.     

Effect of trapping centers of luminescent properties of bismuth orthogermanate

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

Reaction of methyl bromopropiolate with diamines as a method of synthesis of imidazolidine derivatives

A convenient method of synthesis of 2-(methoxycarbonylmethylene)-substituted imidazolidines and imidazolidinium bromides, and also of bicyclic diazo compounds has been developed starting from methyl bromopropiolate and ethylenediamine and its derivatives.Translated from Khimiya Geterotsiklicheskikh Soedinenii, No. 9, pp. 1205–1208, September, 1991.     

Isolation of singularities in the density and the kernel of a two-dimensional integral equation for complex boundary surfaces

We consider the solution of integral equations in problems of three-dimensional electromagnetic fields in piecewise-homogeneous media. An algorithm is proposed for analytical isolation of singularities in the kernel and the density of the integral equation of potential theory for the case of complex boundary surfaces.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 56, pp. 14–17, 1985     

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.     

Fluorescence spectra of different configurations of the diphenyl molecule in solid paraffin solutions

Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 51, No. 2, pp. 212–217, August, 1989.     

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.