K-th number query是计算机算法中的一个基础问题,被广泛作为很多算法实现的重要步骤。对该问题进行了深入研究,并找到了单询问渐近时间复杂度最优的算法。目前一般对于多询问的K-th number query问题使用平衡二叉树解决,询问的时间复...K-th number query是计算机算法中的一个基础问题,被广泛作为很多算法实现的重要步骤。对该问题进行了深入研究,并找到了单询问渐近时间复杂度最优的算法。目前一般对于多询问的K-th number query问题使用平衡二叉树解决,询问的时间复杂度为O(lbn)。但该算法实现比较复杂,并且常系数较大,提出了基于Bit Indexed Tree数据结构的算法解决,在同等时间复杂度的前提下,实现简单,隐含的常系数很小。最后进行了实验测试,分析显示该新算法不论在时间上还是空间上都优于现有的算法。展开更多
Wireless relay and network coding are two critical techniques to increase the reliability and throughput of wireless cooperative communication systems. In this paper, a complex field network coding （CFNC） scheme wit...Wireless relay and network coding are two critical techniques to increase the reliability and throughput of wireless cooperative communication systems. In this paper, a complex field network coding （CFNC） scheme with the K-th best relay selection （KBS） is proposed and investigated, wherein the K-th best relay is selected to forward the multiplexed signal to the destination. First, the upper bound of the symbol error probability （SEP）, the diversity order, and the coding gain are derived for the CFNC scheme with KBS. Then, the coding gain is utilized as the optimized cri- terion to determine the optimal power allocation. It is validated through analysis and simulation that the CFNC scheme with KBS can achieve full diversity only when K=I, while the diversity order decreases with increasing parameter K, and the optimal power allocation can significantly improve the performance of the CFNC scheme with KBS.展开更多
In this paper, we estimate the Fekete-Szego functional with k-th root transform for the inverse of certain classes of analytic univalent functions using quasi-subordination.
The main purpose of this paper is to study the asymptotic property of the fourth power mean of the general k-th Kloosterman sums, and give an interesting asymptotic formula.
Let G be a finite group. Suppose that H is a subgroup of G. We say that H is s-semipermutable in G if HG_p = G_p H for any Sylow p-subgroup G_p of G with(p, |H|) = 1,where p is a prime dividing the order of G. We give...Let G be a finite group. Suppose that H is a subgroup of G. We say that H is s-semipermutable in G if HG_p = G_p H for any Sylow p-subgroup G_p of G with(p, |H|) = 1,where p is a prime dividing the order of G. We give a p-nilpotent criterion of G under the hypotheses that some subgroups of G are s-semipermutable in G. Our result is a generalization of the famous Burnside's p-nilpotent criterion.展开更多
文摘K-th number query是计算机算法中的一个基础问题,被广泛作为很多算法实现的重要步骤。对该问题进行了深入研究,并找到了单询问渐近时间复杂度最优的算法。目前一般对于多询问的K-th number query问题使用平衡二叉树解决,询问的时间复杂度为O(lbn)。但该算法实现比较复杂,并且常系数较大,提出了基于Bit Indexed Tree数据结构的算法解决,在同等时间复杂度的前提下,实现简单,隐含的常系数很小。最后进行了实验测试,分析显示该新算法不论在时间上还是空间上都优于现有的算法。
基金supported by the Major State Basic Research Development Program of China(973 Program No.2012CB316100)the National Natural Science Foundation of China(Nos.61032002/61271246)the 111 Project(No.111-2-14)
文摘Wireless relay and network coding are two critical techniques to increase the reliability and throughput of wireless cooperative communication systems. In this paper, a complex field network coding （CFNC） scheme with the K-th best relay selection （KBS） is proposed and investigated, wherein the K-th best relay is selected to forward the multiplexed signal to the destination. First, the upper bound of the symbol error probability （SEP）, the diversity order, and the coding gain are derived for the CFNC scheme with KBS. Then, the coding gain is utilized as the optimized cri- terion to determine the optimal power allocation. It is validated through analysis and simulation that the CFNC scheme with KBS can achieve full diversity only when K=I, while the diversity order decreases with increasing parameter K, and the optimal power allocation can significantly improve the performance of the CFNC scheme with KBS.
基金Supported by the National Natural Science Foundation of China (Grant No. 11561001)the Natural Science Foundation of Inner Mongolia of China (Grant No. 2018MS01026)+4 种基金the Natural Science Foundation of Anhui Provincial Department of Education (Grant Nos. KJ2018A0833KJ2020A0993KJ2020ZD74)Provincial Quality Engineering Project of Anhui Colleges and Universities (Grant No. 2018mooc608)the Key Cultivated Project at School Level of the National Science Fund of Guangzhou Civil Aviation College (Grant No. 18X0428)。
文摘In this paper, we estimate the Fekete-Szego functional with k-th root transform for the inverse of certain classes of analytic univalent functions using quasi-subordination.
基金the National Natural Science Foundation of China (No.10271093) the Shanxi Provincial Natural Science Foundation of China.
文摘The main purpose of this paper is to study the asymptotic property of the fourth power mean of the general k-th Kloosterman sums, and give an interesting asymptotic formula.
基金Supported by the National Natural Science Foundation of China(Grant No.11271085)the Major Projects in Basic Research and Applied Research(Natural Science)of Guangdong Province(Grant No.2017KZDXM058)+1 种基金Funds of Guangzhou Science and Technology(Grant No.201804010088)the Science and Technology Research Foundation of Education Department of Jiangxi Province(Grant No.GJJ171109)
文摘Let G be a finite group. Suppose that H is a subgroup of G. We say that H is s-semipermutable in G if HG_p = G_p H for any Sylow p-subgroup G_p of G with(p, |H|) = 1,where p is a prime dividing the order of G. We give a p-nilpotent criterion of G under the hypotheses that some subgroups of G are s-semipermutable in G. Our result is a generalization of the famous Burnside's p-nilpotent criterion.
