连通

词组短语

feed through

与连通相关的网络例句 [注：此内容来源于网络，仅供参考]

Therefore,the complicated problem is simplified into asolving procedure of a group of infinite dimensional algebra equations.In thefact,not only is a general solution of the problem obtained,but also a method tocompute the dynamic thermal stress distribution at the surface of the cavity afterthe definition of the coefficient of the dynamic thermal stress distribution isgiven.

事实上，不但得到了单连通区域或复连通区域型二维孔洞表面的动态热应力分布问题的一个一般的解析解，而且，在定义了非耦合和耦合无量纲化动态热应力分布系数后，推导出计算单连通区域或复连通区域型二维孔洞表面的动态热应力分布的方法。

The device for separating and recovering the carbon dioxide from the flue gas by dry process consists of a powder grinding device, a powder feeding device, a fluidized bed, a cyclone separator and a regeneration device, wherein, a flue gas inlet is arranged at the bottom of the fluidized bed, the powder grinding device is communicated with the lower part of the fluidized bed by the powder feeding device, the upper part of the fluidized bed is communicated with the upper part of the cyclone separator by a pipe I, the top of the cyclone separator is provided with an outlet pipe for the flue gas containing low-concentration carbon dioxide, the bottom of the cyclone separator is communicated with the upper part of the regeneration device by a pipe II, the bottom of the regeneration device is communicated with the bottom of the fluidized bed by a pipe III, and the top of the regeneration device is provided with an outlet pipe for the flue gas containing high-concentration carbon dioxide.

本发明提供一种干法分离和回收烟气中二氧化碳的装置和方法，无需分离前对烟气进行降温，而直接在高温下进行二氧化碳的吸收分离，从而避免降温过程中的能量损失；器中干法分离和回收烟气中二氧化碳的装置，由磨粉装置、给粉装置、流化床、旋风分离器和再生装置组成，所述流化床底部有烟气入口，所述磨粉装置通过给粉装置与流化床下部连通，流化床的上部通过管道I与旋风分离器的上部相连通，旋风分离器的顶部有低二氧化碳浓度烟气出口管道，旋风分离器底部经过管道II与再生装置的上部连通，再生装置的底部通过管道III与流化床的底部相连通，再生装置顶部设有高浓度二氧化碳烟气出口管道。

In chapter four, we study the second isoperimetric connectivity of line graphs and line digraphs. For line digraphs, we show that the second isoperimetric connectivity of strongly connected line digraphs with δ≥ 2 equals its connectivity. For line graphs, we give a sufficient and necessary condition for the existence of the second isoperimetric connectivity, and we show that under the condition that the second isoperimetric connectivity exists, the second isoperimetric con

第四章研究线图和有向线图的第二等周点连通度，得到了如下结果：(1)最小度大于等于2的强连通有向线图的第二等周点连通度等于它的点连通度；(2)对于无向线图，我们给出了第二等周点连通度存在的充要条件；(3)对于第二等周点连通度存在的无向线图，它的第二等周点连通度或者等于限制点连通度或者等于最小度和次最小度的和。

Firstly, the connection matrices are strongly connected Boolean matrix, it is shown that the maximum length of limit cycles for FBAM is the period index of the product of the connection matrices. Thus, the maximum limit cycle is reachable. Secondly, two strongly connected components are connected by walks, it is proved that the maximum length of limit cycles for FBAM is the max. of the period index of the two strongly connected components if they are prime, otherwise, it is the least common multiple of the two period index. Finally, n strongly connected component are connected in succession, the method for computing the maximum length is described. By different patterns are presented to the networks, diminishing the number of the strongly connected components until only two components.

第一，连接权矩阵为强连通布尔矩阵，此时模糊双向联想记忆网络的最大极限环长度为连接权矩阵乘积的周期指数，从而极限环具有可达性；第二，两个强连通分支有路径连接，此时如果两个强连通分支的周期指数互素，那么网络的最大极限环长度为其最大者，否则，网络的最大极限环长度就等于二者的最小公倍数；第三，n个相邻强连通分支有路径连接，给出了计算最大极限环长度的方法，通过激发模式的变化，逐渐减少强连通分支的个数，直到只有两个分支。

Let G be a connected graph of order n whose algebraic connectivity, vertex connectivity, and edge connectivity are α,κ, and λ, respectively.

n阶连通图G的代数连通度、点连通度和边连通度分别记作α，κ和λ。

After the simulation system based on these algorithm for motion planning is set up, the correctness of partition principles is confirmed by many typical simulation experiments, so does the feasibility of motion planning for multi-joint robot based on topological dimension reduction method.

经过状态空间的划分，得到许多连通块，根据连通块之间的连通性的判别条件，构建特征网，最后根据搜索算法在特征网上搜索连通路径，进而从特征网上的连通路径求出机器人运动的几何路径。

In fact, on one hand, it is often found that two graphs with the same number of verticesand the same connectivity(edge-connectivity) may result in entirely different forms after a minimum disconnecting set of vertices is removed, one may be totally disconnected while the other may consist of a few very stable components, and thus be much easier to reconstruct.On the other hand, we often face this question: how easily can we disrupt a system at the least cost, on the contrary, when we set up a system, especially a communication system, we try our best to make it as stable as possible that it can be reconstructed easily if it do get disrupted .

对于两个具有相同点数，具有相同点连通度的图，从图中分别去掉使图不连通的点集后，所得图的结构可能完全不同，这是因为点连通度、边连通度和局部点、边连通度等连通性参数仅反映了系统被破坏的难易程度，而对系统遭受破坏的程度并没有明确的反映。

The minimum number of verticesof G whose removal from G results either in a graph that is no longer connected or in a trivial graph with a single vertex: at least K vertices must be removed from a graph with K-connectivity.

从图g中移去顶点使图成为一个非连通图或是单个顶点的"平凡图"的最少顶点数称为连通度。一个k连通度的图至少必须从图g中移去k个顶点才能成为非连通图。

The formatted method of rectangle NAM image representation reconstructed the ubiety of sub-pattern instance with five queues. It made connectivity operation between sub-pattern instances easier.

在对连通关系进行分类的基础上研究了子模式实例连通关系判断、连通关系搜索和连通关系遍历等基础操作，给出了各算法的时间复杂度分析。

Through the survey, Nortel -- North America's biggest maker of telephone gear -- was looking to find out how many workers around the world can be defined as "hyperconnected超连通的," or as those who have fully embraced devices like cell phones and laptops, as well as applications like e-mail or social networking sites like Facebook.

北电网络是北美最大的通讯设备制造商公司。该调查旨在了解目前全世界有多少人是&超连通&人士，或已成为手机、笔记本电脑等设备及电子邮件或Facebook等社交网站等应用工具的忠实用户。

与连通相关的网络解释 [注：此内容来源于网络，仅供参考]

communicating pipe：连通管

communicating interstices 连通的空隙 | communicating pipe 连通管 | communicating pore 连通孔隙

totally disconnected compact group：全不连通紧群

全不连通的|totally disconnected | 全不连通紧群|totally disconnected compact group | 全不连通图|totally disconnected graph

connected complex manifold：连通复流形

connected category | 连通范畴 | connected complex manifold | 连通复流形 | connected complex | 连通复形

connected asymptotic paths：连通渐近路线

connected 连通的 | connected asymptotic paths 连通渐近路线 | connected automaton 连通自动机

connected automaton：连通自动机

connected asymptotic paths 连通渐近路线 | connected automaton 连通自动机 | connected category 连通范畴

connected component：连通分量

连通分量(connected component): 无向图(undirected graph)中的最大连通子图叫做一个连通分量,例如下图中的连通分量为3强连通分量(strongly connected component): 如果有向图(derected graph)中任意一个节点都存在到达其它每个节点的路径,

connected component：连通分量,连通分支,连通支

connect-out command 连出指令 | connected component 连通分量,连通分支,连通支 | connected digit recognition 连接数字识别

totally disconnected graph：完全不连通图,全不连通图

totally disconnected compact groups 完全不连通紧群 | totally disconnected graph 完全不连通图,全不连通图 | totally disconnected group 完全不连通群

totally disconnected closed set：完全不连通闭集

totally disconnected 完全不连通的,全不连通的 | totally disconnected closed set 完全不连通闭集 | totally disconnected compact groups 完全不连通紧群

totally disconnected：完全不连通的,全不连通的

totally diffuse density 总漫射密度 | totally disconnected 完全不连通的,全不连通的 | totally disconnected closed set 完全不连通闭集