助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   网络邻接矩阵 的翻译结果: 查询用时:0.143秒
图标索引 在分类学科中查询
所有学科
公路与水路运输
更多类别查询

图标索引 历史查询
 

网络邻接矩阵
相关语句
  “网络邻接矩阵”译为未确定词的双语例句
     In order to realize the message-passing and the communication among different sub-networks during the distributed traffic network simulation, some kinds of adjacent and turning matrixes to represent network connections are designed and therefore a message matching algorithm is put forward in the paper.
     为实现路网交通流分布式并行模拟中不同子网之间的消息传递和通讯,设计了表征网络连接关系的网络邻接矩阵、转弯矩阵,并在此基础上提出了实现消息匹配的地址搜索算法。
短句来源
     Firstly all the minimal path sets of source-destination node pairs in the network are calculated using optimized node-traversal method and direct disjoint method according to adjacency matrix and network structure parameters matrix. Then connectivity reliability of source-destination node pairs is obtained through probability solution.
     根据网络邻接矩阵和结构参数矩阵用遍历法和不交化法计算出所有源宿点对的最小路集,通过概率求解得出各源宿点对的连通可靠度,进一步计算出网络的平均故障间隔时间、故障频率和维修频率.
短句来源
  相似匹配句对
     Application of the Adjacency Matrix
     邻接矩阵的应用
短句来源
     Realizing Algorithms of ABNET Based on Adjacency Matrix
     抗体网络基于邻接矩阵的算法实现
短句来源
     To Find Function Matrix by Terminal Adjacency Matrix of Network Digraph
     求解网络函数矩阵的终点邻接矩阵算法
短句来源
     Topology Structure of Object Network Reproduced by Adjacency Matrix
     运用邻接矩阵法重现目标网络拓扑结构
短句来源
     ON THE MATRIX ANALYSIS OF NETWORKS
     关于网络矩阵分析
短句来源
查询“网络邻接矩阵”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


In this peper, an algorithm using an operation "*" between the known vector B and edjacency matrix R is developed. All baths of PERT network can be obtained. It proves that the developed algorithm has a polynomial upper boUnd at the time, and can also be easily mounted on computers.

本文给出了利用网络邻接矩阵间的运算,求PERT网络所有线路的矩阵方法。本算法属多项式算法,计算简单,易于计算机实现。

Two algorithms for reliable routing identificationAdjacent Matrix Algorithm (AMA) and Dynamic Routing Algorithm (DRA) are developed in this paper. The two algorithms are based on the assumption that the communication networks have a given topology with nodes being absolutely reliable but edges being randomly failing. With the two algorithms the routing probabilities between a node pair can be computed and the optimal reliable routing be identified in the communication networks. By constructing adjacent matrix...

Two algorithms for reliable routing identificationAdjacent Matrix Algorithm (AMA) and Dynamic Routing Algorithm (DRA) are developed in this paper. The two algorithms are based on the assumption that the communication networks have a given topology with nodes being absolutely reliable but edges being randomly failing. With the two algorithms the routing probabilities between a node pair can be computed and the optimal reliable routing be identified in the communication networks. By constructing adjacent matrix and some related matrices of the network, AMA can identify all the routings between a node pair with Depth-First Search, compute probabilities of all routings and determine which routing is the optimal reliable one. DRA reconstructs the optimal reliable routing at the starting point of the failed link according to the shortest path principle when a link has failed. 1fig., 5refs.

研究了对给定拓扑结构的通信网在假定节点完全可靠而边存在随机破坏的情况下,通过计算点对间的路由概率确定最佳可靠路由的两种算法———邻接矩阵算法和动态路由算法- 邻接矩阵算法通过构造网络的邻接矩阵及一些相关矩阵,利用深度优先搜索的方法找到点对间的所有路由,进而计算各路由的概率并由此确定最佳可靠路由- 动态路由算法则给出了在链路失效后,按照最短路径原则由失效链路的起始点重新构造最佳可靠路由的方法- 图1,参5-

For calculation of flow network in process simulation, the topology structure for flow network was described as an adjacency matrix and the strategy to identify flow network was studied with four sorts-series, parallel, branch and mixing, to put forward the algorithm for auto modeling and calculation of flow and pressure. It is shown that after the adjacency matrix of flow network is input, the algorithm can be employed to generate the model of flow network automatically and the practice with this method is...

For calculation of flow network in process simulation, the topology structure for flow network was described as an adjacency matrix and the strategy to identify flow network was studied with four sorts-series, parallel, branch and mixing, to put forward the algorithm for auto modeling and calculation of flow and pressure. It is shown that after the adjacency matrix of flow network is input, the algorithm can be employed to generate the model of flow network automatically and the practice with this method is successful.

为了解决化工过程仿真中管道网络计算的问题 ,本文运用邻接矩阵描述化工流程中管道网络拓扑结构 ,通过分析网络中串、并、分、汇 4种基本拓扑特征来识别管网 ,得出流量压力计算的自动建模与求解算法。利用该算法 ,只需输入管道网络的邻接矩阵 ,即可自动产生流量压力分布计算的数学模型并进行实时动态求解。并成功将它们应用于实践中 ,效果良好

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

 


 
CNKI小工具
在英文学术搜索中查有关网络邻接矩阵的内容
在知识搜索中查有关网络邻接矩阵的内容
在数字搜索中查有关网络邻接矩阵的内容
在概念知识元中查有关网络邻接矩阵的内容
在学术趋势中查有关网络邻接矩阵的内容
 
 

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