用来GNSS时间同步中，时间累计维持UTC时间。测试函数。

自从烟花算法的开创性论文由谭营教授等人于2010年发表之后 [1] ，业界对烟花算法的研究逐步深入和铺开。通过对原始烟花算法的细致、深入的分析，针对原始烟花算法（FWA）的不足，提出了大量的改进方法，并据此发展了各种改进算法，以及与其他方法的混合方法，大大提高的原始烟花算法的性能，同时研究了烟花算法在求解不同类型优化问题的能力，还有大量的研究人员进行了烟花算法的应用研究，给出了一些典型的成功应用案例。(Since the publication of the pioneering algorithm of the fireworks algorithm in 2010 by Professor Tan Ying and others in [1], the research on fireworks algorithm has gradually deepened and spread in the industry. Through the careful and thorough analysis of the original fireworks algorithm, a large number of improvement methods are put forward in view of the shortage of the original fireworks algorithm (FWA), and a variety of improved algorithms are developed, and the performance of the original fireworks algorithm is greatly improved. At the same time, the solution of the fireworks algorithm is not solved. With the ability of the same type optimization problem, a large number of researchers have applied the research on the fireworks algorithm, and given some typical successful application cases.)

一个下拉框,能显示本机所有驱动器,还包括软驱,光驱,用C#编写.-a drop-down box, the machine can show all drives, including floppy drive, optical drive, using C#.

给出PDC模糊控制求解线性矩阵不等式的算法(Given PDC fuzzy control algorithm for solving linear matrix inequalities)

Micrium-TI-uCOS-II-LCD-TMS470R1B1M基于该开发板的应用程序( Micrium-TI-uCOS-II-LCD-TMS470R1B1M The development board based applications)

说明：  黑刀Dezender4.3简体中文版 黑刀Dezender4.3简体中文版 黑刀Dezender4.3简体中文版(Black knife Black knife Dezender4.3 Simplified Chinese Simplified Chinese version of Dezender4.3 Simplified Chinese version of the black knife Dezender4.3)

一个来源于国外网站的C# 折线图实例，里面的注释也是比较多的，只可惜全是英文，运行的界面效果如图所示。 　　此源码看上去像是一个生成正弦、余弦曲线的一个源码例子，源码可在VS2015下顺利编译运行，为你学习C#提供一个参考。

鼠标控制视角移动的范例代码，做游戏非常有用(Move the mouse to control angle sample code, so the game is very useful)

一个数字梯形，选择k条路线，每条路线从第一层的某个数开始，每次进入下一层到达左下或者右下的数字，直到最后一层为止。每条路线不能经过相同的路径，但是可以经过相同的数字节点。 输出一个整数，表示能得到的最大的k条路径经过的数字之和(A digital ladder, the K route, each route the first layer of a number, each time to enter the next layer to reach the left or right next to the number, until the final layer. Each route can not pass through the same path, but can pass through the same number of nodes. Output an integer representing the sum of the number of the largest K paths that can be obtained)

LDC 1000 CMD in the main functions

说明：  MPEG4播放器PLAYA的VC源代码，该代码发布遵循GNU协议(VC source code of MPEG4 player PLAYA, the code release follows GNU agreement ,)