基于多目标优化的免疫遗传算法 在Matlab环境中的实现,期刊论文。...

基于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.

神经网络算法

一个关于模式识别问题的很好的例子，可以对数组进行检验，非常好用！-a pattern recognition problem on the very good example of the array can be tested very handy!

人工智能的教材啊- Artificial intelligence teaching material

tutorials for learning protege(open source softwar to design the ontology)

人工智能中重要的一个问题, 用广度优先搜索的方法解决-AI an important issue, breadth- first search of solutions

利用遗传算法进行文本聚类的特征选择.把一种特征组合看作一个染色体，对其进行二进制编码，引入文本集密度作为适应度函数进行特征个体适应度的评价. -The use of genetic algorithm feature selection in text clustering. To a combination of characteristics as a chromosome, its binary code, the introduction of text set density as a characteristic of fitness function for evaluation of individual fitness.

he algorithm is equivalent to Infomax by Bell and Sejnowski 1995 [1] using a maximum likelihood formulation. No noise is assumed and the number of observations must equal the number of sources. The BFGS method [2] is used for optimization. The number of independent components are calculated using Bayes Information Criterion [3] (BIC), with PCA for dimension reduction.

K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K－均值聚类的的时间复杂度是n*k*m，其中n为样本数，k为类别数，m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类，寻找最优，列举一遍约66.7天，分成3类，则要约3500万年。针对算法局部最优的缺点，本人正在编制模拟退火程序进行改进。希望及早奉给大家，倾听高手教诲。-K-means clustering algorithm programming. Point by point, including clustering and clustering batch. K-means clustering of the time complexity of n* k* m, n samples, several types of k, m sample dimension. The time complexity is a very objective. Because if we use one billion times per second the computer using 50 samples of two exhaustive method to find the optimal set out again about 66.7 days, divided into three categories, offering 3,500 years. Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements. Early Feng hope for everyone, listen to the master teachings.

模糊控制pid算法，程序化，可以方针，-fuzzy control algorithms, procedures, guidelines,