Coupled Thermo-Hydro-Mechanical and Chemical Analysis of Expansive Clay Subjected to Heating and Hydration

A fully coupled formulation combining reactive transport and an existing thermo-hydro-mechanical (THM) code is presented. Special attention has been given to phenomena likely to be encountered in clay barriers used as part of containment systems of nuclear waste. The types of processes considered include hydrolysis, complex formation, oxidation/reduction reactions, acid/base reactions, precipitation/dissolution of minerals and cation exchange. Both kinetically-controlled and equilibrium-controlled reactions have been incorporated. The total analytical concentrations (including precipitated minerals) are adopted as basic transport variables and chemical equilibrium is achieved by minimizing Gibbs Free Energy. The formulation has been incorporated in a general purpose computer code capable of performing numerical analysis of engineering problems. A validation exercise concerning a laboratory experiment involving the heating and hydration of an expansive compacted clay is described.     

Mean curvature flow with a forcing term in minkowski space

We study the forced mean curvature flow of graphs in Minkowski space and prove longtime existence of solutions. When the forcing term is a constant, we prove convergence to either a constant mean curvature hypersurface or a translating soliton – depending on the boundary conditions at infinity. It is a pleasure to thank my PhD advisors Klaus Ecker and Gerhard Huisken for their assistance and encouragement. I also thank Maria Athanassenas, Oliver Schnürrer and Marty Ross for their interest and useful comments, and the Max Planck Gesellschaft for financial support.     

乙烷对冲扩散火焰中PAHs的生成

本文使用详细的化学反应机理模拟了C2H6／O2／N2／AR层流对冲扩散火焰中多环芳烃的生成动力学过程。反应机理包括96种组分的502个基元反应。通过数值计算分析了层流对冲火焰的结构和主要反应物、中间物质和反应产物的浓度变化,并与相关文献的实验结果进行了比较。结果表明,数值模拟在燃烧过程和PAH生成规律上与实验结果是一致的,但在某些组分的定量预报上存在一定的差别。     

Approximating the single source unsplittable min-cost flow problem

In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing. Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem. Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001     

Numerical simulation and experimental validation of heat transfer within rotating flows for three‐dimensional non‐axisymmetric,turbulent conditions

A control volume type numerical methodology for the analysis of steady three‐dimensional rotating flows with heat transfer, in both laminar and turbulent conditions, is implemented and experimentally tested. Non‐axisymmetric momentum and heat transfer phenomena are allowed for. Turbulent transport is alternatively represented through three existing versions of the k–ε model that were adjusted to take into account the turbulence anisotropy promoted by rotation, streamline curvature and thermal buoyancy. Their relative performance is evaluated by comparison of calculated local and global heat balances with those obtained through measurements in a laboratory device. A modified version of the Lam and Bremhorst, low Reynolds number model is seen to give the best results. A preliminary analysis focused on the flow structure and the transfer of heat is reported. Copyright © 2002 John Wiley & Sons, Ltd.     

Online weighted flow time and deadline scheduling

In this paper we study some aspects of weighted flow time. We first show that the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P|r_i,pmtn|∑w_iF_i. We then consider a related Deadline Scheduling Problem that involves minimizing the weight of the jobs unfinished by some unknown deadline D on a uniprocessor. We show that any c-competitive online algorithm for weighted flow time must also be c-competitive for deadline scheduling. We then give an O(1)-competitive algorithm for deadline scheduling.     

分析布拉格光栅破坏的两纤芯不同的光纤耦合器

进一步推广了描述纤芯不同光纤耦合器的耦合模理论，用于解释被布拉格光栅破坏的两纤芯不同光纤耦合器的耦合现象，理论分析的结果与已报道的实验结果相符，与单独的布拉格光栅所起的反射作用不同,这里布拉格光栅所起的作用主要是引入了强烈的色散，在光栅的频谱范围内使耦合器不再同步，在被布拉格光栅破坏的光纤耦合器的选择性频谱中，其边缘部分出现非常弱的波动，而在其阻带内出现非常强的凹陷。     

Extension of a combined analytical/numerical initial value problem solver for unsteady periodic flow

Here we describe analytical and numerical modifications that extend the Differential Reduced Ejector/ mixer Analysis (DREA), a combined analytical/numerical, multiple species ejector/mixing code developed for preliminary design applications, to apply to periodic unsteady flow. An unsteady periodic flow modelling capability opens a range of pertinent simulation problems including pulse detonation engines (PDE), internal combustion engine ICE applications, mixing enhancement and more fundamental fluid dynamic unsteadiness, e.g. fan instability/vortex shedding problems. Although mapping between steady and periodic forms for a scalar equation is a classical problem in applied mathematics, we will show that extension to systems of equations and, moreover, problems with complex initial conditions are more challenging. Additionally, the inherent large gradient initial condition singularities that are characteristic of mixing flows and that have greatly influenced the DREA code formulation, place considerable limitations on the use of numerical solution methods. Fortunately, using the combined analytical–numerical form of the DREA formulation, a successful formulation is developed and described. Comparison of this method with experimental measurements for jet flows with excitation shows reasonable agreement with the simulation. Other flow fields are presented to demonstrate the capabilities of the model. As such, we demonstrate that unsteady periodic effects can be included within the simple, efficient, coarse grid DREA implementation that has been the original intent of the DREA development effort, namely, to provide a viable tool where more complex and expensive models are inappropriate. Copyright © 2002 John Wiley & Sons, Ltd.     

Flow in a waterfall with large Froude number

An approximate method is developed to solve the full nonlinear equations governing two-dimensional irrotational flow in a free waterfall, falling under the influence of gravity, at high Froude number based on conditions far upstream. Schwarz—Christoffel transformation is used to map the region, in the complex potential-plane, onto the upper half-plane. The Hilbert transformation as well as the perturbation technique, for large Froude number, are used as a basis for the approximate solution of the problem. A complete solution, up to second-order approximation, for the downstream free-surfaces profiles, for different Froude number, is discussed and illustrated. The obtained approximate solutions are compared with those of other authors. Favourable agreement with other results suggests that this method is effective in dealing with flow problems strongly influenced by gravity and high Froude number. The results obtained by this method are sufficiently accurate for practical purposes.