This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.
标签： implementation double-array representing structure
上传时间： 2013-12-10
上传用户：shinesyh
spoj dtree. Count the number of distinct elements in a given range. Usage is done using fenwick trees. Offline algorithm for queries
标签： distinct elements fenwick number
上传时间： 2014-01-20
上传用户：lhw888
叶轮机械多级叶轮网格生成程序介绍 侯 乐 毅 非定常流课题组 本文开发的叶轮机械多级叶轮网格生成程序，采用的网格类型为H型，并在叶片前面/后面延伸区域设置平直网格数ID1和IDN。主程序MESH_BLADE_STAGES，分成三个部分，原始叶型及控制参数从输入程序INPUT输入，求解程序为GRID(ZERO)，输出程序为OUTPUT。
上传时间： 2013-12-03
上传用户：bjgaofei
We obtained the energy transport velocity distribution for a three dimensional ideal cloak explicitly. Near the operation frequency, the energy transport velocity has rather peculiar distribution. The velocity along a line joining the origin of the cloak is a constant, while the velocity approaches zero at the inner boundary of the cloak. A ray pointing right into the origin of the cloak will experience abrupt changes of velocities when it impinges on the inner surface of the cloak. This peculiar distribution causes long time delays for beams passing through the ideal cloak within a geometric optics description.
标签： distribution dimensional transport obtained
上传时间： 2013-12-19
上传用户：zhliu007
自己编的，在VB中实现普里姆最小生成树算法的代码，有图的，边的权值是随机生成的，5个节点，点“generate tree”，就会显示出最小树。
标签：
上传时间： 2017-04-09
上传用户：Andy123456
一个简单的Ext例子，里面有Ext.grid.GridPanel和Ext.tree.TreePanel等Ext常用控件的使用，以及Ext和后台的交互
标签： Ext
上传时间： 2013-12-23
上传用户：qweqweqwe
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 -- -
上传时间： 2017-04-14
上传用户：330402686
TC35i模块有40个引脚，通过一个ZIF(Zero Insertion Force，零阻力插座)连接器引出。这40个引脚可以划分为5类，即电源、数据输入/输出、SIM卡、音频接口和控制。
上传时间： 2017-04-23
上传用户：dave520l
OTSU Gray-level image segmentation using Otsu s method. Iseg = OTSU(I,n) computes a segmented image (Iseg) containing n classes by means of Otsu s n-thresholding method (Otsu N, A Threshold Selection Method from Gray-Level Histograms, IEEE Trans. Syst. Man Cybern. 9:62-66 1979). Thresholds are computed to maximize a separability criterion of the resultant classes in gray levels. OTSU(I) is equivalent to OTSU(I,2). By default, n=2 and the corresponding Iseg is therefore a binary image. The pixel values for Iseg are [0 1] if n=2, [0 0.5 1] if n=3, [0 0.333 0.666 1] if n=4, ... [Iseg,sep] = OTSU(I,n) returns the value (sep) of the separability criterion within the range [0 1]. Zero is obtained only with images having less than n gray level, whereas one (optimal value) is obtained only with n-valued images.
标签： OTSU segmentation Gray-level segmented
上传时间： 2017-04-24
上传用户：yuzsu
Basic function to locate and measure the positive peaks in a noisy data sets. Detects peaks by looking for downward zero-crossings in the smoothed third derivative that exceed SlopeThreshold and peak amplitudes that exceed AmpThreshold. Determines, position, height, and approximate width of each peak by least-squares curve-fitting the log of top part of the peak with a parabola.
标签： peaks function positive Detects
上传时间： 2017-04-26
上传用户：彭玖华
