SFcomplex

典型磁滞模型的的matlab m文件编程，对初学者很有帮助(Typical model of hysteresis of matlab m file programming, to beginners helpful )

matlab 代码，利用分步傅里叶方法求解NLSE方程(matlab code, solve the equation NLSE)

说明：  在MATLAB环境下用PM算法进行的带通滤波器设计(In the MATLAB environment using the PM algorithm bandpass filter design)

说明：  信号分析与处理（清华版）的完整配套matlab程序(Signal Analysis and Processing (Tsinghua version) of the complete program matlab)

合成孔径雷达sar探测距离相对于孔径功率的MATLAB仿真程序，最后结果以图表形式给出(Synthetic aperture radar sar detection distance with respect to the aperture power MATLAB simulation program, the final result is given in the form of a chart)

二维核磁共振最新资料，欢迎交流，共同进步！(Laboratory and Field Evaluation of an Inelastic Neutron Scattering and Capture Gamma Ray Spectrometry Tool)

可以模拟大部分分数阶混沌系统的matlab代码，如分数阶Duffing方程，分数阶Lorenz方程等(The matlab code of most fractional order chaotic systems can be simulated, such as fractional Duffing equation, fractional Lorenz equation and so on.)

说明：  对带噪图象进行处理，削去不必要的东西，抗干扰，(right image processing, cut unnecessary things, interference,)

说明：  本设计为基于MATLAB特征点匹配的指纹识别系统。带有一个GUI界面。主要对指纹图像进行三方面处理：图像预处理、特征提取和特征匹配。图像预处理包括四个步骤：图像分割、滤波增强、二值化、细化，对指纹图像进行预处理后，去除了原图像的冗余部分，方便后续的识别处理；特征提取主要是提取指纹图像细化后的端点和分叉点；特征匹配是利用两个指纹的图像进行特征点比较，来确定两幅图像是否来自于同一手指。(This design is a fingerprint recognition system based on MATLAB feature point matching. With a GUI interface. Fingerprint image is mainly processed in three aspects: image preprocessing, feature extraction and feature matching. Image preprocessing includes four steps: image segmentation, filter enhancement, binarization and thinning. After preprocessing the fingerprint image, the redundant part of the original image is removed to facilitate the subsequent identification processing; feature extraction is mainly to extract the refined endpoint and bifurcation point of fingerprint image; feature matching is to determine the two images by comparing the feature points of two fingerprint images Is it from the same finger.)

TSP can be defined as a problem where starting from a node it is required to visit every other node only once in a way that the total distance covered is minimized. After an initial solution a neighborhood solution is selected by an exchange of a randomly selected pair of nodes. The randomly generated neighbor solution is selected if it improves the solution else it is selected with a probability that depends on the extent to which it deteriorates from the current solution.