The rotational broadening of V395 Carinae. Implications on the compact object's mass

Context: The masses previously obtained for the X-ray binary 2S 0921-630 inferred a compact object that was either a high-mass neutron star or low-mass black-hole, but used a previously published value for the rotational broadening (v sin i) with large uncertainties. Aims: We aim to determine an accurate mass for the compact object through an improved measurement of the secondary star's projected equatorial rotational velocity. Methods: We have used UVES echelle spectroscopy to determine the v sin i of the secondary star (V395 Car) in the low-mass X-ray binary 2S 0921-630 by comparison to an artificially broadened spectral-type template star. In addition, we have also measured v sin i from a single high signal-to-noise ratio absorption line profile calculated using the method of Least-Squares Deconvolution (LSD). Results: We determine v sin i to lie between 31.3±0.5 km s-1 to 34.7±0.5 km s-1 (assuming zero and continuum limb darkening, respectively) in disagreement with previous results based on intermediate resolution spectroscopy obtained with the 3.6 m NTT. Using our revised v sin i value in combination with the secondary star's radial velocity gives a binary mass ratio of 0.281±0.034. Furthermore, assuming a binary inclination angle of 75° gives a compact object mass of 1.37±0.13 M_?. Conclusions: We find that using relatively low-resolution spectroscopy can result in systemic uncertainties in the measured v sin i values obtained using standard methods. We suggest the use of LSD as a secondary, reliable check of the results as LSD allows one to directly discern the shape of the absorption line profile. In the light of the new v sin i measurement, we have revised down the compact object's mass, such that it is now compatible with a canonical neutron star mass.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. The "obvious" lower bounds of O(m) messages (m is the number of edges in the network) and O(D) time (D is the network diameter) are non-trivial to show for randomized (Monte Carlo) algorithms. (Recent results that show that even O(n) (n is the number of nodes in the network) is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms (except for the limited case of comparison algorithms, where it was also required that some nodes may not wake up spontaneously, and that D and n were not known).

We establish these fundamental lower bounds in this paper for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (such algorithms should work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make anyuse of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time algorithm is known. A slight adaptation of our lower bound technique gives rise to an O(m) message lower bound for randomized broadcast algorithms.

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. (The answer is known to be negative in the deterministic setting). We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that trade-off messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This article focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. In particular, the seemingly obvious lower bounds of Ω(m) messages, where m is the number of edges in the network, and Ω(D) time, where D is the network diameter, are nontrivial to show for randomized (Monte Carlo) algorithms. (Recent results, showing that even Ω(n), where n is the number of nodes in the network, is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms, except for the restricted case of comparison algorithms, where it was also required that nodes may not wake up spontaneously and that D and n were not known. We establish these fundamental lower bounds in this article for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (namely, algorithms that work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make any use of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time leader election algorithm is known. A slight adaptation of our lower bound technique gives rise to an Ω(m) message lower bound for randomized broadcast algorithms. 

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. The answer is known to be negative in the deterministic setting. We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that tradeoff messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

Imaging quantum vibrations on an ultrashort timescale: the deuterium molecular ion

The vibrational wavepacket revival of a basic quantum system is demonstrated experimentally. Using few-cycle laser pulse technology, pump and probe imaging of the vibrational motion of D+2 molecules is conducted, and together with a quantum-mechanical simulation of the excited wavepacket motion, the vibrational revival phenomenon has been characterised. The simulation shows good correlation with the temporal motion and structural features obtained from the data, relaying fundamental information on this diatomic system.

Effect of quantization of vibrations on the structural properties of crystals

We study the structural effects produced by the quantization of vibrational degrees of freedom in periodic crystals at zero temperature. To this end we introduce a methodology based on mapping a suitable subspace of the vibrational manifold and solving the Schrödinger equation in it. A number of increasingly accurate approximations ranging from the quasiharmonic approximation (QHA) to the vibrational self-consistent field (VSCF) method and the exact solution are described. A thorough analysis of the approximations is presented for model monatomic and hydrogen-bonded chains, and results are presented for a linear H-F chain where the potential-energy surface is obtained via first-principles electronic structure calculations. We focus on quantum nuclear effects on the lattice constant and show that the VSCF is an excellent approximation, meaning that correlation between modes is not extremely important. The QHA is excellent for covalently bonded mildly anharmonic systems, but it fails for hydrogen-bonded ones. In the latter, the zero-point energy exhibits a nonanalytic behavior at the lattice constant where the H atoms center, which leads to a spurious secondary minimum in the quantum-corrected energy curve. An inexpensive anharmonic approximation of noninteracting modes appears to produce rather good results for hydrogen-bonded chains for small system sizes. However, it converges to the incorrect QHA results for increasing size. Isotope effects are studied for the first-principles H-F chain. We show how the lattice constant and the H-F distance increase with decreasing mass and how the QHA proves to be insufficient to reproduce this behavior.

On the Uncoded BER Performance Bound of the IEEE 802.16d Channel

In this letter, the performance bound of the IEEE 802.16d channel is examined analytically in order to gain an insight into its theoretical potential. Different design strategies, such as orthogonal frequency division multiplexing (OFDM) and single-carrier frequency-domain equalization (SC-FDE), time-domain decision feedback equalization (DFE), and sphere decoder (SD) techniques are discussed and compared to the theoretical bound.