graphcuts

wavelet based codes.. college projects

说明：  神经网络的计算，包括训练和测试两部分，利用的是最小均方误差算法。(Nerual network calculation,including training and working part,utilizing MMSE algorithm.)

数值线性代数Gauss迭代法解决课后习题(Numerical linear algebra, Gauss iterative method to solve after-school exercise)

Particle Swarm Optimization Toolbox (PSO)

：针对城市电网无功优化规划工作缺乏支撑工具的问题，结合实际业务特点，运用多层次的问题分解和 分层架构设计思想，研发了适用于城市高中压配网的无功优化规划软件模块，包括优化计算、原始数据与结 果数据管理子模块，涵盖现状年及目标年单阶段和多阶段无功优化规划功能。(Research on Reactive Power Planning Module for Urban Power Network)

主要有采样定理的主程序和FFT算法程序，能运行！(Mainly on the sampling theorem and the FFT algorithm program the main program can run! )

matlab simulation in tl and cable

应用小种群遗传原理求函数最值的matlab实例(max or min)

均匀性度量法分割图像（二值化处理）对应的MATLAB程序(Uniformity of measurement method of image segmentation ( two values of the corresponding MATLAB program ))

传统的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.)