串口大师 比串口助手好用，可以检测系统线程

f h hghg hghf hghgf hg hgfh-f h hghg hghf hghgf hg hgfh

我总结的泰文的排版规则，对要做泰文排版的，应该很有帮助。-Thai layout rule.

这里搜集了Jmail的各种方法和属性，拿来分享，可供初学者使用。-Here Jmail collected a variety of methods and attributes used to sharing, for beginners to use.

c51中关键词说明,帮助初学着掌握C ,-C51 in the words that help the beginner to master C,

下面的函数LoadBmpFile，其功能是从一个.bmp文件中读取数据(包括BITMAPINFOHEADER，调色板和实际图象数据)，将其存储在一个全局内存句柄hImgData中，这个hImgData将在以后的图象处理程序中用到。同时填写一个类型为HBITMAP的全局变量hBitmap和一个类型为HPALETTE的全局变量hPalette。这两个变量将在处理WM_PAINT消息时用到，用来显示位图。该函数的两个参数分别是用来显示位图的窗口句柄，和.bmp文件名(全路径)。当函数成功时，返回TRUE，否则返回FALSE。-The following function LoadBmpFile, its function is from a. Bmp file to read data (including the BITMAPINFOHEADER, palette and the actual image data), its stored in a global memory handle hImgData, this hImgData will in the future plans used as treatment procedures. At the same time, fill out a type of global variable HBITMAP HBITMAP HPALETTE and a type of global variable hPalette. These two variables will be used for treatment WM_PAINT message, used to display bitmaps. The function of two parameters are used to display the bitmap handle of the window, and. Bmp file name (full path). When the function is successful, return TRUE, otherwise return FALSE.

对于人工神经网络的种类,使用，原理做了详细的介绍，是读者对此有一个比较全面的了解-For the types of artificial neural networks, use, theory made a detailed introduction to the readers to have a more comprehensive understanding of

Calculate Gravitational map

This Exercise 6.SSD2-This is Exercise 6.SSD2

用简单的结构体实现人事管理系统的编辑，包括添加、删除、修改、搜索等，用最简单的思路完成较为复杂的操作

用数据结构(C语言版)编写程序，实现一个国际象棋的马踏遍棋盘的演示程序。具体要求为：将马随机放在国际象棋的8*8棋盘的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。用堆栈编制非递归程序求出马的行走路线，并按求出的行走路线，将数字1,2,3,……,64依次填入一个8*8的方阵，输出之。 -With the data structure (C language version) to write programs to achieve a chess board horse travels to the demonstration program. Specific requirements are: the horses were randomly placed in the 8* 8 chess board in a box, Ma according to the rules of chess to go mobile. Requires that each box is only entered once, traveled all the 64 squares on a chessboard. The preparation of non-recursive procedure with the stack order to run for walking routes, and then find the routes will be the number 1,2,3, ... ..., 64 in turn fill in an 8* 8 matrix, the output of.