期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Generative Neural Network Based Spectrum Sharing Using Linear Sum Assignment Problems
1
作者 Ahmed BZaky Joshua Zhexue Huang +1 位作者 Kaishun Wu Basem MElHalawany 《China Communications》 SCIE CSCD 2020年第2期14-29,共16页
Spectrum management and resource allocation(RA)problems are challenging and critical in a vast number of research areas such as wireless communications and computer networks.The traditional approaches for solving such... Spectrum management and resource allocation(RA)problems are challenging and critical in a vast number of research areas such as wireless communications and computer networks.The traditional approaches for solving such problems usually consume time and memory,especially for large-size problems.Recently different machine learning approaches have been considered as potential promising techniques for combinatorial optimization problems,especially the generative model of the deep neural networks.In this work,we propose a resource allocation deep autoencoder network,as one of the promising generative models,for enabling spectrum sharing in underlay device-to-device(D2D)communication by solving linear sum assignment problems(LSAPs).Specifically,we investigate the performance of three different architectures for the conditional variational autoencoders(CVAE).The three proposed architecture are the convolutional neural network(CVAECNN)autoencoder,the feed-forward neural network(CVAE-FNN)autoencoder,and the hybrid(H-CVAE)autoencoder.The simulation results show that the proposed approach could be used as a replacement of the conventional RA techniques,such as the Hungarian algorithm,due to its ability to find solutions of LASPs of different sizes with high accuracy and very fast execution time.Moreover,the simulation results reveal that the accuracy of the proposed hybrid autoencoder architecture outperforms the other proposed architectures and the state-of-the-art DNN techniques. 展开更多
关键词 autoencoder linear sum assignment problems generative models resource allocation
下载PDF
Multi-target tracking algorithm of boost-phase ballistic missile defense 被引量:2
2
作者 Kangsheng Tian Feng Zhang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2013年第1期90-100,共11页
Considering the problem of multiple ballistic missiles tracking of boost-phase ballistic missile defense, a boost-phase tracking algorithm based on multiple hypotheses tracking (MHT) concept is proposed. This paper ... Considering the problem of multiple ballistic missiles tracking of boost-phase ballistic missile defense, a boost-phase tracking algorithm based on multiple hypotheses tracking (MHT) concept is proposed. This paper focuses on the tracking algo- rithm for hypothesis generation, hypothesis probability calculation, hypotheses reduction and pruning and other sectors. From an engineering point of view, a technique called the linear assignment problem (LAP) used in the implementation of M-best feasible hypotheses generation, the number of the hypotheses is relatively small compared with the total number that may exist in each scan, also the N-scan back pruning is used, the algorithm's efficiency and practicality have been improved. Monte Carlo simulation results show that the proposed algorithm can track the boost phase of multiple ballistic missiles and it has a good tracking performance compared with joint probability data association (JPDA). 展开更多
关键词 ballistic missile multiple hypotheses tracking (MHT) linear assignment problem (LAP) hypothesis pruning.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部