Sublime

Delphi通讯录程序源码，界面精美，你可学习一下本程序在界面方面的设计技巧，当然使用了三方控件，另外，窗口左侧的节点树，也是很常用的窗口菜单，也有必要学习一下。通讯录的功能比较强大，界面易于浏览通讯录信息，可输入的通讯信息也比较多，数据库使用Access。

说明：  opencv编译流程，讲述了如何用cmake编译opencv。(Opencv compilation process)

说明：  计算PLL环路的传递函数，环路带宽，相位裕度等参数； 根据相位噪声大致估算对应的输出信号的jitter(calculate the transformer function, bandwidth, phase margin .etc; and calculate the jitter from phase noise;)

SVPWM仿真 实现PWM整流器的双闭环控制(SVPWMsimulation the double feedback control strategy of PWM rectifier)

基于stm32和ov7670的数字字符识别(Digital character recognition based on STM32 and ov7670)

说明：  包括MATLAB原程序代码，注释，图片，为实验完整素材。(Including Matlab original program code, notes, pictures, for the experiment complete material.)

一个不错的DES加密和解密程序,可以看看这个程序(A good DES encryption and decryption procedures, can take a look at this program)

“面包圈大战”程序。 编译donuts.dsw文件，在Debug目录下会生成donuts.exe文件，直接双击该文件，即可运行“面包圈大战”程序。 *************** 要正确编译该程序，需要安装DirectX 9.0及其以上版本。-"bread circle Wars" procedures. Compiler donuts.dsw documents in the Debug directory will generate donuts.exe document, double-click the file directly, and can run "bread circle Wars" procedures.******************************* To compile the correct procedures need to install DirectX version 9.0 and above.

ST7735小液晶屏在STC51单片机上使用的控制代码，这个代码晚上不太好找，所以上传到这里共享下，同时也给自己备份下。(ST7735 small LCD screen in the use of STC51 microcontroller control code, this code is not easy to find in the evening, so upload to share here, but also to their own backup.)

旅行商问题(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.)