Real fluid properties of normal and parahydrogen

Computer program calculates the real fluid properties of normal or parahydrogen using a library of single function calls without initial estimates. Accurate transport and thermodynamic properties of molecular hydrogen are needed for advanced propulsion systems

A Palladium-Catalyzed Vinylcyclopropane (3 + 2) Cycloaddition Approach to the Melodinus Alkaloids

A palladium-catalyzed (3 + 2) cycloaddition of a vinylcyclopropane and a β-nitrostyrene is employed to rapidly assemble the cyclopentane core of the Melodinus alkaloids. The ABCD ring system of the natural product family is prepared in six steps from commercially available materials

On the Existence of Radiation Gauges in Petrov type II spacetimes

The radiation gauges used by Chrzanowski (his IRG/ORG) for metric reconstruction in the Kerr spacetime seem to be over-specified. Their specification consists of five conditions: four, which we treat here as valid gauge conditions, plus an additional condition on the trace of the metric perturbation. In this work, we utilize a newly developed form of the perturbed Einstein equations to establish a condition -- on a particular tetrad component of the stress-energy tensor -- under which the full IRG/ORG can be imposed. Using gauge freedom, we are able to impose the full IRG for Petrov type II and type D backgrounds, using a different tetrad for each case. As a specific example, we work through the process of imposing the IRG in a Schwarzschild background, using a more traditional approach. Implications for metric reconstruction using the Teukolsky curvature perturbations in type D spacetimes are briefly discussed.Comment: 21 pages, uses iop style files. v2: proved a stronger result for type II backgrounds, added a subsection on remaining gauge freedom in the full IRG and improved calrity and readability throughout due to insightful referee comments; published as Class. Quantum Grav. 24 (2007) 2367-238

CMB Lensing Reconstruction on the Full Sky

Gravitational lensing of the microwave background by the intervening dark matter mainly arises from large-angle fluctuations in the projected gravitational potential and hence offers a unique opportunity to study the physics of the dark sector at large scales. Studies with surveys that cover greater than a percent of the sky will require techniques that incorporate the curvature of the sky. We lay the groundwork for these studies by deriving the full sky minimum variance quadratic estimators of the lensing potential from the CMB temperature and polarization fields. We also present a general technique for constructing these estimators, with harmonic space convolutions replaced by real space products, that is appropriate for both the full sky limit and the flat sky approximation. This also extends previous treatments to include estimators involving the temperature-polarization cross-correlation and should be useful for next generation experiments in which most of the additional information from polarization comes from this channel due to sensitivity limitations.Comment: Accepted for publication in Phys. Rev. D; typos correcte

Nonlinear feedback oscillations in resonant tunneling through double barriers

We analyze the dynamical evolution of the resonant tunneling of an ensemble of electrons through a double barrier in the presence of the self-consistent potential created by the charge accumulation in the well. The intrinsic nonlinearity of the transmission process is shown to lead to oscillations of the stored charge and of the transmitted and reflected fluxes. The dependence on the electrostatic feedback induced by the self-consistent potential and on the energy width of the incident distribution is discussed.Comment: 10 pages, TeX, 5 Postscript figure

Spatial Mixing of Coloring Random Graphs

We study the strong spatial mixing (decay of correlation) property of proper $q$-colorings of random graph $G(n, d/n)$ with a fixed $d$. The strong spatial mixing of coloring and related models have been extensively studied on graphs with bounded maximum degree. However, for typical classes of graphs with bounded average degree, such as $G(n, d/n)$, an easy counterexample shows that colorings do not exhibit strong spatial mixing with high probability. Nevertheless, we show that for $q\ge\alpha d+\beta$ with $\alpha>2$ and sufficiently large $\beta=O(1)$, with high probability proper $q$-colorings of random graph $G(n, d/n)$ exhibit strong spatial mixing with respect to an arbitrarily fixed vertex. This is the first strong spatial mixing result for colorings of graphs with unbounded maximum degree. Our analysis of strong spatial mixing establishes a block-wise correlation decay instead of the standard point-wise decay, which may be of interest by itself, especially for graphs with unbounded degree

On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms

We give a lower bound on the iteration complexity of a natural class of Lagrangean-relaxation algorithms for approximately solving packing/covering linear programs. We show that, given an input with $m$ random 0/1-constraints on $n$ variables, with high probability, any such algorithm requires $\Omega(\rho \log(m)/\epsilon^2)$ iterations to compute a $(1+\epsilon)$-approximate solution, where $\rho$ is the width of the input. The bound is tight for a range of the parameters $(m,n,\rho,\epsilon)$. The algorithms in the class include Dantzig-Wolfe decomposition, Benders' decomposition, Lagrangean relaxation as developed by Held and Karp [1971] for lower-bounding TSP, and many others (e.g. by Plotkin, Shmoys, and Tardos [1988] and Grigoriadis and Khachiyan [1996]). To prove the bound, we use a discrepancy argument to show an analogous lower bound on the support size of $(1+\epsilon)$-approximate mixed strategies for random two-player zero-sum 0/1-matrix games

Shortest Path Computation with No Information Leakage

Shortest path computation is one of the most common queries in location-based services (LBSs). Although particularly useful, such queries raise serious privacy concerns. Exposing to a (potentially untrusted) LBS the client's position and her destination may reveal personal information, such as social habits, health condition, shopping preferences, lifestyle choices, etc. The only existing method for privacy-preserving shortest path computation follows the obfuscation paradigm; it prevents the LBS from inferring the source and destination of the query with a probability higher than a threshold. This implies, however, that the LBS still deduces some information (albeit not exact) about the client's location and her destination. In this paper we aim at strong privacy, where the adversary learns nothing about the shortest path query. We achieve this via established private information retrieval techniques, which we treat as black-box building blocks. Experiments on real, large-scale road networks assess the practicality of our schemes.Comment: VLDB201