Characteristics-of-neuronal-cells

Solving Sylvester equations by the method of the characteristic polynomial

nuttall窗双谱线插值FFT算法实现电力谐波分析(electical harmonic analysis based nuttall window double-spectrum-line interpolation for FFT algorithms )

This is more efficient than RRSQRT

实现对最小均方算法LMS的仿真，及其收敛性能的实现(Achieve the minimum mean square LMS algorithm simulation and performance to achieve convergence)

在matlab平台下的小电流接地故障仿真(Grounding Fault Simulation of Small Current for matlab)

PN序列生成函数, 测试代码. 带有一组生成多项式(failed to translate)

说明：  基于小波包分析的声音特征提取--毕业设计程序：希望交流(Based on wavelet packet voice feature extraction- graduate design program: the hope of sharing)

蕞优分组周游路线问题是一类物流智能调度问题，是众多的计算难度极大的组合爆炸问题之一。自从运输问题最早是由Hitchcock在1941年提出的[2][4]后，人们对这一类问题给予了极大的关注并进行了大量的研究，提出了有效解决问题的优化算法——单纯形法的变形[2]。但由于问题规模的扩大，纯数学方法在允许的时间和空间上都很难找到问题的最优解，于是人们开始转向寻找问题的近似最优解，遗传算法以其在求解最优化问题中的独特的自组织性、自适应性很快进入人们的视野。 经典的遗传算法对于求解多目标的NP完全性问题非常有效，但对于有多个限制条件的多目标最优化问题缺显得有点力不从心，很难得到稳定度较高、收敛较快的解。本文提出的双层遗传算法模型给这一类问题提供了一个很好的解决方法，虽然建模条件限制了描述的问题的通用性，有待推广，但它能有效利用问题的领域知识，提高了求解效率，保证了解的可行性和最优性，算法思想极具推广潜力，可在其它物流智能调度问题求解算法设计中借鉴。(The most optimal packet travel route problem is a kind of intelligent logistic scheduling problem is one of combinatorial calculation difficult problem many. Since the transportation problem was first proposed by Hitchcock in 1941 after the [2][4], the people of this class of problems given great attention and made a lot of research, the deformation of [2] optimization, simplex method algorithm is effective to solve the problem of. But due to the expansion of the scale of the problem, the pure mathematical methods in the allowed time and space are very difficult to find the optimal solution of the problem, so people begin to turn to the approximate optimal solution for the problem, genetic algorithm in solving optimization problems with its unique in the self-organizing, adaptive soon entered people s field of vision. Very effective classical genetic algorithm for solving multi-objective NP complete problems, but for the multi-objective optimization problem with multiple constraints. I)

本文件内容是十大经典算法之一——贪婪算法，还有详细的内容讲解，便于理解，下载的时候可能会占用一点时间。(Contents of this document is one of the top ten classical algorithm- greedy algorithm, there is a detailed explanation of the content, ease of understanding, the download time may take a little time.)

求解积分函数的列子，可以求sin的定积分和cos的定积分函数。(Liezi solution of the integral function, you can find the definite integral of sin and cos of the definite integral function.)