Supported by National Natural Science Foundation of China (No. 60372107, 10371106, 10471114);Natural Science Foundation of Jiangsu Province (No. 04KJB110097)
Based on the synthesis and analysis of recursive receivers, a new algorithm, namely partial grouping maximization likelihood algorithm, is proposed to achieve satisfactory performance with moderate computational compl...
supported by the National Natural Science Foundation of China (Grant Nos. 10771175, 10471114)
The question of establishing measure theory for statistical convergence has been moving closer to center stage, since a kind of reasonable theory is not only fundamental for unifying various kinds of statistical conve...
Supported by the National Natural Science Foundation of China (Grant No. 10471114)
By a ball-covering B of a Banach space X, we mean that it is a collection of open balls off the origin whose union contains the sphere of the unit ball of X. The space X is said to have a ball-covering property, if it...
the National Natural Science Fundation of China(Grant Nos.10571011,10601005,10471114)
To guarantee every real-valued convex function bounded above on a set is continuous, how "thick" should the set be? For a symmetric set A in a Banach space E,the answer of this paper is: Every real-valued convex f...
Research supported by NSFC(Grant No.10471114 and No.10471025)
This paper shows that every non-separable hereditarily indecomposable Banach space admits an equivalent strictly convex norm, but its bi-dual can never have such a one; consequently, every non-separable hereditarily i...