psoPnn(optimize-the-learning-rate)

为大家提供了粉色噪声产生方法的一段matlab程序(to provide you with a pink noise of a Matlab procedures)

GPS在连续波干扰下的捕获程序_PRN9(Capture program for GPS under continuous wave interference)

这里面有两个程序，两个都是采用4QAM调制。不过个人觉得第一个更容易懂，因为写的很有条理。我改的那个程序就是根据这个来的。 不过在这里面有个问题就是信道系数只能是由高到低，大家可以试试，改成[0.227 0.46 0.688 0.46 0.227]这个是老师给我的仿真中常用的信道系数，这个成为归一化信道，就是系数平方和为1. 第二个程序没有涉及到信道系数，但是这个程序当中，在128个子载波中，前后有32个空载波，这个在OFDM中也是经常用的，这样可以降低误码率。 (And there are two programs, two are based on 4QAM modulation. But personally feel that the first is easier, because the writing is organized. I changed that procedure is based on the past. However, there is a problem in that there is only channel coefficients from high to low, we can try and change into [0.227 0.46 0.688 0.46 0.227] This is the teacher gave me the simulation channel coefficient commonly used, this became normalized channel, is coefficient of the square and is 1. The second program is not related to channel coefficients, but this program which, in the 128 sub-carriers, the before and after the 32 air carriers, the in OFDM is also often used, which can reduce the error rate.)

is a program which counts the number of primes between 1 and N.

说明：  1.1 背包问题 有一个徒步旅行者，已知他能承受的旅行背包的重量不超过a（kg）。设有n种物品可供他选择装入背包，这n种物品分别编号为1，2，…，n。其中第i种物品每件的重量为ai（kg），其使用价值（指一件第i种物品对旅行者来说所带来的好处的一种数量指标）为ci（i＝1，2，…，n）。问这位旅行者应如何选择携带这n种物品的件数，使得总价值最大？ (1.1 knapsack problem is a hikers. he is known to travel to withstand the weight of the backpack not exceed a (kg). N Species with articles for his choice loaded backpack, n product were numbered 1, 2, ..., n. I first of which product each ai of the weight (kg), its value (i refers to a section of the types of items travelers the benefits brought by a number of indicators) for the ci (i = 1, 2, ..., n). Asked how travelers who choose to bring this product to the n pieces, making the total value of the largest?)

control formation multi agent system

pml吸收边界条件，最简单的海绵吸收，均匀网格(Pml absorption boundary conditions, the simplest sponge absorption, uniform grid)

识别线条的程序，自己的原创，能识别各种颜色的线条(Identify the lines of the program, their own originality, can identify a variety of color lines)

贪食蛇 游戏 matlab—gui 可以选择上下左右走 碰墙结束游戏 可以修改格子大小(sanck is a classical game by matlab )

C语言编写P-Q分解法潮流计算程序，基于BB方案，且该程序采用基于稀疏技术的因子表法进行迭代求解，以降低存储量，提高运算速度。附有IEEE5,14,30,39,118节点系统数据及潮流结果，已验证程序的可行性。(C language PQ decomposition method flow calculation procedures, based on BB plan and carry out the program uses an iterative solution technique based on sparse factor table method to reduce the storage capacity, improve processing speed. IEEE5,14,30,39,118 node system with data and trend results verified the feasibility of the program.)