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.     

Interplay between four conjectures on certain zero-sum problems

In this paper, we explore the interplay of four different conjectures on certain zero-sum problems in Z_p Z_p. This study of the inter-relations between these conjectures leads to the conclusion that determining the structure of minimal zero sequences (see below for the precise definition) is crucial. Also, we study the analogous situation in Z_n.     

Effect of trapping centers of luminescent properties of bismuth orthogermanate

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

Analytic calculation of scaling dimensions: Tricritical hard squares and critical hard hexagons

The finite-size corrections, central chargesc, and scaling dimensionsx of tricritical hard squares and critical hard hexagons are calculated analytically. This is achieved by solving the special functional equation or inversion identity satisfied by the commuting row transfer matrices of these lattice models at criticality. The results are expressed in terms of Rogers dilogarithms. For tricritical hard squares we obtainc=7/10,x=3/40, 1/5, 7/8, 6/5 and for hard hexagons we obtainc=4/5,x=2/15, 4/5, 17/15, 4/3, 9/5, in accord with the predictions of conformal and modular invariance.     

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.     

Error analysis: a tool for selecting travel demand models

In developing travel demand models it is generally assumed that the base-year data used in developing the parameters, as well as the forecasted data to be used as independent variables for the design year, are of acceptable quality. The purpose of this paper is to present the application of error propagation theory in assesing the predictive quality of one type of travel demand forecasting model (multinomial logit models) and to demonstrate how error considerations can be used as a tool for identifying the optimal model. The general conclusions of this study are that: (1) it is indeed possible to quantify errors in dependent variables in logit models as a consequence of errors in independent variables; and (2) error consideration can be used as a tool for identifying the optimal model from a set of candidate models. Further research is recommended to develop better insights into the phenomenon of error propagation so that the consideration of errors can be a factor in decisions on model selection.     

THE QUALITATIVE CONTENT OF RENEWABLE RESOURCE MODELS

This paper analyzes the extent to which standard dynamic renewable resource models possess refutable implications. Both the steady state comparative static and local comparative dynamic properties of the standard model are studied. A unified framework is developed which enables one to analyze the qualitative properties of any standard renewable resource model. This is achieved by explicitly linking the local stability, steady state comparative static, and local comparative dynamic properties of the model.     

A note on tilde algebras

A closed setE is constructed so thatA∼(E) is an inseparable Banach space but its maximal ideal space isE. Supported in part by the National Science Foundation.