The Kalman filtering method is extended to two dimensions. The resulting computational load is found to be excessive. Two new approximations are then introduced. One, called the strip processor, updates a line segment at a time; the other, called the reduced update Kalman filter, is a scalar processor. The reduced update Kalman filter is shown to be optimum in that it minimizes the post update ...

Several aspects of the design and optimization of coded multiple-antenna transmission diversity methods for slowly time-varying channels are explored from an information-theoretic perspective. Both optimized vector-coded systems, which can achieve the maximum possible performance, and suboptimal scalar-coded systems, which reduce complexity by exploiting suitably designed linear precoding, are ...

A generalization of the Yang-Mills covariant derivative, that uses both vector and scalar fields and transforms as a 4-vector contracted with Dirac matrices, is used to simplify and unify the Glashow-Weinberg-Salam model. Since SU (3) assigns the wrong hypercharge to the Higgs boson, it is necessary to use a special representation of U (3) to obtain all the correct quantum numbers. A surplus ga...

In this note, we propose a straightforward notion of transport distance on a graph that is readily computable via a convex optimization reformulation. Similar ideas lead to a Wasserstein distance on vector-valued densities, that allow us to apply optimal mass transport to graphs whose nodes represent vectorial and not just scalar data. We are interested in the application to various communicati...

1. Suppose that the matrix Mk is of dimension nk × nk+1, k ∈ {1, . . . , h}. We wish to compute the product M1M2 · · ·Mh. Notice that the order of multiplication makes a difference. For example, if (n1, n2, n3, n4) = (1, 10, 1, 10), the calculation (M1M2)M3 requires 20 scalar multiplications, but the calculation M1(M2M3) requires 200 scalar multiplications. Indeed, multiplying a m × n matrix by...

A major obstacle in designing superscalar processors is the size and port requirement of the register file. Multiple register files of a scalar processor can be used in a superscalar processor if results are renamed when they are written to the register file. Consequently, a scalable register file architecture can be implemented without performance degradation. Another benefit is that the cycle...

This paper addresses two basic questions about polarity items: what sorts of meaning can such forms encode and why should such forms exist in the first place. My starting point is the Scalar Model of Polarity (Israel 1996, 1998), which predicts a reliable correlation between a polarity item’s sensitivity and its scalar semantic properties: specifically, it predicts that forms denoting a minimal...

When Etherington (2) introduced linear commutative non-associative algebras in connection with problems in theoretical genetics, he pointed out that various sequences of elements in these algebras represented different mating systems. In all such systems it was however assumed that the generations did not overlap, and this restriction has been kept in later work in this field. In this paper we ...

This is the first report of arthropods associated with carrion in Venezuela, using laboratory bred rats (Rattus norvegicus). Rat carcasses were exposed to colonization by arthropods in neighboring montane savanna and cloud forest habitats in the state of Miranda. The taxonomic composition of the arthropods varied between both ecosystems. Scarabaeidae, Silphidae, Micropezidae, Phoridae, Vespidae...

Welch & Peers (1963) used a root-information prior to obtain posterior probabilities for a scalar parameter exponential model and showed that these Bayes probabilities had the confidence property to second order asymptotically. An important undercurrent of this indicates that the constant information reparameterization provides location model structure, for which the confidence property ...