资源列表
stft
- 短时傅立叶变换C++程序的实现,短时傅立叶变换(STFT)是研究非平稳信号最广泛使用的方法-Short-time Fourier transform C++ program implementation, short-time Fourier transform (STFT) is the study of non-stationary signals the most widely used method
Linear-regression-equation
- 一元线性回归方程, 求线性回归方程:Y = a + bx 的回归系数a和b. 用的是最小二乘法推导的结果。网上搜索最小二乘法原理,配合这个源代码学习还是不错的。本代码是网上搜来的,发现自学用不错,特上传分享。-Linear regression equation, find the linear regression equation: Y = a+ bx the regression coefficients a and b. derived using a least squares res
Niche1
- 基于小生境排挤机制的GA算法,对学习遗传算法具有很好的参考价值!-Niching GA Algorithm is very usful for learner!
GA
- 经典遗传算法的matlab仿真,遗传算法是一类借鉴生物界自然选择和自然遗传机制的随机化搜索算法,其主要特点是群体搜索策略和群体中个体之间的信息交换,搜索不依赖于梯度信息。-good genetic algorithm matlab code
Single-Linked-List
- 数据结构:c语言版 单链表的删除及插入-Single Linked List‘s delete and insert table
3
- 分别编写函数实现冒泡排序、快速排序和简单插入排序算法; 2) 2路归并排序(选做) 3) 编制一个应用程序,它将随机产生的N个0~65535之间的整数插入到一个顺序表中,然后分别用上述排序算法对这个顺序表进行排序;记录并显示各种方法的运行时间; 4) 以N=500和N=5000运行这个应用程序,对算法运行的时间作比较和分析。 -Write a separate function to achieve the bubble sort, quick sort and simple
single-list
- 单链表实现代码,各种操作:数据插入,删除,显示等-Single linked list implementation code, a variety of operations: data insertion, deletion, display
Matlab-Euler-method
- 基于Euler方法解常微分方程,过程简单,方便,速度快-Solution of ordinary differential equations based on Euler method, the process is simple, convenient, fast! !
conjugate-gradient-method
- 基于共轭梯度算法的基本原理,以某一个具体的事例,实现共轭梯度算法对于事例的求取。-Based on the basic principle of the conjugate gradient algorithm to certain specific instances, to achieve conjugate gradient algorithm for the case of the strike.
DynamicProgrammingShortestPath
- 动态规划求最短路径,已知几个城市的位置坐标,求出便利各个城市的最短路径-Dynamic programming for the shortest path to a known location coordinates of several cities, find the shortest path to facilitate various cities
RelDielConst_SalineWater
- 用来计算海水相对介电常数的matlab程序,计算方法源自微波雷达遥感-computes the real and imaginary parts of the relative dielectric constant of water at any temperature 0<t<30, Salinity 0<S<40 0/00, and frequency 0<f<1000GHz
f2dimention
- about 1D calculate in FEM
