伸展树，基本数据结构，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
