DIR2CLIP

点对点传输文件的程序。使用TransmitFile调用，通信双方既是客户机又是服务器-peer-to-peer file transfer procedures. Use TransmitFile call, communication is both client-server is

新的区域生长算法,自动选择种子点,保证别人没有上传过(very good image segtation)

聊天程序,分客户端和服务端-Chat program, sub-client and server

document marku language lecture and tutorial

说明：  QuartzNet构建windows服务,Topshelf是一个windows service框架，它对windows service进行封装使得我们可以把控制台程序安装成service，便捷的安装以及控制台可视化的调试大大提升了服务的开发效率。以上是我个人理解，如有错误，还望大侠纠正，不胜感激！(QuartzNet builds windows services. Topshell is a framework of windows services. It encapsulates windows services so that we can install console programs into services. Easy installation and visual debugging of console greatly improve the development efficiency of services. The above is my personal understanding. If there is any mistake, I would like to see the hero correct it. Thank you very much.)

采用控件进行网络通讯的聊天服务器软件，已调试过。注意：在开启软件前需搭建网络线路，否则会有错误提示，影响软件正常运行-Controls network communications using the chat server software, have been debug. NOTE: before opening the software to build the network line, or it will error and affect the normal operation of software

Key finder for windows....

通过GPS获取当前位置坐标的简单DEMO(Get GPS coordinates simple DEMO)

VC8源代码，VS.NET 2005 下开发，托管代码。功能：文件编码转换(VC8 source code, VS.NET 2005 under development, managed code. Function: file encoding conversion)

poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills. (poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills.)