boost_opengl_tcp

一本非常NB的关于计算机的离散数学与应用书籍！(Discrete Mathematics and its Applications is a focused introduction to the primary themes in a discrete mathematics course, as introduced through extensive applications, expansive discussion, and detailed exercise sets. These themes include mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and enhanced problem-solving skills through modeling. Its intent is to demonstrate the relevance and practicality of discrete mathematics to all students. The Fifth Edition includes a more thorough and linear presentation of logic, proof types and proof writing, and mathematical reasoning. This enhanced coverage will provide students with a solid understanding of the material as it relates to their immediate field of study and other relevant subjects. The inclusion of applications and examples to key topics has been significantly addressed to add clarity to every subject. True to the Fourth Edition, the text-specific web site supplements the subject matter i)

Paillier加密算法的实现。产生512位大数，进行大数运算。1、产生密钥2、加密、3、解密。(Paillier encryption algorithm implementation. Produce 512 Tarsus, Tarsus operation performed. 1, 2 generates a key, encrypts, 3, decryption.)

VC.NET图象处理,采用基于CImage类的图象处理技术,封装的函数为基本的图象处理部分,如几何变换等等,开发环境为VC++.NET(VC.NET image processing, based on CImage kind of image processing technology, Packaging for the basic functions of image processing, such as geometric transformation, and so on, the environment for the development of the VC.NET)

VC++行号显示插件,里面有相应的txt说明文件(VC6 LineNumber Addin dll files.)

基于MFC对话框的OpenGL类：COpenGL，可以在对话框程序中使用OpenGL了，并且提供了全屏与非全屏转换的两个函数，很容易使用，速度快(MFC OpenGL class source code base dialog)

计算三维数据的法矢量并进行调整，里面包括了自己做的实验数据和结果(Three-dimensional data, vector calculation method and make adjustments, which includes the make their own experimental data and results)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)

Visual C++ 6.0程序设计学与用教程的聊天程序(Visual C++ 6.0 programming tutorial learning and use chat program)

用c语言写的基于SVM的多分类源码,来自康奈尔大学,性能良好(C language used SVM-based classification of multi-source, from Cornell University, the performance of good)

labview图形中t轴显示示系统当前时间程序，非常方便实用 (t-axis labview graphical display shows the current system time program, very handy)