资源列表
acm
- 武汉赛区的acm程序设计答案及题目；供程序设计人员参考-Wuhan Division of the acm programming answers and topics for programmers reference
kusupaixu
- 数据结构实验，快速排序算法，输入十个无序数字，可以输出正确排序结果。-Data structure experiments, fast sorting algorithm, input ten disorderly digital, you can output the correct sort results.
tau
- 计算时间序列的延迟时间，有例子，一看就明白啊！-The time series‘delay time is calculated , there is an example!
EUCLIDEAN_Algorithm
- Euclidean节点定位是由美国路特葛斯大学利用距离矢量路由和GPS定位原理提供出一种分布式自主定位算法-Node localization Euclidean path by the Rutgers Universitys use of distance vector routing and GPS positioning to provide a principle of self-positioning algorithm for distributed
Fortan-hanshuku
- 这是fortran内部自带的函数库，中文的-This is a fortran library that comes inside, Chinese
Ocean_Water_Absorption
- 水声通信中海洋对水声信号的吸收仿真，参考较完整模型Francois R E, Garrison G R，包含对陆地无线电吸收对比-Underwater acoustic communication in ocean water to absorb the sound signal simulation, a more complete model reference Francois RE, Garrison GR, contains terrestrial radio absorption c
MATLAB_huiguifenxi.rar
- MATLAB工具箱进行线性回归、多元线性回归、非线性回归的很好的例子，附有教程PPT以及MATLAB程序，很实用，欢迎大家下载。,MATLAB toolbox linear regression, multiple linear regression, nonlinear regression of a good example of PPT, as well as MATLAB program with tutorials, very useful, welcome to download.
xy7z.ZIP
- 恒定导通时间双频率控制开关变换器A constant on-time double frequency controlled switching converter-A constant on-time double frequency controlled switching converter
DifferentiationMatrixSuite
- 微分矩阵组件（Differentiation Matrix Suite)-differential matrix components (Differentiation Matrix Suite)
data-mining
- 本书全面介绍了数据挖掘，涵盖了五个主题：数据、分类、关联分析、聚类和异常检测。除异常检测外，每个主题都有两章：前一章涵盖基本概念、代表性算法和评估技术，而后一章讨论高级概念和算法。这样读者在透彻地理解数据挖掘的基础的同时，还能够了解更多重要的高级主题。 -Introduction to Data Mining Instructor’s Solution
multiple_effectiveness
- 计算大数乘法效率，验证n位长乘法代价是否为n的平方。-calculate the effectiveness of long-integar-muliply
Apriori
- Apriori算法C++实现，Apriori算法是一种挖掘关联规则的频繁项集算法，其核心思想是通过候选集生成和情节的向下封闭检测两个阶段来挖掘频繁项集-Apriori algorithm C++ realize, Apriori algorithm is an association rule mining frequent itemsets algorithm, the core idea is the frequent item sets through a two-stage closed