qisiwole

本书荣获2005年第十五届Jolt通用类图书震撼大奖。 继 Effective C++ 之后，Scott Meyers 于 1996 推出这本「续集」。本书与现今之 C++ 标准规格几乎相同。可能变化的几个弹性之处，Meyers 也都有所说明与提示。(the book won the 2005 session of the 15th General Books Jolt Awards shock. Following the Effective C, Scott Meyers in 1996 to launch the "sequel." The book's C with the current standard is almost the same. Several possible changes in flexibility, Meyers also has suggested and described.)

MAT-file importer to C++ with and without binds to matread/write library functions

基于马尔可夫链的蒙特卡洛方法在matlab中的实现程序(Based on markov chain monte carlo method is implemented in the matlab program)

说明：  在过去的几年中, 背包问题吸引了众多理论研究人员和应用工作者的注意力, 因而得到了广泛而深入的研究。理论方面, 研究兴趣主要来自于该问题简单的结构, 而这种特点既可以深入探索许多组合特性, 又可以通过解决一系列背包子问题来最终求解更为复杂的优化问题。实践方面, 这些问题可以表述许多工业场合的应用, 最典型的应用包括货 物装载、存储分配和资本预算等等。在寻找背包问题可行解的过程中, 出现了众多的算法, 本文是利用MATLAB 程序求背包问题可行解的一种算法。(In the past few years, knapsack problem has attracted many researchers and application of theoretical attention of workers, which has been extensive and in-depth study. Theory, research interest mainly from the simple structure of the problem, and this characteristic combination of both in-depth exploration of many features, but also can solve a series of knapsack sub-problems to solve more complex final optimization problem. Practice, these problems can be expressed in many industrial applications where the most typical applications include cargo loading, storage, distribution and capital budgets, and so on. Knapsack problem in finding feasible solutions in the process, there have been many algorithms, this is the knapsack problem using MATLAB program seeking a feasible solution algorithm.)

GM工具积分属性修改-by_精湛架设-奇迹私服一条龙-奇迹SF版本(GM Tools integral attribute modification-by_ superb erection- PW train miracle- a miracle SF version)

In short, to-the-point chapters, Practical C++ Programming covers all aspects of programming including style, software engineering, programming design, object-oriented design, and debugging. It also covers common mistakes and how to find (and avoid) them. End of chapter exercises help you ensure you ve mastered the material. Steve Oualline s clear, easy-going writing style and hands-on approach to learning make Practical C++ Programming a nearly painless way to master this complex but powerful programming language.

darkeden 6.67 ver exe file!!

关于紫外光语音通信系统的大气信道的仿真程序（MATLAB实现）(UV-voice communications systems on the atmospheric channel simulation program (MATLAB implementation))

图像压缩算法的各种算法，用VC++实现，直接可以编译运行(Image compression algorithms algorithms, using VC++ implementation can be compiled to run directly)

说明：  给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入. 输入:第一行两个正整数n(物品数)和C(容量) 第二行n个正整数n,表示物品价值 第三行n个正整数n,表示物品重量 输出:第一行表示总价值 第二行n个数(0/1),0表示物品不装入,1表示装入 例如, 输入: 5 10 6 3 5 4 6 2 2 6 5 4 输出 15 1 1 0 0 1 (Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)