最優近似 的英文怎麼說

中文拼音 [zuìyōujìnsì]
最優近似 英文
best fit approximation
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 近 : Ⅰ形容詞1 （空間或時間距離短） near; close 2 （接近） approaching; approximately; close to 3 （親...
  • 最優 : optimal; optimum最優策略 optimal policy; optimal strategy; 最優設計 optimum design; 最優值 optima...
  • 近似 : approximate; similar; approach; approximation; roughness; propinquity
  1. 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

    優化關聯規則允許在規則中包含未初始化的屬性.優化過程就是確定對這些屬性進行初始化，使得某些度量最大化.最大化興趣度因子用來發現更加有趣的規則;另一方面，允許優化規則在前提和結果中各包含一個未初始化的數值屬性.對那些處理一個數值屬性的演算法進行直接的擴展，可以得到一個發現這種優化規則的簡單演算法.然而這種方法的性能很差，因此，為了改善性能，提出一種啟發式方法，它發現的是近似最優的規則.在人造數據集上的實驗結果表明，當優化規則包含兩個數值屬性時，優化興趣度因子得到的規則比優化可信度得到的規則更有趣.在真實數據集上的實驗結果表明，該演算法具有近似線性的可擴展性和較好的精度
  2. This paper adopts an adaptive learning algorithm based on hierarchy clustering to update user profile, which continuously abstract the cancroids of one class of optimum information from the feedback flow of system, which effectively shield the learning process from plenty of feedback noises produced by distorted threshold and sparseness of initial information, which also can imitate artificial feedback approximately to perfect the intelligence of adaptive learning mechanism

    摘要本文採用一種基於層次聚類的自適應學習策略，從系統反饋的信息流中，動態提取一類最優信息的質心更新用戶模型，有效屏蔽了閾值失真和初始信息稀疏造成的大量反饋噪聲，並且能夠近似模仿人工反饋，完善自適應學習機制的智能性。
  3. The parameter control methods are very similar to penalty function methods, both of them are to solve constrained optimization problems by solving a series of sub - unconstrained optimization problems. but parameter control methods are different from penalty function methods. firstly, the penalty coefficient of penalty function methods are preassigned, while the parameters of parameter control methodsare generated automatically according to some rule prescribed

    參數控制演算法雖然與罰函數法非常類似，都是通過求解一系列無約束極小化問題來逼近約束優化問題的最優解，但罰函數法中的罰因子是預先設定的，而參數控制演算法中的參數是自動產生的。
  4. Constructing an evolutionary tree is a typical np - complete problem, therefore it is of great significance to construct an algorithm capable of getting optimal approximate solutions

    發生樹的構建問題是一個np完全問題，因此，研究構造發生樹的近似最優演算法有著重要意義。
  5. Bell system technical, 1970, 49 : 291 - 307. 10 wu f, huberman b a. finding communities in linear time : a physics approach. eur

    本質上， dm演算法是一種啟發式的貪心優化演算法，它採用局部搜索方法能逐步逼近地為預先定義的目標函數找到一個近似最優解。
  6. Finally, in the third section, by constructing some functional which similar to the conservation law of evolution equation and the technical estimates, we prove that in the inviscid limit the solution of generalized derivative ginzburg - landau equation ( ggl equation ) converges to the solution of derivative nonlinear schrodinger equation correspondently in one - dimension ; the existence of global smooth solution for a class of generalized derivative ginzburg - landau equation are proved in two - dimension, in some special case, we prove that the solution of ggl equation converges to the weak solution of derivative nonlinear schrodinger equation ; in general case, by using some integral identities of solution for generalized ginzburg - landau equations with inhomogeneous boundary condition and the estimates for the l ~ ( 2 ) norm on boundary of normal derivative and h ~ ( 1 ) ' norm of solution, we prove the existence of global weak solution of the inhomogeneous boundary value problem for generalized ginzburg - landau equations

    第三部分：在一維情形，我們考慮了一類帶導數項的ginzburg ? landau方程，通過構造一些類似於發展方程守恆律的泛函及巧妙的積分估計，證明了當粘性系數趨于零時， ginzburg ? landau方程的解逼近相應的帶導數項的schr （ ? ） dinger方程的解，並給出了最優收斂速度估計；在二維情形，我們證明了一類帶導數項的廣義ginzburg ? landau方程整體光滑解的存在性，以及在某種特殊情形下， gl方程的解趨近於相應的帶導數項的schr （ ? ） dinger方程的弱解；在一般情形下，我們討論了一類ginzburg ? landau方程的非齊次邊值問題，通過幾個積分恆等式，同時估計解的h ~ 1模及法向導數在邊界上的模，證明了整體弱解的存在性。
  7. Kalman filter is an optimal filter algorithm in the minimum - mean - square - error sense, meanwhile extended kalman filter is a sub - optimal filter algorithm, which derived from the linearization of nonlinear system using taylor expansion. while the non - linearity of the system is not extreme strong, ekf can achieve approximately optimal filter effect

    Kf是最小均方意義下的最優濾波演算法， ekf則是利用一階泰勒展開將非線性系統線性化而得到的一種次優濾波演算法，在非線性不是特別嚴重的情況下， ekf有著近似最優的濾波效果。
  8. For the purpose of discovering the near - globally optimal solution, this paper proposed a hybrid approach of ant colony algorithm and sequential quadratic programming ( sqp )

    摘要為了獲得整體近似最優解，提出採用蟻群演算法，搜索發電機可運行狀態的最優組合，並對蟻群演算法的數學模型進行分析，以參數的形式給出具有普遍意義的收斂性定理。
  9. The optimal layout scheme and design scale of the plant site are determined through the analysis and evaluation of the capacity of flood control and flood discharge of the watercourse nearby the pump house of zhongning electric power plant. this will provide use for reference for the similar water - intake engineering in the future. it has great significance for theoretical research and practicable value for application as well

    本課題通過對中寧發電廠取水泵房廠址附近河道的防洪及河道行洪能力的分析和評價來確定其廠址的最優布設方案和設計規模，對今後類似的黃河上取水泵房的設計提供借鑒，因此具有重要理論研究意義和實際應用價值。
  10. A new numerical algorithm integrating a quasi - analytic numerical algorithm with the gear numerical algorithm is used to solve the ordinary differential equations with stiff problem. to accelerate the solving of ode, the optimum step method is introduced into the composite numerical algorithm

    針對重整反應模型方程的特殊結構和剛性問題，提出了一種形式更簡單方便的近似解析數值演算法和吉爾法相結合的混合數值演算法，並引入了最優步長方法。
  11. The basic thought is to divide the cities which are close to each other into a group ( physical area ) by applying sorting neural network, find out the optimal path by the improved hnn, and then calculate the local optimal path by using the same method, and finally get the whole optimal path, which are described as following : a assembly s of cities is grouped into some subsets according to their physical location and we can get, and then get the optimal, path of tsp of s = { s, i = 1, 2, n } through the given method, as well as the st

    基本思想是利用聚類神經網路先把地理位置上相互靠近的城市劃分為一個集體單位（一個物理區域） ，用改進的hopfield神經網路演算法求解各個區域間的最優（或近似最優）路徑，然後再在每一個區域內部用同樣的方法來求解其局部的最優（或近似最優）路徑，這樣可以最終得到全局的最優（或近似最優）解。描述如下：設有城市集合s ，按城市的地理位置把s劃分為若干子摘要2集，得s ijs ， ，其中廠s ； d ， i一口求得集合i叫s s ； i習， 2 ， … n的tsp最優路徑，再依次求得子集s ；內部的tsp最優路徑，即得最終優化路徑m一） s一） …一寧s ； di
  12. Get the main conclusion as follows : when producing advantage enterprises in horizontal merger, if the figure of leaders enterprise do n ' t equal to zero, the horizontal merger motive exists, and under certain condition, this kind of horizontal merger will increase the social total welfare, this is exactly the reason why horizontal merger gets support ; when horizontal merger does not produce advantage enterprises, the condition that the motive exists is extremely harsh, and this kind of merger rises the product price and reduce the social total welfare ; when the market is couront market, if merging side ' s production capacity after merge ca n ' t reach optimum in theories satisfied, so long as its production capacity exceed the sum of optimum output of merger participate, merge motive exists, and horizontal merger will increase the social total welfare rises ; when high - level enterprises merge low level enterprises, because merging side ca n ' t get profit or those do n ' t participate in merger get more profit than merging side, motive

    得到主要結論如下:當橫向並購產生優勢企業時，原先市場的領導層企業數目不等於零時，橫向並購動機存在，而且在一定條件下，這種橫向並購會使社會福利增加，這正是橫向並購得到支持的原因所在;當橫向並購不產生上優勢企業時，動機存在的條件極為苛刻，基本上與不產生優勢企業的假設相違背，可以認為這種並購的動機不存在，而且這種並購導致產品價格上升，社會總福利降低;如果市場近似古諾競爭市場，並購后並購方生產能力不能滿足理論上的最優產量，只要其生產能力超過並購前參與並購各方的最優產量之和，那麼並購動機就會存在，而且橫向並購會導致產品價格下降，社會總福利上升;當處于高層次的企業並購低層次企業時，由於並購者不能獲利或者未參與並購者獲利增加比並購方多，並購動機不存在或者很微弱。
  13. 2 ) systematically introduced parameter estimation of distributed sources on the base of models, including the maximum likelihood estimate, least squares estimator, dspe, dispare, etc. 3 ) studied four low complexity algorithms : one order approximation, two point sources approximation, traditional beamforming and relax of parameter estimation

    2 ）在模型基礎上系統地介紹了已有分散式目標參數估計方法，包括最大似然與最小二乘演算法， dspe和dispare演算法等。 3 ）研究了四種低復雜度演算法：一階近似演算法、兩點近似的演算法、常規波束形成演算法和relax演算法，這些演算法都是次優演算法，但計算量小，具有實用價值。
  14. 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

    慮到型鋼截面的離散化，本文對多層輕鋼框架結構優化提出一種近似的處理方法，即先用準則法求得連續變量最優點，然後將其結果作為混合變量直接搜索法的初始點進行第二步優化。
  15. The search space is divided into many small areas, and each area is given a certain pheromone value. according to the state transition rules, the artificial ants move to the next solution which is generated randomly or calculated by particle swarm optimization. local search strategy is also added into psaco so that the search speed and precision is enhanced

    該演算法首先將連續對象定義域平均分成許多邊緣相互重疊的小區域，區域的稠密程度決定了演算法解的精度，每個區域賦予一定的信息素值;螞蟻根據狀態轉移規則在隨機生成的可行解與利用微粒群演算法得出的可行解之間選擇下一步要去的位置;引入局部尋優策略，加強近似最優解鄰域內的局部搜索，提高搜索速度和精度。
  16. Then, the minimum - time trajectory planning ( mttp ) for single manipulator is investigated. mttp with dynamic model constrains is presented in detail. then a algorithm of dynamic searching time - optimal trajectory based on phase - plane techniques is proposed and simulated

    其次，研究了沿指定路徑單臂最優時間軌跡規劃，先詳細介紹考慮動力學模型的最小時間軌跡精確解法，然後提出了一種基於相平面動態搜索時間近似最優軌跡的方法，並將該演算法進行了模擬實驗。
  17. The ic modulation circuits and microprocessor are used in the control unit. on the side of input of inverter, the maximum power point tracking of solar module is well realized by using a kind of thought of self - optimizing control ; on the side of output of the inverter, a kind of approximate optimum v / f control strategy is used in order to optimize the match between the output of the inverter and load of motor - pump

    在逆變器輸入側，採用自尋優控制思想實現太陽能電池最大功率點跟蹤（ mppt ） ；在輸出側，採用了v / f近似優化的控制策略，以優化逆變器輸出與機泵負載之間的匹配。
  18. Then a new system of nonlinear equations can be formed from the variation gray of same point in multiple images and the optimum solution of the system can be obtained from gauss - newton and levenberg - marquardt algorithms, so that the normal vector at that point of the surface can be defined

    再根據多幅圖像上固定位置一點的灰度值變化列多個非線性方程，以gauss - newton演算法和levenberg - marquardt演算法為基礎求非線性方程組的最優近似解，將選取點的法向量確定下來。
  19. Best fit approximation

    最優近似
  20. Then, based on the analysis of the combined forecasting precision sequence, the paper simplifies the model mentioned above, and gets an optimal model for calculating the approximate solution of the combined forecasting method, which is only a combination of two forecasting methods, and obtains the calculating formula of the optimal approximate solution. shen min ( transportation program and management ) directed by song bing liang

    將上述兩種單項預測法進行整合，首先建立了以預測方法有效性指標為目標函數的組合預測優化模型；其次在對組合預測精度序列分析的基礎上，得到了求兩組合預測方法權系數近似解的優化模型及最優近似解的計算公式； 4
分享友人
分享到 Line

分享到臉書