A new VOF‐based numerical scheme for the simulation of fluid flow with free surface. Part II: application to the cavity filling and sloshing problems

Finite element analysis of fluid flow with moving free surface has been performed in 2‐D and 3‐D. The new VOF‐based numerical algorithm that has been proposed by the present authors (Int. J. Numer. Meth. Fluids, submitted) was applied to several 2‐D and 3‐D free surface flow problems. The proposed free surface tracking scheme is based on two numerical tools; the orientation vector to represent the free surface orientation in each cell and the baby‐cell to determine the fluid volume flux at each cell boundary. The proposed numerical algorithm has been applied to 2‐D and 3‐D cavity filling and sloshing problems in order to demonstrate the versatility and effectiveness of the scheme. The proposed numerical algorithm resolved successfully the free surfaces interacting with each other. The simulated results demonstrated applicability of the proposed numerical algorithm to the practical problems of large free surface motion. It has been also demonstrated that the proposed free surface tracking scheme can be easily implemented in any irregular non‐uniform grid systems and can be extended to 3‐D free surface flow problems without additional efforts. Copyright © 2003 John Wiley & Sons, Ltd.     

Positron-Lithium Atom and Electron-Lithium Atom Scattering Systems at Intermediate and High Energies

The coupled-channel optical method is used to study positron scattering by atomic lithium at energies ranging from the ionization threshold to 60eV, The present method simultaneously treats the target channels and the positronium （Ps） channels in the coupled-channel method together with the continuum effects via an ab-initio optical potential. Ionization, elastic and inelastic cross sections in target channels, and the total cross section are also reported and compared with other theoretical and experimental data. A comparative study with the corresponding electron-lithium data is also reported.     

Composition of the Canadian Total Force: Issues and Findings for the Air Components

In 1987 the Canadian Department of National Defence enunciated the Total Force concept. The Total Force is comprised of Regular and Reserve components. The intention is to make maximum use of the Reserve to reduce defence expenditures and at the same time to ensure that military capability remains adequate to support national policy objectives. This paper discusses some of the governing parameters that affect the modelling of the composition of the Total Force and analyses the mix of regular and reserve forces. The interplay between the key factors and their marginal costs will be stressed. The models are employed to study two units in the Canadian Forces, a maintenance support unit and a tactical unit with high operational activity cost. The lessons drawn from these studies are highlighted.     

The honeycomb network structure of poly[[[μ2‐1,3‐bis(1H‐benzimidazol‐2‐yl)benzene‐κ2N3:N3′](μ2‐terephthalato‐κ2O:O′)zinc(II)] ethanol solvate]

The terephthalate dianion and the bis(imidazolyl)benzene ligand of the title compound, {[Zn(C₈H₄O₄)(C₂₀H₁₄N₄)]·C₂H₆O}_n, each bridges two adjacent zinc centers, resulting in a layer‐type coordination polymer; the zinc center shows tetrahedral coordination. The disordered ethanol solvent molecules occupy the spaces between the layers and are hydrogen bonded to the layers. The two symmetry‐independent dianions lie on different inversion sites.     

Perfect information two-person zero-sum markov games with imprecise transition probabilities

Based on an extension of the controlled Markov set-chain model by Kurano et al. (in J Appl Prob 35:293–302, 1998) into competitive two-player game setting, we provide a model of perfect information two-person zero-sum Markov games with imprecise transition probabilities. We define an equilibrium value for the games formulated with the model in terms of a partial order and then establish the existence of an equilibrium policy pair that achieves the equilibrium value. We further analyze finite-approximation error bounds obtained from a value iteration-type algorithm and discuss some applications of the model.     

Converging Marriage in Honey-Bees Optimization and Application to Stochastic Dynamic Programming

In this paper, we first refine a recently proposed metaheuristic called “Marriage in Honey-Bees Optimization” (MBO) for solving combinatorial optimization problems with some modifications to formally show that MBO converges to the global optimum value. We then adapt MBO into an algorithm called “Honey-Bees Policy Iteration” (HBPI) for solving infinite horizon-discounted cost stochastic dynamic programming problems and show that HBPI also converges to the optimal value.     

A remark on Mansfield's imprimitivity theorem

We show that the Morita equivalence part of Mansfield's Imprimitivity Theory can be obtained by Green's Imprimitivity Theorem (and duality theory).