My custom PID+SMC+FUZZY

说明：  STC8F2K64S2系列单片机提供16个中断请求源，分别是：外部中断0中断（int0）、定时器0中断（timer0）、外部中断1中断（int1）、定时器1中断（timer1）、串行端口1中断（uart1）、低压检测中断（lvd）。，串行端口2中断（UART2），串行外围接口中断（SPI），外部中断2中断（INT2），外部中断3中断（INT3），定时器2中断（Timer2），外部中断4中断（INT4），定时器3中断（Timer3），定时器4中断（Timer4），比较器内部PT（CMP），I2C总线中断。除了外部中断2、外部中断3、定时器2中断、定时器3中断、定时器4中断和比较器中断固定是最低优先级中断外，所有其他中断都有四个可设置的中断优先级。(STC8F2K64S2 series single chip microcomputer provides 16 interrupt request sources, which are: external interrupt 0 interrupt (INT0), timer 0 interrupt (Timer0), external interrupt 1 interrupt (INT1), timer 1 interrupt (Timer1), serial port 1 interrupt (UART1), low voltage detection interrupt (LVD), serial port 2 interrupt (UART2), serial peripheral interface interrupt (SPI), external interrupt 2 interrupt (INT2), external interrupt 3 interrupt (INT3), Timer 2 interrupt (Timer2), external interrupt 4 interrupt (INT4), timer 3 interrupt (Timer3), timer 4 interrupt (Timer4), comparator interrupt (CMP), I2C bus interrupt. Except that the external interrupt 2, the external interrupt 3, the timer 2 interrupt, the timer 3 interrupt, the timer 4 interrupt and the comparator interrupt fixed are the lowest priority interrupts, all the other interrupts have four interrupt priorities that can be set.)

用C语言编程产生离散单位斜边序列、门序列、指数衰减序列，实现三者卷积，并在显示器上观察到相关序列或卷积的图形。比较经典的卷积C源码-C language programming produce discrete units hypotenuse sequence, the gate sequence, exponential decay sequence, the realization of the three convolution, and observed in the display sequence, or convolution-related graphics.This is the classical convolution C original code

这是一个计算机图形学中图形填充的算法，包括种子填充中简单填充算法和扫描线填充算法！-This is a computer graphics to fill the graphics algorithms, including seeds filling simple filling algorithm and scanning fill algorithm!

关于apihook的过检测源码。、只供研究。请勿商业用途(The source code for the over detection of apihook. Only for research. Do not use commercial use)

CAA XML解析，简单的XML解析Demo(CAA XML Parse,A simple XML parsing the Demo)

eWebEditor v4.6版本下载，一款好用的网页在线编辑器，可上传图片、上传文件等。适合ASP/PHP/JSP/ASP.NET多平台调用,精简版式去除了一些不常用的功能,好像官网现在的精简版似乎不能用了，越来越让用商业版了，这个4.6版本虽然不是最新，但大部分功能都可以用了。还带有上传功能。需要的试试吧。

旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)

说明：  FIR低通数字滤波器的设计，利用matlab编程语言利用FIR1函数设计低通滤波器。(Design of FIR Low Pass Digital Filter)

资源描述基于IAP15W4K58S4-小四轴DIY设计，包括原理图、遥控器和四轴本身的源代码

适用于Linux的漂亮网页仪表板可以参考参考。(A beautiful web dashboard for Linux)