Chapter_3

一个基于粒子群算法的三维搜索例程，有助于深入学习和了解粒子群算法(A routines of three-dimensional search based on particle swarm optimization , help-depth study and understanding of particle swarm algorithm)

针对三个非相干QASK数字调制信号的空间谱估计程序(For three non-coherent digital modulation signals QASK spatial spectrum estimation procedure)

matlab软件上的数字图像处理基础源程序(digital image processing programs)

说明：  数据挖掘算法，K-means聚类算法源代码，用于聚类分析(data mining algorithms, K-means clustering algorithm source code for the cluster analysis)

电梯概率问题 可以在准备数学建模的时候作为练习资料(mathmodeling)

多种码的解码程序，用matlab写成，包含多种算法(A variety of code decoding process, written with matlab)

说明：  SCFDE的仿真，使用qpsk，还有相关文档(the simulation of SCFDE with QPSK)

一些关于小波变换的例子，很有用哦。对于理解小波很有用(Some examples of wavelet transform, useful Oh. Useful for understanding the wavelet)

说明：  C++源代码，递归实现。原问题描述：鼓上蚤时迁到一个山洞里去盗宝，里面有n件宝贝，价值分别是a1,a2......an，并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包，能装的东西最大价值是K，他只能进洞一次，请问他最多能带出多少？ 要求：输入K，n，a1，a2......an 输出：他能最多带出的宝物价值 (C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures)

对卡尔曼滤波的matalb仿真进行详细描述，。(Simulation of the Kalman filter matalb detailed description.)