mfcdde

一维激波管黎曼问题的精确解（用于求解一维激波管黎曼问题）(Riemann shock tube problem of one-dimensional exact solution (one-dimensional shock tube used to solve the Riemann problem))

We present a methodology for tracking multiple skin-colored objects in a monocular image sequence. The proposed approach encompasses a collection of techniques that allow the modeling, detection and temporal association of skin- colored objects across image sequences.

用于保存为ASC2字符集的烧写代码文本文件 转为 原始BIN二进制代码(Save ASC2 for the programming code for the character set to the original text file BIN Binary code)

这个代码是基于MSFlexGrid基础功能进行改良扩展的示例----商业日报和私人旅行里程示例，代码增强了隔行变色，以及整行选择、双击事件，并加入了合计计算功能。同时支持打印输出模拟功能。整个代码为一个类文件，大家可以再此基础上继续扩展和修改。(This code is based on the basis of the functions of MSFlexGrid improved sample expansion---- Business Daily and private travel mileage example, color code to strengthen the de-interlacing, as well as the choice of the entire line, double-click events, and joined the combined computing power. At the same time, support for analog functions printout. The entire code into a class file, we can continue to expand on this basis and modified.)

若允许天平两边放砝码,times应从-num[index]开始,并且分段计算sum,本例只放天平一边,()

gh0st3.6个人修改版远程控制源码，功能齐全，无错编译。(gh0st3.6 personally modified version of the remote control source, fully functional, error-free compile.)

基于Visual c++ 的指纹识别系统(fingerprint Visualc++)

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.)

基于随机事件的驱动模拟，利用栈，队列的知识开发的一个银行驱动事件模拟(Driven simulation based on random events, using stacks, queues of knowledge development of a bank-driven event simulation)

使用类编程实现临界区，VC++网络编程，使用VC6.0编译器实现(Use class programming critical, VC++ network programming, using VC6.0 compiler implements)