APF

模拟弹簧振动，讨论最简单的情形，一弹簧系统做横向运动，其位移由振动规律 所决定，仿真弹簧振动。(Spring vibration simulation to discuss the simplest case, a spring system as a lateral movement, the displacement is determined by the law of vibration, simulation spring vibration.)

说明：  matlab经典优化代码，同时附有BNB优化的工具箱，可以安装调试(classical optimization matlab code, accompanied by BNB optimization toolbox, you can install the debugging)

MATLAB 图像处理命令，在二进制图像中利用 lookup 表进行边沿操作(MATLAB image processing orders, in a binary image using the lookup table by using the edge operator )

sift 特征提取算法matlab实现,有实例(sift 特征提取算法matlab实现，有实例)

Directional Weighted median filter for random value impulse noise removal

觉得很好的一个Matlab程序想和大家一起分享，互相学习。(A Matlab program feel good and you want to share, learn from each other.)

This lab exercise will introduce you to the AccelWare IP generators. AccelWare is a library of over fifty IP generators, available in the form of three toolkits that produce synthesizable MATLAB for common MATLAB built in and toolbox functions. Each generator offers macro and micro-architecture selections that allow full customization of the generated model to the target application requirements.(This lab exercise will introduce you to the AccelWare IP generators. AccelWare is a librar y of over fifty IP generators, available in the form of three toolkits that pro duce synthesizable MATLAB for common MATLAB negation ilt in and toolbox functions. Each generator of fers macro and micro-architecture selections that allow full customization of the generated model to the target application requirements.)

ybus case distributed-generation_distribution-system_Newton-Laphson

快速谱峭度工具箱，由法国人Antoni编写(Fast spectral kurtosis toolbox, written by French Antoni)

说明：  禁忌（Tabu Search）算法是一种亚启发式(meta-heuristic)随机搜索算法，它从一个初始可行解出发，选择一系列的特定搜索方向（移动）作为试探，选择实现让特定的目标函数值变化最多的移动。为了避免陷入局部最优解，TS搜索中采用了一种灵活的“记忆”技术，对已经进行的优化过程进行记录和选择，指导下一步的搜索方向，这就是Tabu表的建立。(Tabu Search algorithm is a meta-heuristic random search algorithm. It starts from an initial feasible solution, chooses a series of specific search directions (movement) as a trial, and chooses to achieve the movement that makes the most changes in the value of a specific objective function. To avoid falling into local optimum, TS search uses a flexible "memory" technology to record and select the optimization process that has been carried out, and to guide the next search direction, which is the establishment of Tabu table.)