最近的逼近 的英文怎麼說

中文拼音 [zuìjìndebījìn]
最近的逼近 英文
nearest approach
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 近 : Ⅰ形容詞1 （空間或時間距離短） near; close 2 （接近） approaching; approximately; close to 3 （親...
  • 的 : 4次方是 The fourth power of 2 is direction
  • 逼 : Ⅰ動詞1 （逼迫; 給人以威脅） compel; force; drive; threaten 2 （強迫索取） extort; exert pressure ...
  • 最近 : 1. （近來） recently; lately; of late 2. （距離最近的） nearest3. （最近的將來） in the near future; soon
  • 逼近 : 1 （靠近 接近） press on towards; gain on [upon]; approach; crowd on; close in on; draw near 2 [...
  1. Its biquadratic finite element approximation is considered and under the appropriately graded meshes, quasi - optimal order error estimates in the - weighted h ^ 1 - norm, up to a logarithmic factor in the singular perturbation parameter, are proved

    然後，考慮此方程在分層網格剖分上的雙二次有限元逼近，在-加權h ^ 1 -模意義下得到了至多相差一個關于攝動參數對數因子的擬最優階收斂的誤差估計。
  2. The method proposed in this thesis do well in solving the problems of multi - damping - ratio - spectra simulation. it is convenient to obtain the pareto optimal solution set of the multi - object question by using implicit parallel genetic algorithms and the method can meet the practical needs for simulating ground motions coinciding with multi - damping - ratio - spectra in seismic design. the crossing rate and variance rate are important parameters of genetic algorithms which affect the rate of convergence, the adapting rate of cross and variation in this paper can auto - adapt and according to stand or fall of current sample, it assures the sample approach to the pareto optimal solution set in fast convergent speed

    較好地解決多阻尼比反應譜擬合問題；本文方法通過一次運行就能獲得一組具有集系特性的地震動，在擬合多阻尼比反應譜的人造地震波集系的模擬方面有傳統方法所不能比擬的優勢，產生的人造波或人造波集系可滿足工程抗震設計需要；在遺傳演算法中，交叉概率和變異概率是影響收斂速度的重要參數，本文採用的改進自適應交叉概率和變異概率，可以根據當前樣本的好壞程度來自動地選擇適當的交叉概率和變異概率，以保證演算法始終以較好的速度向pareto最優解集逼近。
  3. The optimal approximation for the pattern formed with fresnel zone plate antenna

    菲涅爾區板天線賦形波束的最優逼近
  4. Considering the characters of bp neural network, such as the simple structure, the advisable malleability, self - fitness, self - studying, nonlinear function approximating, the considerable abilities of parallel computing, fault - tolerant and so on, the bp algorithm have been extensively applied to the areas of system modeling, pattern recognition and seismic exploration since 1986. compared with other algorithms, as the above reasons, the bp algorithm has become the most usual and efficient solutions to the artificial neural networks

    由於人工神經網路中的bp神經網路結構簡單，可塑性強，具有良好的自適應、自學習、極強的非線性逼近、大規模并行處理和容錯能力等特點，自1986年rumelhart等人提出以來，被廣泛應用於系統建模、模式識別、地震勘探等重要領域。而bp演算法數學意義明確，步驟分明，是神經網路中最為常用、最有效、最活躍的一種方法。
  5. Maximum - norm superapproximation of the gradient for the tensor - product quadratic rectangular parallelepiped finite element

    張量積二次長方體有限元梯度最大模的超逼近
  6. The nurbs curves and surfaces approximation to constrained data sets is discussed in this dissertation. the major works are as follows : firstly, based on simulated annealing algorithm and least square principle, a nurbs curves approximation algorithm to constrained discrete data sets is presented

    本文討論了帶約束的離散點集的nurbs曲線、曲面的逼近問題，主要工作如下： 1基於模擬退火演算法和最小二乘法，給出了帶插值條件的離散點集的nurbs曲線逼近的演算法。
  7. Based on the " size " of the set of perturbed minimal points in the variational principle, the differentiability of lower semicontinuous functions is examined by means of approximation of the infconvolution sequence

    摘要通過函數的下卷積函數列的逼近方法，在變分原理中從擾動最小值點集的「大小」入手，研究了下半連續函數的可微性。
  8. Generalized weight approximation by maximal familieswith applications

    廣義權函數的最大類逼近及其應用
  9. Instead, with an iterative approach, an initial guess for the solution of (6. 109) is used.

    取而代之的是迭代的逼近法，並使用（6109）的解最初的估值。
  10. First, it applies fuzzy logical in the abstract and non - linear dealing ability ; second, it applies neural net in the self - study and any functions approaching ability ? through combining above two ability, it can find a best p i d non - linear controlling regularity and achieve controlling on line of the unknown subject etco therefore, it not only can strengthen robust and intelligence of the system, but also make design simple and easily be requiredo in addition, the thesis also does many works on procedure of upper - computer and basic - controller and the whole system designed can be put into work immediately

    根據啤酒發酵過程具有大慣性、時滯和非線性等特點，本論文還提出一種基於神經網路的模糊自適應pid控制方案，它一方面利用模糊邏輯的「概念」抽象能力和非線性處理能力，另一方面利用神經網路的自學習能力和任意函數的逼近能力，通過兩者的有機結合尋找一個最佳的p 、 i 、 d非線性組合控制規律，以實現對未知對象進行在線控制，並具備適應控制環境變化的能力和自學習能力等。
  11. Finally, based on the approximation capability of gengeralized multilinear fuzzy logic systems ( gmfls ), a new scheme of decentralized adaptive fuzzy controllers for a class of multiple - input - multiple - output nonlinear systems with a triangular matrix function control structure is proposed

    最後針對一類具有下三角形矩陣函數控制增益的多變量非線性系統，並利用廣義多線性模糊邏輯系統的逼近能力，提出了一種分散自適應模糊控制器設計的新方案。
  12. An optimal hankel norm approximation model reduction method is used to reduce the equations of motion to lower order size. it is shown that the method is steady, efficient by numerical emulating. firstly, the influence of viscoelastic layer thickness and material properties, piezoelectric actuator layers thickness on the vibration suppression are investigated

    採用最優hankel最小階逼近降階法對主被動混合阻尼結構的控制狀態方程進行降階，以附加主動約束阻尼層的梁結構為例，進行了數值模擬，結果表明：該方法是一種穩定的、高效的、魯棒性很好的降階方法。
  13. The feature points of the image are detected from the lowest approximation of the wavelet transform. the watermark is inserted in the wavelet coefficients corresponding to the feature points

    從圖像小波變換的最低頻逼近中檢測出圖像的特徵點位置，在特徵點對應的小波系數中嵌入水印。
  14. In training of back - propagation neural network, parameter adaptable method which can automatically adjust learning rate and inertia factor is employed in order to avoiding systemic error immersed in a local minimum and accelerating the network ' s convergence ; introduced the further optimization of the network ' s structure, it gives the research result of selection of the hidden layers, neurons, and the strategy of re - learning, compared the sums of the deviation square of this algorithm with conventional bp algorithm, as a result, the approach accuracy and the generalization ability of the network were extremely improved

    在對前饋神經網路的訓練中，使用參數自適應方法實現了學習率、慣性因子的自我調節，以避免系統誤差陷入局部最小，加快網路的收斂速度；提出了優化bp網路結構的實驗研究方法，並給出了有關隱含層數和節點數選擇以及再學習策略引進的研究結果。將該演算法同傳統bp演算法的預測偏差平方和進行比較，結果證實網路的逼近精度及泛化能力均得到了極大的提高和改善。
  15. " the last away match, against the romagnoli, ended in a draw, at the end of a suffered and intense match : cesena confirmed that they are a good team, that ' s why they defeated teams like genoa, and we know how the motivations double up when the opponent is juventus

    「最近的比賽收獲了一場平局，賽事進行的很激烈，最後我們還是被逼平了：切塞納證明了他們是一支優秀的球隊，這就是為什麼他們能夠戰勝像熱那亞這樣的球隊的原因，而我們也知道在面對尤文圖斯時他們的鬥志會更加旺盛。 」
  16. A kind of operator of trigonometric interpolation polynomials with bivariate product was constructed based on an equidistant node set, so that the operator could be converged uniformly to bivariate continuous functions with periodicity of 27 on whole plane, and the convergence order of the approximation would be optimal for a body of functions with arbitrary - ordered continuous partial deritives

    摘要構造了一類基於等距結點組上的二元三角插值多項式運算元，使得該運算元在全平面上一致收斂到每個以2為周期的二元連續函數，並且對具有任意階連續偏導數的函數全體的逼近具有最佳收斂階。
  17. Then the model is simplified, the theory of martingale, simulation, and diffusion approximations are discussed firstly. these methods are applied in the model. then get some useful results, so we can estimate the upper bound for the ruin probability and the approximation of the finite time ruin probability

    並詳細的討論了模型有限時間內破產概率和最終破產概率的估計，應用隨機過程序列弱收斂，鞅以及隨機模擬等理論，得出一些有意義的結果? ?在有限時間內破產概率的逼近表達式；最終破產概率的上界和有限時間內破產概率上界；有限時間內破產概率的隨機模擬演算法；並得到最終破產概率滿足的泛函方程。
  18. Computing result shows that : coevolutionary mdo algorithms are effective on this problem ; distributed coevolutionary mdo algorithm is better than cooperate coevolutionary mdo algorithm ; asynchronous parallel version of distributed coevolutionary mdo algorithm speeds up the optimization procedure greatly while maintains good convergence performance ; multiobjective distributed coevolutionary mdo algorithm approximates the whole pareto optimal front well in only one single run, saves much computing cost than constraint method to obtain pareto optimal set, and greatly shortens search time by distributed asyn

    計算結果表明：協同進化mdo演算法求解該問題是有效的，其中分散式協同進化mdo演算法優于合作協同進化mdo演算法；異步并行的分散式協同進化mdo演算法在保證收斂性能的同時大大加快了優化進程；多目標的分散式協同進化mdo演算法僅一次運行就很好的逼近了問題的整個pareto最優前沿，比用約束法求解pareto最優集節省了大量計算開銷，而且通過網路多臺微機的分散式并行執行大大縮短了搜索時間。
  19. Finally the convection - dominated integro - differential equations of parabolic type are considered, the optimal error estimates for the unknown c and the adjoint flux p gained in the previous parts are still hold

    最後將此方法推廣用於求解對流占優的積分微分方程問題，誤差分析表明離散格式對c ， p也具有最優的逼近精度。
  20. The attack process is segmented into three necessary phases and an improved tool called rapidly - exploring random tree is used for trajectory planning at the last approaching phase by using the concept of state - time space

    將攻擊過程劃分為三個必要的階段進行分析，並針對最後關鍵的逼近階段提出了改進的快速擴展隨機樹演算法，通過在原演算法的基礎上融人狀態一時間空間的思想，使改進后的演算法能夠有效地處理動態環境中的軌跡規劃問題。
分享友人
分享到 Line

分享到臉書