We gives an algorithm for solving the shortest path of maximum capacity connecting two specified vertices u and v .
并给出了 G中两顶点 u与 v之间具有最大能量的最短路的算法 。
The amplitude ratio of the mainlobe to sidelobe of window function is an important index and so is the maximal energy ratio.
窗函数的主辨与旁辨的振幅比和最大能量比都是窗函数的重要性能指标。
By using the maximum power criterion, we can estimate and remove the residual normal moveout.
利用最大能量准则,我们能够在CMP道集上确定剩余动校正量,进而消除剩余动校正量。