运输网络中最小饱和流的求解

运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用.     

不连续双斜向内肋管纵向涡流动显示

利用染色线流动显示方法,显示并分析了不同雷诺数下不连续双斜向内肋管管内流场。流动显示实验结果表明不连续双斜向内肋管管内存在较强的贴近壁面的纵向涡,纵向涡沿流向可持续约一倍管径距离,并且纵向涡的强度随雷诺数的增加而增强。     

The flow of a variable viscosity fluid between parallel plates with shear heating

A model for the flow of a fluid through a channel with parallel plates is investigated. The channel is narrow, so that the lubrication approximation may be applied. The channel walls are maintained at a constant temperature. Shear heating effects are included and the fluid viscosity decreases exponentially with temperature. When the flow is driven solely by shear stress or imposed velocity at the top, analytical progress is possible. When pressure gradient also drives the flow the problem is solved numerically.     

倾斜下降管气液两相分层流截面含气率的计算与液层高度的预测

分层流是气液两相流中常见的流动型式，分层流中液层高度是计算的基本数据，由于界面波的存在，对液层的测量和预测都很困难．Ｖｌａｃｈｏｓ提出了预测气液两相分层流液层厚度的关系式，但这一关系式并不适用于倾斜下降管气液两相流．本文提出了计算倾斜下降管气液两相分层流截面含气率的理论模型，在这种模型下得到的截面含气率和实验结果符合良好．在大量实验的基础上，考虑了倾角、管径、气液各相折算速度的影响，根据实验数据提出了预测液层厚度的关系式。     

Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates

We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the M_t/M_t/1 processor-sharing queue. Our analysis is enabled by the introduction of a “virtual customer” which differs from the notion of a “tagged customer” in that the former has no effect on the processing time of the other customers in the system. Our analysis generalizes to non-exponential service and interarrival times, when the fluid and diffusion limits for the queueing process are known.     

进口畸变条件下改善压气机性能的数值研究

依据"非定常两代流型"理论,验证了二维叶栅在均匀进气条件下,施加激励对其性能所起的改善作用,尔后重点研究了进口具有总压的周向畸变时,施加激励对其气动性能的影响。计算结果表明,在有无进口畸变时,施加一定的激励都会改善流场结构,气动参数有积极变化,压升和效率增加,特别是在流量比较小时,变化尤为明显.对于进口畸变和施加激励影响压气机性能的内在原因,从流场结构的变化方面进行了初步分析。     

Residual currents and corridor of flow in the Rio de la Plata

The Rio de la Plata is a large and shallow water body that discharges onto the Atlantic Ocean. The main driving forces for the river flow are the bathymetry, tides, the outflow from the Paraná and Uruguay rivers and the winds. A numerical model covering the entire river was set up with the objective of increasing our understanding of the hydrographical features and morphological dynamics in the Estuary. The simulations revealed a counter-clockwise residual circulation in the Samborombón Bay and an eastward net flow near the Uruguayan coast. The residual flow is forced by both the tides and the bathymetry. The residence time for the entire river ranges from 40 to 80 days. However, residence times above 120 days was found in the Samborombón Bay. Three corridors of flow have been identified.     

基于二次插值的非饱和土壤水流问题的特征差分方法及数值模拟

本文针对一类非饱和土壤水流问题,提出了基于二次插值的特征差分格式,得到了严谨的L2模误差估计.并作了数值试验,指明方法的有效性.     

A fluid system with coupled input and output,and its application to bottlenecks in ad hoc networks

This paper studies a fluid queue with coupled input and output. Flows arrive according to a Poisson process, and when n flows are present, each of them transmits traffic into the queue at a rate c/(n+1), where the remaining c/(n+1) is used to serve the queue. We assume exponentially distributed flow sizes, so that the queue under consideration can be regarded as a system with Markov fluid input. The rationale behind studying this queue lies in ad hoc networks: bottleneck links have roughly this type of sharing policy. We consider four performance metrics: (i) the stationary workload of the queue, (ii) the queueing delay, i.e., the delay of a ‘packet’ (a fluid particle) that arrives at the queue at an arbitrary point in time, (iii) the flow transfer delay, i.e., the time elapsed between arrival of a flow and the epoch that all its traffic has been put into the queue, and (iv) the sojourn time, i.e., the flow transfer time increased by the time it takes before the last fluid particle of the flow is served. For each of these random variables we compute the Laplace transform. The corresponding tail probabilities decay exponentially, as is shown by a large-deviations analysis. F. Roijers’ work has been carried out partly in the SENTER-NOVEM funded project Easy Wireless.     

An improved algorithm for decomposing arc flows into multipath flows

We consider a multipath maximum flow problem introduced by Kishimoto (Networks 27(4)(1996)279-291). The focus is on efficient transformation from arc flows into multipath flows, where a multipath flow is a nonnegative combination of multipaths. A new algorithm that is more efficient than existing ones is proposed for the transformation.