FNN利用MATLAB编程安装nefcon遵循这些步骤：1。打开…

基于matlab和DSP的IIR/FIR 滤波器-Matlab and DSP-based IIR/FIR filter

给语音加噪声的一个程序，可以给定需要加噪声的分贝数，程序会自动加载，选用的是随机白噪声。-Plus noise to the voice of a program, you can determine the needs to increase the number of decibels of noise, the program will automatically load, selected at random white noise.

ｍａｔｌａｂ编写的计算排序问题或者求最优值问题，适用于数学建模以及工程计算-Matlab calculations prepared by the scheduling problem or seek optimal values, apply to mathematical modeling, and engineering computing

Multi-objective evolutionary algorithm - an application-Multi-objective evolutionary algorithm- an application

包含了许多的最优化算法，有牛顿法，单纯形法等，都已运行通过了-Contains a number of optimization algorithms, there is Newton" s method, simplex method, etc., have to run through the

web流数据聚类挖掘的研究和应用。流数据作为一种特殊的可挖掘的数据类型，特别是基于网络技术迅速发展的今天，其彰显出的重要地位决定了它的挖掘技术需要被认真考虑，而如何在流数据中进行有效的聚类分析，是一个吸引研究者很大注意力的问题。-Clustering web streaming data mining research and applications. Flow data as a special type of data that can be excavated, in particular the rapid development of Web-based technology today, it underlines the important status of the decision of its mining technology need to be seriously considered, and how to stream data effectively together type of analysis, is a great to attract the attention of researchers question.

这是一个用于数据挖掘的常用算法的模板库（数据挖掘的C++模板库for UNIX)-for data mining algorithms commonly used template library (data mining C template library for UNIX)

网上的一个BP算法实现数字识别的demo，希望能对其开发者有帮助-a BP online digital algorithm to identify the demo, hoping they can help developers

神经网络的源代码，关于字符识别的一些东西-Neural network source code, something about character recognition

我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...