نتایج جستجو برای: square representation
تعداد نتایج: 362000 فیلتر نتایج به سال:
— Quasi-symmetry is a model for square contingency tables with rows and columns indexed by the same set. In a log-linear model, quasi-symmetry is associated with a vector subspace QSn of certain realvalued functions on n × n. Permutation of factor levels induces a linear transformation QSn → QSn, making this into a representation of the symmetric group Sn. However, there are many group represen...
The purpose of this paper is to give an explicit description of the trivial and alternating component of the irreducible representation decomposition of the bigraded module obtained as the tensor square of the coinvariant space for hyperoctahedral groups.
Schrödinger equation with the imaginary, PT symmetric potential V (x) = i x is studied and discussed in momentum representation, via a solvable square-well approximation of its kinetic term.
A certain class of mixed states artificially constructed that is used in quantum cryptography is crucial for representation of signals. This correspondence shows that the square-root measurement gives the optimal measurement for such a class of mixed states.
this paper examines the relationships between language and ideology and how ideology is constructed and presented via different language choices in english editorials published in different socio-cultural contexts. van dijk’s (2000a) ideological square in terms of representation of the self and other was applied to the editorials. through a comparative analysis of iranian, turkish and saudi ara...
A new result on the Drazin inverse of 2× 2 block matrix M = [ A B D C ] , where A and C are square matrices are presented, extended in the case when D = 0, the well known representation for the Drazin inverse of M , given by Hartwig, Meyer and Rose in 1977, respectively. Using that new result, an explicit representation for the Drazin inverse of a modified matrix P + RS and its generalized matr...
Abstract—We propose an Euclidean geometric representation for the classical detection theory. The proposed representation is so generic that can be employed to almost all communication problems. The hypotheses and observations are mapped into R in such a way that a posteriori probability of an hypothesis given an observation decreases exponentially with the square of the Euclidean distance betw...
In this paper, based on sparse representation classification and robust thought, we propose a new classifier, named MRSRC (Metasample Based Robust Sparse Representation Classificatier), for DNA microarray data classification. Firstly, we extract Metasample from trainning sample. Secondly, a weighted matrix W is added to solve an l1-regularized least square problem. Finally, the testing sample i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید