Assessment of two‐equation turbulence modelling for high Reynolds number hydrofoil flows

This paper presents an evaluation of the capability of turbulence models available in the commercial CFD code FLUENT 6.0 for their application to hydrofoil turbulent boundary layer separation flow at high Reynolds numbers. Four widely applied two‐equation RANS turbulence models were assessed through comparison with experimental data at Reynolds numbers of 8.284×106 and 1.657×107. They were the standard k–εmodel, the realizable k–εmodel, the standard k–ωmodel and the shear‐stress‐transport (SST) k–ωmodel. It has found that the realizable k–εturbulence model used with enhanced wall functions and near‐wall modelling techniques, consistently provides superior performance in predicting the flow characteristics around the hydrofoil. Copyright © 2004 John Wiley & Sons, Ltd.     

A high‐resolution scheme for low Mach number flows

A method for computing low Mach number flows using high‐resolution interpolation and difference formulas, within the framework of the Marker and Cell (MAC) scheme, is presented. This increases the range of wavenumbers that are properly resolved on a given grid so that a sufficiently accurate solution can be obtained without extensive grid refinement. Results using this scheme are presented for three problems. The first is the two‐dimensional Taylor–Green flow which has a closed form solution. The second is the evolution of perturbations to constant‐density, plane channel flow for which linear stability solutions are known. The third is the oscillatory instability of a variable density plane jet. In this case, unless the sharp density gradients are resolved, the calculations would breakdown. Under‐resolved calculations gave solutions containing vortices which grew in place rather than being convected out. With the present scheme, regular oscillations of this instability were obtained and vortices were convected out regularly. Stable computations were possible over a wider range of sensitive parameters such as density ratio and co‐flow velocity ratio. Copyright © 2004 John Wiley Sons, Ltd.     

Minimal expansions in redundant number systems: Fibonacci bases and Greedy algorithms

We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6].     

A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T,M,S)-Nets of Low Strength

The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.     

激光调Q CAI

从激光调Q速率方程出发,分析推导了激光调Q过程中,腔内光子数与工作物质内反转粒子数间的关系.再根据激光调Q的过程中,对腔Q值控制方式不同,将激光调Q技术分为:转镜调Q、声光调Q、电光调Q、饱和吸收调Q和脉冲透射式调Q.用C语言进行了激光调Q CAI软件的开发研制,获得了将文学、图形、动画和计算融为一体的,直观而生动地将调Q的理论和过程再现于屏幕的CAI课件.介绍了课件的内容、结构及其特点.     

Rank, term rank, and chromatic number

Let G be a graph with a nonempty edge set, and with rank rk(G), term rank Rk(G), and chromatic number χ(G). We characterize Rk(G) as being the maximum number of colors in certain proper colorings of G. In particular, we observe that χ(G)Rk(G), with equality holding if and only if (besides isolated vertices) G is either complete or a star. For a twin-free graph G, we observe the bound and we show that this bound is sharp.     

Convergence Rates in the Law of Large Numbers under Sublinear Expectations

In this note, we study convergence rates in the law of large numbers for independent and identically distributed random variables under sublinear expectations. We obtain a strong L^p-convergence version and a strongly quasi sure convergence version of the law of large numbers.     

Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph

 Let k≤n be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n−|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set. Received: April 14, 2000 Final version received: May 8, 2001     

RICE CONDITION NUMBERS OF CERTAIN CHARACTERISTIC SUBSPACES

This paper proposes the Rice condition numbers for invariant subspace, singular sub-spaces of a matrix and deflating subspaces of a regular matrix pair. The first-order perturbation estimations for these subspaces are derived by applying perturbation expansions of orthogonal projection operators.     

Sizes of Critical Graphs with Small Maximum Degrees

In this paper, we give new lower bounds for the size of Δ-critical graphs with Δ=8,9 which improve the partial results of Luo [6] and Y. Zhao [12].