是一个优秀的语义个人发布平台，主要集中于美学，Web标准和可用性。它支持多用户...

Parzen 窗 和 K近邻法进行概率密度估计 还带一个示波器控件.-Parzen window and K-nearest neighbor method probability density is estimated to bring an oscilloscope control.

蚁群算法解决0-1背包问题,是一个比较小的程序，运行过，没有问题的。-the solving method of zero to one backage with ACO.It is a small programe for the zero to one problem.

基于canny的灰色预测和模式识别,标定的一种做法是：在一块平板上画若干个点， 同时用这两部相机照相，分别得到这些点在它们像平面上的像点，利用这两组像点的几何关系就可以得到这两部相机的相对位置。然而，无论在物平面或像平面上我们都无法直接得到没有几何尺寸的“点”。实际的做法是在物平面上画若干个圆（称为靶标），它们的圆心就是几何的点了。而它们的像一般会变形，如图1所示，所以必须从靶标上的这些圆的像中把圆心的像精确地找到，标定就可实现。-Based on the gray canny prediction and pattern recognition, calibration approach is to: a plate painted in a number of points, at the same time with these two cameras camera, respectively, as these points in their plane as points, the use of these two groups geometric relationship between the image point can be that the relative positions of two cameras. However, in terms of objects such as plane or plane, we can not directly be no geometry point. Actual practice is complex plane painted in a number of round (known as targets), their geometric center of a circle is the point. And they generally like deformation, as shown in Figure 1, it must target these round, like in the center of a circle of like to find precise, calibration can achieve.

多核环境下运行了可满足性分析的工具软件，能够使你充分了解多核编程技术-Multi-core environment running satisfiability analysis tools, enabling you to fully understand the multi-core programming technology

kmeans算法,许多同学做毕设需要用到-kmeans algorithm, many students needed to do to complete set up

rhapsody in C++企业解决方案-rhapsody in C++ Enterprise Solutions

Fuzzy Rule Base Implementation

模拟退火算法实验，使用MATLAB实现。-The simulated annealing algorithm, using MATLAB experiment.

一种数据聚类算法的源码，可以在模式识别和图像处理中试用。 -a data clustering algorithm source code, in pattern recognition and image processing trial.

ClustanGraphics聚类分析工具。提供了11种聚类算法。 Single Linkage (or Minimum Method, Nearest Neighbor) Complete Linkage (or Maximum Method, Furthest Neighbor) Average Linkage (UPGMA) Weighted Average Linkage (WPGMA) Mean Proximity Centroid (UPGMC) Median (WPGMC) Increase in Sum of Squares (Ward s Method) Sum of Squares Flexible (ß space distortion parameter) Density (or k-linkage, density-seeking mode analysis) -ClustanGraphics clustering analysis tools. Provides 11 kinds of clustering algorithms. Single Linkage (or Minimum Method, Nearest Neighbor) Complete Linkage (or Maximum Method, Furthest Neighbor) Average Linkage (UPGMA) Weighted Average Linkage (WPGMA) Mean ProximityCentroid (UPGMC) Median (WPGMC) Increase in Sum of Squares (Ward s Method) Sum of SquaresFlexible (? space distortion parameter) Density (or k-linkage, density-seeking mode analysis)