雷达成像算法 压缩感知

说明：  全搜索算法重构图。像顾名思义，穷尽法就是对搜索范围内的每个位置都进行计算并比较，从原图像块中找到与待匹配块最相似（误差最小）位置的方法。对于一个搜索范围为[-7,7]的区域来说，x，y两个方向全部搜索一遍需要进行 15X15 = 225 次计算。穷尽法的缺点很明显就是计算量太大，速度很慢，另一方面，由于全部范围都进行了计算，其匹配精度是最高的。(Reconstruction graph of full search algorithm. As the name implies, the exhaustive method is to calculate and compare each position within the search range, and find the most similar (least error) position with the block to be matched from the original image block. For an area with a search range of [- 7,7], 15x15 = 225 calculations are required for searching both directions X and Y once. The disadvantage of exhaustive method is that the calculation is too large and the speed is very slow. On the other hand, the matching accuracy is the highest because all the ranges are calculated.)

说明：  计算灰度关联度,进行光谱分析，在相关领域使用(Calculate grayscale correlation)

C# 模拟鼠标操作，单击后鼠标将自动上移。 　　const int MOUSEEVENTF_MOVE = 0x0001;//表示鼠标移动 　　const int MOUSEEVENTF_LEFTDOWN = 0x0002;//表示鼠标左键按下 　　const int MOUSEEVENTF_LEFTUP = 0x0004;//表示鼠标左键松开 　　您的鼠标发生了自动上移，并双击了窗体一次！

给定如下的一组关键字，建立一棵二叉排序树，插入结点等操作-Given the following set of keywords, the establishment of a binary sort tree, insert-node operation

破解版的LINGM，適用於天堂繁體字版本 可用範圍270天堂版本(Cracked version of LINGM, applicable to the Heaven version of traditional characters available range 270 Heaven version)

使用Labview软件进行经验模态分解得到本征模态函数(A VI used for Empirical Mode Decomposition before Hilbert-Huang transformation.)

Euler公式与改进Euler比较。-Euler formula and improve Euler comparison.

说明：  stm3210x Lan8720 驱动及demo程序(STm3210x Lan8720 Driver and Demo Program)

祖玛小游戏 实现基本功能 基本算法 给大家参考一下 地图两种圆形 和 直线(Zuma game to achieve the basic functions basic algorithm to refer to two kinds of circular and linear maps)

验证阻塞赋值与非阻塞的赋值赋值过程的先后顺序(Verification of the order of assignment and non blocking assignment)