Results 171 to 180 of about 1,406,601 (220)
Highest-Weight Vectors and Three-Point Functions in GKO Coset Decomposition. [PDF]
Commun Math PhysBershtein M, Feigin B, Trufanov A.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Canonical decompositions in complete lattices
Algebra and Logic, 1978V. Gorbunov
semanticscholar +3 more sources
CD-BFT: Canonical Decomposition-Based Belief Functions Transformation in Possibility Theory
IEEE Transactions on Cybernetics, 2023Based on subjective possibilistic semantics, an agent’s subjective probability mass function is dominated by a qualitative Possibility Mass Function (PossMF), which can also be transformed into a unique consonant mass function.
Qianli Zhou, Yong Deng, R. Yager
semanticscholar +1 more source
Canonical decomposition of non-linear systems
Automatica, 1997The authors examine nonlinear, affine control systems \[ \begin{cases} \dot x = f(x)+ g(x)u,\\ y= h(x)\end{cases}\tag{\(\#\)} \] defined by meromorphic (a ratio of analytic) data \(f\), \(g\), \(h\). Sufficient conditions are found under which the system \((\#)\) can be transformed to a Morse type normal form consisting of three subsystems ...
Moog, Claude, H. +2 more
openaire +2 more sources
Canonical Decomposition of Graphs
1996Summary: A partition of the vertex set of a graph \(G\) is called canonical if every two elements of the partition induce in \(G\) either a disconnected graph or the complement of a disconnected graph. Thus, every canonical partition of the graph \(G\) can be associated with another graph whose vertices are in a one-to-one correspondence with the ...
openaire +2 more sources
A canonical coordinate decomposition network
Proceedings of the International Joint Conference on Neural Networks, 2003., 2004A network structure for canonical coordinate decomposition is presented. The network consists of two single-layer linear subnetworks that together extract the canonical coordinates of two data channels. The connection weights of the networks are trained by a stochastic gradient descent learning algorithm.
A. Pezeshki +2 more
openaire +1 more source
T-Jordan Canonical Form and T-Drazin Inverse Based on the T-Product
Communication on Applied Mathematics and Computation, 2019In this paper, we investigate the tensor similarity and propose the T-Jordan canonical form and its properties. The concepts of the T-minimal polynomial and the T-characteristic polynomial are proposed.
Yun Miao, L. Qi, Yimin Wei
semanticscholar +1 more source
BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION
International Journal of Foundations of Computer Science, 1999We describe here a technique of decomposition of bipartite graphs which seems to be as interesting within this context as the well known modular and split techniques for the decomposition of general graphs. In particular, we characterize by forbidden subgraphs the family of bipartite graphs which are totally decomposable (i.e.
Fouquet, Jean-Luc +2 more
openaire +2 more sources