Inverse Piston Problem for the System of One-Dimensional Isentropic Flow

In this paper, the authors consider the inverse piston problem for the system of one-dimensional isentropic flow and obtain that, under suitable conditions, the piston velocity can be uniquely determined by the initial state of the gas on the right side of the piston and the position of the forward shock.     

Time dependent analysis of finite buffer fluid flows and risk models with a dividend barrier

Based on the matrix-analytic approach to fluid flows initiated by Ramaswami, we develop an efficient time dependent analysis for a general Markov modulated fluid flow model with a finite buffer and an arbitrary initial fluid level at time 0. We also apply this to an insurance risk model with a dividend barrier and a general Markovian arrival process of claims with possible dependencies in successive inter-claim intervals and in claim sizes. We demonstrate the implementability and accuracy of our algorithms through a set of numerical examples that could also serve as test cases for comparing other solution approaches.      

钱塘江河口弯道潮流场的数值模拟

钱塘江河口潮流错综复杂．依靠零星的实测潮流资料无法全面描述其流场特征．本文采用Dcldt3D模型对钱塘江河口闻家堰至仓前河段的潮流场进行二维数值模拟．着重研究了河口弯道的流场特性．结果表明．河口弯道流场具有跟无潮河流弯道显著不同的特性．如弯道流速向下游递增；涨、落急主流线分歧；涨、落潮流对丁坝工程的响应不同．以及下游弯道水面横比降大于上游弯道．     

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.     

外加磁场微波等离子推力器内流场数值模拟

为了提高微波等离子推力器性能，改善等离子体对电磁波能量的吸收状况，提高核心区温度，提出外加磁场的方案，并对热等离子体进行了数值模拟.假设局域热平衡条件，采用Navier-Stokes，Maxwell和Saha方程，利用压力修正的半隐格式和时域有限差分求解方法，建立了径向磁镜场下推力器内等离子体流场的数值计算模型.数值模拟结果表明：外加磁场后的磁感应强度小于0.5 T时，推力器内热等离子体核心区最高温度随磁感应强度的增加而迅速提高.外加磁场后的磁感应强度大于0.5 T时，核心区最高温度随磁感应强度的增加而缓慢提高.磁感应强度为0.5 T时，热等离子体核心区最高温度与不加磁场相比提高了24%.外加磁场对等离子体流场速度分布影响不大. 关键词： 等离子体模拟 等离子体相互作用 等离子体流动     

Scale-Free Properties in Traffic System

In this work, we propose a new model of evolution networks, which is based on the evolution of the traffic flow. In our method, the network growth does not take into account preferential attachment, and the attachment of new node is independent of the degree of nodes. Our aim is that employing the theory of evolution network, we give a further understanding about the dynamical evolution of the traffic flow. We investigate the probability distributions and scaling properties of the proposed model. The simulation results indicate that in the proposed model, the distribution of the output connections can be well described by scale-free distribution. Moreover, the distribution of the connections is largely related to the traffic flow states, such as the exponential distribution (i.e., the scale-free distribution) and random distribution etc.     

乙烷对冲扩散火焰中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.