Novel Generic Bounds on the Sum Rate of MIMO ZF Receivers

This paper introduces some novel upper and lower bounds on the achievable sum rate of multiple-input multiple-output (MIMO) systems with zero-forcing (ZF) receivers. The presented bounds are not only tractable but also generic since they apply for different fading models of interest, such as uncorrelated/ correlated Rayleigh fading and Ricean fading. We further formulate a new relationship between the sum rate and the first negative moment of the unordered eigenvalue of the instantaneous correlation matrix. The derived expressions are explicitly compared with some existing results on MIMO systems operating with optimal and minimum mean-squared error (MMSE) receivers. Based on our analytical results, we gain valuable insights into the implications of the model parameters, such as the number of antennas, spatial correlation and Ricean-K factor, on the sum rate of MIMO ZF receivers. © 2011 IEEE.

Generic Ergodic Capacity Bounds for Fixed-Gain AF Dual-Hop Relaying Systems

This paper elaborates on the ergodic capacity of fixed-gain amplify-and-forward (AF) dual-hop systems, which have recently attracted considerable research and industry interest. In particular, two novel capacity bounds that allow for fast and efficient computation and apply for nonidentically distributed hops are derived. More importantly, they are generic since they apply to a wide range of popular fading channel models. Specifically, the proposed upper bound applies to Nakagami-m, Weibull, and generalized-K fading channels, whereas the proposed lower bound is more general and applies to Rician fading channels. Moreover, it is explicitly demonstrated that the proposed lower and upper bounds become asymptotically exact in the high signal-to-noise ratio (SNR) regime. Based on our analytical expressions and numerical results, we gain valuable insights into the impact of model parameters on the capacity of fixed-gain AF dual-hop relaying systems. © 2011 IEEE.

Comparison of lagrangian and eulerian simulations of slurry flows in a sudden expansion

From a review of technical literature, it was not apparent if the Lagrangian or the Eulerian dispersed phase modeling approach was more valid to simulate dilute erosive slurry flow. In this study, both modeling approaches were employed and a comparative analysis of performances and accuracy between the two models was carried out. Due to an impossibility to define, for the Eulerian model already implemented in FLUENT, a set of boundary conditions consistent with the Lagrangian impulsive equations, an Eulerian dispersed phase model was integrated in the FLUENT code using subroutines and user-defined scalar equations. Numerical predictions obtained from the two different approaches for two-phase flow in a sudden expansion were compared with the measured data. Excellent agreement was attained between the predicted and observed fluid and particle velocity in the axial direction and for the kinetic energy. Erosion profiles in a sudden expansion computed using the Lagrangian scheme yielded good qualitative agreement with measured data and predicted a maximum impact angle of 29 deg at the fluid reattachment point. The Eulerian model was adversely affected by the reattachment of the fluid phase to the wall and the simulated erosion profiles were not in agreement with the Lagrangian or measured data. Furthermore, the Eulerian model under-predicted the Lagrangian impact angle at all locations except the reattachment point. © 2010 American Society of Mechanical Engineers.

Quantum Discord Bounds the Amount of Distributed Entanglement

The ability to distribute quantum entanglement is a prerequisite for many fundamental tests of quantum theory and numerous quantum information protocols. Two distant parties can increase the amount of entanglement between them by means of quantum communication encoded in a carrier that is sent from one party to the other. Intriguingly, entanglement can be increased even when the exchanged carrier is not entangled with the parties. However, in light of the defining property of entanglement stating that it cannot increase under classical communication, the carrier must be quantum. Here we show that, in general, the increase of relative entropy of entanglement between two remote parties is bounded by the amount of nonclassical correlations of the carrier with the parties as quantified by the relative entropy of discord. We study implications of this bound, provide new examples of entanglement distribution via unentangled states, and put further limits on this phenomenon.

Sublinear Bounds for Randomized Leader Election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) takes only O(n-vlog3/2n) messages to elect a unique leader (with high probability). This algorithm is then extended to solve leader election on any connected non-bipartiten-node graph G in O(t(G)) time and O(t(G)n-vlog3/2n) messages, where t(G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficientdeterministic leader election algorithms. Finally, an almost-tight lower bound is presented for randomized leader election, showing that O(n-v) messages are needed for any O(1) time leader election algorithm which succeeds with high probability. It is also shown that O(n 1/3) messages are needed by any leader election algorithm that succeeds with high probability, regardless of the number of the rounds. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

Sublinear bounds for randomized leader election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O(√ √nlog^3/2n) messages to elect a unique leader (with high probability). When considering the "explicit" variant of leader election where eventually every node knows the identity of the leader, our algorithm yields the asymptotically optimal bounds of O(1) rounds and O(. n) messages. This algorithm is then extended to one solving leader election on any connected non-bipartite n-node graph G in O(τ(. G)) time and O(τ(G)n√log^3/2n) messages, where τ(. G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficient deterministic leader election algorithms. Finally, we present an almost matching lower bound for randomized leader election, showing that Ω(n) messages are needed for any leader election algorithm that succeeds with probability at least 1/. e+. ε, for any small constant ε. >. 0. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

A Lagrangian approach for modeling road collisions using second-order models of traffic flow

In [M. Herty, A. Klein, S. Moutari, V. Schleper, and G. Steinaur, IMA J. Appl. Math., 78(5), 1087–1108, 2013] and [M. Herty and V. Schleper, ZAMM J. Appl. Math. Mech., 91, 763–776, 2011], a macroscopic approach, derived from fluid-dynamics models, has been introduced to infer traffic conditions prone to road traffic collisions along highways’ sections. In these studies, the governing equations are coupled within an Eulerian framework, which assumes fixed interfaces between the models. A coupling in Lagrangian coordinates would enable us to get rid of this (not very realistic) assumption. In this paper, we investigate the well-posedness and the suitability of the coupling of the governing equations within the Lagrangian framework. Further, we illustrate some features of the proposed approach through some numerical simulations.

Bounds for the signless laplacian energy

The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. The Laplacian (respectively, the signless Laplacian) energy of G is the sum of the absolute values of the differences between the eigenvalues of the Laplacian (respectively, signless Laplacian) matrix and the arithmetic mean of the vertex degrees of the graph. In this paper, among some results which relate these energies, we point out some bounds to them using the energy of the line graph of G. Most of these bounds are valid for both energies, Laplacian and signless Laplacian. However, we present two new upper bounds on the signless Laplacian which are not upper bounds for the Laplacian energy. © 2010 Elsevier Inc. All rights reserved.

Lagrangian transport of particles in Ria de Aveiro lagoon, Portugal

A two-dimensional vertically integrated hydrodynamic model coupled to a particle tracking model is applied to study the dispersion processes and residence time in Ria de Aveiro lagoon (Portugal). The only dispersion process that is considered in this study is the advection, according to the main characteristics of the local hydrodynamic. The particle tracking model computes the particles position at each time step, using a fourth-order Runge-Kutta integration method. The dispersion of passive particles released along the lagoon and in critical areas are studied in this work. The residence time is also determined for the entire lagoon. The results show that the mixture between particles coming from different channels of the lagoon is negligible in a time scale higher than 2 tidal cycles. The residence time for the lagoon central area is about 2 days, revealing a strong marine influence in this area. At the upper reaches of the channels were found values higher than 2 weeks.

Determination of Alternaria spp. Habitats Using 7-Day Volumetric Spore Trap, Hybrid Single Particle Lagrangian Integrated Trajectory Model and Geographic Information System

There are many species among the Alternaria genus, which hosts on economically important crops causing significant yield losses. Less attention has been paid to fungi hosting on plants constituting substantial components of pastures and meadows. Alternaria spp. spores are also recognised as important allergens. A 7-day volumetric spore trap was used to monitor the concentration of airborne fungal spores. Air samples were collected in Worcester, England (2006–2010). Days with a high spore count were then selected. The longest episode that occurred within a five year study was chosen for modelling. Two source maps presenting distribution of crops under rotation and pastures in the UK were produced. Back trajectories were calculated using the HYSPLIT model. In ArcGIS clusters of trajectories were studied in connection with source maps by including the height above ground level and the speed of the air masses. During the episode no evidence for a long distance transport from the continent of Alternaria spp. spores was detected. The overall direction of the air masses fell within the range from South-West to North. The back trajectories indicated that the most important sources of Alternaria spp. spores were located in the West Midlands of England.

Detecting a shallow surface layer in Barkley Sound from Lagrangian drifter trajectories

Senior thesis written for Oceanography 444

Hausdorff dimension bounds for smoothness of holonomies for codimension 1 hyperbolic dynamics

We prove that the stable holonomies of a proper codimension 1 attractor Λ, for a Cr diffeomorphism f of a surface, are not C1+θ for θ greater than the Hausdorff dimension of the stable leaves of f intersected with Λ. To prove this result we show that there are no diffeomorphisms of surfaces, with a proper codimension 1 attractor, that are affine on a neighbourhood of the attractor and have affine stable holonomies on the attractor.