dwt

matlab实现几种基本的通信仿真技术 (to achieve basic communication matlab simulation of several)

可以读入.mav格式的音频文件，同时可以仿真出此音频文件的时域及频域的波形图，加入噪声后，可以仿真出加噪后的音频时域及频域波形，并保存新的音频文件。(Mav format audio files that can be read into simulation time domain and frequency domain waveform diagram of audio file, you can add noise simulation time domain and frequency domain waveform plus noise audio, and save the new audio files.)

未来线路预测,分析误差,GPS和INS组合导航程序，本科毕设要求参见标准测试模型。( Future line prediction, error analysis, GPS and INS navigation program, Undergraduate complete set requirements refer to the standard test models.)

无标度网络生成程序。改程序可生成无标度的复杂网络，且很好展示了无标度网络的生成机理，对于初学者帮助很大。(Scale-free network generation program. Reform program will generate a complex network of scale-free, and good scale-free networks show the generation mechanism of great help for beginners.)

synchronous genertor with PV array

《MATLAB遗传算法工具箱及应用》pdf版，是详细讲解英国设菲尔德大学开发的遗传算法工具箱的教材，含有详细的案例讲解以及程序。("MATLAB genetic algorithm toolbox and application pdf version。It is to explain in detail the British set up the Sheffield University developed genetic algorithm toolbox materials containing detailed case to explain procedures.)

基于线性滤波法的风速时程MATLAB程序(MATLAB program based on linear filtering method of wind speed time)

人工蚁群算法，提供了一种高效的编程步骤。(Artificial ant colony algorithm, provides an efficient programming steps.)

TLD跟踪算法源代码下载（纯C++版本），OpenTLD-master，某大牛重新编写的C++版本TLD跟踪算法，脱离MATLAB。(C++ impleletion of TLD)

提供一种求解最优哈密尔顿的算法---三边交换调整法，要求在运行jiaohuan3（三交换法）之前，给定邻接矩阵C和节点个数N，结果路径存放于R中。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。 (Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)