bisection 中文意思是什麼

bisection 解釋
n. 名詞 1. 兩斷，兩分，二等分，折半。
2. 【數學】平分點，平分線。
3. 平分的兩部分之一。
adj. 形容詞 -al
  1. The bisection method finds only one of them.

    二分法只求得其中之一。
  2. Next two problems illustrates a general method called a bisection argument.

    下列兩題說明一種一般的方法，稱為對分法。
  3. The bisection method applied in strength reduction method of bearing capacity of foundation

    二分法在確定地基承載力的強度折減法中的應用
  4. The numerical results show that the method can effectively solve the max - bisection problem

    數值實驗表明該方法可以有效地求解大規模的圖的最大二等分問題
  5. In traditional atm networks, the most widely used dynamic bandwidth allocation algorithm is known as “ bisection algorithm ”

    在傳統的atm網路中，使用最為廣泛的動態分配帶寬的最優演算法是二分法。
  6. Up - down bisection is an arc, horizontal type. innovative insert plates and fixing bolts are used to fix and seal fosc, and its installation is quite simple

    光纜接頭盒外形按弧線型臥式結構設計，上下對開，整體採用創新的插板卡緊結構和少量螺釘固定密封，安裝極為方便。
  7. Both theoretical proof and numerical experiments indicate that this algorithm is convergent and effective for solving large - scale semidefinite programming. in the following section, we work over the bisection problems

    數值實驗與理論分析均表明該演算法適用於求解大規模問題，且具有良好的收斂性；其次，研究了電路二等分問題。
  8. In the paper, we discuss the equation about angle bisector of intersecting line in the analytic geometry and the equation about the bisection planes of dihedral angles in analytic geometry of three dimensions

    摘要主要討論了平面解析幾何中和空間解析幾何兩相交直線夾角平分線方程及空間直角坐標系下兩相交平面的二面角的角平分面方程。
  9. The experiments show that the performance of our method is similar to the ye - 0. 699 algorithm, which is the best approximate algorithm in polynomial time. but our method can effectively solve the max - bisection problem with a large scale. 2

    數值實驗表明，該方法與ye - 0 . 699近似演算法（現有的求解圖的最大二等分問題的最好的多項式時間近似演算法）得到的解的性能幾乎沒有差異
  10. The new algorithm bases on bisection and secant iteration, which is different cuppen ' s method and newton iteration. the results of theoretical analysis and numerical testing show that convergent rant of our algorithm is obviously faster that of the classical algorithm

    該演算法以割線法迭代為基礎，明顯不同與傳統的newton迭代法，理論和數值實驗表明改進的演算法的收斂性比經典演算法好
  11. To inaugurate a series of static, semistatic and peripatetic intellectual dialogues, places the residence of both speakers if both speakers were resident in the same place, the ship hotel and tavern, 6 lower abbey street w. and e. connery, proprietors, the national library of ireland, 10 kildare street, the national maternity hospital, 29, 30 and 31 holles street, a public garden, the vicinity of a place of worship, a conjunction of two or more public thoroughfares, the point of bisection of a right line drawn between their residences if both speakers were resident in different places

    開始一系列靜止的半靜止的逍遙的理性的對話，在對談者雙方家中倘若對談者雙方住在同一處位於下阿貝街六號的「船記」飯店兼酒館經營者為w和e .康納里，基爾代爾街十一號的愛爾蘭國立圖書館霍利斯街二十九三十與三十一號的國立婦產醫院，一座公共花園，禮拜堂附近，兩條或更多的街道交叉點，連接雙方住宅的直線的中點倘若交談者各住一處。
  12. Combining multilevel scheme, spectral bisection method, kl / fm refinement, as well as multi - partitioning refinement strategy, the computing method is characterized by high efficiency, flexibility, and simplicity because it both maintains load balancing and minimizes the complexity of communication among processors

    演算法結合了多層次思想和譜分區方法、 kl fm精化演算法和多分區調整策略等技術，以保持負載平衡和減小處理器之間的通信復雜度為目標，具有高效、靈活、簡便等特點。
  13. By studying the solution to generalized effective medium satori resistivity model in laminated and dispersed shaly sand, it shows that there is a local minimum of the function about w derived from the model in the range from 0 to, and the w corresponding to the minimum varies with or w as well as other parameters, therefore, in order to ensure the iteration convergence, here, we adopt a hybrid algorithm combining newton and bisection, and the calculated result shows that using the hybrid algorithm to solve the equation about w is convergent. it is pointed out that shale distribution largely affects water saturatio n predicted by this model

    通過研究混合泥質砂巖有效介質通用satori電阻率模型的求解方法，表明模型導出的關于_ w函數在0 -區間內存在一個局部極小值，且該極小值點對應的_ w隨或_ w及其他參數的變化而變化，因此，為了保證迭代收斂，採用牛頓和二分結合的混合迭代演算法，試算結果表明利用牛頓和二分混合迭代演算法求解關于_ w的方程是收斂。
  14. There are many faults in the chaotic optimization algorithm. to solve these problems, a new method named " bisection - interpolation approach " is put forward. it has numerous advantages such as ergodicity, uniform distribution, not sensitive to the change of initial value, not sensitive to the defining range of variable, not requiring the continuation and not requiring differential of the optimized object

    該演算法和混飩一樣具有遍歷性的特點，且變量均勻分佈於定義域，對函數的定義域變化和初值的選定都不敏感，同樣也不需要函數連續、可微，對優化對象幾乎沒有特別要求，從而避兔混池優化演算法的缺點。
  15. Executing the lifting method to the equivalent programming, we present a strengthened semidefmite relaxation. as predicted by theory and confirmed by numerical experiments the tight semidefinite relaxation gives a better lower bound of circuit bisection than the one that the previous semidefinite relaxation gives

    本文先通過增加非線性約束得到原始問題的等價模型，進而對等價模型利用提升技術，提出了一個強化的半定鬆弛模型；最後，將結果推廣到更具一般性的圖的分割問題。
  16. An equivalent integral programming model and a new semidefinite programming relaxation for the max - bisection problem are given. then, we solve the relaxation with a projected gradient algorithm. coupled with the randomized method, an approximate solution of the max - bisection problem is obtained

    2 .給出圖的最大二等分問題的整數規劃模型的等價模型及其新的半定規劃鬆弛模型，利用投影梯度演算法求解該半定規劃鬆弛模型，然後利用隨機擾動演算法求得原問題的次優解
  17. In the simulation of functions, this method performs better than chaotic optimization algorithm. with the combination of bisection - interpolation approach and gauss newton levenberg - marquardt method, we optimize neural network and fuzzy inference system. taking advantage of bisection - interpolation approach, simulated annealing algorithm and genetic algorithm find the better solution than chaotic combination method

    作者通過大量的函數模擬以及將其與牛頓高斯levenberg一manquardt方法、模擬退火、遺傳演算法等常用演算法相結合，形成的混合優化演算法，對神經網路、模糊神經網路和函數進行了優化，其優化效果明顯優于混飩以及混飩混合優化演算法。
  18. An eigenvalue interlacing theorem is given and proved. each eigenpair is computed by bisection and generalized rayleigh quotient iteration. for computing all eigenvalues and eigenvectors is o ( n2r2 ), it is less than o ( n3 ), which is the computational complexity of lapack, when r n

    在計算全部特徵值和特徵向量的情況下，演算法的計算復雜性為o （ n ~ 2r ~ 2 ） ，當r n時，優于壇一一一~一續攀遨粼望廷二生掣夔lapack的計算復雜性o （ n 』 ） 。
分享友人
分享到 Line

分享到臉書