基层图书馆的县实现了SOM和学习。语言：C #（.NET…

本课题基于汉语普通话客观质量评价的模型、利用MOS主观评价方法和客观评价方法对语音样本进行评价。并分析客观评价方法的优缺点及在研究中遇到的问题和改进方法，其主要研究内容是利用MATLAB的建立语音客观评价模型，涉及到人工神经网络，数字信号处理等方面的内容。-The issue of objective quality evaluation based on the Mandarin model, using MOS subjective evaluation method and objective evaluation of speech samples evaluated. And analyze the advantages and disadvantages of an objective evaluation method of the problems encountered in the study and improvement of methods, the main research content is to use MATLAB model for the establishment of objective evaluation of speech, involving artificial neural networks, digital signal processing and other aspects.

遗传算法的源代码下载,遗传算法的源代码下载-Genetic algorithm source code download, genetic algorithm source code download

遗传算法源程序evolution calculates the law origin code ,C-C++,人工智能/AI-NN-PR -genetic algorithm calculates the source evolution law orig in code, C-C, AI/AI- NN-PR

对多类点进行分类，有图像界面，使用了多种分类算法-Points to the many types of classification, there are graphical interfaces, using a variety of classification algorithms

关联规则并行算法Count Distribution的C与MPI实现-Parallel Algorithm for Association Rules Count Distribution of C and MPI realize

实现文字的识别 利用比较先进的神经网络笔者已经实验 绝对可行！-it is a good method to realize te recgniton of words.it is based on bp network,the author realized it!

机器人足球的程序,机器人足球大赛的有关源代码-robot soccer procedures, the robot soccer competition of the source code

pso 粒子智能优化算法，C语言实现。欢迎下载。-Intelligent Optimization Algorithm pso particles, C language. Welcome to download

灰色预测模型称为CM模型，G为grey的第一个字母，M为model的第一个字母。GM（1，1）表示一阶的，一个变量的微分方程型预测模型。GM（1，1）是一阶单序列的线性动态模型，主要用于时间序列预测。 一、GM（1，1）建模 设有数列 共有 个观察值 对 作累加生成，得到新的数列 灰色理论与模型及在车辆拥有量预测中的应用 灰色神经网络交通事故预测比较 灰色系统(第三版)-projections Gray (No. Third Edition)

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.