Para.-Est.-and-Inv.-Problems

用MATLAB　实现一简单的数字（0--9）识别程序，非常好的源码。(Using MATLAB to achieve a simple number (0- 9) identification procedures, a very good source.)

Supermarket cashier system .doc(Supermarket cashier system )

说明：  利用耦合模理论分析了光纤Bragg光栅中纤芯模间的耦合、倾斜光纤光栅中纤芯模与辐射模和包层模间的耦合(The coupling mode theory was used to analyze the coupling between the core modes in the fiber Bragg grating and the coupling between the core mode and the radiation mode and the cladding mode in the tilted fiber grating.)

用来进行滤波的，这是基于matlab环境的编程程序。(I hope this code can help others.)

实验四 数字解调与眼图 1. 验证2DPSK 相干解调原理。 2. 验证2FSK 过零检测解调原理。 (Four digital demodulation experiment with eye diagrams 1. verify the 2DPSK coherent demodulation. 2. Verify 2FSK zero-crossing detection and demodulation principle.)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

运用matlab语言编译，进行聚类分析，并且给出了matlab界面。(failed to translate)

wood_berry蒸馏塔的PID控制，使用matlab编程实现。(wood_berry distillation column PID control, the use of matlab programming.)

非均匀天线组阵SUMPLE权值信噪比及信号合成性能分析(Non-uniform antenna arraying SUMPLE weights SNR performance analysis and signal synthesis)

Matlab初学者入门教材，轻松掌握Matlab的教材之一(Matlab beginners introductory textbook, easily mastered one of the textbooks in Matlab)