matlab數據挖掘算法。實用cart決策樹進行分類，可識別多類。decision tree algorithm, classification.
上傳時間： 2014-12-06
上傳用戶：xsnjzljj
1.這個計算器可用在離散數學的數理邏輯中，純屬工具，隨意傳播，由java語言實現,解壓即可運行，需要按照java環境。可以去這里下載運行環境：http://www.skycn.com/soft/3116.html 2.這個計算器可以計算邏輯表達式的值、對應的真值表、主析取范式、主合取范式。 3.輸入表達式時可以在表達式欄中輸入，也可用相應的按鈕輸入，變元只能是PQRST。由于等價連接詞無法識別，所以用等號代替，這也是一個無奈的選擇。 4.計算前請選擇變元個數（默認為3元）并對變元賦值。變元個數最高為5，基本能滿足日常的計算。 5.計算器有自動檢查表達式是否正確的功能，如果判斷功能有誤，麻煩您告訴我您的表達式。
上傳時間： 2013-12-13
上傳用戶：txfyddz
cache4j是一個有簡單API與實現快速的Java對象緩存。它的特性包括：在內存中進行緩存，設計用于多線程環境，兩種實現：同步與阻塞，多種緩存清除策略：LFU, LRU, FIFO，可使用強引用(strong reference)與軟引用(soft reference)存儲對象。
上傳時間： 2014-02-17
上傳用戶：Altman
The source code for this package is located in src/gov/nist/sip/proxy. The proxy is a pure JAIN-SIP application: it does not need proprietary nist-sip classes in addition of those defined in JAIN-SIP 1.1, you can substitute the NIST-SIP stack by another JAIN-SIP-1.1 compliant stack and it should interoperate. he proxy can act as presence server and be able to process NOTIFY and SUBSCRIBE requests. If this parameter is disabled, the proxy will simply forward those kind of requests following the appropriate routing decision.
標簽： proxy The JAIN-SIP package
上傳時間： 2015-11-30
上傳用戶：ippler8
上海數字留言簿系統2.1版 軟件語言： 簡體中文 授權方式： 免費版 文件大小： 211K 系統平臺： ASP+ACCESS 整理日期： 2007-8-21 系統簡介： 上海數字留言本v2.1,繼承了上海數字產品所具有優美的風格，簡潔的程序化模式，更適合企業/個人網站修改成為自已的專業留言本系統。系統全部實現在自主管理，安全上采用md5 32位不可逆加密，全部防sql注入! 官方網址:http://www.168ee.com.cn/soft 演示網址:http://www.80088.cn/guestbook 下載網址:http://down.168ee.com/guestbook.rar
上傳時間： 2015-12-11
上傳用戶：海陸空653
ITU-T G.729語音壓縮算法。 description: Fixed-point description of commendation G.729 with ANNEX B Coding of Speech at 8 kbit/s using Conjugate-Structure Algebraic-Code-Excited Linear-Prediction (CS-ACELP) with Voice Activity Decision(VAD), Discontinuous Transmission(DTX), and Comfort Noise Generation(CNG).
標簽： description commendation Fixed-point 729
上傳時間： 2014-11-23
上傳用戶：thesk123
Boosting is a meta-learning approach that aims at combining an ensemble of weak classifiers to form a strong classifier. Adaptive Boosting (Adaboost) implements this idea as a greedy search for a linear combination of classifiers by overweighting the examples that are misclassified by each classifier. icsiboost implements Adaboost over stumps (one-level decision trees) on discrete and continuous attributes (words and real values). See http://en.wikipedia.org/wiki/AdaBoost and the papers by Y. Freund and R. Schapire for more details [1]. This approach is one of most efficient and simple to combine continuous and nominal values. Our implementation is aimed at allowing training from millions of examples by hundreds of features in a reasonable time/memory.
標簽： meta-learning classifiers combining Boosting
上傳時間： 2016-01-30
上傳用戶：songnanhua
國內關于storm的資料很少額 Delphi的相關資料更是到處都找不到甚至Google都找不到 我就寫了個分享啦 里面有很詳細的注釋 使用Storm.dll解壓MPQ文件的演示 只是一個簡單的演示 更強大的MPQ工具和其他源碼請看Http://Www.WuHansen.Com/soft 雖然很簡單 但是我也是研究了一定時間的 公布出來讓想研究的朋友少走彎路 程序使用很簡單 假設程序名MPQ.exe 有個mpq文件demo.w3m包含war3map.j要把它解壓出來 輸入mpq demo.w3m war3map.j 即可 Storm.dll在暴雪的游戲下一般都有(MPQ1格式的 MPQ2格式現在研究得比較少)
上傳時間： 2013-12-21
上傳用戶：Late_Li
Adaptive Filter. This script shows the BER performance of several types of equalizers in a static channel with a null in the passband. The script constructs and implements a linear equalizer object and a decision feedback equalizer (DFE) object. It also initializes and invokes a maximum likelihood sequence estimation (MLSE) equalizer. The MLSE equalizer is first invoked with perfect channel knowledge, then with a straightforward but imperfect channel estimation technique.
標簽： performance equalizers Adaptive several
上傳時間： 2016-02-16
上傳用戶：yan2267246
The paper presents the CORDIC Algorithm, which has been implemented as an virtual component (IP core) in a VHDL simulation environment. The core is packaged as a soft (VHDL) macro and it implements all transcenden-tal functions. Analysis of the accuracy of the algorithms implemented shows that the CORDIC functions are equivalent to the accuracy of a Pentium coprocessor.
標簽： implemented Algorithm component presents
上傳時間： 2016-02-16
上傳用戶：wcl168881111111
