datag

电力系统分析牛顿拉夫逊法就算潮流主程序及各个子程序合计牛拉法(Power Systems Analysis Newton Raphson even if the trend of the main program and each subroutine Total cattle Rafah)

卡尔曼滤波程序实现，非线性卡尔曼滤波，matlab程序(Nonlinear Kalman filtering, matlab program)

说明：  现代卫星通信系统有关卫星通信的书籍，对做卫星通信的会有用的(Of modern satellite communication system of books on satellite communications, to do so will be useful for satellite communications)

以前常有的调制识别程序大多是基于MATLAB的，本程序是基于C语言的实用程序，可以识别AM、FM、DSB、LSB、USB、CW、Noise等模拟调制信号的调制类型，是在实际工程中正在应用的实用程序！(Previous common modulation identification procedures are mostly based on MATLAB, and this program is based on the C language utility can identify the AM, FM, DSB, LSB, USB, CW, Noise and other analog modulation signal modulation type is the actual project utilities are being applied!)

单张像片后方交会，输入4个以上的控制点，反算外方位元素 (Photo leaflet resection, type of control for more than four points, inverse elements of exterior orientation)

c++ 通用弹道仿真计算程序(经典版)lalalalla(C dandaofangzhenchengxudfdfdfdfdf)

BakeCode通信原理的巴克码模拟编码实现(BakeCode communication principle of Barker code simulation Coding)

Data Abstraction & Problem Solving with C++源码(Data Abstraction )

天波超视距雷达系统仿真(多波束形成)，代码在paper中，而且给出了详细的说明，能够更好理解田博超市距雷达的工作原理(Horizon radar system simulation (multi-beam forming), the code in the paper, but also gives a detailed description, to better understand the field Bo supermarket works from the radar)

说明：   有一个长度为整数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.)