bandwidth search 中文意思是什麼
bandwidth search
解釋
帶寬搜索-
Thereby, a single candidate at the final - level search is enough to provide the desired performance. as a result, the algorithm performs only one local search at the finest level, and its overall computational cost and data bandwidth burden decrease. according to different motion area, the search methods dynamically are also introduced
根據這個初始運動矢量對當前塊的運動類型進行分類，針對不同塊的不同運動內容，確定每一塊運動矢量搜索的起點、搜索的范圍和搜索策略，小運動塊的搜索范圍小，大運動塊的搜索范圍大，這樣既可節省計算量，也可以減小搜索范圍，而且不影響搜索精度，因而搜索效率高。 -
To the primary contradiction of real - time interactive visual simulation, limited bandwidth of network and real time transmitting parameter of relative to move sight, the control mechanism of 3 - d visual object is discussed, under the direction of hla idea, the visual federal object model vfom is established to describe the visual data distributing ; the author designed a grammar of vfom context and a turing conversion mechanism, it will support exploitation of visual simulation in different field ; the author analyses and apply opengl to design a method of implement real - time interactive visual simulation on pc, in additional with object - oriented program technique network communication technique multithreading technique, implement pc - virsp. there are 7 chapters in this thesis. in chapter 1, the developments of virtual simulation is looked back, the aim and significance and the main search content is put forward
論文針對實時交互視景模擬的主要矛盾，即網路有限帶寬與視景運動交互參數實時傳輸矛盾，探討了三維視體運動控制機理，結合hla思想，建立視景聯邦對象模型（ vfom - visualfederalobjectmodel ）來描述視景數據分佈；並設計了模擬實體鏈描述文本文法及其存儲轉換機制，有效支持多領域視景模擬系統開發；分析並應用圖形介面標準opengl ，設計了基於pc機的實時互操作視景生成方法；針對網路分佈環境下視景模擬實時交互需求，設計視景運動同步控制方案；並綜合應用了面向對象編程技術、網路通信技術、多線程技術，實現了基於pc機的視景實時互操作支撐平臺（ pc - vrisp ? real - timeinteractivesupportingplatformforvirtualsimulationbasedonpersonalcomputer ） 。 -
According to the definitions of bottleneck bandwidth, available bandwidth and bulk transfer capacity, we analyzed the algorithms which named vps ( variable packet size ), pptd ( packet pair / train dispersion ), slops ( self - loading periodic streams ) and topp ( trains of packet pairs ) ; based on the principle of sub - path bottleneck measurement, we developed the bottleneck measurement algorithm using heterogenous packet - pair train ; after designing the three child algorithms ( demarcating bandwidth range, approaching bandwidth value and predicting the trendency of available bandwidth fluctuation ), we performed the algorithm called self - loading binary search ; applying the multi - home properties of sctp ( stream controltransmission protocol ) and measurement algorithm of available bandwidth, we presented a scheme to adjust the sctp transport path when there are network congestions or faults ; by the library of winsock and winpcap, we developed a measurement program to look for bottleneck bandwidth. in ns2 experiments, the algorithm based on heterogenous packet - pair train fitted well, and the algorithm of self - loading binary search worked quickly, and the sctp scheme improved the throughput effectively
本文根據瓶頸帶寬、可用帶寬和btc （ bulktransfercapacity ）三類網路帶寬定義，分析了vps （ variablepacketsize ）和pptd （ packetpair / traindispersion ）瓶頸帶寬測試演算法， slops （ self - loadingperiodicstreams ）和topp （ trainsofpacketpairs ）可用帶寬測試演算法;基於子路徑瓶頸測試原理，設計了異構包對序列的瓶頸測試演算法;並結合三個子演算法（界定帶寬范圍演算法、接近帶寬值演算法和帶寬變化趨勢判定演算法） ，設計了自載流折半查找的可用帶寬測試演算法;把上面的演算法應用到sctp （ streamcontroltransmissionprotocal ）的多宿性和可用帶寬測試，提出了一個網路擁塞或故障時調整sctp傳輸路徑的方案;結合winsock和winpcap兩套網路開發工具，設計了一個瓶頸帶寬測試程序;通過ns2模擬實驗，驗證了基於異構包對序列瓶頸測試演算法的準確性、自載流折半查找演算法的快速性，和sctp改進方案的有效性。 -
There are a large amount of geological information data and experts ’ knowledge in agricultural intelligent system, which need a wide bandwidth to keep, get and search geological
4 .對移動agent的通信問題進行了研究，提出了一種新的通信演算法。 -
On the above, to overcome the pre - maturity and low speed of search in the late phase of multicast routing algorithm based on genetic algorithm, the author gives the multi - population parallel annealing genetic multicast routing algorithm to solve the bandwidth, delay, delay jitter and packet loss constrained least - cost multicast routing problem, which combines the
在此基礎上，將多種群并行技術和退火技術相結合，以克服現有基於遺傳演算法的組播路由演算法過早收斂和後期搜索速度較慢的缺陷，且使用樹狀編碼方法，提出求解帶寬、時延、時延抖動和分組丟失率約束的代價最小組播樹的多種群并行退火遺傳組播路由演算法。
分享友人