1133671672316

通过M atlab 模拟了随机产生的一定概率分布的信号序列, 叠加高斯噪声后利用最大后验概率(MAP)检 测到的误码率, 做出BER~ SNR曲线, 并与理论计算得到的曲线进行比较, 两者吻合.(M atlab simulated by a certain probability distribution of random signal sequence, use of superposition of Gaussian noise is the maximum a posteriori (MAP) detection to the error rate, making BER ~ SNR curves obtained with the theoretical curve of the combined fit.)

利用一阶局域加权法进行混沌时间序列的预测。(Using a weighted-rank local-region method of forecasting chaotic time series.)

POS inventory system

这个程序针对的问题是: 17个人为成圈,依次编号为0-16,从第一号开始报数,报到3的倍数的人离开, 一直数下去,直到最后只剩1人,求此人的编号. 程序有点复杂，不过还只能算是初级的水平 (This procedure for the question is: 17 individuals into the circle, followed by numbered 0-16, from the first to begin reported the number of people who report a multiple of three to leave, to keep counting votes until the last only a person seeking this person number. program a bit complicated, but can only be considered the primary level of)

微型逆变器初始化，简单易学，大家互相分享源码。(Micro-inverter initialization, easy to learn, we share with one another source.)

new raja login gm tool

Patterns of Enterprise application architecture

对ising模型的模拟，这是二维的情况，对于学物理的人很重要的。(Ising model for the simulation, which is two-dimensional case, for physics, it is very important.)

freeman_2components_decomposition_T3 效果不错(freeman_2components_decomposition_T3 have a good result)

递归法求解整数划分。 整数划分，是指把一个正整数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) )