Performance of voice and video conferencing over ATM and gigabit ethernet backbone networks

Gigabit Ethernet and ATM network technologies have been modeled as campus network backbones for the simulation-based comparison of their performance. Real-time voice and video conferencing traffic is used to compare the performance of both backbone technologies in terms of response times and packet end-to-end delays. Simulation results show that Gigabit Ethernet has been able to perform the same and in some cases better than ATM as a backbone network for video and voice conferencing providing network designers with a cheaper solution to meet the growing needs of bandwidth-hungry applications in a campus environment

Random parking, Euclidean functionals, and rubber elasticity

We study subadditive functions of the random parking model previously analyzed by the second author. In particular, we consider local functions $S$ of subsets of $\mathbb{R}^d$ and of point sets that are (almost) subadditive in their first variable. Denoting by $\xi$ the random parking measure in $\mathbb{R}^d$, and by $\xi^R$ the random parking measure in the cube $Q_R=(-R,R)^d$, we show, under some natural assumptions on $S$, that there exists a constant $\bar{S}\in \mathbb{R}$ such that % $$\lim_{R\to +\infty} \frac{S(Q_R,\xi)}{|Q_R|}\,=\,\lim_{R\to +\infty}\frac{S(Q_R,\xi^R)}{|Q_R|}\,=\,\bar{S}$$ % almost surely. If $\zeta \mapsto S(Q_R,\zeta)$ is the counting measure of $\zeta$ in $Q_R$, then we retrieve the result by the second author on the existence of the jamming limit. The present work generalizes this result to a wide class of (almost) subadditive functions. In particular, classical Euclidean optimization problems as well as the discrete model for rubber previously studied by Alicandro, Cicalese, and the first author enter this class of functions. In the case of rubber elasticity, this yields an approximation result for the continuous energy density associated with the discrete model at the thermodynamic limit, as well as a generalization to stochastic networks generated on bounded sets.Comment: 28 page

Low-frequency incommensurate magnetic response in strongly correlated systems

It is shown that in the t-J model of Cu-O planes at low frequencies the dynamic spin structure factor is peaked at incommensurate wave vectors (1/2+-delta,1/2)$, (1/2,1/2+-delta). The incommensurability is connected with the momentum dependencies of the magnon frequency and damping near the antiferromagnetic wave vector. The behavior of the incommensurate peaks is similar to that observed in La_{2-x}(Ba,Sr)_xCuO_{4+y} and YBa_2Cu_3O_{7-y}: for hole concentrations 0.02<x<=0.12 we find that delta is nearly proportional to x, while for x>0.12 it tends to saturation. The incommensurability disappears with increasing temperature. Generally the incommensurate magnetic response is not accompanied by an inhomogeneity of the carrier density.Comment: 4 pages, 4 figure

Resonance peak in underdoped cuprates

The magnetic susceptibility measured in neutron scattering experiments in underdoped YBa$_2$Cu$_3$O$_{7-y}$ is interpreted based on the self-consistent solution of the t-J model of a Cu-O plane. The calculations reproduce correctly the frequency and momentum dependencies of the susceptibility and its variation with doping and temperature in the normal and superconducting states. This allows us to interpret the maximum in the frequency dependence -- the resonance peak -- as a manifestation of the excitation branch of localized Cu spins and to relate the frequency of the maximum to the size of the spin gap. The low-frequency shoulder well resolved in the susceptibility of superconducting crystals is connected with a pronounced maximum in the damping of the spin excitations. This maximum is caused by intense quasiparticle peaks in the hole spectral function for momenta near the Fermi surface and by the nesting.Comment: 9 pages, 6 figure

Quantum walk on distinguishable non-interacting many-particles and indistinguishable two-particle

We present an investigation of many-particle quantum walks in systems of non-interacting distinguishable particles. Along with a redistribution of the many-particle density profile we show that the collective evolution of the many-particle system resembles the single-particle quantum walk evolution when the number of steps is greater than the number of particles in the system. For non-uniform initial states we show that the quantum walks can be effectively used to separate the basis states of the particle in position space and grouping like state together. We also discuss a two-particle quantum walk on a two- dimensional lattice and demonstrate an evolution leading to the localization of both particles at the center of the lattice. Finally we discuss the outcome of a quantum walk of two indistinguishable particles interacting at some point during the evolution.Comment: 8 pages, 7 figures, To appear in special issue: "quantum walks" to be published in Quantum Information Processin

Cell shape analysis of random tessellations based on Minkowski tensors

To which degree are shape indices of individual cells of a tessellation characteristic for the stochastic process that generates them? Within the context of stochastic geometry and the physics of disordered materials, this corresponds to the question of relationships between different stochastic models. In the context of image analysis of synthetic and biological materials, this question is central to the problem of inferring information about formation processes from spatial measurements of resulting random structures. We address this question by a theory-based simulation study of shape indices derived from Minkowski tensors for a variety of tessellation models. We focus on the relationship between two indices: an isoperimetric ratio of the empirical averages of cell volume and area and the cell elongation quantified by eigenvalue ratios of interfacial Minkowski tensors. Simulation data for these quantities, as well as for distributions thereof and for correlations of cell shape and volume, are presented for Voronoi mosaics of the Poisson point process, determinantal and permanental point processes, and Gibbs hard-core and random sequential absorption processes as well as for Laguerre tessellations of polydisperse spheres and STIT- and Poisson hyperplane tessellations. These data are complemented by mechanically stable crystalline sphere and disordered ellipsoid packings and area-minimising foam models. We find that shape indices of individual cells are not sufficient to unambiguously identify the generating process even amongst this limited set of processes. However, we identify significant differences of the shape indices between many of these tessellation models. Given a realization of a tessellation, these shape indices can narrow the choice of possible generating processes, providing a powerful tool which can be further strengthened by density-resolved volume-shape correlations.Comment: Chapter of the forthcoming book "Tensor Valuations and their Applications in Stochastic Geometry and Imaging" in Lecture Notes in Mathematics edited by Markus Kiderlen and Eva B. Vedel Jense

A framework for the local information dynamics of distributed computation in complex systems

The nature of distributed computation has often been described in terms of the component operations of universal computation: information storage, transfer and modification. We review the first complete framework that quantifies each of these individual information dynamics on a local scale within a system, and describes the manner in which they interact to create non-trivial computation where "the whole is greater than the sum of the parts". We describe the application of the framework to cellular automata, a simple yet powerful model of distributed computation. This is an important application, because the framework is the first to provide quantitative evidence for several important conjectures about distributed computation in cellular automata: that blinkers embody information storage, particles are information transfer agents, and particle collisions are information modification events. The framework is also shown to contrast the computations conducted by several well-known cellular automata, highlighting the importance of information coherence in complex computation. The results reviewed here provide important quantitative insights into the fundamental nature of distributed computation and the dynamics of complex systems, as well as impetus for the framework to be applied to the analysis and design of other systems.Comment: 44 pages, 8 figure

Report on Gun Conditioning Activities at PITZ in 2013

Recently three RF guns were prepared at the Photo Injector Test Facility at DESY, location Zeuthen PITZ for their subsequent operation at FLASH and the European XFEL. The gun 3.1 is a previous cavity design and is currently installed and operated at FLASH, the other two guns 4.3 and 4.4 were of the current cavity design and are dedicated to serve for the start up of the European XFEL photo injector. All three cavities had been dry ice cleaned prior their conditioning and hence showed low dark current levels. The lowest dark current level as low as 60 amp; 956;A at 65MV m field amplitude has been observed for the gun 3.1. This paper reports in details about the conditioning process of the most recent gun 4.4. It informs about experience gained at PITZ during establishing of the RF conditioning procedure and provides a comparison with the other gun cavities in terms of the dark currents. It also summarizes the major setup upgrades, which have affected the conditioning processes of the cavitie

Fitting the integrated Spectral Energy Distributions of Galaxies

Fitting the spectral energy distributions (SEDs) of galaxies is an almost universally used technique that has matured significantly in the last decade. Model predictions and fitting procedures have improved significantly over this time, attempting to keep up with the vastly increased volume and quality of available data. We review here the field of SED fitting, describing the modelling of ultraviolet to infrared galaxy SEDs, the creation of multiwavelength data sets, and the methods used to fit model SEDs to observed galaxy data sets. We touch upon the achievements and challenges in the major ingredients of SED fitting, with a special emphasis on describing the interplay between the quality of the available data, the quality of the available models, and the best fitting technique to use in order to obtain a realistic measurement as well as realistic uncertainties. We conclude that SED fitting can be used effectively to derive a range of physical properties of galaxies, such as redshift, stellar masses, star formation rates, dust masses, and metallicities, with care taken not to over-interpret the available data. Yet there still exist many issues such as estimating the age of the oldest stars in a galaxy, finer details ofdust properties and dust-star geometry, and the influences of poorly understood, luminous stellar types and phases. The challenge for the coming years will be to improve both the models and the observational data sets to resolve these uncertainties. The present review will be made available on an interactive, moderated web page (sedfitting.org), where the community can access and change the text. The intention is to expand the text and keep it up to date over the coming years.Comment: 54 pages, 26 figures, Accepted for publication in Astrophysics & Space Scienc

Quantum walks: a comprehensive review

Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a solid field of research of quantum computation full of exciting open problems for physicists, computer scientists, mathematicians and engineers. In this paper we review theoretical advances on the foundations of both discrete- and continuous-time quantum walks, together with the role that randomness plays in quantum walks, the connections between the mathematical models of coined discrete quantum walks and continuous quantum walks, the quantumness of quantum walks, a summary of papers published on discrete quantum walks and entanglement as well as a succinct review of experimental proposals and realizations of discrete-time quantum walks. Furthermore, we have reviewed several algorithms based on both discrete- and continuous-time quantum walks as well as a most important result: the computational universality of both continuous- and discrete- time quantum walks.Comment: Paper accepted for publication in Quantum Information Processing Journa