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
葉輪機械多級葉輪網(wǎng)格生成程序介紹 侯 樂 毅 非定常流課題組 本文開發(fā)的葉輪機械多級葉輪網(wǎng)格生成程序，采用的網(wǎng)格類型為H型，并在葉片前面/后面延伸區(qū)域設置平直網(wǎng)格數(shù)ID1和IDN。主程序MESH_BLADE_STAGES，分成三個部分，原始葉型及控制參數(shù)從輸入程序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中實現(xiàn)普里姆最小生成樹算法的代碼，有圖的，邊的權值是隨機生成的，5個節(jié)點，點“generate tree”，就會顯示出最小樹。
標簽：
上傳時間： 2017-04-09
上傳用戶：Andy123456
一個簡單的Ext例子，里面有Ext.grid.GridPanel和Ext.tree.TreePanel等Ext常用控件的使用，以及Ext和后臺的交互
標簽： Ext
上傳時間： 2013-12-23
上傳用戶：qweqweqwe
SQL中的單記錄函數(shù) 1.ASCII 返回與指定的字符對應的十進制數(shù) 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 給出整數(shù),返回對應的字符 SQL> select chr(54740) zhao,chr(65) chr65 from dual ZH C -- -
上傳時間： 2017-04-14
上傳用戶：330402686
TC35i模塊有40個引腳，通過一個ZIF(Zero Insertion Force，零阻力插座)連接器引出。這40個引腳可以劃分為5類，即電源、數(shù)據(jù)輸入/輸出、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
上傳用戶：彭玖華
