offddm

情人节表白攻略，大家来试试吧,很有意思的(Valentine' s Day confession Raiders, everyone to try it, very interesting)

一个动态链接库的使用程序，对动态链接库不是很懂的兄弟，科研好好研究一下-a dynamic link library procedures for the use of dynamic link library is not really understand them brothers, look carefully at the research

CSS3彩虹弹性转动加载动画特效彩虹弹簧式从地平线出现到隐没的(CSS3 Rainbow Elastic Rotation Loading Animation Special Effects)

展讯芯片 改串号的软件-Spreadtrum chips to software serial number

vc编写的游戏俄罗斯方块，功能齐全，很适合大家研究学习vc。-vc Tetris game written in complete functions, it is suitable for everyone to consider learning vc.

uccos下的STM32的开发平台，可用于单片机系统开发，融合所有的驱动，并移植了fatfs(STM32+UCCOS+fatfs+tcpip+sd+usb+)

说明：  这是采用esprit算法实现目标一维角度测量。输入多接收阵元接收的回波信号，代码实现过程参照吴仁彪老师翻译的现代信号谱分析这本书。(This is to use ESPRIT algorithm to achieve one-dimensional angle measurement. Input the echo signal received by multiple receiving array elements. Refer to the modern signal spectrum analysis book translated by Wu renbiao for the code implementation process.)

[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include int number //队列类型 typedef struct{ int q[20] -[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then

抓包代码 那段代码，是我自己写的。这两个是东西是完成SEND和RECV两个地方，所以返回的地址不一样。这才搞出来那么多代码来-Capture code that code, I wrote it myself. These are two things to complete and Recv SEND two places, so not the same as the return address. This engage in so much code out to

1. Image reduction: ? Alternative line reduction ? Fractal linear reduction to reduce images to any smaller size 2. Use two images to perform image enlargement: ? Pixel replication ? Nearest enlargement ? Bilinear interpolation ? Bicubic interpolation ? Fractal linear expansion to expand images to any larger size 3. Perform negative image operation ? On gray images ? On color images(1. Image reduction. 2. Use two images to perform image enlargement. 3. Perform negative image operation.)