基于ELMAN神经网络对阶跃响应动态进行补偿也可以举一反三的运用于ELMAN网络的其他应用...

机械手臂的设计,有三个关节和两个手臂,大家共同-Robot design, has three joints and two arms, a common U.S.

多段图的分析算法,找到最优路径,用VC编的-more of the map analysis algorithms to find the optimal path, the series with VC

目前开发人工只能的朋友一定会遇到bp算法中八进制的问题，这段程序很好的解决了这个问题。我目前在作模糊控制，神经网络，遗传算法的课题，收集了很多相关程序，望同方向者探讨一二。-only friends will find bp algorithm octal problem, this process satisfactorily resolved this problem. Now I make fuzzy control, neural networks, genetic algorithms topic, a lot of collection procedures, and hopes to explore the same direction on January 2.

neural network limulated in C

ART2自组织神经网络vc++源程序，调试通过，可以使用。-ART2 self-organizing neural network vc++ Source code, debugging through, you can use.

研究机器人控制不可多得资料，强烈推荐-robot control study rare, strongly recommended!

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.

独立成分分析的批数据处理算法JADE,计算量虽然大些，但至今仍被人采用-Independent component analysis of batch data-processing algorithm JADE, although the calculation of the volume, but is still used

neural networks applications

基于神经网络的文字识别系统,它通过遗传算法实现。-Neural Network Based Character Recognition system, which through genetic algorithm.