数据库预算法分析(Java英文版) 数据库预算法分析(Java英文版)

DmoVideoWatermark 这是一个DMO组件，演示了Windows Media支持的水印叠加功能。-DmoVideoWatermark This is a DMO components, demonstration of support of the Windows Media superimposed watermark functions.

这是别人写的编程经验,现传上来与大家共享-This is written by someone else programming experience, and now onto Chuan share

视频截图，不需要播放器，直接从视频中截图 mfc工程文件-Video screenshot, no player, directly from the video project file screenshot mfc

曲线拟合涉及回答两个基本问题: 最佳拟合意味着什么？应该用什么样的曲线？可用许多不同 的方法定义最佳拟合, 并存在无穷数目的曲线. 所以, 从这里开始, 我们走向何方？正如它证实的那 样, 当最佳拟合被解释为在数据点的最小误差平方和, 且所用的曲线限定为多项式时, 那么曲线拟 合是相当简捷的.-Curve fitting involves answering two fundamental questions: What does it mean for the best fit? What should be the kind of curve? Available in many different ways to define the best fitting, and the existence of infinite number of curves. So, from here on, we going? As it proved, when the best fit is interpreted as data points in the smallest error sum of squares, and used to be limited to polynomial curve, then curve fitting is very simple.

< Java课程设计》介绍及代码.rar-lt; Lt; Java curriculum design "presentation and code. Rar

库存管理系统（C++） 一个C++编写的库存管理系统，拥有增加删除修改输出存盘等功能,学习C++的好程序-repertory management system (C++): A repertory management system using C++. It includes "add", "delete", "modify", "output", "save" etc. It is useful for C++ leanner.

java程序员 面试试题新-java

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

C#程序开发范例宝典 图书光盘附带源码 第三章-C# Program development paradigm Baodian Book CD-ROM attached to source Chapter III

c++语言程序设计（第2版）》-c Language Program Design (2nd Edition) "