"Windows core programming" complementary source code

这是一个关于tree kernel 的文章，很有帮助。比较新的文章-This is an article on the tree kernel to deal with it. Relatively new article

single phase induction motor control stratergy(both software and hardware inplementation)

vsp的一个示例代码

游戏是以第一次世界大战为背景，原本作者的构思只是源于一款多年前比较流行的棋，但是几经修改，游戏已经初具规模。里面加了作者很多创意的成分。因此基本还算的上是slg类型的游戏-The game is take the First World War as a background, author s ideaonly is originally the source in more than section years ago the quite popular chess, but several passed through the revision, the gamelready begins to take shape. Inside added the author very manycreativity ingredient. Therefore basic also calculated on is the slgtype

此程序是解决八数码问题的。由于使用广度优先搜索，并且程序中用数组存储节点。所以只能进行比较简单的操作。-eight digital solve the problem. The use of BFS, and procedures with an array storage nodes. Therefore, only for a relatively simple operation.

这是用于阅读和写作 Modbus TCP 寄存器 VB.net 项目。开始是我找示例程序 VB.net 的 Modbus TCP 的通信。然后我一个样例项目在 CodeProject.com，在这里找到：http://www.codeproject.com/Tips/16260/Modbus-TCP-class这是用 C# 语言，由 Stephan 史翠克的 Modbus TCP 通信 VB.net 项目。原始项目包含 2 个项目。我打开所有这一切，与上述网站转换。提出了用 VB 语言的新项目。我选择.Net 2.0 框架。这个新的项目名为 Modbus 样品 vb。在我的新项目，我只是创建一个项目，是由一种形式、 一个模块组成。我将 Modbus TCP 类移至模块 ModbusTCP，和我在 frmStart 中复制所有的 objek 和 frmStart 将它粘贴在我的新项目。它令人惊叹，翻译的剧本是几乎是完美的只有几行错误。下面图片显示错误行在 ModuleTCP 事件 OnReceive，对代码 ElseIf......我不知道还如何修复这条线，所以我将该行更改为唯一 Else。我的新项目完成后，建立了用 VB 语言编写的 Modbus TCP 客户端。我尝试连接到本地 IP 127.0.0.1，Modbus 模拟器和成功，它可以读取和写入寄存器。

有关嵌入式编程方面的很好的源代码,其中包括了ARM编程的一些讲解和经典粒子-of good source code, which includes a number of ARM programming on the classical particles and

声卡数据采集播放演示源程序（vc）,可以显示声卡书库的波形-Based on VC programming, it is a demo for sound card collection, showing the waveform of sound card library.

该程序实现简单  操作容易  处理起来比较方便   实用性强   相信会有很大帮助对我们   呵呵。

Think the contest score boards are wrong? Here s your chance to come up with the right rankings. Contestants are ranked first by the number of problems solved (the more the better), then by decreasing amounts of penalty time. If two or more contestants are tied in both problems solved and penalty time, they are displayed in order of increasing team numbers. A problem is considered solved by a contestant if any of the submissions for that problem was judged correct. Penalty time is computed as the number of minutes it took for the first correct submission for a problem to be received plus 20 minutes for each incorrect submission received prior to the correct solution. Unsolved problems incur no time penalties.