Currently displaying 1 – 9 of 9

Showing per page

Order by Relevance | Title | Year of publication

Conditions equivalent to C* independence

Shuilin JinLi XuQinghua JiangLi Li — 2012

Studia Mathematica

Let and be mutually commuting unital C* subalgebras of (). It is shown that and are C* independent if and only if for all natural numbers n, m, for all n-tuples A = (A₁, ..., Aₙ) of doubly commuting nonzero operators of and m-tuples B = (B₁, ..., Bₘ) of doubly commuting nonzero operators of , S p ( A , B ) = S p ( A ) × S p ( B ) , where Sp denotes the joint Taylor spectrum.

An efficient connected dominating set algorithm in wsns based on the induced tree of the crossed cube

Jing ZhangLi XuShu-ming ZhouWei WuXiucai Ye — 2015

International Journal of Applied Mathematics and Computer Science

The connected dominating set (CDS) has become a well-known approach for constructing a virtual backbone in wireless sensor networks. Then traffic can forwarded by the virtual backbone and other nodes turn off their radios to save energy. Furthermore, a smaller CDS incurs fewer interference problems. However, constructing a minimum CDS is an NP-hard problem, and thus most researchers concentrate on how to derive approximate algorithms. In this paper, a novel algorithm based on the induced tree of...

A practical application of kernel-based fuzzy discriminant analysis

Jian-Qiang GaoLi-Ya FanLi LiLi-Zhong Xu — 2013

International Journal of Applied Mathematics and Computer Science

A novel method for feature extraction and recognition called Kernel Fuzzy Discriminant Analysis (KFDA) is proposed in this paper to deal with recognition problems, e.g., for images. The KFDA method is obtained by combining the advantages of fuzzy methods and a kernel trick. Based on the orthogonal-triangular decomposition of a matrix and Singular Value Decomposition (SVD), two different variants, KFDA/QR and KFDA/SVD, of KFDA are obtained. In the proposed method, the membership degree is incorporated...

Page 1

Download Results (CSV)