1

旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)

zxing二维码扫描的源代码,包括zxing核心包的jar和ZXingDemo源码,非常详细.(zxing dimensional code scanning of source code, including zxing core package jar and ZXingDemo source, very detailed.)

k均值的分析与，图解，自己亲自测试，能用并且很好(k-mean analysis, diagrams, personally testing, use and well)

orthogonal frequncy dma

洪水调节，根据试算法原理采用matlab编程。(Flood regulation, according to the principles of the test algorithm using matlab programming.)

color image watermarking in r g b planes using rdwt and svd

采用时域、频域、FFT小波变换及数学形态等分析方法完成对滚动轴承的故障诊断(Fault diagnosis of rolling bearing is completed by using time-domain, frequency domain, FFT wavelet transform and mathematical morphology.)

matlab文件操作的典型 例子，欢迎指正(matlab file operations of a typical example, please correct me)

beam forming in matlab using m files

TD-LTE PMCH matlab source code