The Global Positioning System (GPS) is a satellite based navigation system. GPS satellites transmit signals that allow one to determine the location of GPS receivers. In GPS, a typical technique for kinematic position estimation is differential positioning where two receivers are used: one receiver is stationary and its exact position is known, and the other is roving and its position is to be ...

Embeddings are generic representations that are useful for many NLP tasks. In this paper, we introduce DENSIFIER, a method that learns an orthogonal transformation of the embedding space that focuses the information relevant for a task in an ultradense subspace of a dimensionality that is smaller by a factor of 100 than the original space. We show that ultradense embeddings generated by DENSIFI...

The Gaussian mixture modeling (GMM) techniques are increasingly being used for both speaker identification and verification. Most of these models assume diagonal covariance matrices. Although empirically any distribution can be approximated with a diagonal GMM, a large number of mixture components are usually needed to obtain a good approximation. A consequence of using a large GMM is that its ...

In this paper, comparison of various orthogonal transforms in Wiener filtering is discussed. The study involves the family of discrete orthogonal transforms called Complex Hadamard Transform, which has been recently introduced by the same authors. Basic definitions, properties and transformation kernel of Complex Hadamard Transform are also shown. key words: Complex Hadamard transform, digital ...

We show that a Schur form of a real orthogonal matrix can be obtained from a full CS decomposition. Based on this fact a CS decomposition-based orthogonal eigenvalue method is developed. We also describe an algorithm for orthogonal similarity transformation of an orthogonal matrix to a condensed product form, and an algorithm for full CS decomposition. The latter uses mixed shifted and zero-shi...

A new transformation is proposed that gives orthogonal components with a one-to-one correspondence between the original vectors and the components. The aim is that each component should be close to the vector with which it is paired, orthogonality imposing a constraint. If the vectors have been normalized, then the transformation minimizes the sum of the squared correlations between each vector...

Identity transformations, used as skip-connections in residual networks, directly connect convolutional layers close to the input and those close to the output in deep neural networks, improving information flow and thus easing the training. In this paper, we introduce two alternative linear transforms, orthogonal transformation and idempotent transformation. According to the definition and pro...

This paper introduces a super-orthogonal space-time block code (STBC). The code construction is based on the expansion of orthogonal block code via a unitary matrix transformation. By expanding the orthogonal block code, both the code rate can be increased and the performance improved in terms of Eb/N0, with a moderate increase of the receiver complexity. Exploiting the partial orthogonality of...

in this paper, a schwarz-christoffel method for generating two-dimensional grids for a variety of complex internal and external flow configurations based on the numerical integration procedure of the schwarz-christoffel transformation has been developed by using mathematica, which is a general purpose symbolic-numerical-graphical mathematics software. this method is highly accurate (fifth order...