这是我的老师讲课的java课件，入门很简单，但很容易理解…

约瑟夫环的精简版 实现功能 精简 数据结构专用 -Josephus streamlined version of the functionality to streamline data structure dedicated

Windows Mobile 手机应用的Java applet开发示例

一个多线程的SOCKET程序,是用C++写的,不错的东东,大家可以-More than one thread of the SOCKET procedure is C++ Written Dongdong good, we can

给出一个连通带权的无向图，找出该图的最小生成树。并带有问题的详细描述及测试数据。-Given a connected weighted undirected graph, find the minimum spanning tree graph. With a detailed description of the problem and the test data.

可读入Visual C++工程，浏览编辑工程下的各文件，类似Visual C++的漂亮界面。-into readable Visual C, browsing and editing of the project, which is similar to Visual C beautiful interface.

拉格朗日插值法构造通过n+1个互异点上的次数不超过n的插值多项式P（x),利用此多项式计算在某一点的值-Lagrange interpolation structures differ by n+1 points on a number of no more than n, the interpolation polynomial P (x), take advantage of this polynomial calculation of the value of a point

EncryptPE V2.2007.12.01 脱壳机（源码） Only For V220071201 支持SDK修复 支持codeReplace修复 作者 sh-EncryptPE V2.2007.12.01 shelling machine (source) Only For V220071201 support the SDK support codeReplace repair repair Author sh

动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 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

模拟梁的震动，根据函数关系式y=asin(2∏t/T)sin(2∏x/L)绘制梁振动曲线，其中a为振幅，T为周期，L为梁长！在窗口内出现梁振动图象。-simulated beam vibration, according to a function y =- asin (2 t/T) sin (2 x/L) mapping beam vibration curve, which for a amplitude, T cycle, L-beams! Within the window beam images.

giveio control the parellel port in application