puma

K最邻近密度估计技术是一种分类方法，不是聚类方法。 不是最优方法，实践中比较流行。 通俗但不一定易懂的规则是： 1.计算待分类数据和不同类中每一个数据的距离（欧氏或马氏）。 2.选出最小的前K数据个距离，这里用到选择排序法。 3.对比这前K个距离，找出K个数据中包含最多的是那个类的数据，即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method. It is not the best method, but it is popular in practice. Popular but not necessarily understandable rule is: 1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov). 2. select the minimum distance from the previous K data, where the choice sorting method is used. 3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)

steganography means we have to hide the information in the image for using encryption and decryption algorithm also.

i don t know what exactly it was

说明：  快速单词拼写检错器，能实现一般的文本操作，另外还能检查单词拼写的对错，字典可以自定义。(rapid spelling error device, able to operate normally text, and checking the wrong spelling, dictionary can define.)

gbest trajectory (gbest trajectory)

说明：  关于VC++和Matlab混合编程的一本PDF格式的书籍。(On the VC++ and Matlab programming mixed a PDF format of the book.)

ORTIMUM VALUES FOR SIM ANNEALING HWURISTICS

此程序适合平行二元阵天线，三维的，方向图乘积定理。(This procedure is suitable parallel binary array antenna, three-dimensional, the direction of graph product theorem.)

线性方程组的数值解法，包括高斯列主元消去法 ,Jacobi迭代法,Gauss--Saidel迭代法,超松弛迭代法(The numerical solution of linear equations, including gaussian pca elimination method, Jacobi iteration method, Gauss- Saidel iteration method, overrelaxation iteration method)

基于灰色关联理论的移动机械人故障诊断方法研究(Based on Grey Relational Theory mobile robot fault diagnosis method)