资源列表
电感计算
- matlab程序，输入所需的条件，可自动计算需要的如匝数、线径等电感规格(The matlab program inputs the required conditions, and automatically calculates the required inductors such as turns and wire diameters.)
蚁群算法
- 蚁群算法，可适用于预测类题目，预测结果较好，比赛结果实测(Ant colony algorithm can be applied to predict class problems, and the prediction results are good.)
lizilvbo
- 粒子滤波的MATLAB实现，通过寻找一组在状态空间中传播的随机样本来近似的表示概率密度函数，用样本均值代替积分运算，进而获得系统状态的最小方差估计的过程，这些样本被形象的称为“粒子”，故而叫粒子滤波(MATLAB implementation of particle filter,By looking for a set of random samples which are propagated in the state space to approximate the probability
U_E_threedimen
- 采用模拟电荷法，以点电荷为模拟电荷，在三维空间中计算一个档距的输电线路周围电场。(Using the charge simulation method to calculate the electric field around transmission line of one span in the 3D space, the point electric charge is used as the simulation charge.)
check
- 模拟电荷法校验程序。针对架空输电线路，将位于导线中心的模拟电荷计算出来后，选取导线表面的校验点，对计算结果误差进行检验。(Analog charge method check program. For the overhead transmission line, the simulated charge located at the conductor center is calculated, and the checkpoint of the conductor surface is se
magnify
- 在线实现仿真波形局部放大，结合具体要求实现特定窗口图形(Online simulation of waveform amplification, combined with specific requirements to achieve specific window graphics.)
IMM_f
- 采用交互多模型算法（IMM）对机动目标进行跟踪的实现(Interactive multiple model algorithm (IMM) is applied to track maneuvering target.)
K-means
- K-means聚类算法的matlab实现(k-means clustering is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which each obse
play
- 要求截取一段语音信号，叠加噪声信号，再进行滤波，带通滤波器的设计（GUI界面）(Design of speech signal filtering and bandpass filter)
DV-Hop算法
- 无线传感器网络中，实现节点定位，采用matlab进行实现(In wireless sensor network, node localization is realized by MATLAB.)
swarm
- 采用粒子群算法进行优化，比如损伤识别和传感器优化布置(optimizaiton based on particle swarm algorithm)
ACAbag
- TSP问题 假设有一个旅行商人要拜访全国 31个省会城市，他需要选 择要走的路径，每个城市只能拜访一次 所选路径为最小值(TSP problem Suppose a traveling salesman wants to visit 31 provincial capitals of the whole country. He needs to choose the way to go. Every city can only visit once. The selected p