Laminar-turbulent transition in the boundary layer on cones in a hypersonic flow at high Reynolds numbers per meter

The laminar-turbulent transition is experimentally studied in boundary-layer flows on cones with a rectangular axisymmetric step in the base part of the cone and without the step. The experiments are performed in an A-1 two-step piston-driven gas-dynamic facility with adiabatic compression of the working gas with Mach numbers at the nozzle exit M _∞ = 12–14 and pressures in the settling chamber P₀ = 60–600 MPa. These values of parameters allow obtaining Reynolds numbers per meter near the cone surface equal to Re _1e = (53–200) · 10⁶ m ⁻¹. The transition occurs at Reynolds numbers Re _tr = (2.3–5.7) · 10⁶. __________ Translated from Prikladnaya Mekhanika i Tekhnicheskaya Fizika, Vol. 48, No. 3, pp. 76–83, May–June, 2007.     

Rates of convergence for the laws of large numbers for independent Banach-valued random variables

In this paper, results of Lai, Heyde, and Rohatgi concerning the convergence rates for the laws of large numbers are extended for the case of independent random variables taking values in a separable Banach space.     

The Remak height for units

We investigate the values of the Remak height, which is a weighted product of the conjugates of an algebraic number. We prove that the ratio of logarithms of the Remak height and of the Mahler measure for units αof degree d is everywhere dense in the maximal interval [d/2(d-1),1] allowed for this ratio. To do this, a “large” set of totally positive Pisot units is constructed. We also give a lower bound on the Remak height for non-cyclotomic algebraic numbers in terms of their degrees. In passing, we prove some results about some algebraic numbers which are a product of two conjugates of a reciprocal algebraic number. This revised version was published online in June 2006 with corrections to the Cover Date.     

Optimally conditioned scaled ABS algorithms for linear systems

Using a strict bound of Spedicato to the condition number of bordered positive-definite matrices, we show that the scaling parameter in the ABS class for linear systems can always be chosen so that the bound of a certain update matrix is globally minimized. Moreover, if the scaling parameter is so chosen at every iteration, then the condition number itself is globally minimized. The resulting class of optimally conditioned algorithms contains as a special case the class of optimally stable algorithms in the sense of Broyden.This work was done in the framework of research supported by MPI, Rome, Italy, 60% Program.     

Recent trends in random number and random vector generation

A survey of recent work in the areas of uniform pseudorandom number and uniform pseudorandom vector generation is presented. The emphasis is on methods for which a detailed theory is available. A progress report on the construction of quasirandom points for efficient multidimensional numerical integration is also given.     

扭环粘正n棱柱外侧面数的确定

本文给出了一个确定扭环粘正 n棱柱外侧面数的简洁且具有一般性的结论 ,它可以看成是麦比乌斯带在一定意义下的推广 .对该棱柱的其它性质也进行了讨论 .     

A classification of (some) Pisot-Cyclotomic numbers

A complete classification of degree 2, 3 and degree 4 Pisot-Cyclotomic numbers is given. Some examples of higher degrees are also given. Pisot-Cyclotomic numbers have applications to quasicrystals and quasilattices.     

Parameter Estimation for Controlled Semilinear Stochastic Systems: Identifiability and Consistency

We consider a controlled stochastic semilinear evolution equation with the drift depending on the unknown parameter. We show that the maximum likelihood estimator is strongly consistent for a class of bounded predictable controls.     

Circular flows of nearly Eulerian graphs and vertex‐splitting

The odd edge connectivity of a graph G, denoted by λ_o(G), is the size of a smallest odd edge cut of the graph. Let S be any given surface and ? be a positive real number. We proved that there is a function f_S(?) (depends on the surface S and lim_?→0 f_S(?)=∞) such that any graph G embedded in S with the odd‐edge connectivity at least f_S(?) admits a nowhere‐zero circular (2+?)‐flow. Another major result of the work is a new vertex splitting lemma which maintains the old edge connectivity and graph embedding. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 147–161, 2002