实现类似PHOTOSHOP的橡皮擦，光标随擦子增大而变化。

java入门与事例指导,让你在学习语言的同时能够通过通过源代码来学习java-Java introduction and example,you will study java by code when you learn language

这个是大学大一学生VFP的课程设计~完全是自己做的~很有难度-This is a course design of an undergraduate, made by himsely totally. It is a higher level.

好用，简洁，似然不是很长，但是很好用，功能很强大-easy to use

c# ftp 管理器c# ftp 管理器c# ftp 管理器c# ftp 管理器c# ftp 管理器c# ftp 管理器c# ftp 管理器c# ftp 管理器c# ftp 管理器c# ftp 管理器c# ftp 管理器

打字速度测试！可以在WINDOWS 下直接运行..翻译. 开发工具：VB-mesure the speed of inputing word.directly run under windows.by vb.

编写此代码是使用 opencv，使用三种方法来检测行人，如猪，帧差异和背景的差异。这种算法是非常 stable！

word文档转换成HTML……方便用户的阅读！-word document converted to HTML ... ... to read a user-friendly!

python rmi codes,just give u a example to use RMI in python.

QRcode解码译码器，功能为读入一张图片译出其内容，图片可以是拍摄的。本站其他相关资源都没有此部分源码，此为本人结合官方JAVA源码编写的完整译码部分，具体功能包括图形探测定位、图形过滤校正、检错纠错等。-QRcode codec decoder, functions as a picture translated to read its contents, pictures can be taken. Site other related resources are not part of this source, this is my official JAVA source combined with the preparation of a complete decoding of the specific features include detection of positioning graphics, graphics filter correction, such as Error Detection and Correction.

动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(ij)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通过下方元素可知最终结果的分组方式。-dynamic programming matrix continually multiply-dynamic programming problem is a problem-solving method. It does not require the results need to be how to divide the problems of the sub- problems fixed, but different input given by the specific example of the problem partition method, and then calculate, and answer questions. Matrix continually multiply the main idea is as follows : 1) the installation of the size of continually multiply the number phalanx 2) above the main diagonal elements Di, j (ilt; J) Matrix Mi continually multiply to the smallest workload 3) below elements Di, j (IGT; J) the record was the smallest workload of a matrix of the first group of a matrix of the final sequence, followed by the final element of the final results of the