The quartus achieve the PC

用PSCAD做的三电平svpwm,对学电力电子和风力发电的人应该有用。-svpwm

星星系列―这是一个还不错的游戏，大家-stars series- this a pretty good game, we try

学习Pyhton脚本的源代码，Python是通用的易学的脚本语言-learning Pyhton script source code, Python is a versatile easy to learn scripting language

人机对弈，互取火柴。取最后一根者输。每次至少取一根，最多取4跟。如果人先取则人必输。如果机先取，则机器等待人出错。否则人胜。-Human-computer game, and take matches. The last one loses. Check at least one of each, with up to 4 check. If the person is who will get lost. If the machine to check, then wait for others to machine error. Otherwise, people win.

Computes the hafnian of a nonnegative integer matrix. Notes: Copy hafnian.c to main.c, in the same directory as Rothberg s code (see above). You can download the .tar directory with the code weighted-match.tar here. Then "make" the codes (this codes are in C, not C++). The program is then run by the command "wmatch". -Computes the hafnian of a nonnegative inte ger matrix. Notes : Copy hafnian.c to main.c, in the same directory as Rothberg"s code (see abo ve). You can download the. tar directory with th e code weighted-match.tar here. Then "make" th e codes (this codes are in C, not C). The program is then run by the command "wm atch. "

恒流驱动和提 高LED的光学效率是LED 应用设计的两个关键问题，本文首先介绍大功率LED的应用及其恒流驱动方案的选择指南，然后以美国国家半导体(NS)的产品为例，重点讨论如何巧妙应用 LED恒流驱动电路的采样电阻提高大功率LED的效率，并给出大功率LED驱动器设计与散热设计的注意事项。-LED constant current drive and to improve the optical efficiency of LED application design of two key issues, this paper describes the application of high-power LED constant current driver and the choice of the program guide, and then the United States National Semiconductor (NS) products, for example, focus on how skillful application of LED constant current driver circuit of the sampling resistor to improve the efficiency of high-power LED, and gives high-power LED driver design and thermal design considerations.

1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） 3 编写一个主函数，将上面函数连在一起，构成一个完整程序。 4 将实验源程序调试并运行。 -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!) 3 to prepare a main function, the above function together to form a complete program. 4 source debugging and running the experiment.

编程 工具栏的制作 可供初学者参考使用-programming tools for the production column reference beginners

12864中文资料，介绍了12864基本的用法-12864 Chinese information on the basic usage of the 12864

用kmp算法实现的文档助手算法-with KMP algorithm document assistant algorithm