机载雷达导论

数字游戏代码是一款通过键盘上下左右按钮控制数字移动方向游戏源代(Digital Game Code is the source of a game that controls the direction of digital movement through keyboard buttons.)

C#获取并查看Windows系统日志，实际上是获取了Windows系统事件查看器中的内容，并像系统一样对日志查看器分类，将其分为应用程序日志、安全性日志、系统日志等内容，可显示每条日志的生成时间、来源、分类及事件等信息。

包括一个复杂算法的执行程序和源代码,我编写用来测试GT3速度效果的东东.很简单请不要见笑.-including a complex algorithm implementation, and the source code, I used to prepare GT3 speed test results saucepan. Please do not simply a laughing stock.

通达信公式教程，详细的函数说明，这种资料网上很难找到。-Letter to the formula accessible tutorial detail function description, such information is difficult to find online.

RPCA的代码实现。内容包含部分测试程序以及测试图片(RPCA code implementation.It contains part of the test program and test pictures.)

Scanning and source code analysis of designated websites, forums, posting bars, micro-blogs and Weixin public documents can be carried out. Meanwhile, feature numbers can be grabbed. Public opinion warning can be carried out through three modes: system interface, mail and short message, and various graphical public opinion analysis can be provided. At the same time, the system supports multi-level departments and multi-user definitions. Deploying a system can provide independent public opinion monitoring services for different departments. It is a low-cost, high-efficiency and high-precision Internet public opinion monitoring solution.

FFT频偏估计算法，性能不错，用于GMSK调制(FFT frequency offset estimation algorithm, good performance, for GMSK modulation)

双馈风力发电并网模型，这是系统自带的风力发电模型。可用于学习风力发电的并网过程及故障分析 (Grid connected model of doubly fed wind power generation)

明华智能卡的上位机程序，可以给研发智能卡的用户带来方便-Minghua smart card PC procedures to be developed smart card is convenient for users

通过欧几里德距离对三维空间内的数据点进行聚类： 从文件读入三列表示坐标的数据进行聚类。按项目总数和组数平均划分。首先计算两两之间的距离，选出最近的两个点，再按距离由小到大排序，找出距这两个点最近的若干个点。 除去这些点后对其余的点重复进行上述操作。-By Euclidean distance on three-dimensional space, clustering of data points: from the file read into the three coordinates of the data indicated that cluster. According to the average number of total number of projects and group division. First, calculate the distance between 22 to elect the nearest two points, and then from small to large order to identify these two points away from a number of recent points. After removing these points the rest of the point of repeating to carry out such operations.