最優點 的英文怎麼說

中文拼音 [zuìyōudiǎn]
最優點 英文
optimal point
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  1. " body gamma knife is mainly used for curing all kinds of body tumors, and the latest generation three - dimensional directional actinotherapy devices. it incorporates many modern high - techs and effectively break through the limit of actinotherapy devices available while precisely focused and three - dimensional directional. it also has adjusted actinotherapy, wide range irradiation and common actinotherapy, and protects the normal organism from damage at best while its dosage precisely destroys tumor organism

    「體部伽瑪刀」主要用於治療各種體部腫瘤，是目前世界上最新一代立體定向放療設備，它吸收了眾多現代高新技術成果，有效地突破了現有放射治療設備的局限，兼備精確聚焦立體定位等優點，具有適形調強放療大野照射及普通放療等多種功能，能夠在劑量準確摧毀腫瘤組織的同時，最大程度地保護正常組織免受損傷。
  2. For civil purpose. the biggest advantage of the flying air boat is that it can anything that a plane can do but at the cost roughly of one tenth, the time of staying in the air is very long ranging from 24hr. - 72hr.,

    飛艇最大的優點是凡是飛機能做的事飛艇幾乎全能做，但飛行成本比飛機便宜十幾倍，留空時間長，一般飛艇空中飛行時間可達24小時- 72小時，以上這些均是大型飛艇。
  3. On one hand, numerical derivatives provide proper search directions in optimization, therefore their accuracy is of great importance for fast convergency. on the other hand, derivative evaluation is one of the most time - consuming steps in optimization

    當前的高性能數學規劃演算法大都依賴于導數計算以快速收斂到最優點，所以對求導精度的要求比較高；而導數計算所消耗的時間占優化時間的比例又非常的大。
  4. The basic idea is to find iterative points which converge to optimal point and its corresponding objective function or merit function values converge to optimal value

    其基本思想是構造迭代點來逐步逼近最優點，相應的目標函數值或評價函數值逼近最優值。
  5. The parameter control methods are in the contrast, which is to find a sequence of parameters that converge to optimal value and its corresponding points in converge to optimal solution

    參數控制演算法的基本思想正好相反，它是構造參數序列來逼近最優值，相應的迭代點列逼近最優點。
  6. And in order to optimize space arrangement, a subjection function for the set of fuzzy objects and the set of fuzzy judgements is constructed and the optimal point is also formed adopting the maximal and minimal method

    並通過構造模糊目標集和模糊判決集的隸屬函數和採用最大最小法確定多目標最優點以實現對客船空間總布置的優化。
  7. Chaotic optimization method searches optima by means of regularity, ergodicity and intrinsic stochastic properties of chaotic motion and can find out global optimum in great probability

    摘要混沌優化方法利用混沌運動的隨機性、規律性、遍歷性尋優，能以較大的概率搜索到全局最優點。
  8. Concerned the discrete area of the steel shape, a method is presented : searching the best solution of continual variable first by criteria, and next searching optimal solution by the direct - searching method of mixed variable on the original point of the continual result

    慮到型鋼截面的離散化，本文對多層輕鋼框架結構優化提出一種近似的處理方法，即先用準則法求得連續變量最優點，然後將其結果作為混合變量直接搜索法的初始點進行第二步優化。
  9. Genetic algorithm is a kind of heuristic optimal computing method that simulate the evolution process of natural world, and possessing the characteristics of high efficiency and could convergence to the overall optimal point

    摘要遺傳演算法是一種模擬自然界進化過程的啟發式優化計算演算法，具有高效及可收斂到全局最優點的特點。
  10. This paper presents an elite inheritance strategy of antibody in memory cells to strengthen the memory function and antibody concentration regulation mechanism of immune system, which can make the immune genetic algorithm ( iga ) converge to the global optimal point more rapidly and stably

    摘要提出了一種記憶細胞精英抗體遺傳策略，能強化免疫系統的記憶功能和抗體濃度調節機制，從而使免疫遺傳演算法更快速、穩定地收斂到全局最優點。
  11. Solution will convergent to optimal point of feasibility through penalty of solution outside feasible region again and again

    通過對可行域外的解進行懲罰，經過不斷迭代，使解群逐漸收斂于可行的最優點。
  12. To increase the intension coefficient, and speed up the significant evolutionary, the increases probability of arriving vector optimization is given

    因此提出增加正負進化對的進化強度系數思想，以提高演算法的運行速度，增加向最優點進化的概率。
  13. Martin ( ref. 36 ) proved the equivalence between some invexity and the case that every stationary point or kuhn - tucker point is a global minimum point for unconstrained or constrained scalar programming

    Martin在文獻[ 36 ]中，證明了無約束或約束單目標規劃中某類不變凸性與每個駐點（或k - t點）即為全局最優點的等價性。
  14. Aim at the neural network get local optimum easily, the speed of convergence is slow, the quantity of training excessive and so on. this paper adopted the ga optimize the nn firstly, and then the nn algorithm

    針對神經網路易出現局部最優點、收斂速度慢和訓練量過大等問題，本文先利用遺傳演算法對神經網路進行優化后，再執行神經網路的演算法步驟。
  15. A high precision chaotic optimization strategy was applied to parameter identification of power system static load model and the deficiency of traditional methods were effectively overcome which are easily being trapped in local optima

    將一種高精度的混沌優化策略用於電力系統靜態負荷模型參數辨識，克服了傳統的基於梯度尋優的辨識方法容易陷入局部最優點的不足。
  16. It elaborates on the 3 - step start technique. i adopt the method which permits the bldc motor to automatically search the best time to change its operation stage from a separately controlled synchronous one to a self controlled one using the back emf as the commutation signal. this method prevents the stepping out and stopping problems in the changing procedure of the motor

    闡述了電機的三段式起動方法，在直流無刷電機由起動階段外同步運行切換到反電勢換向自同步運行的過程中採用了自尋最優點切換的方法，保證了電機在切換過程中不會發生失步和停轉現象。
  17. In the design optimization of space equipment satellite systems, there are lots of discrete and integer design variables, the design space is nonconvex and even disjointed, and has multimodality. unfortunately, current mdo procedures or strategies have difficulty to deal with discrete or integer design variables, they are very sensitive to complex design space, have propensity to converge to local optima near the starting point, and can not handle multiple objectives effectively. to overcome these difficulties, this dissertation adopt the idea of coevolution to systematically develop new multidisciplinary design optimization methods based on decomposition and coordination

    論文以航天裝備體系及其它復雜飛行器系統的多學科設計優化（ multidisciplinarydesignoptimization ，簡稱mdo ）為應用背景，針對航天裝備衛星系統設計中存在大量離散和整數設計變量、設計空間非凸和不連通、具有多個局部最優點等特點和現有mdo方法過程難以處理離散和整數變量、對復雜設計空間非常敏感、易於陷入局部最優、不能有效處理多目標等缺陷，採用協同進化的思想，系統地進行基於分解協調的mdo方法研究。
  18. Problem c and problem d are also dual. they have a dual property that there are at least three " critical points " corresponding to an optimal straight - line in problem c and there are at least three " critical straight - lines " corre - sponding to an optimal point in problem d. from these properties, these four non - linear prob - lems could be transformed into combinatorial problems and could be solved by algorithms with polynomial - time iterations

    問題c和問題d也是對偶問題。問題c和問題d也有很好的對偶性質：在問題c中，對應於一條最優直線，至少存在三個「臨界點」 ；在問題d中，對應於一個最優點，至少存在三條「臨界直線」 。基於這種性質，這四個非線性優化問題便轉化為組合問題，從而得到迭代次數為多項式的演算法。
  19. At present, constrained optimization methods may be classified to two classes, one is search method which firstly asserts whether the current point is an optimal point, if the point is not, then we must choose search directions, and along the search direction, find the next iterative point which make the objective function or merit function to decrease

    目前的約束優化演算法可以分成兩大類，一類是搜索演算法，這種演算法首先判斷當前點是否為最優點，若非最優點則要確定搜索方向，然後沿此方向確定一個使目標函數或評價函數下降的點。這種演算法一般為下降演算法，如可行方向法、約束變尺度法等。
  20. Gradient - based multidisciplinary design optimization methods can not be used directly to problems with discrete and integral design variables or with disjoint design space, and they have a propensity to converge to a relative optimum closest to the starting point

    摘要現有基於梯度的多學科設計優化演算法難于處理具有離散和整數設計變量、設計空間非凸或不連通的多學科設計優化問題，並且傾向于收斂到接近初始點的局部最優點。
分享友人
分享到 Line

分享到臉書