期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
A highly reliable embedding algorithm for airborne tactical network virtualization 被引量:2
1
作者 MIAO Jingcheng LYU Na +2 位作者 CHEN Kefan CHEN Zhuo GAO Weiting 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2021年第6期1364-1374,共11页
The evolution of airborne tactical networks(ATNs)is impeded by the network ossification problem.As a solution,network virtualization(NV)can provide a flexible and scalable architecture where virtual network embedding(... The evolution of airborne tactical networks(ATNs)is impeded by the network ossification problem.As a solution,network virtualization(NV)can provide a flexible and scalable architecture where virtual network embedding(VNE)is a key part.However,existing VNE algorithms cannot be optimally adopted in the virtualization of ATN due to the complex interference in aircombat field.In this context,a highly reliable VNE algorithm based on the transmission rate for ATN virtualization(TR-ATVNE)is proposed to adapt well to the specific electromagnetic environment of ATN.Our algorithm coordinates node and link mapping.In the node mapping,transmission-rate resource is firstly defined to effectively evaluate the ranking value of substrate nodes under the interference of both environmental noises and enemy attacks.Meanwhile,a feasible splitting rule is proposed for path splitting in the link mapping,considering the interference between wireless links.Simulation results reveal that our algorithm is able to improve the acceptance ratio of virtual network requests while maintaining a high revenue-to-cost ratio under the complex electromagnetic interference. 展开更多
关键词 airborne tactical network(ATN) network virtualization(NV) resource allocation virtual network embedding(VNE) transmission rate
在线阅读 下载PDF
Tri-party deep network representation learning using inductive matrix completion 被引量:4
2
作者 YE Zhong-lin ZHAO Hai-xing +2 位作者 ZHANG Ke ZHU Yu XIAO Yu-zhi 《Journal of Central South University》 SCIE EI CAS CSCD 2019年第10期2746-2758,共13页
Most existing network representation learning algorithms focus on network structures for learning.However,network structure is only one kind of view and feature for various networks,and it cannot fully reflect all cha... Most existing network representation learning algorithms focus on network structures for learning.However,network structure is only one kind of view and feature for various networks,and it cannot fully reflect all characteristics of networks.In fact,network vertices usually contain rich text information,which can be well utilized to learn text-enhanced network representations.Meanwhile,Matrix-Forest Index(MFI)has shown its high effectiveness and stability in link prediction tasks compared with other algorithms of link prediction.Both MFI and Inductive Matrix Completion(IMC)are not well applied with algorithmic frameworks of typical representation learning methods.Therefore,we proposed a novel semi-supervised algorithm,tri-party deep network representation learning using inductive matrix completion(TDNR).Based on inductive matrix completion algorithm,TDNR incorporates text features,the link certainty degrees of existing edges and the future link probabilities of non-existing edges into network representations.The experimental results demonstrated that TFNR outperforms other baselines on three real-world datasets.The visualizations of TDNR show that proposed algorithm is more discriminative than other unsupervised approaches. 展开更多
关键词 network representation network embedding representation learning matrix-forestindex inductive matrix completion
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部