probabilistic networks 中文意思是什麼

probabilistic networks 解釋
隨機網路
  • probabilistic : adj. 1. （天主教教義）蓋然論的，或然說的。2. 概率的，幾率的。
  • networks : 廣播電視網
  1. 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的總傳導率之比。
  2. A conformation algorithm for wireless sensor networks with strong probabilistic connectivity robustness

    一種大概率強連通魯棒性的無線傳感器網路構造演算法
  3. Two spatially registered images with different focuses are decomposed into several blocks. then, three features reflecting the clear level of every block, i. e., spatial frequency, visibility, and edge, are calculated. finally, artificial neural networks, i. e., multilayer - perceptron, radial - basis function, probabilistic neural network, are used to recognize the clear level of the corresponding blocks to decide which blocks should be used to construct the fusion result

    具體實現過程概述如下：首先將兩幅（或多幅）配準圖象進行分塊處理，提取兩幅圖象中對應塊的能反映圖象清晰度的三種特徵，即空間頻率、可見度和邊緣，將特徵歸一化後送入訓練好的神經網路進行識別，根據得到的結果依據「誰清晰誰保留」的原則構成融合的圖象。
  4. We can also see that these algorithms have better performance than the majority algorittim and compete algorithm, which are classic probabilistic algorithm in system level fault diagnosis. a distributed hierarchical diagnosis algorithm is discussed for virtual private networks

    對于診斷正確率，貪婪演算法遠遠好於majority演算法，並好於compete演算法；對于時間復雜度，與majority演算法相當，均為o （ n ~ 2 ） ，要好於compete演算法。
  5. 20 leighton f t, ma y, suel t. on probabilistic networks for selection, merging and sorting

    在這方面， mediator例子是一個很好的基準程序，因為它具有相當的復雜和異構的資源需求。
分享友人
分享到 Line

分享到臉書