BP-image-compress

This finds size of nano particle, via some image processing technique. we have to enter the minimum and maximum diameter of particles to get download....

This Filter provides a selective mean (averaging) lter. In contrast to the standard mean lter,it preserves edges better and is less sensitive to outliers(outliers are those that are not included in the measurement taking place.In this case averaging). The lter smooths an image by taking an average over the neighbouring pixels, but only includes those pixels that have a value not deviating from the current pixel by more than a given range. The range is dened by the standard deviation of the pixel values within the neighbourhood . If the number of pixels in this range is too low (less than `Minimum Pixel Fraction ), averaging over all neighbouring pixels is performed.With the `Outlier Aware option, averaging over all neighbouring pixels excludes the center pixel.

说明：  研究能量受限的SWIPT无线通信网络中，基站采用MIMO多天线发送信号给用户节点，在有窃听节点的情况下，通过联合优化发射波束形成矢量、人工噪声协方差和接收PS比来最小化总发射功率，同时保证每个接收机的个体保密率和能量收集约束。(In the energy limited swipt wireless communication network, the base station uses MIMO multi antenna to send signals to user nodes. In the case of eavesdropping nodes, the total transmit power is minimized by jointly optimizing transmit beamforming vector, artificial noise covariance and receive PS ratio, while ensuring the individual confidentiality rate and energy collection constraint of each receiver.)

说明：  这是一个pso优化bp神经网络的预测算法，可用亲测(This is a prediction algorithm of pso optimized bp neural network, available for pro test)

用MATLAB编写的递推最小二乘算法算法LMS算法,karlman算法(using MATLAB recursive least squares algorithm LMS algorithm, the algorithm karlman)

非常好的三边定位代码，希望与大家共享它的精彩之处(Very good trilateral positioning code, and hope to share the wonderful)

传统的K-medoids聚类算法的聚类结果随初始中心点的 不同而波动，且计算复杂度较高不适宜处理大规模数据集； 快速K-medoids聚类算法通过选择合适的初始聚类中心改进 了传统K-medoids聚类算法，但是快速K-medoids聚类算法 的初始聚类中心有可能位于同一类簇。为了克服传统的K- medoids聚类算法和快速K-medoids聚类算法的缺陷，提出 一种基于粒计算的K-medoids聚类算法。(The traditional K-medoids clustering algorithm clustering results with different initial center points and volatility, and high computational complexity is not suitable for processing large data sets; K-medoids clustering algorithm by choosing proper initial cluster centers to improve the traditional K-medoids clustering algorithm, but the initial cluster center of K-medoids clustering algorithm can be located in the same cluster. In order to overcome the shortcomings of the traditional K- medoids clustering algorithm and the fast K-medoids clustering algorithm, a K-medoids clustering algorithm based on granular computing is proposed.)

用matlab 中的Simulik设计的PID程序，适用于压缩机！(The Simulik with matlab PID design procedure for the compressor!)

随机撒点程序 对随机撒的点进行分类 按距离进行分类(Random scatter point program for random scatter of points clas)

该书是一本MATLAB程序设计的完整教材，特别是对于程序开发助教来说，可以说是一顿丰盛的午餐。(This book is a complete MATLAB programming teaching materials, especially for program development assistant, this can be said to be a sumptuous lunch.)