polynomial algorithm 中文意思是什麼
polynomial algorithm
解釋
多項式演算法- polynomial : adj. 1. 【動、植】多詞學名的。2. 【數學】多項式的。n. 1. 【動、植】多詞學名。 2. 【數學】多項式。
- algorithm : n. 【數學】演算法；規則系統；演段。
-
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近似演算法（現有的求解圖的最大二等分問題的最好的多項式時間近似演算法）得到的解的性能幾乎沒有差異 -
A gmres based polynomial preconditioning algorithm
的多項式預處理廣義極小殘差法 -
Hence an algorithm for the minimal polynomial of a block circulant matrix over the field is presented
） bner基，從而給出了求塊循環矩陣的極小多項式的演算法。 -
An algorithm for finding the minimal polynomial of a fls r - circulant matrix
循環矩陣的極小多項式的演算法 -
Firstly, we generalize and analyze the advantages and present research of elliptic curve cryptography ; secondly, we study the basic theory of the ecc ; thirdly, we illustrate the safety of the ecc and discuss the elliptic curve key agreement scheme, elliptic curve encryption scheme and elliptic curve digital signature algorithm ; fourthly, we study fast algorithms of the multiplication and inversion multiplication of the element of in the underlying finite field f2m whose characteristic is two represented by the two basis of optimal normal basis and polynomial basis. we make improvements to the fast algorithm of the polynomial basis multiplication by hankerson and base on the experiments, we describe the properties and compare the advantages of the multiplication and inversion multiplication of the elements in f2m field under optimal normal bases and polynomial basis. results concluding from the study car be used as references in the realization of the elliptic curve cryptosystem ; fifthly, we overview the current fast algorithm of point multiplication, improve the fix base point comb algorithm, advance the speed of the whole system and remark the advantages and disadvantages of the popular algorithms based upon the experimental datas ; sixthly we realize the algorithm library of elliptic curve cryptography based on the f2m. only change slightly in our algorithm library can we realize the ecdh, eces, ecdsa based onf2m of anysize ; seventhly, we realize the ecc on two secure elliptic curves, including ecdh, eces, ecdsa
本文首先介紹並分析了橢圓曲線密碼體制的優點及研究現狀；其次研究了橢圓曲線密碼體制的基本理論；第三，分析了橢圓曲線密碼的安全性並介紹了密鑰共享，加密，數字簽名等橢圓曲線密碼體制；第四，深入研究了特徵為2的有限域f _ 2m中的元素在多項式基和最優正規基表示下的乘法運算和乘法逆運算的快速演算法，並對hankerson等人提出的多項式基下的乘法運算的快速演算法作了改進，而且在實驗的基礎上不僅分析研究了f _ 2m域中元素在多項式基和最優正規基表示下的乘法和乘法逆運算的性能，還對這兩種基表示下的f _ 2m域中元素運算效率的優劣作了比較和研究，所得的結論可供在實現橢圓曲線密碼體制時參考；第五，研究了目前流行的計算橢圓曲線標量乘法的快速演算法，同時改進了固定基點梳形法，提高了整個系統的速度，並在實驗的基礎上分析研究了流行演算法的優劣；第六，實現了基於f _ 2m的橢圓曲線密碼體制的演算法庫，在我們的演算法庫中只需稍微改變便能實現基於任意尺寸的f _ 2m上的ecdh ， eces ， ecdsa等橢圓曲線密碼體制；第七，實現了兩條安全橢圓曲線上的橢圓曲線密碼體制，包括ecdh ， eces ， ecdsa 。 -
Firstly, a 52 degree univariate polynomial equation is deduced by using resultant elimination method. 6 extraneous roots are found during the process to obtain the other 3 variables by using euclidean algorithm
首先使用結式對4個多項式方程直接消元，得到1個一元52次的多項式方程，再用輾轉相除法求其他3個變量，在此過程中發現了6個增根。 -
A polynomial time algorithm in positive define geometric programming with constraints
約束正定式幾何規劃的一種多項式時間演算法 -
An infeasible path - following algorithm is constructed, and its polynomial complexity is analyzed. numerical tests show the self - adjusting effect of the parameters
基於這組方程，文中建立了一個求解線性互補的不可行內點演算法，並分析了它的多項式復雜度。 -
The genetic algorithm with load balance can solve routing problem and can be applied in mobile ip and next hop route. chapter 4 collaborates on routing problem via a designated node. due to the excellent performance in nondeterministic polynomial problem, such as tsp, we choose the genetic algorithm to implement triangle routing in mobile ip protocol
本文第三章提出了基於矩陣編碼的遺傳演算法的最低費用的下一跳路由，解決浙江大學博士學位論文了下一跳路由中不考慮網路負載和時延可能產生擁塞的問題，優化了網路的性能，使得網路中的帶寬得到合理分配。 -
In the terms of interpolation, the image reconstructed from nearest interpolation or linear interpolation has good edge but serious noise ; reconstruction from 4 * 4cubic interpolation or three b - spline or three - order lagrange interpolations has better local character. 2 x 2cubic interpolations which has both better edge and local character is the ideal interpolation, the following is the basic principle during reconstruction : ( 1 ) the more width of interpolation, the more number of summation and the more order of interpolation polynomial, the higher of density resolution ; ( 2 ) the more of interpolation polynomial and width of interpolation, the more of reconstruction time simultaneously, aimed at eliminating the effects of noise contained in projection data, in this paper, author analysis cause and effects of common artifacts. importantly, discusses convolution back - projection reconstruction algorithm with a shift axis of rotation has been derived for correcting images that acquired with a divergence axis of rotation using the fan beam geometry with an angle - equaled detector
在ct圖像重建時，選擇有限帶寬窗有較好的空間解析度，三角形窗有較好的密度解析度，選擇餘弦窗則使得空間解析度與密度解析度的折衷；從窗函數的頻譜角度來講，可以用於圖像重建的一個良好的卷積窗函數應該具備以下條件： （ ? ）小的3db帶寬b ，即最小的主瓣寬度； （ ? ）最小的旁瓣最大峰值a ； （ ? ）最大的旁瓣峰值衰減速度d ；就內插函數而言，臨近點內插與線性內插重建圖像噪聲大，但有較好的邊緣與細節； 4 4三次內插、三次b -樣條與四次拉格朗日多項式內插圖像平滑，局部特性較好。 -
In order to improve their speed, " fast polynomial multiplication algorithm " and " fast algorithm of r - circulant matrix inversion " are proposed, which offer obviously computational advantages
本文提出了「快速多項式乘法運算」演算法和「 r -循環矩陣快速乘逆運算」演算法，用以提高這兩種運算的速度，具有明顯的速度優勢。 -
Firstly, a 0 - 1 integer programming mathematical model is constructed to describe tail - number - assigning work happened in domestic airline, since the problem is npc, a unified polynomial algorithm which satisfies engineering requirement is unavailable. illuminated by the practical experience, a specific tna problem is classified into one of three typical tna modes : tna based on fleet dispatching commands, tna based on fleet balance application, tna based on minimum fleet requirement ; secondly, by simplifying and relaxing some minor constraints, corresponding mathematical models and heuristic algorithms are reconstructed for each typical tna mode ; finally, computing complexities are discussed
為此論文在借鑒手工編制排班計劃經驗的基礎上，將一個具體的飛機排班問題，歸結為三種典型排班模式中的一種，即：基於飛機調度指令要求的排班問題，基於飛機使用均衡要求的排班問題和基於最少需用飛機數的排班問題，對于每種典型的飛機排班模式，在對次要的約束條件進行簡化、松馳的基礎上構造出相應的能夠滿足工程應用要求的啟發式演算法，並分析了演算法的復雜性。 -
The parametric speed of the curve is firstly approximated by the bezier polynomial which takes the lengths of control polygon ' s edges of the direction curve of normal as bezier coordinates. then the corresponding geometric offset approximation algorithm is given. moreover, an offset approximation with high precision is obtained by degree elevation of the direction curve of normal
首先利用以法矢方向曲線的控制多邊形邊長為b zier縱標的b zier多項式來逼近曲線的參數速度，給出了相應的幾何等距逼近演算法，進一步結合法矢方向曲線的升階獲得了高精度逼近 -
Based on the idea of subordinate meshes, we bring forward a new method of weighted volume which is used for constructing linear interpolation polynomials. besides, according to the eno interpolation on unstructured grids, a class of linear interpolation polynomial is developed on irregular quadrilateral grids and allows very small oscillation. program in fortran is given for a remapping algorithm developed by caiqingdong
另外，根據非結構網格的eno插值的思想，構造了四邊形網格網眼內的線性插值多項式，由於利用其插值點自適應選取的特性，在物理量變化劇烈區域選取最光滑區域的點來插值，雖然不能保持單調性，但只允許出現非常小的振蕩。 -
Inimum network problem and its time - based polynomial algorithm
最小網路問題及其多項式時間演算法 -
A polynomial algorithm for minimum - cardinality feedback vertex set problem in outerplanar graphs
一個求外平面圖最小反饋點集的多項式時間演算法 -
That is to say, we can not use any polynomial algorithm to solve this kind of problems
也就是說，不能用任何已知的多項式演算法求解這種問題。 -
Four special capacity expansion problem of undirected network were discussed and the responsible strongly polynomial algorithm was get
討論了無向網路容量擴充的4種特殊問題，給出了相應的強多項式演算法 -
Furthermore, the vertex - neighbor - scattering number of trees is discussed in details. the main contents of chapter 4 are the introduction of edge - neighbor - scattering number of graphs, the edge - neighbor - scattering number values of several simple graphs and a polynomial algorithm of the edge - neighbor - scattering number of trees
第四章主要定義圖的邊鄰域離散數，給出一些基本圖的邊鄰域離散數值，圖的邊鄰域離散數的界，樹的邊鄰域離散數的一個多項式演算法。 -
Abstract : in this paper, we discussed a new kind of single machine scheduling problems with controllable processing times. the objective function being considered was the sum of weighted completion times of all jobs plus the maximum dissatisfaction of all jobs ' processing times that deviated from their specified ones. we presented a polynomial algorithm to solve the problem
文摘:本文討論了一類新的加工時間可控的單機排序問題.我們所考慮的目標函數由所有工件的加權完工時間之和與對所有工件的實際加工時間偏離額定加工時間的最大不滿意程度這兩部分組成.對此問題，我們提出了一個多項式演算法
分享友人