Hilbert重级数定理的一个改进

The object of this note is to prove the followingTheorem Let{a_n}and{b_n}be sequences of real numbers such that0<∑∑a_n~2<+∞and0<∑b_n~2<+∞.Then we have the inequalitysum from m=1 to∞sum from n=1 to∞a_mb_n/m+n<{sum from n=1 to∞(π-θ/n~(1/2)a_n~2}~1/2{sum from n=1 to∞(π-θ/n~(1/2)b_n~2}~1/2 (1)whereθ=3/2~(1/2)-1=1.121320343.     

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.     

Inclusion of carbon nanotubes in a TiO2 sol-gel matrix

We report here the successful inclusion of carbon nanotubes (CNs) into a TiO₂ matrix prepared by a sol-gel method. The presence of CNs in the sol-gel matrix and the structure of the film were analyzed principally by transmission electron microscopy. Complementary information about the behavior of embedded carbon nanotubes versus heat treatment and ion irradiation were obtained by X-ray photoelectron spectroscopy. The elaboration of an inorganic matrix containing embedded carbon nanotubes leads to a new nanocomposite. The possible applications of this nanocomposite are discussed.     

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.     

Three-dimensional Schwarzschild spacetimes

In the following we find all of the three-dimensional flat spacetimes which are static and rotationally symmetric.     

Estimating a reduced rank regression model for non-normal variables

A method using third order moments for estimating the regression coefficients as well as the latent state scores of the reduced-rank regression model when the latent variable(s) are non-normally distributed is presented in this paper. It is shown that the factor analysis type indeterminacy of the regression coefficient matrices is eliminated. A real life example of the proposed method is presented. Differences of this solution with the reduced-rank regression eigen solution are discussed.     

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.