PCA1

一种具有提示功能的文本框，可以根据实际使用进行重新，具有很好的参考价值(A text box with prompts that can be re-based on actual use, a good reference value)

有关卡调用的很好资料，希望对大家有用，一起学习(hand book)

说明：  有关于大学 声源定位 的数据处理相关程序(University of sound source location on the data processing procedures)

说明：  经典的石子划分问题，不同质量和数量的石子进行划分，以求最优解(Classic stone division, different quality and quantity of stones to be divided, with a view to the optimal solution)

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)

calculates BER of BPSK on OFDM

用matlab和VC实现图像匹配拼接的sift算法(VC implementation using matlab and the image matching algorithm sift Splicing)

说明：  program c++ for vector quantization use k-means

C_与MATLAB混合编程(英文版),讲解如何用C与MATLAB的混合编程运用。(C_ mixed with the MATLAB programming (English))

该书详细介绍了Boost库的数十种子库，是目前为止我找到的最详细的Boost库中文书籍(The book details the Boost libraries dozens seed bank, is by far the most detailed I ve found Boost library books Chinese)