Eigenvalue

一是利用计算机对正整数进行素因子分解认识素数，通过运用筛法与试除法寻找一定范围内的素数，体会到筛法比试除法有效但无法找出所有素数；二是通过若干特殊形式的素数的研究，寻找素数生成公式，发现一些结论；三是借助于非线性拟合技术，观察素数分布规律，利用其研究有关数论问题。(The first computer was used to prime factor decomposition of positive integers understanding of prime numbers, through the use of screening method and trial division to find prime numbers within a certain range, the division experienced a test of an effective screening method but can not identify all the prime numbers second is through a number of special form of prime numbers research, looking for prime number generation formula, found that some of the conclusions third, by means of non-linear fitting technique to observe the distribution of prime numbers, using their research on number theory problems.)

ex9_11 雷达脉冲压缩处理。对接收到的雷达回波信号进行正交解调，产生理想线性调频脉冲压缩系数。进行脉压处理。(ex9_11 radar pulse compression processing. Butt received radar echo signals, quadrature demodulation, resulting in an ideal LFM pulse compression factor. Pulse pressure to deal with.)

vmware存储IO控制。 在vsphere环境下，当存储IO性能达到顶峰时，如何有效的控制IOps的大小，不至于将存储写爆了。(vmware storage IO control. In vsphere environment, when the storage IO performance peaked IOps how to effectively control the size, not the memory write burst.)

非二位元LDPC 16 CODE錯誤率 非二位元LDPC 16 CODE錯誤率(Non-two yuan LDPC 16 CODE error rate of non-two yuan LDPC 16 CODE error rate)

相图与庞加莱截面，但程序有点问题，需要交流，相图应该是对的(A problem, the phase diagram and Poincare section)

sequence data struct

NLSE用于求解偏微分方程 可演示非线性光纤光学任何一个方程(NLSE pian weifen fang cheng qiu jie guang xian guang xue yan shi cheng xu ke jie ren he yi ge pain wei fen fang cheng )

Implement the O(1) Bilateral Filter with Constant Spatial filters and a Gaussian range filter

这两个是关于柱体跟等腰三角形的RCS计算matlab程序，还不错哦(Two cylinder isosceles RCS matlab program, also good, oh)

Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.