MDS codes are erasure-correcting codes that can correct the maximum number of erasures for a given number of redundancy or parity symbols. If an MDS code has r parities and no more than r erasures occur, then by transmitting all the remaining data in the code, the original information can be recovered. However, it was shown that in order to recover a single symbol erasure, only a fraction of 1/...

We determine the radio and optical luminosity evolutions and the true distribution of the radio-loudness parameter R, defined as the ratio of the radio to optical luminosity, for a set of more than 5000 quasars combining Sloan Digital Sky Survey optical and Faint Images of the Radio Sky at Twenty cm (FIRST) radio data. We apply the method of Efron and Petrosian to access the intrinsic distribut...

The recent application of genome-wide, single nucleotide polymorphism (SNP) microarrays to investigate DNA copy number aberrations in cancer has provided unparalleled sensitivity for identifying genomic changes. In some instances the complexity of these changes makes them difficult to interpret, particularly when tumour samples are contaminated with normal (stromal) tissue. Current automated sc...

Call admission control is the problem of deciding for a given set of connection requests which of them to accept and which to reject, with the goal of maximizing the profit obtained from the accepted requests. The problem is considered in a scenario with advance reservations where users can specify several alternatives for when and how they want their connections to be established. Two variants...

The authors show that there is a generalization of Rodrigues’ formula for computing the exponential map exp: so(n)→SO(n) from skewsymmetric matrices to orthogonal matrices when n ≥ 4, and give a method for computing some determination of the (multivalued) function log: SO(n) → so(n). The key idea is the decomposition of a skew-symmetric n×n matrix B in terms of (unique) skew-symmetric matrices ...

Natural images can be viewed as combinations of smooth regions, textures, and geometry. Wavelet-based image coders, such as the space-frequency quantization (SFQ) algorithm, provide reasonably efficient representations for smooth regions (using zerotrees, for example) and textures (using scalar quantization) but do not properly exploit the geometric regularity imposed on wavelet coefficients by...

Call admission control is the problem of deciding for a given set of connection requests which of them to accept and which to reject, with the goal of maximizing the profit obtained from the accepted requests. The problem is considered in a scenario with advance reservations where users can specify several alternatives for when and how they want their connections to be established. Two variants...

We determine the fundamental stellar parameters of altogether 20 double-mode RR Lyrae (RRd) stars from the Galactic Field and the Large Magellanic Cloud, following our approach employed on the field RRd star BS Comae [1]. The stars were selected to cover wide ranges of periods and period ratios, implying diverse stellar parameters. From the possible observed quantities we use only the periods a...

In this paper we present a deterministic protocol for routing arbitrary permutations in arbitrary networks. The protocol is analyzed in terms of the size of the network and the routing number of the network. Given a network H of size n, the routing number of H is defined as the maximum over all permutations on [n] of the minimal number of steps to route offline in H . We can show that for any n...

A typical adaptive arithmetic coder consists of three steps: range calculation, renormalization, and probability model updating. A method, called greedy re-normalization, is given in this paper that significantly reduces the computational complexity of the renormalization step of arithmetic coding. This is achieved by reducing both the number of re-normalizations required to encode a sequence a...