TRITON-(HE)-H-3 RELATIVE AND DIFFERENTIAL FLOWS AND THE HIGH DENSITY BEHAVIOR OF NUCLEAR SYMMETRY ENERGY

Using a transport model coupled with a phase-space coalescence after-burner we study the triton-He-3 relative and differential transverse flows in semi-central Sn-132 + Sn-124 reactions at a beam energy of 400 MeV/nucleon. We find that the triton-He-3 pairs carry interesting information about the density dependence of the nuclear symmetry energy. The t-He-3 relative flow can be used as a particularly powerful probe of the high-density behavior of the nuclear symmetry energy.

Pressure drops of single and two-phase flows through T-type microchannel mixers

In this paper, preliminary experimental results are presented on pressure drop characteristics of single and two-phase flows through two T-type rectangular microchannel mixers with hydraulic diameters of 528 and 333 mum, respectively. It is shown that both N-2 and water single-phase laminar flows in microchannels, with consideration of experimental uncertainties, are consistent with classic theory, if additional effects, such as entrance effects that will interfere with the interpretation of experimental results, are eliminated by carefully designing the experiments. The obtained pressure drop data of N-2-water two-phase flow in micromixers are analyzed and compared with existing flow pattern-independent models. It is found that the Lockhart-Martinelli method generally underpredicts the frictional pressure drop. Thereafter, a modified correlation of C value in the Chisholm's equation based on linear regression of experimental data is proposed to provide a better prediction of the two-phase frictional pressure drop. Also among the homogeneous flow models investigated, the viscosity correlation of McAdams indicates the best performance in correlating the frictional pressure drop data (mean deviations within +/-20% for two micromixers both). Finally it is suggested that systematic studies are still required to accurately predict two-phase frictional performance in microchannels. (C) 2004 Elsevier B.V. All rights reserved.

Spatial and temporal flows of China's forest resources: Development of a framework for evaluating resource efficiency

Science & Technology Basic Work Program of China: Scientific Survey of the Middle-lower Reaches of Lantsang River and the Great Shangri-La Region [2008FY110300]; National Basic Research Program of China (973 Program): Ecosystem Services and Ecological Safety of the Major Terrestrial Ecosystems of China [2009CB421106]; National Natural Science Foundation of China [30670374]; EU ; European Commission, DG Research [003874]

Mesoscopic simulation of the impregnating process of unidirectional fibrous preform in resin transfer molding

The resin transfer molding has gained popularity in the preparation of fiber-reinforced polymer-matrix composites because of its high efficiency and low pollution. The non-uniform inter-tow and intra-tow flows are regarded as the reason of void formation in RTM. According to the process characteristics, the axisymmetric model was developed to study the interaction between the flow in the inter-tow space and that in the intra-tow space. The flow behavior inside the fiber tows was formulated using Brinkman's equation, while that in the open space around the fiber tows was formulated by Stokes' equation. The volume of fluid (VOF) method was applied to track the flow front, and the effects of filling velocity, resin viscosity, inter-tow dimension and intra-tow permeability on fluid pressure and flow front were analyzed. The results show that the flow front difference between the inter-tow and intra-tow becomes larger with the decrease of intra-tow permeability, as well as the increase of filling velocity and inter-tow dimension.

Strongly nonlinear long interfacial waves in uniform basic flows and their dispersion relationship

In this paper, long interfacial waves of finite amplitude in uniform basic flows are considered with the assumption that the aspect ratio between wavelength and water depth is small. A new model is derived using the velocities at arbitrary distances from the still water level as the velocity variables instead of the commonly used depth-averaged velocities. This significantly improves the dispersion properties and makes them applicable to a wider range of water depths. Since its derivation requires no assumption on wave amplitude, the model thus can be used to describe waves with arbitrary amplitude.

Inter-regional transfer trade flows in the English football league

Perdikis, Nicholas, Thomas, Dennis, Inter-regional transfer trade flows in the English football league', Tijdschrift voor Economie en Management (2002) 47 (4) 477-509 RAE2008

Quantum Flows as Markovian Limit of Emission, Absorption and Scattering Interactions

Gough, John, (2004) 'Quantum Flows as Markovian Limit of Emission, Absorption and Scattering Interactions', Communications in Mathematical Physics 254 pp.498-512 RAE2008

Contraction/expansion flows: The pressure drop and related issues

Binding, David; Phillips, P.M.; Philips, T.N., (2006) 'Contraction/expansion flows: The pressure drop and related issues', Journal of Non-Newtonian Fluid Mechanics 137 pp.31-38 RAE2008

Structural Analysis of Network Traffic Flows

Network traffic arises from the superposition of Origin-Destination (OD) flows. Hence, a thorough understanding of OD flows is essential for modeling network traffic, and for addressing a wide variety of problems including traffic engineering, traffic matrix estimation, capacity planning, forecasting and anomaly detection. However, to date, OD flows have not been closely studied, and there is very little known about their properties. We present the first analysis of complete sets of OD flow timeseries, taken from two different backbone networks (Abilene and Sprint-Europe). Using Principal Component Analysis (PCA), we find that the set of OD flows has small intrinsic dimension. In fact, even in a network with over a hundred OD flows, these flows can be accurately modeled in time using a small number (10 or less) of independent components or dimensions. We also show how to use PCA to systematically decompose the structure of OD flow timeseries into three main constituents: common periodic trends, short-lived bursts, and noise. We provide insight into how the various constituents contribute to the overall structure of OD flows and explore the extent to which this decomposition varies over time.

Analysis of OD Flows (Raw Data)

In a recent paper, Structural Analysis of Network Traffic Flows, we analyzed the set of Origin Destination traffic flows from the Sprint-Europe and Abilene backbone networks. This report presents the complete set of results from analyzing data from both networks. The results in this report are specific to the Sprint-1 and Abilene datasets studied in the above paper. The following results are presented here: 1 Rows of Principal Matrix (V) 2 1.1 Sprint-1 Dataset ................................ 2 1.2 Abilene Dataset.................................. 9 2 Set of Eigenflows 14 2.1 Sprint-1 Dataset.................................. 14 2.2 Abilene Dataset................................... 21 3 Classifying Eigenflows 26 3.1 Sprint-1 Dataset.................................. 26 3.2 Abilene Datase.................................... 44

Characterization of Network-Wide Anomalies in Traffic Flows

Detecting and understanding anomalies in IP networks is an open and ill-defined problem. Toward this end, we have recently proposed the subspace method for anomaly diagnosis. In this paper we present the first large-scale exploration of the power of the subspace method when applied to flow traffic. An important aspect of this approach is that it fuses information from flow measurements taken throughout a network. We apply the subspace method to three different types of sampled flow traffic in a large academic network: multivariate timeseries of byte counts, packet counts, and IP-flow counts. We show that each traffic type brings into focus a different set of anomalies via the subspace method. We illustrate and classify the set of anomalies detected. We find that almost all of the anomalies detected represent events of interest to network operators. Furthermore, the anomalies span a remarkably wide spectrum of event types, including denial of service attacks (single-source and distributed), flash crowds, port scanning, downstream traffic engineering, high-rate flows, worm propagation, and network outage.

Evaluation of a Load Profiling Approach to Routing Guaranteed Bandwidth Flows

To support the diverse Quality of Service (QoS) requirements of real-time (e.g. audio/video) applications in integrated services networks, several routing algorithms that allow for the reservation of the needed bandwidth over a Virtual Circuit (VC) established on one of several candidate routes have been proposed. Traditionally, such routing is done using the least-loaded concept, and thus results in balancing the load across the set of candidate routes. In a recent study, we have established the inadequacy of this load balancing practice and proposed the use of load profiling as an alternative. Load profiling techniques allow the distribution of "available" bandwidth across a set of candidate routes to match the characteristics of incoming VC QoS requests. In this paper we thoroughly characterize the performance of VC routing using load profiling and contrast it to routing using load balancing and load packing. We do so both analytically and via extensive simulations of multi-class traffic routing in Virtual Path (VP) based networks. Our findings confirm that for routing guaranteed bandwidth flows in VP networks, load balancing is not desirable as it results in VP bandwidth fragmentation, which adversely affects the likelihood of accepting new VC requests. This fragmentation is more pronounced when the granularity of VC requests is large. Typically, this occurs when a common VC is established to carry the aggregate traffic flow of many high-bandwidth real-time sources. For VP-based networks, our simulation results show that our load-profiling VC routing scheme performs better or as well as the traditional load-balancing VC routing in terms of revenue under both skewed and uniform workloads. Furthermore, load-profiling routing improves routing fairness by proactively increasing the chances of admitting high-bandwidth connections.

On Class-based Isolation of UDP, Short-lived and Long-lived TCP Flows

The congestion control mechanisms of TCP make it vulnerable in an environment where flows with different congestion-sensitivity compete for scarce resources. With the increasing amount of unresponsive UDP traffic in today's Internet, new mechanisms are needed to enforce fairness in the core of the network. We propose a scalable Diffserv-like architecture, where flows with different characteristics are classified into separate service queues at the routers. Such class-based isolation provides protection so that flows with different characteristics do not negatively impact one another. In this study, we examine different aspects of UDP and TCP interaction and possible gains from segregating UDP and TCP into different classes. We also investigate the utility of further segregating TCP flows into two classes, which are class of short and class of long flows. Results are obtained analytically for both Tail-drop and Random Early Drop (RED) routers. Class-based isolation have the following salient features: (1) better fairness, (2) improved predictability for all kinds of flows, (3) lower transmission delay for delay-sensitive flows, and (4) better control over Quality of Service (QoS) of a particular traffic type.

Scheduling Flows with Unknown Sizes: Approximate Analysis

Previous studies have shown that giving preferential treatment to short jobs helps reduce the average system response time, especially when the job size distribution possesses the heavy-tailed property. Since it has been shown that the TCP flow length distribution also has the same property, it is natural to let short TCP flows enjoy better service inside the network. Analyzing such discriminatory system requires modification to traditional job scheduling models since usually network traffic managers do not have detailed knowledge about individual flows such as their lengths. The Multi-Level (ML) queue, proposed by Kleinrock, can b e used to characterize such system. In an ML queueing system, the priority of a flow is reduced as the flow stays longer. We present an approximate analysis of the ML queueing system to obtain a closed-form solution of the average system response time function for general flow size distributions. We show that the response time of short flows can be significantly reduced without penalizing long flows.

Multiplexing VBR Traffic Flows with Guaranteed Application-level QoS Using Statistical Rate Monotonic Scheduling

Quality of Service (QoS) guarantees are required by an increasing number of applications to ensure a minimal level of fidelity in the delivery of application data units through the network. Application-level QoS does not necessarily follow from any transport-level QoS guarantees regarding the delivery of the individual cells (e.g. ATM cells) which comprise the application's data units. The distinction between application-level and transport-level QoS guarantees is due primarily to the fragmentation that occurs when transmitting large application data units (e.g. IP packets, or video frames) using much smaller network cells, whereby the partial delivery of a data unit is useless; and, bandwidth spent to partially transmit the data unit is wasted. The data units transmitted by an application may vary in size while being constant in rate, which results in a variable bit rate (VBR) data flow. That data flow requires QoS guarantees. Statistical multiplexing is inadequate, because no guarantees can be made and no firewall property exists between different data flows. In this paper, we present a novel resource management paradigm for the maintenance of application-level QoS for VBR flows. Our paradigm is based on Statistical Rate Monotonic Scheduling (SRMS), in which (1) each application generates its variable-size data units at a fixed rate, (2) the partial delivery of data units is of no value to the application, and (3) the QoS guarantee extended to the application is the probability that an arbitrary data unit will be successfully transmitted through the network to/from the application.