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.      

<Emphasis Type="Italic">Comment on</Emphasis>¶Low temperature specific heat of blue bronze K <Emphasis Type="Bold">0.30</Emphasis>MoO <Emphasis Type="Bold">3</Emphasis>, by J. Odin,J.C. Lasjaunias,K. Biljaković, K. Hasselbach,and P. Monceau

Eur. Phys. J. B 24, 315 (2001) Here we comment on a recently published paper on the presence of a phason contribution in the low temperature heat capacity data of the charge-density-wave compounds K_0.3MoO₃ and (TaSe₄)₂I. We have shown that the anomaly in the C _P / T ³ data reported by Odin et al. is straightforwardly interpreted in terms of low energy phonon modes resulting from the peculiar topology of these compounds. Received 21 February 2002 Published online 19 July 2002     

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.     

Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem

In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size.     

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

对G.Ladas的一个开问题的解答

本文获得了一个高阶非线性差分方程具有无界正解的充分条件，所得结果解决了G.Ladas提出的一个开问题。     

Probing antiferromagnetic order with heat capacity in exchange-biased structures

We explore the magnetic heat capacity in exchange-biased ferromagnet/antiferromagnet bilayers theoretically. We show that changes in the antiferromagnetic structure due to the reversal of the ferromagnet layer can be detected by distinct features in the heat capacity. This offers a method for probing antiferromagnetic domains in exchange-biased systems.     

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.