ModbusTCP监控程序

OpenGL的一个简单列子，实现图形的绘制功能-OpenGL Liezi a simple, graphical implementation of the mapping function

获取CUP的状态信息-CUP access to the state information

WinCE下的串口收发程序，支持三个串口，多种波特率-under WinCE Serial Transceivers procedures, three serial port support, a variety of baud rate

hanoi MFC hanoi MFC hanoi MFC hanoi MFC-hanoi MFChanoi MFChanoi MFChanoi MFChanoi MFChanoi MFC

这是一个关于图像处理的程序，能够将像素比较低的图像变成分辨率高的图像.-This is a matter of image processing procedures, can be relatively low-pixel high resolution image into the image.

Bindows是一个用来创建功能强大的瘦客户端应用程序的框架。Bindows应用程序运行于现代的Web浏览器中。在其中，它们使用DHTML来呈现丰富的可以包含很多不同窗体小部件（widget）的图形用户界面（GUI）。Bindows应用程序可以使用很多方法与服务器端进行交互。其中大多数方法是基于XML的。它同样支持XML-RPC和基于SOAP的Web Services。程序设计语言是JavaScript。 所有windows控件的模拟。按钮，标签，列表，文本框，对话框，颜色，样式，等等，一个典型桌面应用应该有的控件、样式都具备 新版本1.30beta，增加了千呼万唤的Theme支持。Erik&Emil不愧为世界水平的JavaScript高手，原本仅用做浏览器脚本支持的这个小东西如今被发挥得淋漓尽致，几乎到了浏览器JavaScript所能表现的最高境界-Bindows is a framework for B/S application. it works with morden exploer, use DHTML show GUI composed by lots of different widgets, and support many way to communicate with server base on XML,support XML-RPC and web services(SOAP).Bindows developed use JavaScript, implement all widgets in windows( button,tag,list-box, editbox,dialog) with same color and style etc. which enough to build a classic desktop application. New 1.30beta version, add Theme support. Erik&Emil is famous JavaSrcipt developer,they let the JavaScript on the top of the world.

本程序主要实现了根据你当前的输入，计算下一天的日期，并显示正确结果，主要用于测试实验。-the main procedures under your current input, calculating the next day"s date, and demonstrate the correct results, mainly for tests and experiments.

约瑟夫环（Joseph）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始人选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从它在顺时针方向的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。试设计一个程序求出出列顺序-Joseph Central (Joseph) a description of the problem is: numbered 1,2, ..., n of n individuals according to a clockwise direction around a circle, each holding a password (positive integer). The beginning of a positive integer as a candidate at a number of upper limit of m, from the first individual to embark on the clockwise direction since the beginning of the order of 1 is reported the number of stops required to report back at a few m. Those who reported m out of his password as the new value of m, in a clockwise direction from the next person to start off again from the 1, and so on, until all that out until all. Try to design a procedure to derive the column order

用C++语言实现建立拓扑结构图并输出拓扑有序序列-With C++ Language to achieve the establishment of topology and output topology map in an orderly sequence

有例子程序，网上搜集，每次只能使用15分钟。winCE 下 zc030x 封装类-There are examples of programs, on-line collection, each can only use 15 minutes. winCE wrapper classes under the zc030x