一本关于人机交互中人机对话的英文教程，其中涉及到了建立语言模型及鲁棒性相关的内容。...

ASP.NET编写的网络像册,可以作为模板开发个人网站或其他，强烈推荐。-ASP.NET prepared by the network album artwork, as a template can develop individual sites or other, strongly recommended.

sdjfhsf this mcq5 SSD1-sdjfhsf this is mcq5 SSD1

经典c程序100例.doc，电子书，网上下的，还不错-Classic c procedures for 100 cases. Doc, e-books, online under, not bad

Project Server 2003系统限管理-Project Server 2003 system restrictions management

汇编语言，教你如何编写高效的汇编程序，使你在短时间内成为汇编高手-computer principle and asm language

这是PKI入门，以及理解PKI的非常好的一本书-This is the entry PKI, PKI and understanding a very good book

好书一定要大家分享！-books to share with you!

level set methods and dynamic implicit surfaces

This book is based on my best-selling book Sams Teach Yourself SQL in 10 Minutes, which has become one of the most-used SQL tutorials in the world, with an emphasis on teaching what you really need to know, methodically, systematically, and simply.

背包问题动态规划算法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.