Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks

Recently, it has been shown that CSMA-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can never occur. In addition, simulation results indicate that the delay performance of these algorithms can be quite bad. On the other hand, although some simple heuristics (such as distributed approximations of greedy maximal scheduling) can yield much better delay performance for a large set of arrival rates, they may only achieve a fraction of the capacity region in general. In this paper, we propose a discrete-time version of the CSMA algorithm. Central to our results is a discrete-time distributed randomized algorithm which is based on a generalization of the so-called Glauber dynamics from statistical physics, where multiple links are allowed to update their states in a single time slot. The algorithm generates collision-free transmission schedules while explicitly taking collisions into account during the control phase of the protocol, thus relaxing the perfect CSMA assumption. More importantly, the algorithm allows us to incorporate mechanisms which lead to very good delay performance while retaining the throughput-optimality property. It also resolves the hidden and exposed terminal problems associated with wireless networks.Comment: 12 page

Second language user support

Computer users rarely experience entirely trouble-free interaction. The natural variety ofindividuals ensures that no software systems yield constantly fluent interaction for allusers. In consequence, software designers often strive to ameliorate this situation bybuilding 'user support' into their systems. User support can take different forms but,conventionally, each aims to assist the needy end-user by means of facilities directly supporting the performance of certain operations, or through supply of information thatadvises the user on available system functionality.The present paper briefly characterises a range of user support facilities before describingone requirement in greater detail. This aspect considers the needs of users whose mother-tongue is not English, but who are obliged to use English-based information systems. Inthis context, 'helping the user' must reasonably extend beyond mere advice on systemoperation to selective elucidation of information content. We regard this move as alogical extension of the user support concept, by seeking to address specific interactionneeds in a target user population. An example of this approach is described through aninformation system, in the domain of civil engineering, for native Chinese speakers ofEnglish

Spatial data stream multiplexing scheme for high-throughput WLANs

A novel scheme using spatial data stream multiplexing (SDSM) in the upcoming multiple-input multipleoutput (MIMO)-based IEEE 802.11n physical layer is proposed. It is shown that with SDSM, the same data rate can be achieved by using less number of transmit and receive antennas and therefore this scheme can reduce the number of antennas which results in reducing mutual coupling effects, hardware costs and implementation complexities. The maximum data rates that can be achieved using a 2 * 2 MIMO system is 270 Mbps and for a 4 * 4 MIMO system is 540 Mbps. The same data rates can be achieved using the SDSM technique which reduces the 2 * 2 MIMO system to 1 * 1 SISO system and the 4 * 4 MIMO system to a 2 * 2 MIMO system

Scattering by a contact potential in three and lower dimensions

We consider the scattering of nonrelativistic particles in three dimensions by a contact potential $\Omega\hbar^2\delta(r)/ 2\mu r^\alpha$ which is defined as the $a\to 0$ limit of $\Omega\hbar^2\delta(r-a)/2\mu r^\alpha$. It is surprising that it gives a nonvanishing cross section when $\alpha=1$ and $\Omega=-1$. When the contact potential is approached by a spherical square well potential instead of the above spherical shell one, one obtains basically the same result except that the parameter $\Omega$ that gives a nonvanishing cross section is different. Similar problems in two and one dimensions are studied and results of the same nature are obtained.Comment: REVTeX, 9 pages, no figur

Learning Loosely Connected Markov Random Fields

We consider the structure learning problem for graphical models that we call loosely connected Markov random fields, in which the number of short paths between any pair of nodes is small, and present a new conditional independence test based algorithm for learning the underlying graph structure. The novel maximization step in our algorithm ensures that the true edges are detected correctly even when there are short cycles in the graph. The number of samples required by our algorithm is C*log p, where p is the size of the graph and the constant C depends on the parameters of the model. We show that several previously studied models are examples of loosely connected Markov random fields, and our algorithm achieves the same or lower computational complexity than the previously designed algorithms for individual cases. We also get new results for more general graphical models, in particular, our algorithm learns general Ising models on the Erdos-Renyi random graph G(p, c/p) correctly with running time O(np^5).Comment: 45 pages, minor revisio

Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling

Glauber dynamics is a powerful tool to generate randomized, approximate solutions to combinatorially difficult problems. It has been used to analyze and design distributed CSMA (Carrier Sense Multiple Access) scheduling algorithms for multi-hop wireless networks. In this paper we derive bounds on the mixing time of a generalization of Glauber dynamics where multiple links are allowed to update their states in parallel and the fugacity of each link can be different. The results can be used to prove that the average queue length (and hence, the delay) under the parallel Glauber dynamics based CSMA grows polynomially in the number of links for wireless networks with bounded-degree interference graphs when the arrival rate lies in a fraction of the capacity region. We also show that in specific network topologies, the low-delay capacity region can be further improved.Comment: 12 page

Building a 3.5 m prototype interferometer for the Q & A vacuum birefringence experiment and high precision ellipsometry

We have built and tested a 3.5 m high-finesse Fabry-Perot prototype inteferometer with a precision ellipsometer for the QED test and axion search (Q & A) experiment. We use X-pendulum-double-pendulum suspension designs and automatic control schemes developed by the gravitational-wave detection community. Verdet constant and Cotton-Mouton constant of the air are measured as a test. Double modulation with polarization modulation 100 Hz and magnetic-field modulation 0.05 Hz gives 10^{-7} rad phase noise for a 44-minute integration.Comment: This draft has been presented in the 5th Edoardo Amaldi Conference on Gravitational Wave

Elevated soil lead: Statistical modeling and apportionment of contributions from lead-based paint and leaded gasoline

While it is widely accepted that lead-based paint and leaded gasoline are primary sources of elevated concentrations of lead in residential soils, conclusions regarding their relative contributions are mixed and generally study specific. We develop a novel nonlinear regression for soil lead concentrations over time. It is argued that this methodology provides useful insights into the partitioning of the average soil lead concentration by source and time over large residential areas. The methodology is used to investigate soil lead concentrations from the 1987 Minnesota Lead Study and the 1990 National Lead Survey. Potential litigation issues are discussed briefly.Comment: Published at http://dx.doi.org/10.1214/07-AOAS112 in the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org

Preparation of Neutron-activated Xenon for Liquid Xenon Detector Calibration

We report the preparation of neutron-activated xenon for the calibration of liquid xenon (LXe) detectors. Gamma rays from the decay of xenon metastable states, produced by fast neutron activation, were detected and their activities measured in a LXe scintillation detector. Following a five-day activation of natural xenon gas with a Cf-252 (4 x 10^5 n/s) source, the activities of two gamma ray lines at 164 keV and 236 keV, from Xe-131m and Xe-129m metastable states, were measured at about 95 and 130 Bq/kg, respectively. We also observed three additional lines at 35 keV, 100 keV and 275 keV, which decay away within a few days. No long-lifetime activity was observed after the neutron activation.Comment: to be published in NIM A, corrected typos in Table 1 and Fig.6 of the previous versio