一個實現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
上傳用戶：璇珠官人
) 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
橢圓濾波器，fp=2400hz,fs=5000hz,rp=3dB,rs=25dB,求其3dB時的各項參數！
上傳時間： 2017-07-01
上傳用戶：h886166
The emphasis of this book is on real-time application of Synopsys tools, used to combat various problems seen at VDSM geometries. Readers will be exposed to an effective design methodology for handling complex, submicron ASIC designs. Significance is placed on HDL coding styles, synthesis and optimization, dynamic simulation, formal verification, DFT scan insertion, links to layout, physical synthesis, and static timing analysis. At each step, problems related to each phase of the design flow are identified, with solutions and work-around described in detail. In addition, crucial issues related to layout, which includes clock tree synthesis and back-end integration (links to layout) are also discussed at length. Furthermore, the book contains in-depth discussions on the basics of Synopsys technology libraries and HDL coding styles, targeted towards optimal synthesis solution.
標簽： application real-time Synopsys emphasis
上傳時間： 2017-07-05
上傳用戶：waitingfy
JXMLEditor is a XML editor developed in Java which is based on the Xerces Java parser. The goal of this editor is to offer some features (tree view, drag & drop, syntax colorizing) to create XML documents easily. Also available as Eclipse Plugin.
標簽： Java JXMLEditor developed editor
上傳時間： 2013-11-30
上傳用戶：水口鴻勝電器
自己做的： （一）用雙線性變換法設計并用實驗系統實現一個三階的契比雪夫Ⅰ型低通數字濾波器，其采樣頻率Fs =8KHz，1DB通帶邊界頻率為fp=2KHz。 （二）用雙線性變換法設計并用實驗系統實現一個三階的契比雪夫Ⅱ型高通數字濾波器，其采樣頻率Fs =16KHz，阻帶邊界頻率為fst =4KHz，As=20dB。
上傳時間： 2013-12-25
上傳用戶：D&L37
Abtract - We propose a new family of fi lter banks, named NDFB, that can achieve the directional decomposition of arbitrary N-dimensional (N ≥ 2) signals with a simple and effi cient tree-structured construction.
標簽： direction Abtract propose achieve
上傳時間： 2014-01-15
上傳用戶：鳳臨西北
此文件夾中共包括十二個小程序 AVL創建平衡二叉樹,通過加入一個個的結點創建,并實現了平衡二叉樹中的結點刪除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph實現了有向圖的非遞歸廣度優先遍歷及非遞歸深度優先遍歷 HeapSort利用堆排序實現優先級隊列 Merge實現二路歸并排序算法 MFK動態規劃解背包問題 nqueue求解n皇后問題 QuickSort快速排序算法的實現。 Shell排序算法的實現。 Tree程序中實現了先序\中序\后序遍歷二叉樹的非遞歸算法。 tubao用遞歸法解決突包問題
標簽： Boyer_Moore Horspool Grap AVL
上傳時間： 2017-08-08
上傳用戶：佳期如夢
