AbstractHttpClientConnection

jsp文件，三角形的三边关系，三条边各自的长度，组成三角形的三边的条件，各种情况的分析(Triangle Success)

In this paper age is classified indifferent groups.

在局域网中，管理员常常需要将某条信息发送给一组用户。如果使用一对一的发送方法，虽然是可行的，但是过于麻烦，也常会出现漏发、错发。为了更有效的解决这种组通信问题，出现了一种多播技术（也常称为组播通信），它是基于IP层的通信技术(In a LAN, administrators often need to send a certain message to a group of users. If one to one transmission method is used, it is feasible, but it is too troublesome, and often there will be missed and wrong hair. In order to solve this kind of communication problem more effectively, there is a multicast technology (often called multicast communication). It is a communication technology based on the IP layer.)

哈夫曼树编码,利用哈夫曼树算法实现对数据的压缩,很好,不错(Huffman tree coding, using Huffman tree algorithm to achieve data compression, good, good)

包括所有二进制功能Shiro(没有依赖关系),在某些构建有用的 环境(如Ant)。 然而,这是 不 不推荐在Maven构建 保持正确的依赖项的元数据,从而导致Maven工作错误。 对于Maven构建, 它是 高度 建议指定单个模块下面列出的要求他们。(Includes all binary functionality for Shiro (without dependencies), useful in certain build environments (e.g. Ant). However, this is NOT recommended in Maven builds as it does not retain correct dependency metadata, which can lead to Maven working incorrectly. For Maven builds, it is highly recommended to specify individual modules listed below as you require them.)

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

C# CPUTemperature 实例源码下载

通过文本文档读取矩阵，并存储为二重指针。(Read the matrix and store it as a double pointer.)

采用vc语言编写，完成了图书馆里系统的借书和储存。(Written in VC language, the system has borrowed and stored books in the library.)

java深入浅出设计模式的 一个总结 (Head First Design Patterns of Summary)