纸币面额识别代码

实验指导　低通采样定理实验 FFT频谱分析实验 IIR滤波器设计实验 窗函数法FIR滤波器设计 频率采样法FIR滤波器设计实验(Experimental guide low-pass sampling theorem FFT spectrum analysis experiment experiment experiment IIR Filter Design Window Function FIR filter design frequency sampling FIR filter design experiment)

Gram-Schmidt orthogonalization of the columns of A.

一个很好用的自适应人工神经网络模型库，包括ADALINE/RBF/多层前向等，另外内含Demo，更易上手(A good use of adaptive artificial neural network model library, including the ADALINE/RBF/Multi-layer and so on, the other containing the Demo, even易上手)

说明：  这是一个在matlab中实现灰度图像二值化的小程序(This is a gray image is implemented in the matlab binary applet)

超短激光脉冲传输：展宽、色散、自自相位调制、倍频、FROG，超短脉冲测量(Ultrashort laser pulse transmission: broadening, dispersion, since the self-phase modulation, frequency, FROG, ultra-short pulse measurement)

prmlmatlab各章算法程序的编写，这些程序是各大名校的大牛人认真编写，给我们学习MATLAB有很大帮助(prmlmatlab algorithm procedures for the preparation of each chapter, these programs are the major schools of large cattle carefully prepared, give us great help to learn MATLAB)

find pitch to detection gender

Photovoltaic (PV) or solar energy is expected to be one of the most important

说明：  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)

this matlab source code is for introduction