lee03a.ps

全波形反演最速下降法，共轭梯度发matlab程序。仅供参考(Matlab conjugate gradient method)

可以产生PN码序列，可用于直扩通信等需要PN序列的地方。(Can generate PN code sequence, can be used for DSSS communications needs of the local PN sequence.)

实现四路复用程序。通过walsh正交码的复用技术，matlab仿真(achieve multiplexing process. Walsh orthogonal codes through the Reuse, Matlab simulation)

MATLAB中代码矢量化的经典指南，非常实用。 (MATLAB code vector of the classic guide, very practical.)

neural network program with 1

是一个很好的kalman程序包，其中包括几个实例和仿真，而其有详细的解释说明。(Kalman is a good package, which includes several examples and simulation, and its detailed explanation.)

计算旅行商问题的一个ＧＵＩ程序，浙江大学的学生设计的～～～～～(Calculation of a GUI program traveling salesman problem)

这是一篇关于MotomanHP6动力学仿真的论文，对于做这个方面的人很有参考和借鉴价值，推荐(This is a dynamic simulation on the MotomanHP6 papers, for people who do this in great reference and learning value, recommended)

说明：  基于Graph Cut的一种分割方法，比较著名的论文。(Graph Cut based on a segmentation method to compare the famous paper.)

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