-
USB
f28335 ti USB扩展接接口系统设计 软件和硬件都有(f28335 ti USB extension connected interface system design software and hardware have)
- 2012-11-19 15:17:54下载
- 积分：1
-
corner-detection
说明： 这是在 Ruadhan 提供的源代码基础上做了一些修改，可以检测图像中的角点。应用环境是：OPENCV BETA 4，VC6 编译运行通过。(Ruadhan This is the basis of the source code to do some modifications, can detect images of the corner. Application Environment : OPENCV BETA 4, VC6 compiler running through.)
- 2006-04-26 16:45:25下载
- 积分：1
-
LCD_TFT
屏幕刷新程序，可实现图片的储存和切换，功能实现完整(Screen refresh process, enabling image storage and switching functions to achieve complete)
- 2014-02-26 13:32:19下载
- 积分：1
-
GEP_genericalgorithm
很好的基因表达式编程（GEP）的入门小程序，C
语言写的，欢迎下载。(gep vc code)
- 2021-04-16 08:48:54下载
- 积分：1
-
easyshell
不错的后门代码，用了一些驱动技术来隐藏进程，隐藏注册表，希望对大家有所帮助(good backdoor code, used some technology-driven process to conceal, hide the registry, and I hope to help everyone)
- 2007-04-16 03:55:07下载
- 积分：1
-
1
说明： 本程序是window平台下，使用virtual C++编写文件下载程序，使用了Http协议(This program is a window platform, use the virtual C++ writing the file download process, using Http protocol)
- 2012-10-17 09:10:34下载
- 积分：1
-
CC2530-in-Chinese
德州仪器公司的CC2530芯片手册，用于ZigBee技术的IEEE 802.15.4协议的2.4GHz通信应用(CC2530-in Chinese)
- 2013-10-26 18:41:11下载
- 积分：1
-
FigTree-v1.4.0
Cluster 斯坦福的对大量微矩阵数据组进行各种簇（Cluster）分析与其它各种处理的软件。
SAM Significance Analysis of Microarrays 的缩写，微矩阵显著性分析软件，EXCEL软件的插件，由Stanford大学编制。 (Cluster Stanford microarray data set for a large variety of cluster (Cluster) analysis software and other kinds of treatment. SAM Significance Analysis of Microarrays abbreviation significant microarray analysis software, EXCEL software plug-ins, prepared by Stanford University.)
- 2014-07-02 16:56:16下载
- 积分：1
-
zoj1094
zoj094
Matrix multiplication problem is a typical example of dynamical programming.
Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose.
For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix.
There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C).
The first one takes 15000 elementary multiplications, but the second one only 3500.
Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy.
(Matrix multiplication problem is a typical example of dynamical programming.
Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose.
For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix.
There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C).
The first one takes 15000 elementary multiplications, but the second one only 3500.
Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy.
)
- 2012-06-10 10:38:53下载
- 积分：1
-
IOCP
实现服务器发送结构体到客户端 联合开发网 - pudn.com
- 2012-02-14 14:51:44下载
- 积分：1
|
联系客服（QQ：3324461878）
