Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set

This paper presents a near-optimal distributed approximation algorithm for the minimum-weight connected dominating set (MCDS) problem. The presented algorithm finds an $O(\log n)$ approximation in $\tilde{O}(D+\sqrt{n})$ rounds, where $D$ is the network diameter and $n$ is the number of nodes. MCDS is a classical NP-hard problem and the achieved approximation factor $O(\log n)$ is known to be optimal up to a constant factor, unless P=NP. Furthermore, the $\tilde{O}(D+\sqrt{n})$ round complexity is known to be optimal modulo logarithmic factors (for any approximation), following [Das Sarma et al.---STOC'11].Comment: An extended abstract version of this result appears in the proceedings of 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014

Measurement and Modeling of Infrared Nonlinear Absorption Coefficients and Laser-induced Damage Thresholds in Ge and GaSb

Using a simultaneous fitting technique to extract nonlinear absorption coefficients from data at two pulse widths, we measure two-photon and free-carrier absorption coefficients for Ge and GaSb at 2.05 and 2.5 μm for the first time, to our knowledge. Results agreed well with published theory. Single-shot damage thresholds were also measured at 2.5 μm and agreed well with modeled thresholds using experimentally determined parameters including nonlinear absorption coefficients and temperature dependent linear absorption. The damage threshold for a single-layer Al2O3 anti-reflective coating on Ge was 55% or 35% lower than the uncoated threshold for picosecond or nanosecond pulses, respectively

Information trade-offs for optical quantum communication

Recent work has precisely characterized the achievable trade-offs between three key information processing tasks---classical communication (generation or consumption), quantum communication (generation or consumption), and shared entanglement (distribution or consumption), measured in bits, qubits, and ebits per channel use, respectively. Slices and corner points of this three-dimensional region reduce to well-known protocols for quantum channels. A trade-off coding technique can attain any point in the region and can outperform time-sharing between the best-known protocols for accomplishing each information processing task by itself. Previously, the benefits of trade-off coding that had been found were too small to be of practical value (viz., for the dephasing and the universal cloning machine channels). In this letter, we demonstrate that the associated performance gains are in fact remarkably high for several physically relevant bosonic channels that model free-space / fiber-optic links, thermal-noise channels, and amplifiers. We show that significant performance gains from trade-off coding also apply when trading photon-number resources between transmitting public and private classical information simultaneously over secret-key-assisted bosonic channels.Comment: 6 pages, 2 figures, see related, longer article at arXiv:1105.011

Classical capacity of the lossy bosonic channel: the exact solution

The classical capacity of the lossy bosonic channel is calculated exactly. It is shown that its Holevo information is not superadditive, and that a coherent-state encoding achieves capacity. The capacity of far-field, free-space optical communications is given as an example.Comment: 4 pages, 2 figures (revised version

Temperature dependent photoluminescence of organic semiconductors with varying backbone conformation

We present photoluminescence studies as a function of temperature from a series of conjugated polymers and a conjugated molecule with distinctly different backbone conformations. The organic materials investigated here are: planar methylated ladder type poly para-phenylene, semi-planar polyfluorene, and non-planar para hexaphenyl. In the longer-chain polymers the photoluminescence transition energies blue shift with increasing temperatures. The conjugated molecules, on the other hand, red shift their transition energies with increasing temperatures. Empirical models that explain the temperature dependence of the band gap energies in inorganic semiconductors can be extended to explain the temperature dependence of the transition energies in conjugated molecules.Comment: 8 pages, 9 figure

The CWKB particle production and classical condensate in de Sitter spacetime

The complex time WKB approximation is an effective tool in studying particle production in curved spacetime. We use it in this work to understand the formation of classical condensate in expanding de Sitter spacetime. The CWKB leads to the emergence of thermal spectrum that depends crucially on horizons (as in de Sitter spacetime) or observer dependent horizons (as in Rindler spacetime). A connection is sought between the horizon and the formation of classical condensate. We concentrate on de Sitter spacetime and study the cosmological perturbation of $k=0$ mode with various values of $m/H_0$. We find that for a minimally coupled free scalar field for $m^2/H_0^2<2$, the one-mode occupation number grows more than unity soon after the physical wavelength of the mode crosses the Hubble radius and soon after diverges as $N(t)\sim O(1)[\lambda_{phys}(t)/{H_0^{-1}}]^{2\sqrt{\nu^2-1/4}}$, where $\nu\equiv (9/4 -m^2/{H_0^2})^{1/2}$. The results substantiates the previous works in this direction. We also find the correct oscillation and behaviour of $N(z)$ at small $z$ from a single expression using CWKB approximation for various values of $m/H_0$. We also discuss decoherence in relation to the formation of classical condensate. We also find that the squeezed state formalism and CWKB method give identical results.Comment: 19 pages, revtex, 5 figure

Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams

Estimating frequency moments and $L_p$ distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been growing interest in revisiting these problems in the framework of random-order streams. The best space lower bound known for computing the $k^{th}$ frequency moment in random-order streams is $\Omega(n^{1-2.5/k})$ by Andoni et al., and it is conjectured that the real lower bound shall be $\Omega(n^{1-2/k})$. In this paper, we resolve this conjecture. In our approach, we revisit the direct sum theorem developed by Bar-Yossef et al. in a random-partition private messages model and provide a tight $\Omega(n^{1-2/k}/\ell)$ space lower bound for any $\ell$-pass algorithm that approximates the frequency moment in random-order stream model to a constant factor. Finally, we also introduce the notion of space-entropy tradeoffs in random order streams, as a means of studying intermediate models between adversarial and fully random order streams. We show an almost tight space-entropy tradeoff for $L_\infty$ distance and a non-trivial tradeoff for $L_p$ distances

An approach to description logic with support for propositional attitudes and belief fusion

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-89765-1_8Revised Selected and Invited Papers of ISWC International Workshops, URSW 2005-2007.In the (Semantic) Web, the existence or producibility of certain, consensually agreed or authoritative knowledge cannot be assumed, and criteria to judge the trustability and reputation of knowledge sources may not be given. These issues give rise to formalizations of web information which factor in heterogeneous and possibly inconsistent assertions and intentions, and make such heterogeneity explicit and manageable for reasoning mechanisms. Such approaches can provide valuable metaknowledge in contemporary application fields, like open or distributed ontologies, social software, ranking and recommender systems, and domains with a high amount of controversies, such as politics and culture. As an approach to this, we introduce a lean formalism for the Semantic Web which allows for the explicit representation of controversial individual and group opinions and goals by means of so-called social contexts, and optionally for the probabilistic belief merging of uncertain or conflicting statements. Doing so, our approach generalizes concepts such as provenance annotation and voting in the context of ontologies and other kinds of Semantic Web knowledgeThis work was partially funded by the German National Research Foundation DFG (Br609/13-1, research project “Open Ontologies and Open Knowledge Bases”) and by the Spanish National Plan of R+D, project no. TSI2005-08225-C07-0

Joint source-channel coding for a quantum multiple access channel

Suppose that two senders each obtain one share of the output of a classical, bivariate, correlated information source. They would like to transmit the correlated source to a receiver using a quantum multiple access channel. In prior work, Cover, El Gamal, and Salehi provided a combined source-channel coding strategy for a classical multiple access channel which outperforms the simpler "separation" strategy where separate codebooks are used for the source coding and the channel coding tasks. In the present paper, we prove that a coding strategy similar to the Cover-El Gamal-Salehi strategy and a corresponding quantum simultaneous decoder allow for the reliable transmission of a source over a quantum multiple access channel, as long as a set of information inequalities involving the Holevo quantity hold.Comment: 21 pages, v2: minor changes, accepted into Journal of Physics