使用J2ME收发短信SMS相关源代码

决策树分类算法，c4.5，java语言进行描述的-Decision tree classification algorithm, c4.5, java language described

白月门窗厂订单管理系统。 订单的常规管理和客户查询系统-White on doors and windows factory order management system. Of conventional management and customer order inquiry system

黑色向右滑出的多级纯CSS菜单，一看就知道是国外的CSS达人写的，兼容性想当不错，鼠标放在一级主菜单 上，二级子菜单向右滑出，也就是展开，测试了一下，好像最多只支持两级。

电子跑表设计 希望对大家有帮助 这是我今年的课程设计 -electronic stopwatch design we want to help me this year and this is the course design

数独是一种源自18世纪末瑞士的数学智力拼图游戏。拼图是九宫格（即3格宽×3格高）的正方形状，每一格又细分为一个九宫格。在每一个小九宫格中，分别填上1至9的数字，让整个大九宫格每一列、每一行的数字都不重复。 数独的玩法逻辑简单，数字排列方式千变万化。不少教育者认为数独是锻炼脑筋的好方法。-Sudoku is a kind of Switzerland originated in late 18th century mathematical intelligence jigsaw puzzle. Puzzle is the squares (ie, 3 cells wide × 3 grid H) of square-shaped, each divided into a fine grid squares. Small squares in each of the respective fill in the figures 1-9, so that the whole big squares in each row, each row will not repeat the figures. The logic of playing Sudoku is simple, the arrangement of the ever-changing figures. Many educators think Sudoku is a good way to exercise their brains.

Program for the generation of postals on 8th March, on Februaries, 23 and on 1th April to the chief

完美仿真MATLAB瑞利信道的相位包络概率密度-Perfect simulation of MATLAB Rayleigh channel, the phase envelope probability density

第1例到第6例的源描述都是从第8例的程序包中 提取出来的,不能单独编译,这些例子的编译与 模拟请参考第8例.-Example No. 1 to the first six cases are the source described in Example 8 from the first package to extract it and can not be a separate compiler, which compiler and simulation examples please refer to the first eight cases.

五种排序算法，此外，几乎包含了所有常见的数论里的算法。-five sort algorithm。in addition，contains all the common algorithm of maths

数根 数也有根吗？有！数根就是把一个数的各个数位上的值相加，直到得到一个一位数为止。请你编写一个程序来计算任意数N（0≤N≤1000000000000）的根。 输入： 输入有多个案例。每一个案例为一行，每行只有一个整数N。当输入的N是-1时，输入结束。 输出： 每一个案例输出一行。每行只有一个数字，就是N对应的数根。 Sample input 39 -1 Sample output 3-Number of root number also has roots do? There is! The number of roots is to a number of different values on the digital sum until they have been a number of up to one. Please write a program to calculate an arbitrary number N (0 ≤ N ≤ 1000000000000) roots. Input: Enter a number of cases. Each case for the line, each line is only an integer N. When the input of N is-1, the input end. Output: the output line of each case. There is only one number per line, that is, N corresponds to the number of roots. Sample input 39-1 Sample output 3