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

图标索引 历史查询
 

strongly-connected
相关语句
  强连通分量
     For a geometric constraint system based on directed graph,matching direction and distribution of constraints and scale of strongly-connected sub-graphs in the directed graph affect the efficiency of constraint solving directly.
     在基于有向图表达的几何约束系统中,几何约束的匹配方向、分布状态以及有向图中强连通分量的规模直接影响到整个约束系统的求解;
短句来源
  “strongly-connected”译为未确定词的双语例句
     The Algorithm GSCA for Graph of Strongly-Connected Components
     求强分图图的算法
短句来源
     Due to the actual needs like the references and , the Algorithm for strongly-connected component of graph based on DFS technology is expanded and improved in order to make it more complete.
     由于如文献[1]和[2]等的实际需要,对基于DFS技术的求强分图算法进行扩充、改进,使之更完整。
短句来源
     Finally, the analysis approaches of fault propagation based on strongly-connected components (SCCs) are presented, which provide the theoretical foundations for the applications based on the SDG approach in the area of fault diagnosis and so on.
     最后提出了基于强连通单元(SCC)分解的故障传播分析方法,为SDG方法在故障诊断等方面的应用做了理论准备。
短句来源
  相似匹配句对
     Strongly Connected Set R in Topology
     拓扑空间中的R强连通
短句来源
     A THEOREM ON FACTORS OF STRONGLY CONNECTED COMPLEXES
     关于强连通复形的因子定理
短句来源
     The Algorithm GSCA for Graph of Strongly-Connected Components
     求强分图图的算法
短句来源
     Connected with academicians
     政府搭台,千家鲁企进京与院士、专家对接
短句来源
     V(G),the G is Hamilton—connected.
     V(G),G 中都有(a.b)—控制路,则 G 是 Hamilton—连通的。
短句来源
查询“strongly-connected”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  strongly-connected
We discovered the existence of a single large weakly-connected and a single large biconnected component, and confirmed the expected lack of a large strongly-connected component.
      
We consider several problems relating to strongly-connected directed networks of identical finite-state processors that work synchronously in discrete time steps.
      


In this paper the structure of large-scale systems is firstly discussed. It is pointed out that each such system cah be decomposed into a multi-level structure, each level of which is composed of "minimal strongly connected subsystems" and only the highest level is a "Simply connected subsystem". Then concepts "stability strength" and "Connectivity strength" are introduced. Such allows the stability conditions of the large-scale system to have simple forms of the same type, having appavent physical interpretations....

In this paper the structure of large-scale systems is firstly discussed. It is pointed out that each such system cah be decomposed into a multi-level structure, each level of which is composed of "minimal strongly connected subsystems" and only the highest level is a "Simply connected subsystem". Then concepts "stability strength" and "Connectivity strength" are introduced. Such allows the stability conditions of the large-scale system to have simple forms of the same type, having appavent physical interpretations. In the last section the stabilization problem is considered. Multilevel structure and concepts of stability strength and connectivity strength much faciliate the selection of local feedbach controllers which are minimally necessary.

本文首先研究了大规模系统的结构,指出可将大系统分解成多层结构,每一层均是“最小强相联”子系统组成的,只有最高层是“简相联”子系统组成的。然后引入子系统本身的“稳定性强度”和子系统间的“联接性强度”的概念,多层结构使得大系统的稳定性条件有相同的类型,形式简单而且有明显的物理概念。最后讨论了用局部反馈对大系统进行镇定的问题,多层结构及稳定性强度与联接性强度概念,使镇定方案简明,且便于讨论引用最少数目的反馈问题。

A new algorithm of performing the transitive closure of a directed graph is presented. Each of the strongly connected components in the graph is 'compressed' to a single node in the first place. The graph is trimmed into a spanning tree without any cycle. At the same time, all reflexive edges and forward edges are eliminated in the process. The union operation of non-disjoint sets is used to compute transitive relations of a graph. The algorithm is faster, in case e<

本文根据方向图可迁闭包的性质,通过运用“压缩”技巧,将方向图中的强连分量“压缩”为一点,对“压缩”后的图所生成的树进行简化,并采用非分离集合的并来实现可迁关系的计算,得到一个在e《N~2情况下求方向图可迁闭包的较快速的算法。

For the decentralized control system, though quite a few works about the stuctural characteristic of the system having fixed modes and the necessary and sufficient conditions of D controllability had been done in recent years, the relationship between fixed mode and D-controll-ability is nowadays being less considered. As viewed from D-controllability, the non-existence condition of fixed mode is discussed in this article in order to clarify further the interrelation between fixed mode and D-controllability....

For the decentralized control system, though quite a few works about the stuctural characteristic of the system having fixed modes and the necessary and sufficient conditions of D controllability had been done in recent years, the relationship between fixed mode and D-controll-ability is nowadays being less considered. As viewed from D-controllability, the non-existence condition of fixed mode is discussed in this article in order to clarify further the interrelation between fixed mode and D-controllability. Thus a basis can be laid down for systematically studying the stability and pole assignment problems.Summary. In accordance with D-controllability, existence conditions of a given system having no fixed mode are discussed, a sufficient condition and a necessary and sufficient condition are derived therefrom as follows.Theorem 1. Let ∑ be a system described asand ∑ be jointly observable and be possessed of D-controllability for eachwith output feedback,no fixed mode will exist in.WhereX is the n-dimensional state vector of ∑, u the i th m; dimensional input vector, yj the j-th pi-dimensional output vector, and A,Bi and Cj the real matrices having appropriate dimensions.Theorem 2. Let system ∑ described as above be jointly controllable and observable and strongly connected, then no fixed mode will exist in if and only if the given system is possessed of D-controllability for each ui, i∈{1,2,......,N}.

本文从系统D能控性的角度研究了固定模式的存在条件并给出:具有N个控制站的定常线性系统;在联合能控条件下没有固定模式的充分条件;以及系统没有固定模式的充要条件。

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

 


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

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