Adversarial Analyses of Window Backoff Strategies for Simple Multiple-Access Channels

Backoff strategies have typically been analyzed by making statistical assumptions on the distribution of problem inputs. Although these analyses have provided valuable insights into the efficacy of various backoff strategies, they leave open the question as to which backoff algorithms perform best in the worst case or on inputs, such as bursty inputs, that are not covered by the statistical models. This paper analyzes randomized backoff strategies using worst-case assumptions on the inputs. Specifically, we analyze algorithms for simple multiple-access channels, where the only feedback from each attempt to send a packet is a single bit indicating whether the transmission succeeded or the packet collided with another packet. We analyze a class of strategies, called window strategies, where each packet partitions time into a sequence (W₁, W₂,...) of windows. Within each window, the packet makes an access attempt during a single randomly selected slot. If its transmission is unsuccessful, it waits for its slot in the next window before retrying. We use delay-sequence arguments to show that for the batch problem, in which n packets all arrive at time 0, if every window has size W = Θ(n), then with high probability, all packets successfully transmit with makespan n lg lg n ± O(n). We use this result to analyze window backoff strategies with varying window sizes. Specifically, we show that the familiar binary exponential backoff algorithm, where Wk = Θ(2k), has makespan Θ(n lg n), and that more generally, for any constant r > 1, the r-exponential backoff algorithm in which Wk = Θ(rk) has makespan Θ(n lglg rn). We also show that for any constant r > 1, the r-polynomial backoff algorithm, in which Wk = Θ(kr), has makespan Θ((n/lg n)¹⁺¹/r). All of these batch strategies are monotonic, in the sense that the window size monotonically increases over time. We exhibit a monotonic backoff algorithm that achieves makespan Θ(n lg lg n/lg lg lg n). We prove that this algorithm, whose backoff is superpolynomial and subexponential, is optimal over all monotonic backoff schemes. In addition, we exhibit a simple backoff/backon algorithm, having window sizes that vary nonmonotonically according to a "sawtooth" pattern, that achieves the optimal makespan of Θ(n). We study the online setting using an adversarial queueing model. We define a (λ,T)-stream to be an input stream of packets in which at most n = λT packets arrive during any time interval of size T. In this model, to evaluate a given backoff algorithm (which does not know λ or T), we analyze the worst-case behavior of the algorithm over the class of (λ,T)-streams. Our results for the online setting focus on exponential backoff. We show that for any arrival rate λ, there exists a sufficiently large interval size T such that the throughput goes to 0 for some (λ,T)-stream. Moreover, there exists a sufficiently large constant c such that for any interval size T, if λ ⥠c lg lg n/lg n, the system is unstable in the sense that the arrival rate exceeds the throughput in the worst case. If, on the other hand, we have λ ⤠c/lg n for a sufficiently small constant c, then the system is stable. Surprisingly, the algorithms that guarantee smaller makespans in the batch setting require lower arrival rates to achieve stability than does exponential backoff, but when they are stable, they have better response times.Singapore-MIT Alliance (SMA

Inverting the Sachs-Wolfe Formula: an Inverse Problem Arising in Early-Universe Cosmology

The (ordinary) Sachs-Wolfe effect relates primordial matter perturbations to the temperature variations $\delta T/T$ in the cosmic microwave background radiation; $\delta T/T$ can be observed in all directions around us. A standard but idealised model of this effect leads to an infinite set of moment-like equations: the integral of $P(k) j_\ell^2(ky)$ with respect to k ($0<k<\infty$) is equal to a given constant, $C_\ell$, for $\ell=0,1,2,...$. Here, P is the power spectrum of the primordial density variations, $j_\ell$ is a spherical Bessel function and y is a positive constant. It is shown how to solve these equations exactly for ~$P(k)$. The same solution can be recovered, in principle, if the first ~m equations are discarded. Comparisons with classical moment problems (where $j_\ell^2(ky)$ is replaced by $k^\ell$) are made.Comment: In Press Inverse Problems 1999, 15 pages, 0 figures, Late

The Effect of Inoculants on Nutrient Losses of Corn Silage and High-moisture Corn Stored in Mini Silos

Two experiments were conducted to determine the effects of inoculants (BONSILAGE CORN 200G and BONSILAGE HMC 200G) containing Lactobacillus buchneri, Lactobacillus plantarum and Pediococcus acidilactici on nutrient losses and aerobic stability of corn silage and high moisture corn. Corn silage and high moisture corn were inoculated and stored in mini silos with nutrient loss and spoilage characterizations at 30, 90, and 120 days with multiple inoculation levels. Longer ensiling times led to greater total acid production. The higher levels of inoculation led to lower total acid production and higher pH. Inoculating corn silage and high moisture corn also affected the fermentation process by decreasing lactic acid production and increasing acetic acid production. The increase in acetic acid production may be partially responsible for the increased aerobic stability observed for the inoculated feeds. Previous research would support our finding of greater stability and lower DM losses with L. buchneri inoculants

Spectral properties of the Dirichlet-to-Neumann operator for exterior Helmholtz problem and its applications to scattering theory

We prove that the Dirichlet-to-Neumann operator (DtN) has no spectrum in the lower half of the complex plane. We find several application of this fact in scattering by obstacles with impedance boundary conditions. In particular, we find an upper bound for the gradient of the scattering amplitude and for the total cross section. We justify numerical approximations by providing bounds on difference between theoretical and approximated solutions without using any a priory unknown constants

Inductive learning spatial attention

This paper investigates the automatic induction of spatial attention from the visual observation of objects manipulated on a table top. In this work, space is represented in terms of a novel observer-object relative reference system, named Local Cardinal System, defined upon the local neighbourhood of objects on the table. We present results of applying the proposed methodology on five distinct scenarios involving the construction of spatial patterns of coloured blocks

The "Artificial Mathematician" Objection: Exploring the (Im)possibility of Automating Mathematical Understanding

Reuben Hersh confided to us that, about forty years ago, the late Paul Cohen predicted to him that at some unspecified point in the future, mathematicians would be replaced by computers. Rather than focus on computers replacing mathematicians, however, our aim is to consider the (im)possibility of human mathematicians being joined by “artificial mathematicians” in the proving practice—not just as a method of inquiry but as a fellow inquirer

Millisecond-range electron spin memory in singly-charged InP quantum dots

We report millisecond-range spin memory of resident electrons in an ensemble of InP quantum dots (QDs) under a small magnetic field of 0.1 T applied along the optical excitation axis at temperatures up to about 5 K. A pump-probe photoluminescence (PL) technique is used for optical orientation of electron spins by the pump pulses and for study of spin relaxation over the long time scale by measuring the degree of circular polarization of the probe PL as a function of pump-probe delay. Dependence of spin decay rate on magnetic field and temperature suggests two-phonon processes as the dominant spin relaxation mechanism in this QDs at low temperatures.Comment: 3 pages, 4 figures, submitted to Appl. Phys. Let

Meson-Meson Scattering in the Quark Model: Spin Dependence and Exotic Channels

We apply a quark interchange model to spin-dependent and exotic meson-meson scattering. The model includes the complete set of standard quark model forces, including OGE spin-orbit and tensor and scalar confinement spin-orbit. Scattering amplitudes derived assuming SHO and Coulomb plus linear plus hyperfine meson wavefunctions are compared. In I=2 pi pi we find approximate agreement with the S-wave phase shift from threshold to 1.5 GeV, where we predict an extremum that is supported by the data. Near threshold we find rapid energy dependence that may reconcile theoretical estimates of small scattering lengths with experimental indications of larger ones based on extrapolation of measurements at moderate kpi^2. In PsV scattering we find that the quark-quark L*S and T forces map into L*S and T meson-meson interactions, and the P-wave L*S force is large. Finally we consider scattering in J^PC-exotic channels, and note that some of the Deck effect mechanisms suggested as possible nonresonant origins of the pi_1(1400) signal are not viable in this model.Comment: 51 pages, 10 figures, uses epsf.sty epsfig.st