In this paper, we consider the relationship between the binding number and the existence of fractional k-factors of graphs. The binding number of G is defined by Woodall as bind(G)=min{ | NG(X) || X |:∅≠X⊆V(G) }. It ...In this paper, we consider the relationship between the binding number and the existence of fractional k-factors of graphs. The binding number of G is defined by Woodall as bind(G)=min{ | NG(X) || X |:∅≠X⊆V(G) }. It is proved that a graph G has a fractional 1-factor if bind(G)≥1and has a fractional k-factor if bind(G)≥k−1k. Furthermore, it is showed that both results are best possible in some sense.展开更多
To meet the high-performance requirements of fifth-generation(5G)and sixth-generation(6G)wireless networks,in particular,ultra-reliable and low-latency communication(URLLC)is considered to be one of the most important...To meet the high-performance requirements of fifth-generation(5G)and sixth-generation(6G)wireless networks,in particular,ultra-reliable and low-latency communication(URLLC)is considered to be one of the most important communication scenarios in a wireless network.In this paper,we consider the effects of the Rician fading channel on the performance of cooperative device-to-device(D2D)communication with URLLC.For better performance,we maximize and examine the system’s minimal rate of D2D communication.Due to the interference in D2D communication,the problem of maximizing the minimum rate becomes non-convex and difficult to solve.To solve this problem,a learning-to-optimize-based algorithm is proposed to find the optimal power allocation.The conventional branch and bound(BB)algorithm are used to learn the optimal pruning policy with supervised learning.Ensemble learning is used to train the multiple classifiers.To address the imbalanced problem,we used the supervised undersampling technique.Comparisons are made with the conventional BB algorithm and the heuristic algorithm.The outcome of the simulation demonstrates a notable performance improvement in power consumption.The proposed algorithm has significantly low computational complexity and runs faster as compared to the conventional BB algorithm and a heuristic algorithm.展开更多
The effective earth radius factor(k-factor)has a refractive propagation effect on transmitted radio signals thus making its study necessary for the proper planning of terrestrial radio links and power budget.This stud...The effective earth radius factor(k-factor)has a refractive propagation effect on transmitted radio signals thus making its study necessary for the proper planning of terrestrial radio links and power budget.This study was carried out over the city of Lokoja,Nigeria,using ten years(2011 to 2020)atmospheric data of temperature,pressure and humidity both at the surface(12 m)and at 100 m AGL.The data were retrieved from European Centre for Medium-Range Weather Forecasts(ECMWF)ERA5.The k-factor yearly variation follows the same trend with minimum and maximum values obtained during dry and wet season months respectively.In addition,the highest mean value of 1.00042 was recorded in the month of August while the lowest value of 1.00040 was recorded in the month of January with an overall mean value of 1.0003.This value is less than the recommended standard of 1.33 by ITU-R.The propagation effect corresponding to k<1.33 is sub-refractive.The implication of this on radio wave propagation,especially terrestrial communications is that transmitted wireless signal is prone to losses.This can be mitigated through an effective power budget:Choice of transmitting antenna’s height and gain,so as to improve the Quality of Service over the study area.展开更多
研究了非正交多址(Non‑orthogonal‑multiple‑access,NOMA)接入通信系统的物理层安全性能。当基站采用下行NOMA方案发送信息时,由于信道的开放性,信息容易被窃听,而当存在多个随机分布的窃听者时,安全性能会进一步降低。为了增强存在硬...研究了非正交多址(Non‑orthogonal‑multiple‑access,NOMA)接入通信系统的物理层安全性能。当基站采用下行NOMA方案发送信息时,由于信道的开放性,信息容易被窃听,而当存在多个随机分布的窃听者时,安全性能会进一步降低。为了增强存在硬件损伤系统的物理层安全性能,本文考虑保护区的方法,针对地面用户与基站之间存在直连链路的情况,采用莱斯衰落来建模小尺度衰落。本文还假设多个窃听者的位置遵循齐次泊松点过程(Homogeneous Poisson point process,HPPP),借助高斯切比雪夫积分公式,推导了平均保密容量的闭式表达式,并给出了在高信噪比情况下的渐近表达式来获得进一步见解。仿真结果验证了保护区方法在增强安全性能方面的有效性,并说明了不同参数对系统保密性能的影响。展开更多
文摘In this paper, we consider the relationship between the binding number and the existence of fractional k-factors of graphs. The binding number of G is defined by Woodall as bind(G)=min{ | NG(X) || X |:∅≠X⊆V(G) }. It is proved that a graph G has a fractional 1-factor if bind(G)≥1and has a fractional k-factor if bind(G)≥k−1k. Furthermore, it is showed that both results are best possible in some sense.
基金supported in part by the National Natural Science Foundation of China under Grant 61771410in part by the Sichuan Science and Technology Program 2023NSFSC1373in part by Postgraduate Innovation Fund Project of SWUST 23zx7101.
文摘To meet the high-performance requirements of fifth-generation(5G)and sixth-generation(6G)wireless networks,in particular,ultra-reliable and low-latency communication(URLLC)is considered to be one of the most important communication scenarios in a wireless network.In this paper,we consider the effects of the Rician fading channel on the performance of cooperative device-to-device(D2D)communication with URLLC.For better performance,we maximize and examine the system’s minimal rate of D2D communication.Due to the interference in D2D communication,the problem of maximizing the minimum rate becomes non-convex and difficult to solve.To solve this problem,a learning-to-optimize-based algorithm is proposed to find the optimal power allocation.The conventional branch and bound(BB)algorithm are used to learn the optimal pruning policy with supervised learning.Ensemble learning is used to train the multiple classifiers.To address the imbalanced problem,we used the supervised undersampling technique.Comparisons are made with the conventional BB algorithm and the heuristic algorithm.The outcome of the simulation demonstrates a notable performance improvement in power consumption.The proposed algorithm has significantly low computational complexity and runs faster as compared to the conventional BB algorithm and a heuristic algorithm.
文摘The effective earth radius factor(k-factor)has a refractive propagation effect on transmitted radio signals thus making its study necessary for the proper planning of terrestrial radio links and power budget.This study was carried out over the city of Lokoja,Nigeria,using ten years(2011 to 2020)atmospheric data of temperature,pressure and humidity both at the surface(12 m)and at 100 m AGL.The data were retrieved from European Centre for Medium-Range Weather Forecasts(ECMWF)ERA5.The k-factor yearly variation follows the same trend with minimum and maximum values obtained during dry and wet season months respectively.In addition,the highest mean value of 1.00042 was recorded in the month of August while the lowest value of 1.00040 was recorded in the month of January with an overall mean value of 1.0003.This value is less than the recommended standard of 1.33 by ITU-R.The propagation effect corresponding to k<1.33 is sub-refractive.The implication of this on radio wave propagation,especially terrestrial communications is that transmitted wireless signal is prone to losses.This can be mitigated through an effective power budget:Choice of transmitting antenna’s height and gain,so as to improve the Quality of Service over the study area.
文摘磁共振成像(Magnetic Resonance Imaging,MRI)已经成为一种常见的影像检查方式,MRI的去噪算法影响着MRI的成像效果。基于深度学习的MRI去噪算法需要一定量的数据,绝大部分基于非深度学习的MRI去噪算法都是将MRI数据转化为实数之后进行去噪的,针对复数MRI中的复数数据类型的算法也存在着失真的问题。因此,提出一种通过单张MRI脑图像的原始数据进行噪点剔除的算法,以此更好得去除图像噪声。该算法从MRI的原始数据出发,利用了MRI噪声分布性质和MRI脑图像的特点,以判断MRI图像中噪声明显的点,从而剔除MRI中特定的莱斯分布的噪声。并将所提出的算法结合了MRI去噪中常用的非局部平均算法(Non-Local Means denoising,NLM)与三维块匹配算法(Block-Matching and 3D filtering,BM3D),并和不使用该算法剔除噪点的NLM、BM3D进行了对比评估。对比结果表明,在噪声密度不同的多种情况下,该算法总能优化与之相结合的图像去噪算法,在不同的噪声情况下使峰值信噪比(Peak Signal-to-Noise Ratio,PSNR)与结构相似性(Structural Similarity,SSIM)提高了1%~9%。最后将该算法结合BM3D,对比了DnCNN、低秩聚类算法(Weighted Nuclear Norm Minimization,WNNM)、BM3D、NLM等用于MRI去噪的算法,在莱斯噪声较多时,该算法在PSNR上有更好的表现。
基金supported in part by the National Natrual Science Foundation of China(Nos.61971220,61971221)the Open Research Fund Key Laboratory of Wireless Sensor Network and Communication of Chinese Academy of Science(No.2017006).
文摘研究了非正交多址(Non‑orthogonal‑multiple‑access,NOMA)接入通信系统的物理层安全性能。当基站采用下行NOMA方案发送信息时,由于信道的开放性,信息容易被窃听,而当存在多个随机分布的窃听者时,安全性能会进一步降低。为了增强存在硬件损伤系统的物理层安全性能,本文考虑保护区的方法,针对地面用户与基站之间存在直连链路的情况,采用莱斯衰落来建模小尺度衰落。本文还假设多个窃听者的位置遵循齐次泊松点过程(Homogeneous Poisson point process,HPPP),借助高斯切比雪夫积分公式,推导了平均保密容量的闭式表达式,并给出了在高信噪比情况下的渐近表达式来获得进一步见解。仿真结果验证了保护区方法在增强安全性能方面的有效性,并说明了不同参数对系统保密性能的影响。
