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
