二等分

èr děnɡ fēn
  • bisect
二等分二等分
  1. 由于电路二等分问题在超大规模集成电路(VLSI)设计中的基础地位,电路二等分半定松驰问题一直引人关注。

    Fundamental in VLSI layout , the semidefinite relaxation for circuit bisection ( CB ) has been paid attention for a long time .

  2. 梯形对称二等分叶法吻合小血管

    Small vascular anastomosis with two trapezoid and symmetrical lobulated flap

  3. 第一,它可以二等分分成南部和北部。

    First , it can be split into northern and southern halves .

  4. 基于二等分放大的故障判别神经网络

    Neural Network of Fault Distinguishing Based on Halve Amplification

  5. 电路二等分问题的强化半定规划松弛

    A Strengthened SDP Relaxation of the Circuit Bisection

  6. 涡格法中二等分平板的升力和力矩的高精度解

    High-precision solutions of the vortex-lattice method for lift and moment of a halving plate

  7. 尺规作图二等分多边形面积

    Halving the Polygonal Areas with Rulers and Compass

  8. 图的最大二等分问题的非线性规划算法

    A Nonlinear Programming Algorithm for MAX Bisection

  9. 电路二等分问题的一个强化半定松驰模型

    A Strengthened Semidefinite Relaxation for Circuit Bisection

  10. 直线二等分试验;

    The line bisection test ;

  11. 本文给出了非负权图的最大二等分问题的一种近似算法,并从理论上证明了这种算法是0.488近似算法。

    A 0.488 approximate algorithm is presented in this paper for the max-bisection problem with nonnegative edge weights .

  12. 如果你期末考试的分数是你最低的分数,则二等分中的一个将被去除。

    If your score on the final is your lowest grade then one of the halves will be dropped .

  13. 介绍了一种基于二等分取样,并将预处理数据放大的故障判别神经网络。

    An artificial neural network for fault distinguishing by sampling halve is presented , and the pretreatment data are amplified .

  14. 完成了锁相频率源中的无源电路设计,包括:微带滤波器和二等分功分器。

    Then passive circuits in the proposed frequency synthesizer are designed , including : a micro-strip filter and a power splitter .

  15. 二等分物,尤指平分一个角的直线在后头骨下面以水平线分别细分。

    Something that bisects , especially a ray that bisects an angle . Subdivide with a horizontal parting below the occipital .

  16. 期末考试的成绩将被二等分,在计算成绩时每一半作为一次测验成绩计算。

    The score on the final exam will be halved and each half counts as a quiz score when calculating your grade .

  17. 将表示电路的超图转化成带权值的无向图,从而将电路二等分问题转化成图的划分问题。

    The hypergraph denoting circuit is transformed into a weighted undirected graph , so the problem of circuit bisection is transformed into the graph partition problem .

  18. 对最大割问题和图的最大二等分问题的数值实验表明:上述算法在时间和内存的利用上要优于半定规划内点算法,尤其对于大规模的半定规划松弛问题。

    The numerical examples to the max cut problem and the max bisection problem show that our method has the advantage of lower EMS memory and of lesser CPU time than the inner-point method for the semidefinite programming relaxation , especially for the large scale semidefinite programming . 2 .