-
crou
Crout s algorithm is used when the inversion of large matrices, say 1000X1000 is difficult. So Crout s algorithm uses LU decomposition method to get the same results as the inversion of Matrix.
- 2013-11-04 10:58:10下载
- 积分：1
-
hundunzhiluan
其余混沌的数字图像置乱。该算法利用混沌对初值的敏感性，算法是想简单。(The rest of Chaos Digital Image Scrambling. The algorithm using the sensitivity of chaos to the initial value, the algorithm is to simple.)
- 2007-10-14 11:07:00下载
- 积分：1
-
matlab-Create-Read-Update-Delete-database-lp2m-ar
how you can create, read, delete and update using Matlab by simple code
- 2014-11-07 06:24:55下载
- 积分：1
-
EXTPRINCIPLE
The M-files that are in the folders "Operations," "Extension Principle," and "Plotting" are all keyed
into a specific chapter of the book Uncertain Rule-Based Fuzzy Logic Systems: Introduction and
New Directions, by Jerry M. Mendel, and published by Prentice-Hall, 2000.
There are also some miscellaneous M-files.
- 2013-12-19 15:51:32下载
- 积分：1
-
WTWPTour
WTWPTour function in wavelet processing
- 2013-05-08 01:21:00下载
- 积分：1
-
PTS_Papr_V4
说明： OFDM信号的PTS算法，用于降低峰均比，v=4，64QAM调制，子载波数可以自己调整(Partial Transfer Sequence Algorithms)
- 2019-04-24 15:13:52下载
- 积分：1
-
检测算法
说明： 本程序是对V-BLAST系统及其检测算法的仿真，可采用BPSK,QPSK,16QAM,64QAM调制。(This procedure is to the V-BLAST system and its detection algorithm simulation, can use BPSK,QPSK,16QAM,64QAM modulation.)
- 2020-10-29 09:53:25下载
- 积分：1
-
programm5
说明： 研究碳纳米管的热输运，其中输运系数最重要，此程序的功能就是计算透射系数(Study the thermal transport of carbon nanotubes, in which the most important transport coefficients, this procedure is the calculation of the function of transmission coefficient)
- 2009-08-08 09:42:19下载
- 积分：1
-
spring_mass_damper
Spring Mass Damper Simulink model
- 2014-03-31 00:11:37下载
- 积分：1
-
maxcost
“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。
(" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
- 2010-12-22 17:27:32下载
- 积分：1
