-
MatlabEngineConsoleTest
说明： VC与MATLAB混合编程，示范例子 使用C++开发(VC versus MATLAB )
- 2011-04-06 14:43:26下载
- 积分：1
-
FCT-MVP
镇流器功能测试系统，采用WT1600功率计和研华PCL-1733/PCL-1734/NI GPIB卡进行控制(Ballast functional test system, using WT1600 power meter and Advantech PCL-1733/PCL-1734/NI GPIB card control)
- 2014-05-17 23:26:22下载
- 积分：1
-
NtMapViewOfSection
最新的C++写的NtMapViewOfSection注入工具，经过长时间测试完全稳定可靠。值得大家使用。(The latest written in C++, NtMapViewOfSection injection tool, after a long test completely reliable. Worth using.)
- 2021-03-14 22:49:22下载
- 积分：1
-
AdaptiveTechniquesforMultiuserOFDM
这是一个非常好的关于OFDM的英文文章，它是国外的博士论文，对于想了解整个OFDM的朋友来说，可以了解到许多中文文章所没有的知识。(This is a very good article in English on OFDM, which is the doctoral thesis abroad, who want to understand the overall OFDM' s friends, you can understand that many Chinese do not have knowledge of the article.)
- 2010-07-18 11:34:02下载
- 积分：1
-
stfl-1.0.tar
实现了ipv6到ipv4的转换（部分实现）(to achieve the ipv4 ipv6 conversion (partially))
- 2007-06-16 19:51:12下载
- 积分：1
-
Doppler
一种MIMO体制天波雷达多普勒扩展杂波抑制方法(Doppler radar system for MIMO-day extension clutter suppression method)
- 2013-12-09 16:39:41下载
- 积分：1
-
adpcm
g.722 code for speech compression
- 2010-03-02 16:08:59下载
- 积分：1
-
0
说明： 给定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)
- 2009-07-01 23:07:01下载
- 积分：1
-
1-20
求从1到20的阶乘，并且可以推广到N阶阶乘，。(Demand from 1 to 20 factorial, and can be extended to N-order factorial,.)
- 2009-12-28 14:34:44下载
- 积分：1
-
beibaowenti
有N件物品和一个容量为V的背包。第i件物品的费用是c，价值是w。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量，且价值总和最大。(There are N items and a knapsack capacity of V' s. No. i is the cost of items c, the value of w. Solving items into the backpack which will enable the cost of these items does not exceed the sum of the capacity of backpack, and the sum of the maximum value.)
- 2009-05-07 22:10:10下载
- 积分：1
