《神经网络理论与Matlab7实现》下载资料

在盲辨识系统中，非常关键的是如何获得最好的辨识效果，这里采用了多种方法，通过系统建模，并比较方法(In blind identification system is critical to identify how to get the best effect, this uses a variety of ways, through system modeling, and comparison)

利用元胞自动机算法实现交通流的数学模型构建和模拟，数据输出为.txt文件(Constructing a mathematical model of traffic flow and simulation with the use of cellular automata algorithms, data output as .txt files)

A novel multipath matrix algorithm for exact room response identification in stereo echo cancellation.pdf自己编写的这篇英文文献代码(A novel multipath matrix algorithm for exact room response identification in stereo echo cancellation.pdf English literature I have written this code)

Electric Circuit by simulink

Meanshift运动目标跟踪matlab代码，实现运动目标的跟踪，代码适合新手学习(Meanshift moving target tracking matlab code to achieve the tracking of moving objects, the code for novices to learn!)

matlab源程序,用Sobel算子和拉普拉斯对图像锐化(Matlab source code, image sharpening of Sobel operator and Laplasse )

有关MPSK调制，传输模型。成型脉冲分为矩形，升余弦脉冲，平方根升余弦脉冲。M的值为2，4和8.所加噪声是高斯白噪声。(Of the MPSK modulation, transmission model. Pulse shape is divided into rectangular, raised cosine pulse, the square root raised cosine pulse. The value of M for 2,4 and 8. The increase in noise is Gaussian white noise.)

this code has an amplitude modulation with plots.

标准全局版粒子群算法的单步更新位置速度的功能(Single-step to update the position, velocity function of the standard global version of particle swarm optimization)

NW小世界网络的构成原则为：从一个环状的规则网络开始，网络含有N个结点，每个结点向与它最近邻的K个结点连出K条边，并满足N>>K>>In(N)>>1。随后进行随机化加边，以概率p在随机选取的一对节点之间加上一条边。其中，任意两个不同的节点之间至多只能有一条边，并且每一个节点都不能有边与自身相连。改变p值可以实现从最近邻耦合网络(p=0)向全局耦合网络(p=1)转变。在p足够小和N足够大时，NW小世界模型本质上等同于WS小世界模型。 (NW constitutive principles of small-world networks: from the rules of a ring network, network with N nodes, each node is connected to the K node with its nearest neighbor K edges, and meet N > > K > > In (N) > > 1. Followed by randomization into the plus side, with probability p with an edge between a pair of nodes in a randomly selected. Wherein between any two different nodes at most only one edge, and each node can not have a side connected with itself. P value can be changed to achieve the transition from the nearest neighbor coupling network (p = 0) coupled to the global network (p = 1). When p is small enough and large enough N, NW small-world model is essentially the same as the WS small-world model.)