Initial phase modelling in numerical explosion applied to process safety

The utilisation of computational fluid dynamics (CFD) in process safety has increased significantly in recent years. The modelling of accidental explosion via CFD has in many cases replaced the classical Multi Energy and Brake Strehlow methods. The benefits obtained with CFD modelling can be diminished if proper modelling of the initial phase of explosion is neglected. In the early stages of an explosion, the flame propagates in a quasi-laminar regime. Proper modelling of the initial laminar phase is a key aspect in order to predict the peak pressure and the time to peak pressure. The present work suggests a modelling approach for the initial laminar phase in explosion scenarios. Findings are compared with experimental data for two classical explosion test cases which resemble the common features in chemical process areas (confinement and congestion). A detailed analysis of the threshold for the transition from laminar to turbulent regime is also carried out. The modelling is implemented in a fully 3D Navier-Stokes compressible formulation. Combustion is treated using a laminar flamelet approach based on the Bray, Moss and Libby (BML) formulation. A novel modified porosity approach developed for the unstructured solver is also considered. Results agree satisfactorily with experiments and the modelling is found to be robust. © 2013 The Institution of Chemical Engineers.

基于改进网络模型的大时滞网络拥塞控制算法

　随着对网络拥塞控制的深入研究,出现了许多有关网络流量的控制理论及网络模型.Misra等人于2000年基于流体流(fluidflow)理论提出的模型被研究人员广为采用.但模型在推导过程中的一些近似却使得模型对网络行为描述不精确.本文对此从理论和实验结果两方面进行了详细分析,并对原模型进行了改进.基于改进的模型,把一种PID(ProportionalIntegralDifferential)及类PID设计方法用于AQM(ActiveQueueManagement)控制器的设计.对比仿真结果表明,该算法具有更好的性能.

NS2网络仿真器功能扩展方法及实现

NS2作为开源软件缺少对最新研究算法的模拟能力 .在现有软件基础上对其进行功能扩展极其必要 ,是模拟研究新理论新算法的基础 .本文着重探讨网络仿真软件 NS2的功能扩展原理及设计实现 ,展示运用 NS2仿真器对网络行为进行研究的过程 .最后对该算法进行模拟实验 ,并与已有 RED和 PI算法进行性能对比分析 .

基于D稳定域和ITAE准则的主动队列管理算法

主动队列管理（active queue management，简称AQM）是网络拥塞控制的研究热点之一，其中的关键问题是如何设计反馈控制策略．提出一种新的基于D稳定域和时间乘以误差绝对值乘积积分（integral of time-weighted absolute error,简称ITAE）性能准则的比例-积分-微分（proportional-integral-differential，简称PID）优化设计方法（简称DITAE-PID），并用于AQM控制器的设计，控制闭环系统的理想动态性能．首先在复平面上设定一组理想的D稳定域，然后以ITAE为目标函数，通过数值优化算法求出控制器的参数，使得闭环系统的所有特征根都在D稳定域内，以降低排队延时，提高有效吞吐量．对比仿真实验结果表明孩算法能够预先探测和控制拥塞，有较好的鲁棒性，链路利用率更高，丢包率更小，平均队列长度更趋于期望值，同时，趋于期望队列长度的时间更短，其综合性能明显优于典型的随机早期探测（random early detection，简称RED）和比例-积分（proportional-integral，简称PI）算法．

一种开放源代码的网络仿真器的原理与实现

随着互联网的飞速发展,网络拥塞已经成为一个十分重要的问题,网络仿真是一种检测拥塞控制算法有效性的常用方法.该文给出了一种开放源代码的网络仿真器NS2(Network Simulator V2)的原理与实现.首先比较了四种不同仿真器的优缺点,然后详细描述了NS2的模块组成、工作环境、主代码结构以及扩展方法等,最后用RED(Random EarlyDetection)队列调度和移动IP数据传输两个典型实例说明了NS2的应用价值.

Titanium and zirconium complexes with aminoiminophosphorane ligands

A series of titanium and zirconium complexes based on aminoiminophosphorane ligands [Ph2P(Nt-Bu)(NR)](2)MCl2 (4, M = Ti, R = Ph; 5, M = Zr, R = Ph; 6, M = Ti, R = SiMe3; 7, M = Zr, R = SiMe3) have been synthesized by the reaction of the ligands with TiCl4 and ZrCl4. The structure of complex 4 has been determined by X-ray crystallography. The observed very weak interaction between Ti and P suggests partial pi-electron delocalization through both Ti and P. The complexes 4-7 are inactive for ethylene polymerization in the presence of modified methylaluminoxane (MMAO) or i-Bu3Al-Ph3CB(C6F5)(4) under atmospheric pressure, and is probably the result of low monomer ethylene concentration and steric congestion around the central metal.

Persistent Nodes for Reliable Memory in Geographically Local Networks

A Persistent Node is a redundant distributed mechanism for storing a key/value pair reliably in a geographically local network. In this paper, I develop a method of establishing Persistent Nodes in an amorphous matrix. I address issues of construction, usage, atomicity guarantees and reliability in the face of stopping failures. Applications include routing, congestion control, and data storage in gigascale networks.

Sustainable urban transport in Central America - a future without the car?

Is it conceivable to contemplate a future without the car as the center of an urban transportation system? Can emerging economies grow without concomitant growth in car usage? San Pedro Sula, Honduras, is one city at a critical decision point about the future of transportation and mobility. Will it be a sustainable transport future that balances economic, environmental and social needs or will it be the traditional “predict and provide” approach that attempts to expand the capacity of the road system to meet future travel demand. This paper provides some background into the issue for this Central American city by describing the current urban transport system, current plans for improvement and outlines a process for defining a vision for a sustainable transport future in San Pedro Sula. The paper concludes with a challenge to all cities that currently have low automobile ownership rates to consider a sustainable transport system in order to “thrive” with transport choices for all residents rather than “choke” on congestion and the negative side effects thereof.

Impact of postponement on transportation: An environmental perspective

Yang, Ying, Yang, Biao, and Wijngaard, Jacob, ' Impact of postponement on transportation: An environmental perspective', International Journal of Logistics Management (2005) 16(2) pp.192-204 RAE2008

Mapping Parallel Iterative Algorithms onto Workstation Networks

For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work [HPS94], we showed experimentally that the performance of certain parallel applications running on a workstation network can be improved significantly if a congestion control protocol is used to enhance network performance. In this paper, we characterize and analyze the communication requirements of a large class of supercomputing applications that fall under the category of fixed-point problems, amenable to solution by parallel iterative methods. This results in a set of interface and architectural features sufficient for the efficient implementation of the applications over a large-scale distributed system. In particular, we propose a direct link between the application and network layer, supporting congestion control actions at both ends. This in turn enhances the system's responsiveness to network congestion, improving performance. Measurements are given showing the efficacy of our scheme to support large-scale parallel computations.

How Well Can TCP Infer Network State?

The Transmission Control Protocol (TCP) has been the protocol of choice for many Internet applications requiring reliable connections. The design of TCP has been challenged by the extension of connections over wireless links. We ask a fundamental question: What is the basic predictive power of TCP of network state, including wireless error conditions? The goal is to improve or readily exploit this predictive power to enable TCP (or variants) to perform well in generalized network settings. To that end, we use Maximum Likelihood Ratio tests to evaluate TCP as a detector/estimator. We quantify how well network state can be estimated, given network response such as distributions of packet delays or TCP throughput that are conditioned on the type of packet loss. Using our model-based approach and extensive simulations, we demonstrate that congestion-induced losses and losses due to wireless transmission errors produce sufficiently different statistics upon which an efficient detector can be built; distributions of network loads can provide effective means for estimating packet loss type; and packet delay is a better signal of network state than short-term throughput. We demonstrate how estimation accuracy is influenced by different proportions of congestion versus wireless losses and penalties on incorrect estimation.

Efficiently and Fairly Allocating Bandwidth at a Highly Congested Link

We consider the problem of efficiently and fairly allocating bandwidth at a highly congested link to a diverse set of flows, including TCP flows with various Round Trip Times (RTT), non-TCP-friendly flows such as Constant-Bit-Rate (CBR) applications using UDP, misbehaving, or malicious flows. Though simple, a FIFO queue management is vulnerable. Fair Queueing (FQ) can guarantee max-min fairness but fails at efficiency. RED-PD exploits the history of RED's actions in preferentially dropping packets from higher-rate flows. Thus, RED-PD attempts to achieve fairness at low cost. By relying on RED's actions, RED-PD turns out not to be effective in dealing with non-adaptive flows in settings with a highly heterogeneous mix of flows. In this paper, we propose a new approach we call RED-NB (RED with No Bias). RED-NB does not rely on RED's actions. Rather it explicitly maintains its own history for the few high-rate flows. RED-NB then adaptively adjusts flow dropping probabilities to achieve max-min fairness. In addition, RED-NB helps RED itself at very high loads by tuning RED's dropping behavior to the flow characteristics (restricted in this paper to RTTs) to eliminate its bias against long-RTT TCP flows while still taking advantage of RED's features at low loads. Through extensive simulations, we confirm the fairness of RED-NB and show that it outperforms RED, RED-PD, and CHOKe in all scenarios.