序贯重要性采样

说明：  人工创建一个红色的圆球,根正苗红的圆球，(make a red ball)

说明：  Circle Detection using Dynamic Hough Transform. It has also sample images that can be use.

说明：  针对多种光栅，传输谱反射谱进行仿真，同时对反射谱加入切趾函数抑制旁瓣，MATLAB仿真(For a variety of gratings, the transmission spectrum reflection spectrum is simulated, and the apodization function is added to the reflection spectrum to suppress side lobes, MATLAB simulation)

说明：  小波插值（全小波插值，小波双线性插值，小波双三次插值及其改进）放大图像，提高图像的分辨率；对插值图像做质量评价（峰值信噪比PSNR；均方信噪比SNR）(Wavelet interpolation (full wavelet interpolation, wavelet bilinear interpolation, cubic interpolation and improved method) to enlarge the image and improve image resolution assesse the interpolation image (peak signal to noise ratio PSNR mean square signal to noise ratio SNR))

A股市场WIND数据库技术指标日时间序列矩阵导出(Export Database technical indicators day time series matrix A-share market WIND)

Minh Do《Contourlet toolbox》(Contourlet变换影像处理工具箱)(Minh Do《Contourlet toolbox》)

本程序应用于火电厂主蒸汽温度额度辨识，仅限于单回路辨识，参数辨识精度较高(The procedure used in thermal power plant main steam temperature limit identification, limited to single-loop identification, high precision parameter identification)

对一维脉冲信号可去除基底，且做结构函数分析。如果是二维信号，可进行动态谱分析，进行二维高斯函数拟合(Can remove the base and do the structure function analysis of the one-dimensional pulse signal. If it is a two-dimensional signal dynamic spectral analysis, two-dimensional Gaussian function fitting)

MEMORY,NEURAL NETWORK & PROTEIN

旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)