This paper presents a new asymptotically exact lower bound on pairwise error probability of a space-time code as well as an example code that outperforms the comparable orthogonal-design-based space-time (ODST) code. Also contained in the paper are some observations relating to exact pairwise error probability, signal design guidelines and simplicity of the ODST code receiver. Keywords— Space-t...

Precise timing coordinates cell proliferation with embryonic morphogenesis. As Drosophila melanogaster embryos approach cell cycle 14 and the midblastula transition, rapid embryonic cell cycles slow because S phase lengthens, which delays mitosis via the S-phase checkpoint. We probed the contributions of each of the three mitotic cyclins to this timing of interphase duration. Each pairwise RNA ...

We consider a system ofN individuals consisting of S species that interact pairwise: xm + xl → 2xm with arbitrary probabilities plm. With no spatial structure, the master equation yields a simple set of rate equations in a mean field approximation, the focus of this note. Generalizing recent findings of cyclically competing threeand four-species models, we cast these equations in an appealingly...

We present a closed form upper bound for the average pairwise error probabilities (PEP) of space-time codes for a keyhole channel. It is derived from the exact conditional PEP for given fading channel coefficients, using a moment generating function-based approach. We include simulation results for varying numbers of antennas which affirm that the proposed PEP serves as a tight bound for codes ...

We present a deterministic linear time algorithm to find a set of five points that stab a set of n pairwise intersecting disks in the plane. We also give a simple construction with 13 pairwise intersecting disks that cannot be stabbed by three points.

We consider n observations from the GARCH-type model: S = σ2Z, where σ2 and Z are independent random variables. We develop a new wavelet linear estimator of the unknown density of σ2 under four different dependence structures: the strong mixing case, the β- mixing case, the pairwise positive quadrant case and the ρ-mixing case. Its asymptotic mean integrated squared error properties are ...

let g be a group. a subset x of g is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in x. if |x| ≥ |y | for any other set of pairwise non-commuting elements y in g, then x is said to be a maximal subset of pairwise non-commuting elements. in this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space—where k is logarithmic in n and independent of d—so that all pairwise distances are maintained within an arbitrarily small factor. All known constructions of such embeddings involve projecting the n points onto a spherically random k-...

It is proved that there are precisely 4204 pairwise non-isomorphic Steiner systems S(5, 6, 72) invariant under the group PSL2(71) and which can be constructed using only short orbits. It is further proved that there are precisely 38717 pairwise non-isomorphic Steiner systems S(5, 6, 84) invariant under the group PSL2(83) and which can be constructed using only short orbits.