Linux运行时内核分析

自动控制学报 好象是昆明大学出版的 对于在学校的大学生很有用-Journal of Automation, Kunming University Press seems to be at the School of the University Students for useful

在各种不同的网络传送协议上，为网络编程提供一个大家都很熟悉的接口,需注意各种网络协议的一些特征。本章将全面讲述使用特定协议时应该留意的一些特征，其中包括一些基本的网络连接原理。另外，我们还将讨论如何通过程序向 Wi n s o c k查询协议信息，并探讨针对一种具体协议创建套接字所需的基本步骤。-In a variety of network transmission protocol, in order to provide a network programming interfaces are familiar with the U.S., should pay attention to some of the various characteristics of network protocols. This chapter will talk about a comprehensive agreement to use a specific attention should be drawn to some of the characteristics, including some of the basic principles of network connections. In addition, we will also discuss how Wi nsock inquiry procedure to protocol information, and to explore a specific protocol for the creation of the basic steps required socket.

VB API学习资料-VB API learning materials

这是用c语言实现的一个简单文本编译器，其中包含了所有的源代码和详细的注释说明-This is achieved using c language compiler a simple text, which contains all the source code and detailed notes

C从C++中移，详细说明从C到C++编程的总的数与异数之间的异同。对更好地掌握c/c很有帮助

Dreamwrever教程-Dreamwrever Guide

经典LabWindows CVI方面的教材《LabWindows CVI开发入门和进阶》一书第8章中的例题源码，使用LabWindows CVI的人用得着。麻烦管理员帮我开通下载功能，我急需要本网站上的labwindows/CVI方面的数据库教程，谢谢！-LabWindows CVI aspects of the classic textbook

VC编程的基本例子，通过该例子可以对学习VC起到很到的帮助作用-VC programming basic example, through the examples of VC can learn to play a very helpful

背包问题动态规划算法JAVA 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Knapsack problem dynamic programming algorithm for a given n species JAVA goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.

The C++ Programming Language