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.     

On a conjecture of Cox and Katz

This note shows that a certain toric quotient of the quintic Calabi-Yau threefold in provides a counterexample to a recent conjecture of Cox and Katz concerning nef cones of toric hypersurfaces. Received: 8 February 2001; in final form: 17 September 2001 / Published online: 1 February 2002     

V型三能级原子与非经典光场作用中光场特性的变化

研究了V型三能级原子BEC与双模压缩光场相互作用系统中,忽略原子间相互作用和考虑原子间相互作用时光场的正交压缩和光子数压缩。结果表明,光场的正交压缩依赖于压缩参数,而光子数压缩与压缩参数、光场信号强度有关,在一定条件下,两种压缩可同时存在。原子间相互作用影响两种压缩的涨落随时间变化的周期,以及正交分量涨落随时间变化的幅度,而对光子数压缩涨落随时间变化的幅度几乎无影响。     

General strategy for a short and efficient synthesis of 3-hydroxy-4-methylprolines (HMP)

The non-proteinogenic amino acid 3-hydroxy-4-methylproline (HMP) is an active constituent of some potent antimicrobials including echinocandins, nostopeptins, pneumocandins, sporiofungin and mulundocandins. A synthesis has been achieved in 10 steps with 29% overall yield; the Evans’ aldol reaction using Crimmins’ modified method was pivotal to the success of the strategy.     

Accelerating Effect in Kerr-Newman-Kasuya Field

We have obtained expressions of the accelerating effect in Kerr-Newman Kasuya field. These expressionsinclude four parameters: mass m, angular momentum a, electric charge q, and magnetic charge φ. Furthermore we studyits special case (vi = 0). We get the following conclusion. In the gravitation field of souse mass with electric charge qand magnetic charge b, the acceleration of test particle has not only radial component but also transverse component.When θ = 0, the acceleration is minimum, and when θ = π/2, the acceleration is maximum. Furthermore, we discussthe effects of electric charge q and magnetic charge φ respectively.     

A novel and efficient synthesis of porphine

meso-Tetra(n-hexyloxycarbonyl)porphyrin was found to be converted into porphine, the mother compound of porphyrins, in a 77% yield when heated in aqueous sulfuric acid at 180 °C over 30 min under an inert atmosphere. The observation demonstrates that the substituted porphyrin serves as a novel and useful precursor for porphine.     

Inequalities for the Moments and Distribution of the Ladder Height of a Random Walk

We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.     

A primer on perfect simulation for spatial point processes

This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed. Received: 30 June 2002     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008