最大值演算法 的英文怎麼說

中文拼音 [zuìdàzhíyǎnsuànfǎ]
最大值演算法 英文
max's algorithm
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. And then facing the problem of the channel estimation of the adaptive modulation system, we conclude out the channel estimation algorithms on maximum likelihood ( ml ) estimation and maximum a posteriori ( map ) estimation under the condition of flat fading channel and selective fading channel in detail. to meet flat fading channel, we simulate the relationship of the ratio between the error covariance in map estimation and ml estimation and pilot symbol message length. the conclusion can be drawn from these results

    接著，對自適應調制系統中的通道估計問題難點，詳細推導了平衰落通道條件下和選擇性衰落通道條件下最大似然（ ml ）估計和最大后驗概率（ map ）估計演算法，針對平衰落通道，我們模擬了map估計和ml估計的方差與導頻符號長度的關系，模擬結果表明，錯誤方差受多譜勒頻率的變化影響最大，並且對實際的自適應調制系統，導頻符號長度的取值超過20個符號長度時， map通道估計明顯優于ml通道估計。
  2. Optimized association rules are permitted to contain uninstantiated attributes. the optimization procedure is to determine the instantiations such that some measures of the roles are maximized. this paper tries to maximize interest to find more interesting rules. on the other hand, the approach permits the optimized association rule to contain uninstantiated numeric attributes in both the antecedence and the consequence. a naive algorithm of finding such optimized rules can be got by a straightforward extension of the algorithm for only one numeric attribute. unfortunately, that results in a poor performance. a heuristic algorithm that finds the approximate optimal rules is proposed to improve the performance. the experiments with the synthetic data sets show the advantages of interest over confidence on finding interesting rules with two attributes. the experiments with real data set show the approximate linear scalability and good accuracy of the algorithm

    優化關聯規則允許在規則中包含未初始化的屬性.優化過程就是確定對這些屬性進行初始化，使得某些度量最大化.最大化興趣度因子用來發現更加有趣的規則;另一方面，允許優化規則在前提和結果中各包含一個未初始化的數值屬性.對那些處理一個數值屬性的演算法進行直接的擴展，可以得到一個發現這種優化規則的簡單演算法.然而這種方法的性能很差，因此，為了改善性能，提出一種啟發式方法，它發現的是近似最優的規則.在人造數據集上的實驗結果表明，當優化規則包含兩個數值屬性時，優化興趣度因子得到的規則比優化可信度得到的規則更有趣.在真實數據集上的實驗結果表明，該演算法具有近似線性的可擴展性和較好的精度
  3. 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近似演算法（現有的求解圖的最大二等分問題的最好的多項式時間近似演算法）得到的解的性能幾乎沒有差異
  4. The quadratic equation algorithm utilizes spa, dpa and principle of rsa - crt, converts the complicated prime factorization of a large composite number into finding the solution of a quadratic equation and gains the private key at last

    該方法綜合利用spa 、 dpa攻擊手段和rsa - crt演算法原理，將rsa演算法的大數分解難題轉化為以私鑰p或q為解的二次方程，最終獲取演算法私鑰值。
  5. The hybrid algorithm raises the convergence rate of the conjugate gradient method and solves the problem for which the convergence rate of the steepest descent method get slower when the isopleth of goal function is oblong

    這種混合優化演算法結合了共扼梯度法和最速下降法產生搜索方向，既提高了共扼梯度演算法的收斂速度，又解決了目標函數的等值線是扁長橢球時，最速下降法下降緩慢的問題，具有收斂速度快、收斂范圍大、適應面廣等特點。
  6. The asteroids are the most important small bodies in the solarsystem, and they mainly lies in the two locations - a main belt between the mars ' s orbit and the jupiter ' s and the near - earth space. the most feature of the orbits of near - earth asteroids ( neas ) is that the semi - major axes of the orbits are nearly equal to that of the earth or the perihelia distances are approximate to or even less than the mean distance between the sun and the earth, thus they could move into inside of the earth ' s orbit, so that they might close approach or even colliside with the earth ( or other planets, such as the venus, the mars, etc. ). the characteristic brings about some difficulties in the numerical research during their orbital evolution, which leads to the failure of the normalization technique in the general removal impact singularities of celestial mechanics methods and the symplectic algorithm which is successfully applied to the investigation in quality. by comparing the computation effects of several common numerical methods ( including symplectic algorithm ), and considering the nature of the movement of the small bodies, the corresponding treatments are provided here to improve the reliability of the computation

    小行星是太陽系最重要的一類小天體，主要分佈在兩個區域；火星和木星軌道之間的一條主帶和近地空間.近地小行星軌道的最大特點是其軌道半長徑與地球軌道半長徑相近，或近日距離接近甚至小於日地平均距離，其運動可深入到地球軌道的內部，這將導致該類小行星與地球（還有金星、火星等）十分靠近甚至發生碰撞.這一特徵給其軌道演化數值研究帶來一些困難，包括天體力學方法中一般消除碰撞奇點的正規化處理以及對定性研究十分成功的辛演算法都將在不同程度上失效.通過對幾種常用數值方法（包括辛演算法）計算效果的比較，根據小天體運動自身的特性，給出了相應處理措施，從而可提高計算結果的可靠性
  7. This article puts forward a solution named divide - assemble by deducing the size of bp neural network to overcome entering the local best point, the dividing process is that a big bp neural network is divided into several small bp neural networks, every small bp neural network can study alone, after all small bp neural networks finish their study, we can assemble all these small bp neural networks into the quondam big bp neural networks ; on the basis of divide - assemble solution, this article discusses the preprocessing of input species and how to deduce the size of bp neural network further to make it easy to overcome entering the local best point ; for the study of every small bp neural network, this article adopts a solution named gdr - ga algorithm, which includes two algorithms. gdr ? a algorithm makes the merits of the two algorithms makeup each other to increase searching speed. finally, this article discusses the processing of atm band - width distribution dynamically

    本文從bp網的結構出發，以減小bp神經網路的規模為手段來克服陷入局部極小點，提出了bp神經網路的拆分組裝方法，即將一個大的bp網有機地拆分為幾個小的子bp網，每個子網的權值單獨訓練，訓練好以後，再將每個子網的單元和權值有機地組裝成原先的bp網，從理論和實驗上證明了該方法在解決局部極小值這一問題時是有效的；在拆分組裝方法基礎上，本文詳細闡述了輸入樣本的預處理過程，更進一步地減小了bp網路的規模，使子網的學習更加容易了；對于子網的學習，本文採用了最速梯度? ?遺傳混合演算法（即gdr ? ? ga演算法） ，使gdr演算法和ga演算法的優點互為補充，提高了收斂速度；最後本文闡述了用以上方法進行atm帶寬動態分配的過程。
  8. Firstly, the complex characteristics of the seal images caused in the process of producing conditions are analyzed. to solve these problems respectively, the circularity clusters and the ostu method are firstly used to realize the shape classification and threshold processing of different seal images. then the image denoise is performed well by scanning beam seed filling and labeling algorithm

    論文中首先分析了印鑒圖像由於蓋印條件造成的圖像本身的一些復雜特點，提出了運用圓形度聚類和最大方差比演算法對圖像進行形狀分類和閾值處理，隨后利用掃描線種子填充演算法和貼刪標簽演算法進行噪聲的去除等預處理。
  9. In this paper, the main research works are as follows : 1 ) survey and analysis previous work in auv navigation and summarize : as the cumulate error, the dead - reckoning and inertial navigation systems ca n ' t be used without other modified system ; the acoustic navigation system is used only in small range, and is very expensive. 2 ) two important approaches in geophysical navigation techniques are summarized, one is terrain contour based navigation, this approach is investigated keystone today ; the other is image based navigation, due to no perfect image sensors and image seabed map, this approach has seldom been practised. 3 ) two important terrain contour based navigation algorithms has been applied to auv, one is match algorithm - based terrain contour match ( tercom ) ; the other is kalman filter - based sandia inertia terrain - aided navigation ( sitan )

    主要研究內容包括：一、總結分析了當前水下導航的常用方法和不足之處，指出基於航位推算的導航方法，存在著最大的問題就是導航誤差的積累問題，如果沒有修正系統，這種方法很難滿足使用要求；其次指出基於聲學的導航方法，造價昂貴，導航范圍有限，難以滿足自主水下航行器大范圍導航的需求；二、總結了當前水下地形輔助導航的主要技術路線，一是基於地形高程的匹配方法，這是當前研究的重點；二是基於地形圖像的匹配方法，由於缺乏良好的圖像傳感器，和可用的海底圖像地圖，目前這種方法還有待研究發展；三、將兩種地形高程匹配的常用方法應用到自主水下航行器上：以相關演算法為前提的地形輪廓匹配（ tercom ）方法和以卡爾曼濾波為基礎的桑迪亞慣性地形輔助導航（ sitan ）方法，前者演算法簡單可靠，但是導航精度不高，後者雖然精度比較高，但存在著演算法較為復雜、有可能發散和出現奇異值等問題。
  10. This paper develops a deterministic inventory model for perishable items with a mixture of back orders and lost sales under inflation and time discounting, where the backlogged demand rate is dependent on the negative inventory level during the stock out period. the main differences from the existing related models are that the present model takes the maximum present value of profit in a repeatable order cycle as the objective function and proposes a more practical constraint of maximum customer - waiting time to ensure a proper customer service level. then the existence and the uniqueness of the solution to relevant systems are examined and a solution algorithm is shown to find the optimal replenishment policy. at last, some numerical examples are presented to illustrate the applicatioh of the model

    本文建立了一種考慮通貨膨脹與時間價值的變質性物品的庫存模型，在模型中允許短缺發生且拖后的需求速率與在缺貨期間已經發生的缺貨量有關.和已有相關模型的主要區別在於本模型把一個可重復的訂貨周期內的最大平均利潤的凈現值作為目標函數，且增加了在缺貨期間最長顧客等待時間的限制，以確保庫存系統擁有較高的服務水平.然後討論了模型最優解的存在性與唯一性，並提供了尋求模型整體最優解的演算法.最後用實例說明了此模型在實際中的應用
  11. Then, time - variant load characteristic is decomposed and the tva load model structure is proposed to reduce the effects on the time - variation of the amplitudes of the load. finally, the group algorithm and hypothesis testing strategies are applied to solve the problem of the time - variation of the load components

    進一步對負荷特性的時變性進行分解，提出了tva負荷模型結構以消除負荷幅值大小時變性的影響，最後，採用分組演算法和假設檢驗的工程應用策略，解決了負荷組成成分的時變性問題，從而最終從一定程度上解決了負荷的時變性問題。
  12. To improve the accuracy of node trust evaluation in a distributed network, a trust model based on the experience of individuals is proposed, which establishes a new trust assessment system by introducing the experience factor and the comparative experience factor. the new evaluation system considers the differences between individuals and interactive histories between nodes, which solves the problem that nodes have inaccurate assessments due to the asymmetry of nodes to a certain extent. the algorithm analysis indicates that the new model uses different deviating values of tolerance evaluation for different individuals and uses different updating values embodying node individuation when updating feedback credibility of individuals, which evaluates the trust value more reasonably and more accurately. in addition, the proposed algorithm can be used in various trust models and has a good scalability

    為了提高分散式網路中各節點信任評價的準確度，提出了一種基於個體經驗的信任模型.該模型通過引入經驗因子和相對經驗因子的方法，建立了新的信任評價體系.這種新的信任評價體系考慮了個體節點的差異問題，在計算節點的信任值時考慮了節點間的交互歷史，這在一定程度上解決了由於節點的非對稱性而導致的信任評價不準確的問題.演算法分析表明:新模型能夠針對不同的個體節點，採用不同的最大容忍評價偏差，並且對個體節點的反饋可信度進行更新時，採用不同的更新值，體現了節點的個性化特徵，使信任評價更加準確合理.此外，所提出的新演算法能夠運用到多種信任模型中，具有很好的可擴展性
  13. The retrospective algorithm about searching augmenting path of maximum feasible flow problem

    最大可行流問題中增值鏈的一種回溯求解演算法
  14. ( 2 ) taking the geology analysis as main way and combining the pre - test, predicating the tunnel ' s main geology condition ( rock quality, surrounding rock classification, long - wide joint, fault, ground water, crustal stress ), and predicating the main potential disaster ( collapse, breaking water, rockburst, large deformation ) ( 3 ) employing the stress test result and inverse analysis of the stress field, finding out the crustal stress " s distributing rule along the tunnel axes section : the highest crustal stress is 24mpa near the deepest spot, and predicting that the k2 + 260 ~ k3 + 000 likely to be the high crustal stress segment for this tunnel

    通過地質分析、類比分析、監控量測、數值模擬、神經網路等方法，對鷓鴣山隧道潛在的主要地質災害（塌方、涌水、巖爆和大變形）進行了預測預報（ 3 ）在現場地應力測試成果的基礎上，運用數值計算進行應力場反演，基本查明了沿隧道軸線剖面的地應力分佈規律：地應力量級在最大埋深附近達到最大值24mpa ，並預測k2 + 260 k3 + 000段將很可能成為鷓鴣山隧道的高地應力段。 （ 4 ）塌方往往與斷層破碎帶及千枚巖相聯系。
  15. Experimental results show that the total measurement time is less than 0. 1 second and the maximum error of voidage measurement is less than 6 %

    實驗結果表明摘要一在0 100測量范圍內空隙率測量最大誤差可小於6 ，得到一個空隙率測量值演算法耗時小於0j秒。
  16. The reason why we integrate them is that k - means algorithm is a mountain climbing method, which is easy convergent to local extremum, and sensitive to the original condition, but its convergent speed is relatively fast, and that genetic algorithm is a random searching method, which can find the whole extremum in a rather big probability, and non - sensitive to the original condition, but its convergent speed relatively slow

    之所以將：二者結合在一起，是回為k一均值演算法是一種爬山法，容易收斂到岡部極小值，對初始條件較敏感，但收斂速度較快，而遺傳演算法是卞dl隨機搜索演算法，能夠以較大概率找到全局最憂解，且對們始條件個敏感，但收斂速度較慢。
  17. Two image mapping algorithms of the volume rendering, forward mapping and backward mapping are researched on the basis of optical model for volume rendering. combined with the characteristic of a series of section images from laser confocal scanning microscopy, the volume buffer algorithm and maximizing algorithms are proposed in this paper. 4

    同時在探討體繪制光學模型的基礎上，研究了體繪制的兩種圖像合成演算法，即由前向後演算法和由後向前演算法，並結合激光共聚焦掃描顯微成像系統序列斷層熒光圖像的特點提出了體緩沖器演算法和最大值演算法。
  18. Secondly, the dissertation proposes a novel blind symbol - timing scheme for ofdm systems based on cyclostationarity feature of received symbols. the proposed schemes also exploits the periodicity of ofdm symbol introduced by cyclic prefix, by applying 2 - dimentional fourier transformation and choosing the appropriate correlation peak value as the symbol start location, the precision of this scheme is higher than previous conventional method. thirdly, the dissertation presents analysis with regard to channel estimation of ofdm systems. several interpolation algorithm in ofdm systems which based on pilot sequence have been analyzed in the first instance, and the influence of the channel noise on interpolation precision has discussed. the theoretic analysis and simulation results show that : the interpolation error induced by the precision of interpolation procedure itself has out weight

    第三，論文在ofdm系統的通道估計方面，先對基於導頻的ofdm通道估計中的多種插值方法進行了分析，討論了噪聲對插值精度的影響，指出插值本身的精度所造成的插值誤差遠大於噪聲所帶來的插值誤差，從而階次更高的插值演算法在實用中並非最優的;並指出插值濾波法比變采樣率演算法對噪聲的影響更為敏感，在信噪比較高時插值濾波演算法比變采樣率演算法更優。
  19. 2. analyzed, simulated the effect of maximal value estimate method, coherent accumulating on ranging performance

    2 .分析並模擬了頻率估計的最大值估值演算法和相干積累對系統測距性能的提高。
  20. The mechanical system using to the new technology, engineers can build system model in computer, and simulate the characteristic of kinematics and dynamics of mechanical system on realistic condition, by the valid numeric algorithm, well - round three dimension visualization technology and standard gui technology. according to the analysis results, engineers can improve or optimize mechanical systems ? designing projects and its running process. the mechanical system virtual prototyping technology can help enterprises to reduce the trial - manufacture times of physical prototyping, so that can shorten periods of designing and producing, consequently reduce the costs and improve the quality of products

    藉助于這項技術，工程師們可以在計算機上建立機械繫統的模型，伴之以有效的數值演算法、成熟的三維可視化技術以及標準的圖形用戶界面，模擬在現實環境下機械繫統的運動學和動力學特性，並根據模擬結果改進或優化機械繫統的設計方案與工作過程，幫助企業最大限度地減少物理樣機的試制次數，從而縮短設計和生產周期，降低成本，提高產品質量。
分享友人
分享到 Line

分享到臉書