Low-Latency Routing on Mesh-Like Backbones

Early in in the Internet's history, routing within a single provider's WAN centered on placing traffic on the shortest path. More recent traffic engineering efforts aim to reduce congestion and/or increase utilization within the status quo of greedy shortest-path first routing on a sparse topology. In this paper, we argue that this status quo of routing and topology is fundamentally at odds with placing traffic so as to minimize latency for users while avoiding congestion. We advocate instead provider backbone topologies that are more mesh-like, and hence better at providing multiple low-latency paths, and a routing system that directly considers latency minimization and congestion avoidance while dynamically placing traffic on multiple unequal-cost paths. We offer a research agenda for achieving this new low-latency approach to WAN topology design and routing

The solution of a mixed boundary value problem in the theory of diffraction by a semi-infinite plane

A solution is obtained for the problem of the diffraction of a plane wave sound source by a semi-infinite half plane. One surface of the half plane has a soft (pressure release) boundary condition, and the other surface a rigid boundary condition. Two unusual features arise in this boundary value problem. The first is the edge field singularity. It is found to be more singular than that associated with either a completely rigid or a completely soft semi-infinite half plane. The second is that the normal Wiener-Hopf method (which is the standard technique to solve half plane problems) has to be modified to give the solution to the present mixed boundary value problem. The mathematical problem which is solved is an approximate model for a rigid noise barrier, one face of which is treated with an absorbing lining. It is shown that the optimum attenuation in the shadow region is obtained when the absorbing lining is on the side of the screen which makes the smallest angle to the source or the receiver from the edge

Amplituhedron meets Jeffrey-Kirwan Residue

The tree amplituhedra A^(m)_n,k are mathematical objects generalising the notion of polytopes into the Grassmannian. Proposed for m=4 as a geometric construction encoding tree-level scattering amplitudes in planar N=4 super Yang-Mills theory, they are mathematically interesting for any m. In this paper we strengthen the relation between scattering amplitudes and geometry by linking the amplituhedron to the Jeffrey-Kirwan residue, a powerful concept in symplectic and algebraic geometry. We focus on a particular class of amplituhedra in any dimension, namely cyclic polytopes, and their even-dimensional conjugates. We show how the Jeffrey-Kirwan residue prescription allows to extract the correct amplituhedron volume functions in all these cases. Notably, this also naturally exposes the rich combinatorial and geometric structures of amplituhedra, such as their regular triangulations.Peer reviewedFinal Accepted Versio

On Deterministic Sketching and Streaming for Sparse Recovery and Norm Estimation

We study classic streaming and sparse recovery problems using deterministic linear sketches, including l1/l1 and linf/l1 sparse recovery problems (the latter also being known as l1-heavy hitters), norm estimation, and approximate inner product. We focus on devising a fixed matrix A in R^{m x n} and a deterministic recovery/estimation procedure which work for all possible input vectors simultaneously. Our results improve upon existing work, the following being our main contributions: * A proof that linf/l1 sparse recovery and inner product estimation are equivalent, and that incoherent matrices can be used to solve both problems. Our upper bound for the number of measurements is m=O(eps^{-2}*min{log n, (log n / log(1/eps))^2}). We can also obtain fast sketching and recovery algorithms by making use of the Fast Johnson-Lindenstrauss transform. Both our running times and number of measurements improve upon previous work. We can also obtain better error guarantees than previous work in terms of a smaller tail of the input vector. * A new lower bound for the number of linear measurements required to solve l1/l1 sparse recovery. We show Omega(k/eps^2 + klog(n/k)/eps) measurements are required to recover an x' with |x - x'|_1 <= (1+eps)|x_{tail(k)}|_1, where x_{tail(k)} is x projected onto all but its largest k coordinates in magnitude. * A tight bound of m = Theta(eps^{-2}log(eps^2 n)) on the number of measurements required to solve deterministic norm estimation, i.e., to recover |x|_2 +/- eps|x|_1. For all the problems we study, tight bounds are already known for the randomized complexity from previous work, except in the case of l1/l1 sparse recovery, where a nearly tight bound is known. Our work thus aims to study the deterministic complexities of these problems

Dynamic interfacial trapping of flexural waves in structured plates

The paper presents new results on the localization and transmission of flexural waves in a structured plate containing a semi-infinite two-dimensional array of rigid pins. In particular, localized waves are identified and studied at the interface boundary between the homogeneous part of the flexural plate and the part occupied by rigid pins. A formal connection has been made with the dispersion properties of flexural Bloch waves in an infinite doubly periodic array of rigid pins. Special attention is given to regimes corresponding to standing waves of different types as well as Dirac-like points that may occur on the dispersion surfaces. A single half-grating problem, hitherto unreported in the literature, is also shown to bring interesting solutions

Assessing the risk of venous thromboembolic events in women taking progestin-only contraception: a meta-analysis

Objectives: To evaluate the risk of venous thromboembolic events associated with the use of progestin-only contraception and whether that risk differs with the mode of drug delivery (oral, intrauterine, or depot injection). Design: Systematic review and meta-analysis of randomised controlled trials and observational studies. Data sources: Pubmed, Embase, Cochrane Library, and reference lists of relevant reviews. Study selection: Randomised controlled trials and case-control, cohort, and cross sectional studies with venous thromboembolic outcome for progestin-only contraception reported relative to a non-hormone comparator group. Data extraction: Data were extracted by two independent investigators, and consensus for inclusion was reached after assessment by additional investigators. Results: Among the 2022 unique references identified by all searches, eight observational studies fulfilled inclusion criteria. A total of 147 women across all studies were diagnosed with a venous thromboembolic event while taking progestin-only contraception, and the summary measure for the adjusted relative risk of a venous thromboembolic episode for users versus non-users of a progestin-only contraceptive was, based on the random effects model, 1.03 (95% CI 0.76 to 1.39). Subgroup analysis confirmed there was no association between venous thromboembolic risk and progestin-only pills (relative risk 0.90 (0.57 to 1.45)) or a progestin intrauterine device (0.61 (0.24 to 1.53)). The relative risk of a venous thromboembolic event for users of an injectable progestin versus non-users was 2.67 (1.29 to 5.53). Conclusions: Published data assessing the risk of venous thromboembolism in women prescribed progestin-only contraception are limited. In this meta-analysis of eight observational studies, the use of progestin-only contraception was not associated with an increased risk of venous thromboembolism compared with non-users of hormonal contraception. The potential association between injectable progestins and thrombosis requires further study

A Two-loop Test of Buscher's T-duality I

We study the two loop quantum equivalence of sigma models related by Buscher's T-duality transformation. The computation of the two loop perturbative free energy density is performed in the case of a certain deformation of the SU(2) principal sigma model, and its T-dual, using dimensional regularization and the geometric sigma model perturbation theory. We obtain agreement between the free energy density expressions of the two models.Comment: 28 pp, Latex, references adde

Fluctuations in the Site Disordered Traveling Salesman Problem

We extend a previous statistical mechanical treatment of the traveling salesman problem by defining a discrete "site disordered'' problem in which fluctuations about saddle points can be computed. The results clarify the basis of our original treatment, and illuminate but do not resolve the difficulties of taking the zero temperature limit to obtain minimal path lengths.Comment: 17 pages, 3 eps figures, revte

Scaling Limits for Internal Aggregation Models with Multiple Sources

We study the scaling limits of three different aggregation models on Z^d: internal DLA, in which particles perform random walks until reaching an unoccupied site; the rotor-router model, in which particles perform deterministic analogues of random walks; and the divisible sandpile, in which each site distributes its excess mass equally among its neighbors. As the lattice spacing tends to zero, all three models are found to have the same scaling limit, which we describe as the solution to a certain PDE free boundary problem in R^d. In particular, internal DLA has a deterministic scaling limit. We find that the scaling limits are quadrature domains, which have arisen independently in many fields such as potential theory and fluid dynamics. Our results apply both to the case of multiple point sources and to the Diaconis-Fulton smash sum of domains.Comment: 74 pages, 4 figures, to appear in J. d'Analyse Math. Main changes in v2: added "least action principle" (Lemma 3.2); small corrections in section 4, and corrected the proof of Lemma 5.3 (Lemma 5.4 in the new version); expanded section 6.

Finding and counting vertex-colored subtrees

The problems studied in this article originate from the Graph Motif problem introduced by Lacroix et al. in the context of biological networks. The problem is to decide if a vertex-colored graph has a connected subgraph whose colors equal a given multiset of colors $M$. It is a graph pattern-matching problem variant, where the structure of the occurrence of the pattern is not of interest but the only requirement is the connectedness. Using an algebraic framework recently introduced by Koutis et al., we obtain new FPT algorithms for Graph Motif and variants, with improved running times. We also obtain results on the counting versions of this problem, proving that the counting problem is FPT if M is a set, but becomes W[1]-hard if M is a multiset with two colors. Finally, we present an experimental evaluation of this approach on real datasets, showing that its performance compares favorably with existing software.Comment: Conference version in International Symposium on Mathematical Foundations of Computer Science (MFCS), Brno : Czech Republic (2010) Journal Version in Algorithmic