933 resultados para canonical matrices
Resumo:
We propose a novel method of constructing Dispersion Matrices (DM) for Coherent Space-Time Shift Keying (CSTSK) relying on arbitrary PSK signal sets by exploiting codes from division algebras. We show that classic codes from Cyclic Division Algebras (CDA) may be interpreted as DMs conceived for PSK signal sets. Hence various benefits of CDA codes such as their ability to achieve full diversity are inherited by CSTSK. We demonstrate that the proposed CDA based DMs are capable of achieving a lower symbol error ratio than the existing DMs generated using the capacity as their optimization objective function for both perfect and imperfect channel estimation.
Resumo:
There is a strong relation between sparse signal recovery and error control coding. It is known that burst errors are block sparse in nature. So, here we attempt to solve burst error correction problem using block sparse signal recovery methods. We construct partial Fourier based encoding and decoding matrices using results on difference sets. These constructions offer guaranteed and efficient error correction when used in conjunction with reconstruction algorithms which exploit block sparsity.
Resumo:
Given a metric space with a Borel probability measure, for each integer N, we obtain a probability distribution on N x N distance matrices by considering the distances between pairs of points in a sample consisting of N points chosen independently from the metric space with respect to the given measure. We show that this gives an asymptotically bi-Lipschitz relation between metric measure spaces and the corresponding distance matrices. This is an effective version of a result of Vershik that metric measure spaces are determined by associated distributions on infinite random matrices.
Resumo:
LDPC codes can be constructed by tiling permutation matrices that belong to the square root of identity type and similar algebraic structures. We investigate into the properties of such codes. We also present code structures that are amenable for efficient encoding.
Resumo:
Actions of transforming growth factor-beta are largely context dependent. For instance, TGF-beta is growth inhibitory to epithelial cells and many tumor cell-lines while it stimulates the growth of mesenchymal cells. TGF-beta also activates fibroblast cells to a myofibroblastic phenotype. In order to understand how the responsiveness of fibroblasts to TGF-beta would change in the context of transformation, we have compared the differential gene regulation by TGF-beta in immortal fibroblasts (hFhTERT), transformed fibroblasts (hFhTERT-LTgRAS) and a human fibrosarcoma cell-line (HT1080). The analysis revealed regulation of 6735, 4163, and 3478 probe-sets by TGF-beta in hFhTERT, hFhTERT-LTgRAS and HT1080 cells respectively. Intriguingly, 5291 probe-sets were found to be either regulated in hFhTERT or hFhTERT-LTgRAS cells while 2274 probe-sets were regulated either in hFhTERT or HT1080 cells suggesting that the response of immortal hFhTERT cells to TGF-beta is vastly different compared to the response of both the transformed cells hFhTERT-LTgRAS and HT1080 to TGF-beta. Strikingly, WNT pathway showed enrichment in the hFhTERT cells in Gene Set Enrichment Analysis. Functional studies showed induction of WNT4 by TGF-beta in hFhTERT cells and TGF-beta conferred action of these cells was mediated by WNT4. While TGF-beta activated both canonical and non-canonical WNT pathways in hFhTERT cells, Erk1/2 and p38 Mitogen Activated Protein Kinase pathways were activated in hFhTERT-LTgRAS and HT1080 cells. This suggests that transformation of immortal hFhTERT cells by SV40 large T antigen and activated RAS caused a switch in their response to TGF-beta which matched with the response of HT1080 cells to TGF-beta. These data suggest context dependent activation of non-canonical signaling by TGF-beta. (C) 2015 Published by Elsevier Inc.
Resumo:
Let R be a (commutative) local principal ideal ring of length two, for example, the ring R = Z/p(2)Z with p prime. In this paper, we develop a theory of normal forms for similarity classes in the matrix rings M-n (R) by interpreting them in terms of extensions of R t]-modules. Using this theory, we describe the similarity classes in M-n (R) for n <= 4, along with their centralizers. Among these, we characterize those classes which are similar to their transposes. Non-self-transpose classes are shown to exist for all n > 3. When R has finite residue field of order q, we enumerate the similarity classes and the cardinalities of their centralizers as polynomials in q. Surprisingly, the polynomials representing the number of similarity classes in M-n (R) turn out to have non-negative integer coefficients.
Resumo:
We show that the density of eigenvalues for three classes of random matrix ensembles is determinantal. First we derive the density of eigenvalues of product of k independent n x n matrices with i.i.d. complex Gaussian entries with a few of matrices being inverted. In second example we calculate the same for (compatible) product of rectangular matrices with i.i.d. Gaussian entries and in last example we calculate for product of independent truncated unitary random matrices. We derive exact expressions for limiting expected empirical spectral distributions of above mentioned ensembles.
Resumo:
The utility of canonical correlation analysis (CCA) for domain adaptation (DA) in the context of multi-view head pose estimation is examined in this work. We consider the three problems studied in 1], where different DA approaches are explored to transfer head pose-related knowledge from an extensively labeled source dataset to a sparsely labeled target set, whose attributes are vastly different from the source. CCA is found to benefit DA for all the three problems, and the use of a covariance profile-based diagonality score (DS) also improves classification performance with respect to a nearest neighbor (NN) classifier.
Resumo:
Here we attempt to characterize protein evolution by residue features which dominate residue substitution in homologous proteins. Evolutionary information contained in residue substitution matrix is abstracted with the method of eigenvalue decomposition. Top eigenvectors in the eigenvalue spectrums are analyzed as function of the level of similarity, i.e. sequence identity (SI) between homologous proteins. It is found that hydrophobicity and volume are two significant residue features conserved in protein evolution. There is a transition point at SI approximate to 45%. Residue hydrophobicity is a feature governing residue substitution as SI >= 45%. Whereas below this SI level, residue volume is a dominant feature. (C) 2007 Elsevier B.V. All rights reserved.