资源列表
vc++c4.5
- 基于vc的决策树的分类算法是ID3算法的演变-vc on the decision tree classification algorithm is the evolution ID3 algorithm
XW
- 本程序主要是为初学者提供，里面介绍了怎样用MATlab观察一个信号的波形 星座图 频谱 等-this program is to provide beginners. on the inside with what MATlab observation of a signal waveform constellation spectrum
SignalAnalyze
- 本程序主要是对三种调制方式APSK PSK QAM进行了性能 比较，并采用了最新自适应预失真算法，得出了结论-this procedure is mainly of three PSK modulation APSK QAM compares the performance, and the use of the latest adaptive predistortion algorithm, came to the conclusion that
APSKanalyze
- 本程序主要对APSK信号进行了定性分析，对其星座进行优化设计，得出最佳设计。-the main procedures of APSK signal a qualitative analysis, Constellation optimize its design, The optimum design.
polygon_decompose_lx
- 用户指定顶点，系统判定并分解该多边形为不重叠的多个三角形，并使所有三角形的边长和最小-vertex specified users, the system and determine the polygon decomposition of the number of non-overlapping triangles, make all the triangle and the length of the smallest
Wolfram
- 用于交通流研究的Wolfram模型的程序，对于做交通流研究的很有参考价值的-traffic flow for the Wolfram Research model procedures for doing traffic flow study of great reference value
traffica
- 用于交通流研究的程序，里面是各个分开独立的程序，想用就先研究一下交通流方面的文献哦。-used to study traffic flow procedures, which is separate from the various procedures, want to use on the first study of traffic flow literature oh.
loren
- 这是一个计lorens变换的fortran程序-This is a transformation of dollars lorens procedures fortran
complex_network
- 这是复杂网络研究中研究小世界性质的c程序2。-This is a complex network of small research study of the nature of the world c procedures 2.
cal-diameter
- 计算网络静态参数的直径c程序（其中的数据是具体的可换成其他的数据）。-computing network diameter of the static parameters c (which is specific data can be replaced by other data).
netcalculation
- 一个用于复杂网络研究中计算网络静态参数（度分布，簇系数等）的c程序（其中的数据是具体的可换成其他的数据）。很简单但是对于做复杂网络研究的却很有启发的哦。-a complex network for research computing network static parameters (distribution, Clustering coefficient, etc.) c (which is specific data can be replaced by other data). Ver
MergeSort2
- 二路合并排序算法，使用分治策略,时间复杂度O(nlog2n), 需要和待排记录等数量的辅助空间，是一种稳定的排序算法-two-way merge sorting algorithm, the use of divide-and-conquer strategy, the time complexity O (nlog2n) Pai and the need to record the number of auxiliary space, is a stable Sort Algorithm