point convergence 中文意思是什麼

point convergence 解釋
點匯
  • point : n 1 尖頭，尖端；尖頭器具；〈美國〉筆尖；接種針，雕刻針，編織針；小岬，小地角；【拳擊】下巴。2 【...
  • convergence : n. 1. 聚合，會聚，輻輳，匯合。2. 集合點；【數、物】收斂；【生物學】趨同（現象）。
  1. At any point the convergence is the angle between the meridian as represented on the plane and the n grid line.

    一點上的收斂角是子午線在平面上的投影與N坐標線之間的角度。
  2. Near point of convergence

    集合近點
  3. Convergence lines : all parallel lines in a scene will always appear to converge to a single point ( the vanishing points )

    一點透視：當物體平行或者垂直於觀察者的時候，一點透視是很明顯的。
  4. In this dissertation, we firstly prove that any dirichlet problem is indeed equal to a voltages problem of networks. we give five solutions to dirichlet problem in two dimensions ; among these five solutions, we prove that the iteration solution and the solution of relaxations are exponential convergence, then we estimate their respective convergence rates ; secondly, we discuss random walks on general networks, prove that there is an one to one correspondence between networks and reversible ergodic markov chains ; thirdly, we give probabilistic interpretation of voltages for general networks : when a unit voltage is applied between a and b, making va = 1 and vb = 0, the voltage vx at any point x represents the probability that a walker starting from x will return to a before reaching b ; furthermore, we study the relationship between effective resistance and escape probability : starting at a, the probability that the walk reaches b before returning to a is the ratio of the effective conductance and the total conductance

    本文證明了任何邊值的dirichlet問題都可轉化為求解電路電壓的問題：給出了計算平面格點上dirichlet問題的5種方法：證明了迭代法和松馳法都是指數收斂的，並分別給出收斂速度的估計；討論了一般電路上的隨機徘徊，驗證了電路與可逆的遍歷markov鏈是一一對應的；給出了電路電壓的概率解釋：當把1伏電壓加於a ， b兩端，使得v _ a = 1 ， v _ b = 0時，則x點的電壓v _ x表示對應的markov鏈中，從x出發，到達b之前到達a的概率；進一步地，給出了逃離概率與有效電阻之間的關系：從a出發，在到達b之前到達a的概率為有效傳導率與通過a的總傳導率之比。
  5. At first, in order to prevent the premature convergence of genetic algorithm effectively, the author brings forward a novel dyadic floating - point supplementary mutation operator. then, simulating the natural evolution, the author presents a novel topology, unoriented - connected topology, for parallel genetic algorithm. in the end, an interval decomposed optimization method is brought forward for ipga, which can improve the optimization performance of the algorithm

    為提高演算法的性能，作者對遺傳演算法進行三種改進：首先，為克服遺傳演算法早熟收斂，作者提出一種新的二元浮點補碼變異運算元；其次，模擬生物自然進化模式，為并行遺傳演算法提出了一個新的并行拓撲結構- - - -無定向拓撲連接；最後，作者提出一種區間分解優化思想，來提高對最優解的搜索能力。
  6. Two convergence theorems, which show that under suitable conditions evolution strategy asymptotically converges to a global minimum point with probability one, are given

    對于有界閉集上的連續函數，證明了進化策略以概率為1收斂（幾乎處處收斂）于優化問題的全局極小點。
  7. In this article, we use idea of turning dispersion into convergence and put all the well ' s points into the same unit net to think about it. and answer three questions of the distribution of well drilling by the way of searching for groups of points. fincite - step - searching underthe condition of translationg fcoordinate system or revolving coordinate system. to first question. we find two algo - rithms and make use of data that is given to find the solution. we seek coorlinate of net point is co. 361, 0. 461 ) and mostly four old well ' s points are utilized at the same time by first algorithim, which are no. 2, no, 4, no. 5, no. 10. by second algorithm, we rechon the coordinate of net point is co. 390, 0. 505 ). and that mostly four old well ' s points are utilizld which are no. 2, no. 4, no. 10. to second question, we turn it into the first question by angling awt the center of net point. we seek that mostly six old well ' s points are utilized at the same time, which are no. 1, no. 6, no. 7, no. 8, no. 9, no. 11, when net is angled 0. 78 radian. and net point is translated to ( 0. 75, 0. 076 ) ( at nwe coordinate system ). to third question, wefind a necessary and sufficient condition and affer algorithms, at last, we analyse algorithms

    運用化分散為集中的思想，把所有的井點都放在同一個單位網格內考慮.在坐標可平移、旋轉的條件下，利用尋找點群、有限步驟搜索法，對鉆井布局的三個問題進行了解答.對問題一，給出了兩個不同演算法.並對題目提供的數據進行了求解，演算法1得到的結點為（ 0 . 361 ， 0 . 461 ） ，最多有4個舊井點被同時利用，它們是第2 、 4 、 5 、 10個井點;演算法2得到的結點為（ 0 . 390 ， 0 . 505 ） ，最多有4個井點被利用，它們是第2 、 4 、 5 、 10個井點.對問題二，以結點為中心旋轉一定的角度后，歸結為問題一進行求解，求解結果為當網格傾斜角為0 . 78弧度（相對原坐標系） ，結點平移到（ 0 . 75 ， 0 . 076 ）點（在新坐標系下） ，可被同時利用的最多舊井點為6個，它們是第1 、 6 、 7 、 8 、 9 、 11個井點，對問題三，我們給出了充要條件，並給出了演算法.最後還分析了演算法的優劣性
  8. Based on the saint - venant equations describing the channel flow movement, the nonlinear algebraic equations derived by the use of preissmann weighted implicit four - point scheme are solved with the netwon - raphson method, which raises the accurate of the numerical solution, and the convergence of the numerical solution is discussed, 2

    用newton方法直接求解按preissmann加權四點格式離散擴展形式的saint - venant方程組所得的非線性代數方程組，提高了數值解的精確性，並對數值解的收斂性進行了討論。
  9. We prove the weak consistency of the estimator, which is based on the point process convergence

    基於點過程的收斂性，證明了這一估計是弱相合的。
  10. This paper discusses from the point of complete convergence the convergence of random sequences which include both i. i. d. and dependent case, such as na sequences and - mixing sequences

    這篇文章主要從完全收斂性的角度研究隨機變量序列的收斂性，不僅包括獨立同分佈的隨機變量序列，還包括不獨立的情況，例如na序列和-混合序列。
  11. An algorithm for detecting moving ir point target in complex background is proposed, which is based on the reverse phase feature of neighborhood ( rpfn ) of target in difference between neighbor frame images that two positions of the target in the difference image are near and the gray values of them are close to in absolute value but with inverse sign. firstly, pairs of points with rpfn are detected in the difference image between neighbor frame images, with which a virtual vector graph is made, and then the moving point target can be detected by the vectors ' sequence cumulated in vector graphs. in addition, a theorem for the convergence of detection of target contrail by this algorithm is given and proved so as to afford a solid guarantee for practical applications of the algorithm proposed in this paper. finally, some simulation results with 1000 frames from 10 typical images in complex background show that moving point targets with snr not lower than 1. 5 can be detected effectively

    基於運動點目標在鄰幀差分圖像中所具有的近鄰反相特徵，即運動點目標的兩個位置相鄰近、灰度值一正一負，提出一種在復雜背景下，基於紅外序列圖像的運動點目標檢測演算法.本演算法利用該特徵在鄰幀差分圖像中檢測反相點對，進而構造反相點對矢量圖，最後依據累積反相點對矢量圖中多矢量首位相接的連續性檢測出運動的點目標.文中給出並證明應用本演算法能以概率1檢測到運動點目標的收斂性定理.對典型復雜背景下10幅1000幀圖像的模擬結果表明，當信噪比大於或等於1 . 5時，可以有效檢測出運動點目標
  12. Third, by means of smale, s point estimates theorem, the existence and the convergence theorem of broyden, s iteration is given, the method has less calculation and the speed of super linear convergence for solving the nonlinear equations with nondifferential terms under the point estimates or weak condition

    第三，本文利用smale提出的點估計理論，給出了在點估計和弱條件下，用計算量小、具有超線性收斂速度的broyden方法來求解帶不可微項的非線性方程，給出了存在性收斂性定理及相應的證明。
  13. 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

    摘要遺傳演算法是一種模擬自然界進化過程的啟發式優化計算演算法，具有高效及可收斂到全局最優點的特點。
  14. Convergence and stability of fixed point the ishikawa iteration procedures for asymptotically nonexpansive mapping

    迭代程序收斂性與穩定性
  15. In this paper, we analyze difference solutions of the burgers - kdv type equations with the periodic boundary condition by use of functional analysis method. the existence of difference solutions is proved by fixed - point theorem and the priori estimates of the difference solution are obtained using interpolation formula of sobolev space. the convergence and stability are proved

    本文應用泛函分析方法對一系列burgers - kdv型方程周期邊值問題的差分解進行了分析，運用各種不動點原理證明了差分解的存在性，應用sobolev空間的離散內插公式得到了差分解及其各階差商的先驗估計，利用得到的先驗估計證明了差分解的收斂性和穩定性。
  16. At any point the convergence is the angle between the meridian as represented on the plane and the n grid line

    一點上的收斂角是子午線在平面上的投影與n坐標線之間的角度。
  17. Approximate fixed point sequences and convergence theorems for lipschitz pseudocontractive mappings in banach spaces

    偽壓縮映射的近似不動點序列及其收斂定理
  18. With cubic b - spline function taken as trial function, the solution of nonlinear stability of a revolving shallow shell with arbitrarily variable thickness was obtained by the method of point collocation in order to solve the convergence of a shallow shell with big rise

    摘要為解決計算矢高特大的扁殼的收斂問題，以三次b樣條函數為試函數，用配點法計算了任意變厚度的旋轉扁薄殼的非線性穩定。
  19. Far point of convergence

    集合遠點
  20. In this paper we construct a new interior - point homotopy method for solving fixed - point problem in nonconvex set, and prove the convergence under the weak normal cone condition ( see definition 2. 1 ( 2 ) ) and some proper conditions

    摘要本文構造了一個新的求解非凸區域上不動點問題的內點同倫演算法，並在弱法錐（見定義2 . 1 （ 2 ） ）和適當的條件下，證明了演算法的全局收斂性。
分享友人
分享到 Line

分享到臉書