1

热狗工作脚本samp gtasa联机 内含pwn可修改 转载。。。(Hot work script samp. Instead gta)

各种系统(lte和wimax等)使用的典型信道模型(wireless channel model design)

背包问题 贪心法C++实现 功能健康，绝对无毒(Greedy Knapsack Problem C++ Achieve functional health, is absolutely non-toxic)

由于最近做一个项目需要对MATLAB电路图做测试，且需要满足MCDC且覆盖每个门，由于 手工生成非常麻烦而且也容易出错，所以做了个工具来自动生成测试用例(With the recent need to do a project on the MATLAB test circuit, and the need to meet and MCDC coverage of each door, hand-generated as a result of a very troublesome and error-prone, so do a tool to automatically generate test cases)

matlab小波变换源代码，供广大研究者学习(matlab wavelet transform source code, for the majority of researchers to learn)

卡尔曼滤波器进行信道估计的一篇文章，适用于OFDM-MIMO系统。(Kalman filter for channel estimation in an article for OFDM-MIMO systems.)

地震SV波的源代码，得出反射系数，透射系数，转换波的反射系数，透射系数等(SV wave seismic source code, come the reflection coefficient, transmission coefficient, reflection coefficient, transmission coefficient converted waves, etc.)

混合编程，vc++和matlab混合编程，通过rtw转换(Mixed programming, vc++ and matlab mixed programming, through rtw conversion)

递归法求解整数划分。 整数划分，是指把一个正整数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仿真研究与分析，这个不错(Synovial matlab simulation of variable structure control research and analysis, this looks good)