助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   边容量 的翻译结果: 查询用时:0.557秒
图标索引 在分类学科中查询
所有学科
电信技术
数学
更多类别查询

图标索引 历史查询
 

边容量
相关语句
  edge capacities
     The Synthesis of Communication Networks with Integer Edge Capacities
     边容量限定为整数的无向通信网最优综合
短句来源
     modified Gomory-Hu's method for the synthesis of communication networks is proposed,and the method for the synthesis of communication networks with integer edge capacities is given.
     给出了边容量无限制情况下无向通信网最优综合的Gomory-Hu改进方法,在此基础上提出了一种边容量限定为整数情况下的通信网最优综合方法。
短句来源
  “边容量”译为未确定词的双语例句
     The experiment shows that this method mends traditional maximum flow algorithm, and improves the quality of web communities.
     实验证明,本文给出的改进的边容量分配方法提高了所发现网络社区的质量。
短句来源
     This thesis presents the improved edge capacity assigning method for web communities identification based on the characteristics of probability distribution, and provides the new ways and thoughts which guarantee that the underlying communities can be identificated.
     本文从概率分布的角度给出了社区发现中改进的边容量分配方法,为获得高质量的网络社区提供了新思路和新途径,为有效地发现Web中潜在的社区提供了保证。
短句来源
     This paper also discusses how to find the multicommodity flows in a lossy network.
     ,max))|(n+k-1)],并且当流网络中各边容量及各源汇对间传输要求量均为整数的情况下,可获得整数流解.
短句来源
  相似匹配句对
     BUFFER CAPACITY
     缓冲容量
短句来源
     MODULUS AND CAPACITY
     模和容量
短句来源
     The Synthesis of Communication Networks with Integer Edge Capacities
     容量限定为整数的无向通信网最优综合
短句来源
     ON SEARCHING FOR AN EDGE IN A GRAPH
     寻问题
短句来源
     Edge Coloring of Planar Graphs
     平面图的染色
短句来源
查询“边容量”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  edge capacities
In a digraph with real-valued edge capacities, we pack the greatest number of arborescences in time O(n3m log(n2/m)); the packing uses at mostm distinct arborescences.
      
Many combinatorial optimization problems are solved by a sequence of network flow computations on a network whose edge capacities are given as a function of a parameter λ.
      
In the context of general graphs considering only edge capacities is not restrictive, since the vertex-capacity problem can be reduced to the edge-capacity problem.
      
We study different versions of the planar flow problem (all of which have been extensively investigated in the context of edge capacities).
      
[4] recently examined the problem of computing on line a sequence ofk maximum flows and minimum cuts in a network ofn nodes, where certain edge capacities change between each flow.
      
更多          


The concept of vulnerability of a network mean the susceptibility to attack, that is very useful for the design and analysis the network of communication networks and (ompute networks. In this paper, we will discuss the vulnerability evalulion of a directed flow network (it is denoted by DFN), two new concepts of the modified edge failure probability and the modified edge capacily are presented, and a method of resolving vertex is given. Using two new concepts and a resolvent method, we can change a DFN with...

The concept of vulnerability of a network mean the susceptibility to attack, that is very useful for the design and analysis the network of communication networks and (ompute networks. In this paper, we will discuss the vulnerability evalulion of a directed flow network (it is denoted by DFN), two new concepts of the modified edge failure probability and the modified edge capacily are presented, and a method of resolving vertex is given. Using two new concepts and a resolvent method, we can change a DFN with both edge and vertex failures into a DFN with edge capacity. Therefore, using indices for evaluting a DFN with edge capacity, we can evalule the vulnerability and property of a DFN with both edge and vertex failures.

网络脆弱性就是指一个网络受攻击后能否继续工作,及其承受破坏的能力,它对于分析和设计通讯网络和计算机网络是非常有用的。本文将讨论顶点和边均失效情况下有向流网络的脆弱性评价问题,提出了改进边失效概率,改进边容量两个新概念,给出了把一个顶点分解为两个顶点与一条边组合的分解方法。利用这两个新概念和分解法,我们可以把一个顶点和边均失效的有向流网络转换为一个仅含边容量的有向流网络,从而,利用度量含边容量的有向流网络脆弱性的指标来度量顶点和边均失效的有向流网络的脆弱性,以及评价网络的性能。

This paper deals with the multicommodity flows.We prove that if the lossless network considered here satisfies a certain condition,we can obtain a very effective algorithm for finding the multicommodity flows by using the method of transmitting flows along the paths,the upper bound of which is O[d_(pr,maax) |E(P_(le,max))|(n+k-1)].This paper also discusses how to find the multicommodity flows in a lossy network.We show a suffi- cient condition for the multieommodity flows to exist.In accor- dance with this condition,we...

This paper deals with the multicommodity flows.We prove that if the lossless network considered here satisfies a certain condition,we can obtain a very effective algorithm for finding the multicommodity flows by using the method of transmitting flows along the paths,the upper bound of which is O[d_(pr,maax) |E(P_(le,max))|(n+k-1)].This paper also discusses how to find the multicommodity flows in a lossy network.We show a suffi- cient condition for the multieommodity flows to exist.In accor- dance with this condition,we offer a polynomial-time algorithm for finding flows in the lossy networks.

本文证明对满足一定约束条件的一类无耗网络,应用沿通路送流法,可获得一个有效的求多商品流算法,其运算复杂度仅为 O[d_(pr,max)|E(P_((?),max))|(n+k-1)],并且当流网络中各边容量及各源汇对间传输要求量均为整数的情况下,可获得整数流解.本文还将上述算法推广到有耗网络中多商品流的求解问题,提出并证明了平面有耗网中多商品流存在的充分条件,据此获得一个求有耗网络多商品流的多项式时间算法.

In this paper, the vulnerability of a random hybrid capacity

本文将讨论随机混合容量网络的脆弱性、提出了改进边失效概率,改进边容量两个新概念,给出了把一个顶点分解为两个顶点与一条边组合的分解方法。利用这两个新概念和分解法,可以把一个随机混合容量网络转换为一个定常边容量网络,从而利用度量定常边容量网络的指标来度量随机混合容量网络的脆弱性。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关边容量的内容
在知识搜索中查有关边容量的内容
在数字搜索中查有关边容量的内容
在概念知识元中查有关边容量的内容
在学术趋势中查有关边容量的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社