cPP_opengl_yibiao

用socket编程接口开发面向连接的网络应用程序（TCP/IP协议）(socket)

matlab仿真源代码，AM源程序，用matlab运行(matlab simulation source code, AM source, using matlab to run)

说明：  msimg32 hook dll for any program

可以隐藏信息和读取。用LSB算法的。代码长度不长。VC++环境下(to hide information and read. LSB algorithm used. Code length is not long. VC environment)

实现了两个客户机程序与服务器程序间的进程通信(本机)。客户机与服务器间的通信是双向的，采用QLocalServer与QLocalSocket实现。(The realization of the two procedures and the client server inter-process communication (local). Client and server communication is a two-way, using QLocalServer with QLocalSocket achieve.)

基于vc++6.0的佳点集遗传算法的编程，里面的各项参数均可由使用者自我调整!(Vc++6.0 based on the good point set genetic algorithm programming, which the parameters can be adjusted by the users themselves!)

matlab高级编程的所有源程序,以章节为单位，源程序很全(all program of matlab )

FTCP动态库是使用C++语言编写的可以实现与DTU交互的工具包(The FTCP dynamic library is a toolkit that uses the C++ language to interact with DTU)

校园导航问题，设计你的学校的平面图，至少包括10个以上的景点（场所），每两个景点间可以有不同的路，且路长也可能不同，找出从任意景点到达另一景点的最佳路径（最短路径）。 要求： （1）以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。 （2）为来访客人提供图中任意景点相关信息的查询。 （3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。 （4）修改景点信息。 (Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path). Requirements: (1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information. (2) the figure for visiting any sites offering information about the query. (3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites. (4) modify the attractions information.)

SERPSK SERPAM SERQAM