网站首页

low-noise-CCD-

于 2013-12-13 发布文件大小:504KB

 0  102

下载积分: 1 下载次数: 1

我要下载

代码说明：

低噪声CCD信号采集与处理系统技术研究 (Research on low-noise CCD signal acquisition and processing system technology)

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

freeman_2components_decomposition_T3
freeman_2components_decomposition_T3 效果不错(freeman_2components_decomposition_T3 have a good result)

2015-03-24 10:36:51下载

积分：1
Timer
CC2530的定时器实验，使用IAR编写。(CC2530 key experiments, using IAR preparation procedures.)

2014-02-14 10:29:09下载

积分：1
zuiyoutidu
最速下降法的Matlab程序，实现函数无约束条件下的最小值求解(Steepest descent method in Matlab, functions to achieve the minimum under no constraints to solve)

2011-12-14 08:51:16下载

积分：1
GUI_2
matlab初学者资料里面有M程序的详细文件还有编程直接运行即可(Matlab beginners material inside have M program detailed document and programming can be run directly )

2012-03-30 11:20:47下载

积分：1
pipe
Stuff. This is only to become a uploading member to start working on a Chinese language system for my programs. I will upload soon.

2014-10-02 01:51:22下载

积分：1
1
说明：将Minpack库中的LM算法封装成库，经过调试，通过算例运行结果与Matlab中运行出来的结果相差0.01范围内。(Will Minpack library package into the LM algorithm library，After debugging An example is the results is only 0.01 Difference from the result of Matlab s! )

2009-08-09 22:15:03下载

积分：1
New--GP-programming
一种新的改进的遗传编程，调用的子函数描述的很清晰，涵盖了经典遗传编程的所有步骤，方便大家的学习和参考(A new and improved genetic programming, call the subroutine described in very clear and covers all the steps of classical genetic programming, we facilitate learning and reference)

2011-05-08 18:08:25下载

积分：1
TSP
说明：介绍求解TSP 问题的蚁群算法，是解决旅行售货员问题的一种比较好的方法(Introduced to solve the ant colony algorithm for TSP problem is to solve the traveling salesman problem of a better way to)

2009-08-21 09:57:16下载

积分：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
ProjectPlanningfinal
MODTRAN MATLAB 结合使用且可以移植到VC(MODTRAN MATLAB and can be used in conjunction ported to VC)

2008-06-30 10:14:17下载

积分：1

696524资源总数
103957会员总数
51今日下载

low-noise-CCD-

0 个回复

热门标签

热门下载