伸展樹，基本數據結構，The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.
標簽： 樹
上傳時間： 2017-05-07
上傳用戶：JIUSHICHEN
ZigBee路由協議指的是ZigBee規范中規定的與路由相關的功能和算法部分，主要包括不同網絡拓撲結構下ZigBee協議數據單元的路由方式、路由發現和路由維護等內容。為了達到低成本、低功耗、可靠性高等設計目標，ZigBee網絡采用了Cluster-Tree與AODV路由相結合的路由算法。該包實現了ZIGBEE路由算法在NS2下的模擬
上傳時間： 2017-05-14
上傳用戶：WMC_geophy
oracle中常用函數說明. SQL中的單記錄函數 1.ASCII 返回與指定的字符對應的十進制數 SQL> select ascii( A ) A,ascii( a ) a,ascii( 0 ) zero,ascii( ) space from dual A A ZERO SPACE --------- --------- --------- --------- 65 97 48 32 2.CHR 給出整數,返回對應的字符 SQL> select chr(54740) zhao,chr(65) chr65 from dual ZH C -- - 趙 A 3.CONCAT 連接兩個字符串 SQL> select concat( 010- , 88888888 )|| 轉23 高乾競電話 from dual 高乾競電話 ---------------- 010-88888888轉23
上傳時間： 2014-11-23
上傳用戶：zhangyigenius
The aip file contains few Matlab routines for 1D line scan analysis, 1D scaling, 2D scaling, image brightness or contrast variation routine and rouitne for finding area between zero cossings of 1D times series.
標簽： scaling contains analysis routines
上傳時間： 2014-01-19
上傳用戶：xmsmh
一個實現struts+spring+hebernate的例子，外加一個JavaScript實現的tree的都OK了。
上傳時間： 2013-11-25
上傳用戶：skhlm
Huffman codes 1.In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0 s and 1 s? 2.To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. 3.This problem can be solved by using an extended binary tree which is used in the 2-way merging problem. the sourse code is to encode and decode the Huffman.
標簽： telecommunication represent messages Huffman
上傳時間： 2013-12-22
上傳用戶：ztj182002
Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound. 2.If a constant subtracted from any row or any column of the cost matrix, an optimal solution does not change.
標簽： branch-and-strategy Salesperson Traveling solution
上傳時間： 2013-12-29
上傳用戶：璇珠官人
This program take a two sequences with differents lengths and transform in two sequences with same length with use zero padding method.
標簽： sequences with differents two
上傳時間： 2017-05-27
上傳用戶：kikye
) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
標簽： code Compression huffman provide
上傳時間： 2017-05-30
上傳用戶：yuchunhai1990
4 16 64 QAM plots for simulated and theoretical results for OFDM system with addition of Cyclic prefix and a zero-Forcing equalizer.
標簽： theoretical for simulated addition
上傳時間： 2017-06-02
上傳用戶：hgy9473
