ID 原文 译文
23475 从属系数用于衡量当前节点与标签所标识社区的相关度，从属系数的值越大说明该节点与标签所标识社区的关联性越强。 The dependent coefficient is used to measure the relevance of the current node with the correspondent community which is marked by the label. A greater value of dependent coefficient means a stronger association between the node and the community.
23476 在每一次迭代的过程中，算法依据贡献函数计算每个节点的从属系数，并生成新的三元组集合。 During each iteration process, the dependent coefficients are calculated through Contribution Function (CF) of each node, and new triples are produced.
23477 然后依据标签决策规则淘汰标签，进行从属系数规范化。 Then the labels in terms of decision rules are selected, and the dependent coefficients of the node are normalized.
23478 通过对真实的复杂网络和 LFR(Lancichinetti Fortunato Radicchi)自动生成的网络进行测试可知，该算法的社区划分准确率高，而且划分结果稳定。 According to the tests with real-world networks and automatic generation of LFR (Lancichinetti Fortunato Radicchi) test network, the algorithm can divide communication with high accuracy and robust result.
23479 该文针对虚拟网络映射过程中节点与链路映射关联性差、虚拟邻接节点映射距离远和相邻节点链路资源消耗不均衡的问题，提出一种两阶段的基于节点邻近感知与路径综合评估的虚拟网络映射算法(NA-PVNM)。 To solve the problems of poor correlation in node mapping and link mapping, wide apart of adjacent virtual node during mapping and imbalance resource consumption of nodes with their adjacent links, a two-stage Virtual Network Mapping algorithm is proposed based on Node Adjacent-awareness and Path comprehensive evaluation (NA-PVNM).
23480 在节点映射阶段，首先对虚拟节点按照资源请求和广度优先搜索算法排序，然后对每个虚拟节点的候选物理节点考虑资源丰富度和拓扑邻近性，建立了节点适应值函数计算最佳映射节点。 In the stage of node mapping, firstly, virtual nodes are ranked according to resources request and breadth-first search, secondly, a node fitness function is set to find the best node in candidates of a virtual node, which takes resource richness and topology connection feature into account.
23481 在链路映射阶段，采用 k 最短路径算法，对每条候选路径考虑可用带宽、途经物理节点资源最大值和路径跳数，通过路径适应值函数计算最佳路径。 In the stage of link mapping, a path fitness function is set to find the best path in candidates, which takes available bandwidth, node resource and hops of path into account.
23482 仿真结果表明算法降低了链路映射长度，提高了虚拟网络请求接受率和收益开销比。 Simulation results show that the path distances of virtual links are reduced, the acceptance ratio and revenue/cost ratio of virtual networks are improved using the proposed NA-PVNM algorithm.
23483 实验分析了位置约束和物理网络拓扑性质对算法性能的影响以及映射过程中物理网络资源占用情况。 The influence of location constraint and substrate topology feature on algorithm performance, and the resource occupancy of substrate network during mapping are analyzed by experiments.
23484 实验结果表明，在物理资源分布和虚拟网络请求的条件约束下，提高虚拟网络映射成功率的关键在于减少映射时的资源消耗。 Experimental results show that, under the constraint of physical resource distribution and virtual network requests, the critical factor of improving success rate is to reduce resource consumption during mapping.