winldap

利用GNSS 进行高精度导航定位的前提是正确固定载波相位观测值的整周模糊度。由Galileo 系统的4 个载波观测值可以 形成诸多有良好特性的组合观测值,利用这些组合观测值,结合MCAR 方法,可以有效地确定整周模糊度。(The use of high-precision GNSS navigation and positioning the premise is correct carrier phase observations fixed integer ambiguity. May consist of four carriers observations Galileo system There are many good characteristics to form a combination of observations using a combination of these observations, combined with MCAR method can effectively determine the integer ambiguity.)

实现VC++与Matlab的混合编程，解决这 个问题， 不仅能更好地发挥Matlab 强大的功能， 还能快速地进行软件开发， 尤其是当软件开发中需要实现复杂的数学算法、图形处理时尤为迫切。(The realization of VC++ and Matlab mixed programming, to solve thisA question, not only can play a better Matlab powerful function, can rapidly in software development, especially when the software development need to realize the complex mathematical algorithms, graphics processing is particularly urgent.)

这篇文章是盲信号处理，因为是英文文章，所以大家看内容就好了。(Principal component analysis (PCA) is a mainstay of modern data analysis- a black box that is widely used but poorly understood. The goal of this paper is to dispel the magic behind this black box. This tutorial focuses on building a solid intuition for how and why principal component analysis works furthermore, it crystallizes this knowledge by deriving from simple intuitions, the mathematics behind PCA . This tutorial does not shy away from explaining the ideas informally, nor does it shy away from the mathematics. The hope is that by addressing both aspects, readers of all levels will be able to gain a better understanding of PCA as well as the when, the how and the why of applying this technique.)

一些基于元胞自动机的小程序 帮助理解元胞自动机(Cellular Automata)

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

信道编解码中的turbo编解码程序，采用了多种解码算法，进行了性能比较，信道模拟高斯白噪声信道(Channel of the turbo codec codec procedures, using a variety of decoding algorithms, a performance comparison, channel analog Gaussian white noise channel)

一元多项式的计算 有输入多项式项 有加法项 有减法项 有乘法项等(Unary polynomial calculation)

阿鲁发行可理解和空间哈空间和康皇客家健康双方的空间上看到合肥看见谁的罚款速度快解放看见爱上的合法看见(Aru understandable and spatial distribution of space and Kang Huang Ha Hakka healthy to see both sides of the room to see who is a fine of Hefei, quick to see the liberation of the legitimate love to see)

shadow detection paper from net,it is value

运用C语言对高斯信道进行仿真，简洁快速的实现(The use of C language Gaussian channel simulation, simple rapid implementation)