In this paper, we study the sequential convergence in E-direct sums E（X） where X is an Ω-ofamily of Banach spaces and discuss the lifting of the Kadec-Klee property from X to E（X）.
This article mainly discusses the direct sum decomposition of type G_2 Lie algebra, which, under such decomposition, is decomposed into a type A_1 simple Lie algebra and one of its modules. Four theorems are given to ...This article mainly discusses the direct sum decomposition of type G_2 Lie algebra, which, under such decomposition, is decomposed into a type A_1 simple Lie algebra and one of its modules. Four theorems are given to describe this module,which could be the direct sum of two or three irreducible modules, or the direct sum of weight modules and trivial modules, or the highest weight module.展开更多
In this paper, we consider a class of the infinitely differentiable functions with compact support on R2 , and give a kind of its direct sum decomposition.
近年来,多用户多输入多输出(Multiple-User Multiple-Input Multiple-Output,MU-MIMO)下行链路的预编码算法设计吸引了越来越多研究者的兴趣。然而目前并没有对基站端已知信道误差概率分布且约束条件为单天线功率约束(Per-Antenna Power...近年来,多用户多输入多输出(Multiple-User Multiple-Input Multiple-Output,MU-MIMO)下行链路的预编码算法设计吸引了越来越多研究者的兴趣。然而目前并没有对基站端已知信道误差概率分布且约束条件为单天线功率约束(Per-Antenna Power Constraints,PAPCS)的情况下的线性预编码算法的研究。针对上述情况,以遍历和速率(Expected Sum Rate)最大化为优化准则,主要基于约束随机逐次凸近似(Constrained Stochastic Successive Convex Approximation,CSSCA)、二阶对偶法、交替方向乘子法(Alternating Direction Method of Multipliers,ADMM)及高斯随机化(Gaussian Randomization)设计了线性预编码算法。所提算法的适用场景更符合实际情况,而且实验仿真结果证明,算法的性能较好。展开更多
A sufficient condition is given to assert that a continuous mapping between Rm and Rn has a zero. The constructive proof of the result is based upon continuation methods and supplies the existence of a path leading to...A sufficient condition is given to assert that a continuous mapping between Rm and Rn has a zero. The constructive proof of the result is based upon continuation methods and supplies the existence of a path leading to the zero point.展开更多
文摘In this paper, we study the sequential convergence in E-direct sums E（X） where X is an Ω-ofamily of Banach spaces and discuss the lifting of the Kadec-Klee property from X to E（X）.
基金The CLRPF(17pzxmyb10) of Guangdong Peizheng College
文摘This article mainly discusses the direct sum decomposition of type G_2 Lie algebra, which, under such decomposition, is decomposed into a type A_1 simple Lie algebra and one of its modules. Four theorems are given to describe this module,which could be the direct sum of two or three irreducible modules, or the direct sum of weight modules and trivial modules, or the highest weight module.
基金supported by National Natural Science Foundation of China (11161030)
文摘In this paper, we consider a class of the infinitely differentiable functions with compact support on R2 , and give a kind of its direct sum decomposition.
文摘近年来,多用户多输入多输出(Multiple-User Multiple-Input Multiple-Output,MU-MIMO)下行链路的预编码算法设计吸引了越来越多研究者的兴趣。然而目前并没有对基站端已知信道误差概率分布且约束条件为单天线功率约束(Per-Antenna Power Constraints,PAPCS)的情况下的线性预编码算法的研究。针对上述情况,以遍历和速率(Expected Sum Rate)最大化为优化准则,主要基于约束随机逐次凸近似(Constrained Stochastic Successive Convex Approximation,CSSCA)、二阶对偶法、交替方向乘子法(Alternating Direction Method of Multipliers,ADMM)及高斯随机化(Gaussian Randomization)设计了线性预编码算法。所提算法的适用场景更符合实际情况,而且实验仿真结果证明,算法的性能较好。
基金This work is partially supported by D.G.E.S. PB 96-1338-CO2-01 and the Junta de Andalucla.
文摘A sufficient condition is given to assert that a continuous mapping between Rm and Rn has a zero. The constructive proof of the result is based upon continuation methods and supplies the existence of a path leading to the zero point.
