路径矩阵用英语怎么说,路径矩阵的英文翻译


词语导航

基本信息

词语:路径矩阵

繁体:路徑矩陣

拼音:lù jìng jǔ zhèn

英语翻译

【计】 Boolean matrix; path matrix

分词翻译

路径的英语翻译:

method; path; route; way
【计】 path
【化】 path
【医】 pathway

矩阵的英语翻译:

matrix
【计】 matrix
【化】 matrix
【经】 matrices; matrix

翻译例句

1. 为了改善射线路径矩阵的数学性质,提出了自适应网格技术。

The self - adaptability grid technique was proposed to improve the mathematical property of ray path matrix.

2. 结合图论中的邻接矩阵,提出路径矩阵和路径子矩阵的概念及形成方法,进而提出求取可行联络线集合的算法。

A feasible tie-line set were developed on the base of adjacent matrix, path matrix and path sub-matrix.

3. 在最短路算法和传统的绝对中心点模型的基础上介绍了一种利用最小距离矩阵和最优路径矩阵求取绝对中心点的算法。

Based on the shortest path problem and classical absolute center model, an algorithm of absolute center problem is discussed, by using the least distance matrix and the optimum path matrix.

4. 定义了最小路径矩阵的几种运算,利用所定义的运算,将多源点多汇点网络系统转化为等价的单源点单汇点网络系统,并给出了由子系统可靠度精确表示网络系统可靠度的解析表达式。

Minimal path matrix are defined. Based on the special vector operations defined in this paper, reliability of the systems can be expressed exactly by those of subsystems, and the algorithm is given.

5. 结果是制度矩阵中的路径依赖模型是和参与者的心智模型相互作用导致了渐进变化。

The result is a path dependence pattern in which the institutional matrix and the mental models of the players interact to shape incremental change.

6. 本文讨论了扩张矩阵的路径,提出了一种抽取模糊规则的启发式算法。

This paper discussed the path of extension matrix and introduced a new heuristic algorithm.

7. 两个矩阵的最短路径如图所示。

The minimal path is illustrated for each matrix.

8. 为了便于计算机处理,将有向图用矩阵表示,通过有向图矩阵的乘法运算搜索最长的有向路径。

For computer processing of the directed digraph, it is expressed by a matrix, and then the longest directed paths can be obtained through matrices multiplication.

9. 计算最短路径与矩阵乘法和弗洛伊德·沃肖尔算法对以下图。

Compute shortest paths with matrix multiplication and the Floyd-Warshall algorithm for the following graph.

10. 这样,把受控变量、操纵变量在同一个矩阵中描述出来,利于应用最优控制原理求解出优化的操作路径。

In this way, the controlled variables and operating variables can be described in the same matrix, using the optimal operating path solved by the principle of optimal control.

11. 图的路径层矩阵与图的同构问题密切相关。

The path layer matrix is closely related to graph isomorphism.

12. 本文讨论了矩阵最优路径的串行和并行算法。

Discusses the sequential and parallel algorithms about matrix optimum path.

13. 为了克服这一困难,本文通过引进一个仿射变换矩阵,构造仿射投影既约预条件共轭梯度路径来搜索获得迭代方向。

In order to overcome the difficulties, we introduce an affine scaling matrix, and form the affine scaling reduced preconditional conjugate gradient path to obtain a new accepted step.

14. 在不求出DOA的情况下,采用离散傅里叶变换来估计该路径下行信道协方差矩阵。

DFT is used to estimate the covariance matrix of downlink channel of the path, not calculating DOA.

15. 本文所研究的具有相同路径层矩阵不同构的图的问题是在药品分析的实际应用领域中提出来的。

The subject of graphs having the same path layer matrix, which we are researching, arises from the drug design.

16. 对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。

This paper discusses the application of adjacency matrix at the algorithm"s analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.

17. 该算法使用位置矩阵编码方式表示所有组合路径和重计划信息。

A position matrix coding scheme was used to express simultaneously all of composite paths and re-planning information in the algorithm.

18. 在模糊环境下,模糊扩张矩阵算法根据路径的最小模糊信息熵标准,从示例中归纳产生一组模糊规则。

Under fuzzy environment, the fuzzy extension matrix approach can generate a set of fuzzy rules from examples according to the minimum fuzzy entropy criterion of the path.

19. 关键路径进度,识别和控制,项目故障及后果,关键链法,设计结构矩阵连接关键链。

Critical Path Scheduling, Identification and Control, Project Crashing and its Consequences, Critical Chain Method, DSM to Critical Chain Linking.

20. 建立图形路径和转换矩阵。

Creates a graphics path and a translation matrix.

21. 在估计出混合矩阵的基础上,利用最短路径法分离出源信号。

Then, the source signals can be recovered by the shortest path method.

22. 由相似矩阵进行模糊聚类分析,得到了汕头港地区底沙输运路径。

On the basis of these matrices, fuzzy classification analysis can be conducted and each class is souath of sediment transport.

23. 针对算法实现复杂、耗时,域间证书路径构建的效率低,基于图论的理论思想提出了一种邻接矩阵构建算法。

Since the realization of algorithms is quite complex and time-consuming, the certification path construction of cross domain has low efficiency.

24. 给定一个整数矩阵,计算其最长递增路径的长度。

Given an integer matrix, find the length of the longest increasing path.WWW.WEntiYi.CoM

25. 通过对多种现有算法的分析,利用公交换乘矩阵性质,本文提出了一种求解公交网络最优路径的标准算法。

Secondly, based on the shortest path algorithm, a public traffic network-transit matrix and a non-transfer matrix are introduced to design the public traffic transfer algorithm.

26. 基于这些初步结论,本研究利用矩阵分析与路径分析对研究结果数量化,使结果更为直观可信。

Based on these findings, the research USES matrix analysis and path analysis to get the quantitative relation of the findings, which makes the results more intuitional and credible.

27. 最后根据遍历矩阵对相关联页面进行路径合并,得出频繁路径。

Finally, all the relative pages is combined by Trace Matrix, which generates Frequent Paths?

28. 最后根据遍历矩阵对相关联页面进行路径合并,得出频繁路径。

Finally, all the relative pages is combined by Trace Matrix, which generates Frequent Paths?

版权声明:问题易所有作品(图文、音视频)均来源网络,版权归原创作者所有,与本站立场无关,如不慎侵犯了你的权益,请联系我们告知,我们将做删除处理!