期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Heuristics of node selection criteria to assess robustness of world airport network 被引量:3
1
作者 Manel SORIA Oriol LORDAN JosMaría SALLAN 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2017年第4期1473-1480,共8页
The world airport network(WAN) is one of the networked infrastructures that shape today's economic and social activity, so its resilience against incidents affecting the WAN is an important problem. In this paper, ... The world airport network(WAN) is one of the networked infrastructures that shape today's economic and social activity, so its resilience against incidents affecting the WAN is an important problem. In this paper, the robustness of air route networks is extended by defining and testing several heuristics to define selection criteria to detect the critical nodes of the WAN.In addition to heuristics based on genetic algorithms and simulated annealing, custom heuristics based on node damage and node betweenness are defined. The most effective heuristic is a multiattack heuristic combining both custom heuristics. Results obtained are of importance not only for advance in the understanding of the structure of complex networks, but also for critical node detection. 展开更多
关键词 Adaptive strategy Air route networks Complex networks Intentional attacks Network robustness
原文传递
0N THE COMPLEXITY OF AN OPTIMAL ROUTING TREE PROBLEM
2
作者 堵丁柱 KER-IKo 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1989年第1期68-80,共13页
A routing tree for a set of tasks is a decision tree which assigns the tasks to their destinationsaccording to the features of the tasks. A weighted routing tree is one with costs attached to each linkof the tree. Lin... A routing tree for a set of tasks is a decision tree which assigns the tasks to their destinationsaccording to the features of the tasks. A weighted routing tree is one with costs attached to each linkof the tree. Links of the same feature have the same cost. It is proved that the problem of finding ?routing tree of the minimum cost for a given set of tasks of two features is NP-complete. 展开更多
关键词 NODE TH THE complexity OF AN OPTIMAL ROUTING TREE PROBLEM
原文传递
Nonreciprocal optical routing via a magneto-optical phased array on silicon
3
作者 WEI YAN XIAOYI SONG +7 位作者 DI WU YUCONG YANG ZIXUAN WEI ZIJIAN ZHANG TIANCHI ZHANG JUNXIAN WANG JUN QIN LEI BI 《Photonics Research》 2025年第9期2432-2441,共10页
Nonreciprocal optical devices are key components in photonic integrated circuits for light reflection blocking and routing.Most reported silicon integrated nonreciprocal optical devices to date were unit devices.To al... Nonreciprocal optical devices are key components in photonic integrated circuits for light reflection blocking and routing.Most reported silicon integrated nonreciprocal optical devices to date were unit devices.To allow complex signal routing between multiple ports in photonic networks,multi-port magneto-optical(MO)nonreciprocal photonic devices are desired.In this study,we report experimental demonstration of a silicon integrated5×5 nonreciprocal optical router based on a magneto-optical phased array.By introducing different nonreciprocal phase shifts to planar photonic waveguides,the device focuses light to different ports for both forward and backward propagation directions.The device shows designable nonreciprocal optical transmission between5×5 ports,achieving 16 dB isolation ratio and-18 dB crosstalk. 展开更多
关键词 nonreciprocal optical routing silicon integrated nonreciprocal optical router magneto optical phased array photonic networksmulti port photonic integrated circuits complex signal routing unit devicesto nonreciprocal optical devices
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部