MyOnce

一个C++的垃圾回收器，用于研究垃圾自动回收机制。(The garbage collector is a C++, used to study.)

免杀版ghost3.6 带服务器管理 很容易免杀的 换换资源完爆360全套(dwalfnselgreg fdseres )

说明：  一些有关卡尔曼滤波器的资料，非常全面，对关卡尔曼滤波器的原理用法都有详细的介绍(Some of the Kalman filter the information, very comprehensive, right off the principle of use of the Kalman filter are introduced in detail)

基于googlebuffer协议包与zmq的c#版(C# version based on package and ZMQ googlebuffer agreement)

一个以太网帧解析程序，实现以下功能：解析已封装好的Ethernet V2.0帧封装文件（见附件），判断有多少个帧，每个帧的所有字段内容，检测CRC校验是否正确(An Ethernet frame analysis program, the following functions: parsing the encapsulated Ethernet V2.0 frame encapsulation (see annex), to determine the number of frames, each frame contents all fields to detect CRC checksum is correct)

多基线干涉合成孔径雷达干涉条纹的获取，通过两幅单视复图像进行配准，获取干涉相位(Multi-baseline interferometric synthetic aperture radar interferometry fringes of the acquisition, through two single look complex image registration, access to intervention phase)

数据结构 实验练习 删除相同的节点 希望会对大家有所帮助(Data structures lab exercises to remove the same node want to be helpful to everyone)

采用turbo编程，可实现对鼠标，键盘等操作的识别与输出控制。(Turbo programming, operation of the mouse, keyboard and other identification and output control.)

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone. Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a defined start-point, end-point)

说明：  VC++编写上位机串口通信界面，原创VC++编写串口通信上位机界面 本人做接口实验时上位机部分 (VC++ write PC serial communication interface, the preparation of original VC++ serial communication interface, PC interface, I do some PC experiments)