On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality. This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA.     

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.     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

Effect of particle charging on momentum and heat transfer from rarefied plasma flow

The features of interaction of a spherical metallic particle with a rarefied thermal plasma flow due to the presence o charges-electrons and ions in the gaseous phase-are considered. Analytical expressions describing charge, momentum, and energy exchange between the plasma and the particle für the cases of strong and weak Debye screening are obtained. It is illustrated that the efficiency of particle heating in the plasma considerably grows as compared with a hot molecular gas due to participation of electrons and ions in file transfer processes.     

A numerical study of an unsteady laminar flow in a doubly constricted 3D vessel

Unsteady flow dynamics in doubly constricted 3D vessels have been investigated under pulsatile flow conditions for a full cycle of period T. The coupled non‐linear partial differential equations governing the mass and momentum of a viscous incompressible fluid has been numerically analyzed by a time accurate Finite Volume Scheme in an implicit Euler time marching setting. Roe's flux difference splitting of non‐linear terms and the pseudo‐compressibility technique employed in the current numerical scheme makes it robust both in space and time. Computational experiments are carried out to assess the influence of Reynolds' number and the spacing between two mild constrictions on the pressure drop across the constrictions. The study reveals that the pressure drop across a series of mild constrictions can get physiologically critical and is also found to be sensitive both to the spacing between the constrictions and the oscillatory nature of the inflow profile. The flow separation zone on the downstream constriction is seen to detach from the diverging wall of the constriction leading to vortex shedding with 3D features earlier than that on the wall in the spacing between the two constrictions. Copyright © 2002 John Wiley & Sons, Ltd.     

QUENCHING PROBLEMS OF DEGENERATE FUNCTIONAL REACTION-DIFFUSION EQUATION

This paper is concerned with the quenching problem of a degenerate functional reaction-diffusion equation. The quenching problem and global existence of solution for the reaction-diffusion equation are derived and, some results of the positive steady state solutions for functional elliptic boundary value are also presented.     

Quantification of mass flow effects in capillary SFC

A model for restrictor flow produces accurate predictions of flow that can be used to optimize restrictor design. The relative amplitudes of restrictor and other flows and their effect on efficiency are discussed.     

CSR外靶实验终端中子流测量的模拟

随着兰州重离子加速器冷却储存环(HIRFL-CSR)外靶实验终端中子墙的建立, 为实验测量高能中子提供了机遇. 为确定CSR外靶实验终端对中子流测量的可行性, 基于BUU理论模型分别对对称系统(Ni+Ni, Pb+Pb)和非对称系统(Pb+Ni)进行了模拟计算, 发现当系统能量达到几百MeV/u时, 中子流信号相当明显, 并与碰撞参数有明显的依赖关系. 模拟结果表明, 在前角20°的覆盖范围内, 可以较好地实现中子流测量所需要的反应平面确定及碰撞参数选择. 对双击事件及其对中子流的影响进行了简单的讨论.