BDS卫星坐标解算

The manuscript describes performance comparison of nearest-neighbor interpolation and bilinear to reduce the complexity of decoder WZVC.

在没有虚拟领导者的情况下能够实现多智能体编队，并能够避免智能体之间的碰撞(Under no circumstances can the virtual leader of the multi-agent formation, and the ability to avoid collisions between agent)

说明：  STM32+AD7606串行程序，采用spi串行读取数据，单片机采用stm32f407(STM32+AD7606 serial program,using spi serial to read data,single-chip using stm32f407)

student management application that simulates a student hostel.C++ 3.1 aplication . object oriented programming

我们的目的是将一个分数拆分成若干个分子是1分母是正整数的分数之和的形式。例如2/3可以拆分成1/2+1/6的形式。这里不考虑顺序，比如1/6+1/2和1/2+1/6相同。 输入p, q, a, n, 其中p/q为分数，对这个分数进行拆分，要求拆分的分数个数不能多于n个，所有分母的乘积不能大于a。求有多少种拆分方法? 输入：最多200组数据。在每行中都有四个数分别表示p, q, a, n，之间以空格隔开，并且满足p,q<=800，a<=12000，n<=7，最后以四个0做为输入的结束。 输入示例: 2 3 120 3 2 3 300 3 0 0 0 0 输出示例: 4 7 (Our aim is to split a fraction into a number of elements is a denominator is a positive integer fraction of the sum of form. For example, 2/3 can be split into 1/2+1/6 form. Not considered here, the order, such as 1/6+1/2 and 1/2+1/6 of the same. Input p, q, a, n, where p/q as a fraction of this split scores require no more than the number of split points n-all the product of the denominator can not be larger than a. How many kinds of demand split method? Input: Up to 200 sets of data. In each line has four numbers indicate the p, q, a, n, separated by a space between, and meet the p, q < = 800, a < = 12000, n < = 7, the end, four 0 as the input end. Input Example: 2,312,032,330,030,000 sample output: 47)

学习c语言必读的一本书，指针讲解的很透彻。(c program language pointer)

控制器计算机通过通信系统从地面站接受指令并报告自己的状态。通常控制器可完成以下工作:手动控制、安全装置启动、蓄电池状态、转向极限、制动器解脱、行走灯光、驱动和转向电机控制和充电接触器等。某些AGV小车具有编程能力，允许小车离开导引路径，驶向某个示教地点，完成任务后循原道返回到导引路径上来

The running time of rc4 and xxtea is compared.

这个包是学习预测一个结构化的输出，如中所述的多类对象检测模型的结构化的预测方法的一个实现 （德赛 C.Ramanan D.梦

bridge pattern in c++. vs2010, vs2010