Results 1  10
of
843
1 Interference Channel with an OutofBand Relay
"... Abstract—A Gaussian interference channel (IC) with a relay is considered. The relay is assumed to operate over an orthogonal band with respect to the underlying IC, and the overall system is referred to as IC with an outofband relay (ICOBR). The system can be seen as operating over two parallel i ..."
Abstract
 Add to MetaCart
interferencelimited channels: The first is a standard Gaussian IC and the second is a Gaussian relay channel characterized by two sources and destinations communicating through the relay without direct links. We refer to the second parallel channel as OBR Channel (OBRC). The main aim of this work is to identify
1On the Identifiability of Overcomplete Dictionaries via the Minimisation Principle Underlying KSVD
, 2013
"... This article gives theoretical insights into the performance of KSVD, a dictionary learning algorithm that has gained significant popularity in practical applications. The particular question studied here is when a dictionary Φ ∈ Rd×K can be recovered as local minimum of the minimisation criterion ..."
Abstract
 Add to MetaCart
This article gives theoretical insights into the performance of KSVD, a dictionary learning algorithm that has gained significant popularity in practical applications. The particular question studied here is when a dictionary Φ ∈ Rd×K can be recovered as local minimum of the minimisation criterion underlying KSVD from a set of N training signals yn = Φxn. A theoretical analysis of the problem leads to two types of identifiability results assuming the training signals are generated from a tight frame with coefficients drawn from a random symmetric distribution. First asymptotic results showing, that in expectation the generating dictionary can be recovered exactly as a local minimum of the KSVD criterion if the coefficient distribution exhibits sufficient decay. This decay can be characterised by the coherence of the dictionary and the `1norm of the coefficients. Based on the asymptotic results it is further demonstrated that given a finite number of training samples N, such that N / logN = O(K3d), except with probability O(N−Kd) there is a local minimum of the KSVD criterion within distance O(KN−1/4) to the generating dictionary. Index Terms dictionary learning, sparse coding, KSVD, finite sample size, sampling complexity, dictionary identification, minimisation criterion, sparse representation 1
Akademisk avhandling för teknisk doktorsexamen vid
, 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract
 Add to MetaCart
mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group elements are data structures in a computer. Matrices are unnecessarily large structures, and part of this thesis is concerned with small and efficient representations of a large class of Coxeter groups (including most Coxeter groups that anyone ever payed any attention to.) The main contents of the thesis can be summarized as follows. • We prove that for all Coxeter graphs constructed from an npath of unlabelled edges by adding a new labelled edge and a new vertex (sometimes two new edges and vertices), there is a permutational representation of the corresponding group. Group elements correspond to integer nsequences and the nodes in the path generate all n! permutations. The extra node has a more complicated action, adding a certain quantity to some of the numbers.
Selfdetermination and persistence in a reallife setting: Toward a motivational model of high school dropout.
 Journal of Personality and Social Psychology,
, 1997
"... The purpose of this study was to propose and test a motivational model of high school dropout. The model posits that teachers, parents, and the school administration's behaviors toward students influence students' perceptions of competence and autonomy. The less autonomy supportive the so ..."
Abstract

Cited by 183 (19 self)
 Add to MetaCart
"CentreVille," Montreal, Quebec, Canada H3C 3P8. Electronic mail may be sent via the Internet to vallerand.robertj@uqam.ca. a motivational model of high school dropout on the basis of theory and research in the field of intrinsic and extrinsic motivation. We believe that such an undertaking
Authors:
, 1997
"... 1 Dedicated to Ludwig Elsner on the occasion of his sixtieth birthday We describe canonical forms for elements of a classical Lie group of matrices under similarity transformations in the group. Matrices in the associated Lie algebra and Jordan algebra of matrices inherit related forms under these s ..."
Abstract
 Add to MetaCart
1 Dedicated to Ludwig Elsner on the occasion of his sixtieth birthday We describe canonical forms for elements of a classical Lie group of matrices under similarity transformations in the group. Matrices in the associated Lie algebra and Jordan algebra of matrices inherit related forms under these similarity transformations. In general, one cannot achieve diagonal or Schur form, but the form that can be achieved displays the eigenvalues of the matrix. We also discuss matrices in intersections of these classes and their Schurlike forms. Such multistructered matrices arise in applications from quantum physics and quantum chemistry. 1
Results 1  10
of
843