Introduction of longitudinal and transverse Lagrangian velocity increments in homogeneous and isotropic turbulence

Based on geometric considerations, longitudinal and transverse Lagrangian velocity increments are introduced as components along, and perpendicular to, the displacement of fluid particles during a time scale {\tau}. It is argued that these two increments probe preferentially the stretching and spinning of material fluid elements, respectively. This property is confirmed (in the limit of vanishing {\tau}) by examining the variances of these increments conditioned on the local topology of the flow. Interestingly, these longitudinal and transverse Lagrangian increments are found to share some qualitative features with their Eulerian counterparts. In particular, direct numerical simulations at turbulent Reynolds number up to 300 show that the distributions of the longitudinal increment are negatively skewed at all {\tau}, which is a signature of time irreversibility of turbulence in the Lagrangian framework. Transverse increments are found more intermittent than longitudinal increments, as quantified by the comparison of their respective flatnesses and scaling laws. Although different in nature, standard Lagrangian increments (projected on fixed axis) exhibit scaling properties that are very close to transverse Lagrangian increments

Intermediate boundary conditions for LOD, ADI and approximate factorization methods

A general approach to determining the correct intermediate boundary conditions for dimensional splitting methods is presented. The intermediate solution U is viewed as a second order accurate approximation to a modified equation. Deriving the modified equation and using the relationship between this equation and the original equation allows us to determine the correct boundary conditions for U*. This technique is illustrated by applying it to locally one dimensional (LOD) and alternating direction implicit (ADI) methods for the heat equation in two and three space dimensions. The approximate factorization method is considered in slightly more generality

Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc Wireless Networks

Hierarchical cooperation has recently been shown to achieve better throughput scaling than classical multihop schemes under certain assumptions on the channel model in static wireless networks. However, the end-to-end delay of this scheme turns out to be significantly larger than those of multihop schemes. A modification of the scheme is proposed here that achieves a throughput-delay trade-off $D(n)=(\log n)^2 T(n)$ for T(n) between $\Theta(\sqrt{n}/\log n)$ and $\Theta(n/\log n)$, where D(n) and T(n) are respectively the average delay per bit and the aggregate throughput in a network of n nodes. This trade-off complements the previous results of El Gamal et al., which show that the throughput-delay trade-off for multihop schemes is given by D(n)=T(n) where T(n) lies between $\Theta(1)$ and $\Theta(\sqrt{n})$. Meanwhile, the present paper considers the network multiple-access problem, which may be of interest in its own right.Comment: 9 pages, 6 figures, to appear in IEEE Transactions on Information Theory, submitted Dec 200

Measurement of Top Quark Properties at the Tevatron

We highlight the most recent top quark properties measurements performed at the Tevatron collider by the CDF and D0 experiments. The data samples used for the analyses discussed correspond to an integrated luminosity varying from 360 pb-1 to 760 pb-1.Comment: 4 pages, 6 figures. To be included in the proceedings of the 41st Rencontres de Moriond, QCD and Hadronic Interactions, La Thuile, Italy, 18-25 Mar 200

On the Rapid Increase of Intermittency in the Near-Dissipation Range of Fully Developed Turbulence

Intermittency, measured as log(F(r)/3), where F(r) is the flatness of velocity increments at scale r, is found to rapidly increase as viscous effects intensify, and eventually saturate at very small scales. This feature defines a finite intermediate range of scales between the inertial and dissipation ranges, that we shall call near-dissipation range. It is argued that intermittency is multiplied by a universal factor, independent of the Reynolds number Re, throughout the near-dissipation range. The (logarithmic) extension of the near-dissipation range varies as \sqrt(log Re). As a consequence, scaling properties of velocity increments in the near-dissipation range strongly depend on the Reynolds number.Comment: 7 pages, 7 figures, to appear in EPJ

Product Multicommodity Flow in Wireless Networks

We provide a tight approximate characterization of the $n$-dimensional product multicommodity flow (PMF) region for a wireless network of $n$ nodes. Separate characterizations in terms of the spectral properties of appropriate network graphs are obtained in both an information theoretic sense and for a combinatorial interference model (e.g., Protocol model). These provide an inner approximation to the $n^2$ dimensional capacity region. These results answer the following questions which arise naturally from previous work: (a) What is the significance of $1/\sqrt{n}$ in the scaling laws for the Protocol interference model obtained by Gupta and Kumar (2000)? (b) Can we obtain a tight approximation to the "maximum supportable flow" for node distributions more general than the geometric random distribution, traffic models other than randomly chosen source-destination pairs, and under very general assumptions on the channel fading model? We first establish that the random source-destination model is essentially a one-dimensional approximation to the capacity region, and a special case of product multi-commodity flow. Building on previous results, for a combinatorial interference model given by a network and a conflict graph, we relate the product multicommodity flow to the spectral properties of the underlying graphs resulting in computational upper and lower bounds. For the more interesting random fading model with additive white Gaussian noise (AWGN), we show that the scaling laws for PMF can again be tightly characterized by the spectral properties of appropriately defined graphs. As an implication, we obtain computationally efficient upper and lower bounds on the PMF for any wireless network with a guaranteed approximation factor.Comment: Revised version of "Capacity-Delay Scaling in Arbitrary Wireless Networks" submitted to the IEEE Transactions on Information Theory. Part of this work appeared in the Allerton Conference on Communication, Control, and Computing, Monticello, IL, 2005, and the Internation Symposium on Information Theory (ISIT), 200