address algorithm 中文意思是什麼
address algorithm
解釋
地址運算-
Then the thesis presents a probabilistic viterbi algorithm to segment address block and gets the character. finally, after independent chinese characters are recognized and fitted with address database, we get the address. in this way, automatic recognition of envelope ' s address is realized
對得到的地址塊提出了一種利用概率型viterbi演算法進行字元切分的方法，最後將切分好的單個字元進行識別，並與地址數據庫進行匹配，從而得到地址，進而實現了信封地址的自動識別。 -
The key to the fft algorithm is the design of butterfly computation and that of the address logic. the whole schema is designed in the top - down design flow and described in the vhsic hardware description language ( vhdl ), basing on these, we do our research on reconfigurable technology. the result indicates that the data processing ability of reconfigurable system improved greatly
結果表明，可重構系統在數據處理能力方面比以往的系統有了很大的提高，本設計實現的fft重構處理器可工作於60mhz下，完成一個16點fft需要132個主時鐘周期，完成32點fft需要324個主時鐘周期，而且具有一定可重構性，可以方便地將其運算點數進行擴展，或將其他的圖像處理演算法在實時處理系統中實現。 -
In rsdm, binary patterns are replaced by real - valued patterns, accordingly avoiding the coding process ; the outer learning rule is replaced by regression rule, therefore the model has not only the ability of pattern recognition but the ability of function approximation. the prearrangement of the address array bases on the distribution of patterns. if the distribution of patterns is uniform. then the address array is prearranged randomly, otherwise predisposed with the theory of genetic algorithm and the pruneing measure so as to indicate the distribution of patterns and improve the network performance. non - linear function approximation, time - series prediction and handwritten numeral recognition show that the modified model is effective and feasible
在rsdm中，以實值模式代替二值模式，避免了實值到二值的編碼過程：以回歸學習規則代替外積法，使該模型在具有識別能力的同時具有了對函數的逼近能力；地址矩陣的預置根據樣本的分佈採取不同方法，若樣本均勻分佈，則隨機預置，否則利用遺傳演算法的原理和消減措施來預置地址矩陣，使之反映樣本的分佈，改善網路的性能。 -
Additionally, a new address translation mechanism and related physical memory management algorithm are presented and analyzed, which hybrid the segment and segment - page addressing. object - oriented instructions are one of the features of jvm instruction set
另外，文中還提出了一種直接段式和間接段頁式結合的尋址策略和地址轉換技術以及相關物理存儲器的管理演算法，並對這些技術進行了全面的性能評價。 -
So the problem of mining communities of signed networks quickly and correctly has not been solved satisfactorily. in this paper, we propose a heuristic algorithm to address this issue
值得注意的是，當前有關萬維網挖掘的工作都是基於只包含正關系的web圖模型，而忽略了負關系的存在，如公司之間的競爭關系。 -
Chapter 2 uses two ways to address the issues of qos based resource allocation in ip over wdm networks. firstly, for optical - layering approach, we propose a novel priority - based wavelength assignment algorithm. by calculating the relative capacity loss, we manage to assign wavelengths so as to guarantee the blocking probability of the high priority requests to a lower degree, and at the same time with the least influence on the lower priority
基於此，首次提出了利用全網信息而支持優先級的波長分配演算法，由於利用了全網信息，在保證較高優先級請求的阻塞性能時，還對較低優先級請求的阻塞性能進行了優化，從而改善了全網的平均阻塞率；另一個為基於mpls技術的方法，提出了支持不同qos要求的vpn業務的設計問題。 -
And now it has become the most useful routing protocol in the construction of great network. relatively, the paper discusses the internal mechanism of internet routing particularly and roundly, which involved router mechanism, ip address, routing table, routing framework and the two most familiar routing algorithm - distance - vector and link - state
本文較細致、全面地討論了internet路由選擇的內部工作機制，包括路由器的工作原理、 ip編址、路由表、 internet路由選擇體系結構，以及兩種主要的路由選擇技術?距離矢量與鏈路狀態演算法。 -
In this paper, the key technology - fp recognition algorithm is launched based on the analysis of current situation of automatic fingerprint identification system ( apis ). the structure - based fp representation and its matching algorithm are proposed to address the shortcoming of traditional minutiae - based method, which makes use of limited information in fp images
針對傳統基於細節點的指紋識別方法只利用了指紋圖像中的有限信息（細節點）的不足，本文提出了基於指紋脊線紋理結構的特徵表達及其匹配演算法，沖破了傳統方法的局限。 -
Study of how to convert recursive algorithm without return address
無返回地址的遞歸消除方法研究 -
To manage large - scale xml documents with complicated structure, this dissertation focus on the efficient structural indexing algorithm for xml data, result size estimation problem for xml structure based query optimization, result relevance ranking algorithm, and infrastructure for xml query processing for both text - rich and data - rich xml documents. to address the aforementioned issues, this dissertation makes the following contributions. first, it investigates the drawbacks of existing indexing algorithm for xml data, and propose a dynamic indexing algorithm for xml data based on d - bisimilarity, difx
為滿足結構復雜、大規模的xml數據管理需要，本文深入研究了xml信息檢索系統中的結構索引演算法設計和結構化查詢優化中的查詢代價估計問題，以及查詢結果和查詢條件間的相關度演算法，主要取得了4個方面的成果：第一，分析了已有的xml數據索引演算法中存在的問題，提出了一種高效的動態xml結構索引演算法difx ，它採用動態後向結構相似性（ d - bisimilarity ）的概念，可以根據實際查詢需求以及索引最優化的要求動態決定索引中保存的結構信息。 -
To ensure that all network interfaces on a network have a unique address, the interface host is responsible for running a " duplicate address detection " algorithm on unicast addresses
為確保網路上的所有網路介面具有唯一地址，介面主機負責在單播地址上運行「重復地址檢測」演算法。 -
To ensure that all network interfaces on a network have a unique address, the interface host is responsible for running a " duplicate address detection " algorithm on multicast addresses
為確保網路上的所有網路介面具有唯一地址，介面主機負責在多路廣播地址上運行「重復地址檢測」演算法。 -
In the last part, this paper proposed a different backoff algorithm for dfwmac based on resource estimation. simulation results indicate that the new backoff algorithm can address the above two problems effectively without lose of simplicity
並且針對上述問題，本文在最後部分為dfwmac提出了一種新的基於資源估計的回退演算法，模擬結果表明這種回退機制在不失簡單性的情況下能有效改善tcp吞吐率抖動和不公平問題。 -
Analysis and simulation results show that, compared with the ieee802. 11 binary exponential backoff ( beb ) algorithm and other algorithms that have been employed to address the fairness problem, the proposed qbwf algorithm is simpler and practical. also, by choosing appropriate parameters, the qbwf algorithm can effectively improve the channel access fairness and achieve a preferable trade - off between fairness and throughput
分析與模擬結果表明，與ieee802 . 11標準的二進制指數退避（ beb ）演算法和其它改善通道接入公平性的演算法相比，本文演算法更為簡單實用，且對于合適的參數取值，本文演算法能有效地改善通道接入的不公平性，並能在通道吞吐量的下降和通道接入公平性的改善之間達到一個較好的折衷。 -
To address this problem, an incremental algorithm is proposed, which allows for mining community structure in large - scale and dynamic networks
現有的共體結構挖掘演算法可分為兩大類：二分法和層次法。 -
Abstract : at first, this paper analyces the open defect of cmos ram address decoder, it comes out that one type open defect cannot be detected by march test algorithm, and then we give the test method of this type undetectable fault and the design scheme with built - in tolerance against hard - to - detect open defects
文摘:對cmos存儲器中地址譯碼器的開路故障進行了分析和分類，得出了其中有一類開路故障不能用常用的測試演算法可靠的測試出，給出了測試該類開路故障的測試方法以及針對該類開路故障的容錯性設計方案。 -
We use an address symbolic value propagation algorithm to derive possible address set that might be accessed by a memory instruction
我們通過一種值預測及傳播演算法檢測存儲器指令數據相關。這種方法有助於提高與存儲器訪問相關的指令的執行效率。 -
When the digital streaming video is transmitted on internet, it will be affected by the network, such as bandwidth, so the paper also deals with streaming video watermarking and its exclusive requirement. at the last chapter, an object - based watermarking algorithm has been presented. the watermarking algorithm for mpeg - 4 compression is devoted to address the influence from the rate scalability, based on static texture object in mpeg - 4 and watermarking in wavelet domain
在此基礎上針對視頻與圖像的異同點，分析比較了靜態圖像水印和視頻水印特點的異同，並且結合在internet上傳輸視頻時，網路自身的特性（比如帶寬資源等）對視頻流產生的影響，以及這些影響對視頻流水印技術的特殊要求，結合基於對象的視頻編碼標準mpeg - 4的特性，提出了在視頻對象中利用基於小波變換的水印方案。 -
For a given network physical topology and long - term traffic pattern, design of delay - based logical topology can be formulated as a linear problem, a np - hard problem, which is computationally intractable for large size of networks. so, we pr opose a heuristic algorithm to address the problems of routing and wavelength assignment
基於業務平均跳數來衡量的模擬結果表明，在網路中不同qos要求的業務需求大致相當的情況下，不管網路負載如何變化，對某qos要求的vpn業務，總是能夠取得qos較之要低的業務更低的平均跳數，即更小的平均時延。
分享友人