An Interacting Dark Energy Model for the Expansion History of the Universe

We explore a model of interacting dark energy where the dark energy density is related by the holographic principle to the Hubble parameter, and the decay of the dark energy into matter occurs at a rate comparable to the current value of the Hubble parameter. We find this gives a good fit to the observational data supporting an accelerating Universe, and the model represents a possible alternative interpretation of the expansion history of the Universe.Comment: 6 pages, 2 figures, Phys. Rev. D versio

A Modified Version of the Waxman Algorithm

The iterative algorithm recently proposed by Waxman for solving eigenvalue problems, which relies on the method of moments, has been modified to improve its convergence considerably without sacrificing its benefits or elegance. The suggested modification is based on methods to calculate low-lying eigenpairs of large bounded hermitian operators or matrices

CP Violation and Arrows of Time Evolution of a Neutral KK or BB Meson from an Incoherent to a Coherent State

We study the evolution of a neutral $K$ meson prepared as an incoherent equal mixture of $K^0$ and $\bar{K^0}$. Denoting the density matrix by \rho(t) = {1/2} N(t) [\1 + \vec{\zeta}(t) \cdot \vec{\sigma} ] , the norm of the state $N(t)$ is found to decrease monotonically from one to zero, while the magnitude of the Stokes vector $|\vec{\zeta}(t)|$ increases monotonically from zero to one. This property qualifies these observables as arrows of time. Requiring monotonic behaviour of $N(t)$ for arbitrary values of $\gamma_L, \gamma_S$ and $\Delta m$ yields a bound on the CP-violating overlap $\delta = \braket{K_L}{K_S}$, which is similar to, but weaker than, the known unitarity bound. A similar requirement on $|\vec{\zeta}(t)|$ yields a new bound, $\delta^2 < {1/2} (\frac{\Delta \gamma}{\Delta m}) \sinh (\frac{3\pi}{4} \frac{\Delta \gamma}{\Delta m})$ which is particularly effective in limiting the CP-violating overlap in the $B^0$-$\bar{B^0}$ system. We obtain the Stokes parameter $\zeta_3(t)$ which shows how the average strangeness of the beam evolves from zero to $\delta$. The evolution of the Stokes vector from $|\vec{\zeta}| = 0$ to $|\vec{\zeta}| = 1$ has a resemblance to an order parameter of a system undergoing spontaneous symmetry breaking.Comment: 13 pages, 6 figures. Inserted conon "." in title; minor change in text. To appear in Physical review

Observing the Odderon: Tensor Meson Photoproduction

We calculate high-energy photoproduction of the tensor meson $f_2(1270)$ by odderon and photon exchange in the reaction $\gamma + {\rm{p}} \to f_2(1270) + {\rm{X}}$, where X is either the nucleon or the sum of the N(1520) and N(1535) baryon resonances. Odderon exchange dominates except at very small transverse momentum, and we find a cross section of about 20 nb at a centre-of-mass energy of 20 GeV. This result is compared with what is currently known experimentally about $f_2$ photoproduction. We conclude that odderon exchange is not ruled out by present data. On the contrary, an odderon-induced cross section of the above magnitude may help to explain a puzzling result observed by the E687 experiment.Comment: 19 pages, 11 figure

The Angular Size and Proper Motion of the Afterglow of GRB 030329

The bright, nearby (z=0.1685) gamma-ray burst of 29 March 2003 has presented us with the first opportunity to directly image the expansion of a GRB. This burst reached flux density levels at centimeter wavelengths more than 50 times brighter than any previously studied event. Here we present the results of a VLBI campaign using the VLBA, VLA, Green Bank, Effelsberg, Arecibo, and Westerbork telescopes that resolves the radio afterglow of GRB 030329 and constrains its rate of expansion. The size of the afterglow is found to be \~0.07 mas (0.2 pc) 25 days after the burst, and 0.17 mas (0.5 pc) 83 days after the burst, indicating an average velocity of 3-5 c. This expansion is consistent with expectations of the standard fireball model. We measure the projected proper motion of GRB 030329 in the sky to <0.3 mas in the 80 days following the burst. In observations taken 52 days after the burst we detect an additional compact component at a distance from the main component of 0.28 +/- 0.05 mas (0.80 pc). The presence of this component is not expected from the standard model.Comment: 12 pages including 2 figures, LaTeX. Accepted to ApJ Letters on May 14, 200

Improving the Convergence of an Iterative Algorithm Proposed By Waxman

In the iterative algorithm recently proposed by Waxman for solving eigenvalue problems, we point out that the convergence rate may be improved. For many non-singular symmetric potentials which vanish asymptotically, a simple analytical relationship between the coupling constant of the potential and the ground state eigenvalue is obtained which can be used to make the algorithm more efficient

Optimisation of patch distribution strategies for AMR applications

As core counts increase in the world's most powerful supercomputers, applications are becoming limited not only by computational power, but also by data availability. In the race to exascale, efficient and effective communication policies are key to achieving optimal application performance. Applications using adaptive mesh refinement (AMR) trade off communication for computational load balancing, to enable the focused computation of specific areas of interest. This class of application is particularly susceptible to the communication performance of the underlying architectures, and are inherently difficult to scale efficiently. In this paper we present a study of the effect of patch distribution strategies on the scalability of an AMR code. We demonstrate the significance of patch placement on communication overheads, and by balancing the computation and communication costs of patches, we develop a scheme to optimise performance of a specific, industry-strength, benchmark application

Conceptual design study of a Harrier V/STOL research aircraft

MCAIR recently completed a conceptual design study to define modification approaches to, and derive planning prices for the conversion of a two place Harrier to a V/STOL control, display and guidance research aircraft. Control concepts such as rate damping, attitude stabilization, velocity command, and cockpit controllers are to be demonstrated. Display formats will also be investigated, and landing, navigation and guidance systems flight tested. The rear cockpit is modified such that it can be quickly adapted to faithfully simulate the controls, displays and handling qualities of a Type A or Type B V/STOL. The safety pilot always has take command capability. The modifications studied fall into two categories: basic modifications and optional modifications. Technical descriptions of the basic modifications and of the optional modifications are presented. The modification plan and schedule as well as the test plan and schedule are presented. The failure mode and effects analysis, aircraft performance, aircraft weight, and aircraft support are discussed

On the push&pull protocol for rumour spreading

The asynchronous push&pull protocol, a randomized distributed algorithm for spreading a rumour in a graph $G$, works as follows. Independent Poisson clocks of rate 1 are associated with the vertices of $G$. Initially, one vertex of $G$ knows the rumour. Whenever the clock of a vertex $x$ rings, it calls a random neighbour $y$: if $x$ knows the rumour and $y$ does not, then $x$ tells $y$ the rumour (a push operation), and if $x$ does not know the rumour and $y$ knows it, $y$ tells $x$ the rumour (a pull operation). The average spread time of $G$ is the expected time it takes for all vertices to know the rumour, and the guaranteed spread time of $G$ is the smallest time $t$ such that with probability at least $1-1/n$, after time $t$ all vertices know the rumour. The synchronous variant of this protocol, in which each clock rings precisely at times $1,2,\dots$, has been studied extensively. We prove the following results for any $n$-vertex graph: In either version, the average spread time is at most linear even if only the pull operation is used, and the guaranteed spread time is within a logarithmic factor of the average spread time, so it is $O(n\log n)$. In the asynchronous version, both the average and guaranteed spread times are $\Omega(\log n)$. We give examples of graphs illustrating that these bounds are best possible up to constant factors. We also prove theoretical relationships between the guaranteed spread times in the two versions. Firstly, in all graphs the guaranteed spread time in the asynchronous version is within an $O(\log n)$ factor of that in the synchronous version, and this is tight. Next, we find examples of graphs whose asynchronous spread times are logarithmic, but the synchronous versions are polynomially large. Finally, we show for any graph that the ratio of the synchronous spread time to the asynchronous spread time is $O(n^{2/3})$.Comment: 25 page