1) minimal breakpoint set
![点击朗读](/dictall/images/read.gif)
最小断点
2) minimum break point set
![点击朗读](/dictall/images/read.gif)
最小断点集
1.
In order to decrease the complexity of determining the minimum break point set in a large scale complicated multi-loop power networks,the whole network can be partitioned into several sub-networks in advance.
对大规模复杂环网预先进行网络分割是降低最小断点集问题计算复杂性的有效途径。
2.
Based on the directed graph of primary relay and backup relay s coordination relationships,a new method to determine the minimum break point set(MBPS)by graph simplification is proposed in this paper.
基于保护主后备配合依赖关系有向图,提出了通过有向图化简计算保护配合最小断点集(MBPS)的新方法。
3.
The key procedures to determine optimal coordination sequence of directional protection for multi-loop power network is to solve the minimum break point set (MBPS).
确定复杂环网方向保护最优配合顺序的核心步骤是求解最小断点集(minimum break point set,MBPS)。
3) minimum break point set (MBPS)
![点击朗读](/dictall/images/read.gif)
最小断点集(MBPS)
4) minimum truncation
![点击朗读](/dictall/images/read.gif)
最小截断
5) minimal point
![点击朗读](/dictall/images/read.gif)
最小点
1.
The paper has discussed iterative methods of the minimal point for the functionalfμ(x) =∫1/p‖yx-x‖pdμ(n)(where fj, -Banach limit), by use the characteristic inequality in Banach space, we have obtained conditions of weak convergence for these iterative methods, the conclusion in this paper is new in Banach spaces.
本文在Banach空间讨论泛函f_μ(x)=∫1/p‖y_n—x‖~1dμ(n)的最小点的迭代法(这里μ是Banach极限),利用空间的特征不等式,给出了算法的弱收敛性,这里的结果在这类空间是新的。
6) Minimum points set
![点击朗读](/dictall/images/read.gif)
最小点集
补充资料:最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条