LocalVariableExtractor

这是一个光谱匹配的源代码，研究高光谱图像的朋友可以借鉴一下。(This is a spectral matching of the source code to study the hyperspectral images of a friend can learn from you.)

Frame Layout Gravity extends Activity Source Code for Andriod.

信道编码turbo码,编码,译码程序,C语言编写()

Raidsim磁盘模拟器，可以模拟磁盘的各种操作，例如读预取，Catch块替换等，非常好用，而且很不好找，希望对大家有点帮助。-RAIDframe: A Rapid Prototyping Tool for RAID Systems

说明：  这是学习SVM方法做实验时，下载到的代码压缩包，需要的可自取，使用较为简单(This is learning SVM method to do experiments, download to the code compression package, need to take, use is relatively simple)

asp写的一个文件管理系统.　需要以服务器支持asp.net-asp to write a document management system. asp.net server supports the need for

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. )

To get latest version of Process manager and stay updated about latest patches, bug fix ,and new releases.

LTE资源调度算法，对于研究经典的资源调度算法比较好的参考文献及对应的学术文献(LTE resource scheduling algorithm, for the study of the classic resource scheduling algorithm better reference and the corresponding academic literature)

加速梯度下降算法求函数最优值,用加速梯度下降算法，可以明显缩短优化时间(accelerated gradient descent algorithm)