欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
我们学习与表示在二个节点之间的交通的连接重量在 scale-freenetworks 宣传进程的详细恶意的代码。propagatingvelocity 很快到达一座山峰，这被发现然后，在一条幂定律的腐烂形成，它与在未加权的网络大小写中的知道 thewell 的结果不同。模拟结果证明有 largerstrength 的节点是优先的被感染，但是层次动力学清楚地没被发现。Thesimulation 结果也证明网络的重量的那更大的分散导致 slowerpropagating，它显示那恶意的代码在一样的条件下面比在加权的没有规模的网络在未加权的 scale-freenetworks 快速宣传更多。这些结果 notonly 显示出那重量影响恶意的宣传的网络而且连接的拓扑学进程。
英文摘要：
We study the detailed malicious code propagating process in scale-free networks with link weights that denotes traffic between two nodes. It is found that the propagating velocity reaches a peak rapidly then decays in a power-law form, which is different from the well-known result in unweighted network case. Simulation results show that the nodes with larger strength are preferential to be infected, but the hierarchical dynamics are not clearly found. The simulation results also show that larger dispersion of weight of networks leads to slower propagating, which indicates that malicious code propagates more quickly in unweighted scale-free networks than in weighted scale-free networks under the same condition. These results show that not only the topology of networks but also the link weights affect the malicious propagating process.
同期刊论文项目
同项目期刊论文
期刊信息
位置：