1) power law graphs
幂率图
2) power graph
幂图
1.
It is proved that the power graphs of any triangulated graph are still triangulated graphs when the power exponents are odd positive integers.
证明了弦图的奇次幂图仍为弦图,举例说明了弦图的偶次幂图不一定是弦图,从而证实了R。
2.
Based on Granular Computing Theory of Rough Set,power graph,granularity-power graph and binary granules are defined.
以粗糙集理论发展的粒计算理论为基础,定义了幂图、粒度幂图及二进制粒等概念,提出基于二进制粒计算与粒度幂图的两种属性约简算法,把属性约简问题转化为在粒度幂图中的搜索问题,为属性约简开辟了新的途径。
3.
As problem solving under different knowledge representations corresponding to different difficulties,the new knowledge representation,called power graph,is presented in this paper.
文中从改变属性约简问题的知识表示入手,提出了该问题的一种新的表示方式——幂图;给出了基于幂图的属性约简搜索式算法,把属性约简计算问题转化为在幂图中的搜索问题。
3) power law
幂率
1.
A simulation is carried out and some complex phenomena, such as phase transitions and power laws, are discovered.
基于 Transit- Stub分层网络拓扑结构模型 ,提出了一个相对复杂的计算机网络模型 ,并通过对仿真结果的处理 ,揭示并分析了其中存在的诸如相变、幂率等复杂性现象 ,同时定性地研究了网络参数的影响。
2.
Many characteristics of topology are analyzed with the corresponding metrics, including power law.
对包括幂率(power law)在内的多种Internet拓扑特征及其相应度量进行了分析,对现有的拓扑模型、拓扑生成算法以及拓扑生成器进行了全面的综述。
3.
Analysis results show that the network topology of every country has similar properties on several metrics,that different from the research results of AS-level topology the power law does not in strict sense fit the degree distribution of the main Asia-Pacific countries\' topologies and that Japanese network size is larger while its average path length is shorter.
与AS级拓扑的结论不同,幂率不能在严格意义上描述亚太主要国家网络拓扑的度分布。
4) power-law
幂率
1.
We find that the number of the friends at different weight follows a power-law with exponent equal 1 for every one.
通过计算发现,对于每个个体,他们的不同权重的朋友的数目服从指数为1的幂率分布,为建立个体友谊圈的含权网络提供了一种可能的模式。
2.
So the conclusion can be drawn that the CMV-HOT model satisfies the power-law nature and the small world nature at the same time,it has high veracity and practical worthiness in the network research area.
因此模型能同时满足幂率特性和小世界特性,在网络研究中具有极高的准确性和实用价值。
5) power
[英]['paʊə(r)] [美]['pauɚ]
功率率幂
6) Cographs of the power of cycles
圈幂补图
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条