-
Gauss_E_Pivoting
Gaussian Elimination with partial pivoting (LU factorization)
- 2009-12-15 19:59:49下载
- 积分：1
-
lsb_embed
数字水印嵌入算法，利用空域变换的（lsb）算法(Digital watermark embedding algorithm, the use of airspace transform (lsb) algorithm)
- 2010-03-08 10:46:34下载
- 积分：1
-
cppm_ieee
Digital Communication Using
Chaotic-Pulse-Position Modulation
- 2013-12-07 04:25:00下载
- 积分：1
-
source
这是一个802.11a物理层OFDM技术的仿真与研究，可以观察各示波器输出波形(This is a simulation and research of 802.11a s OFDM physical layer, which can see its wave form.)
- 2014-01-05 22:00:05下载
- 积分：1
-
MATLAB
三维地图，用于计算地形遮蔽等计算时的DEM数据(The 3D map is used to calculate the DEM data in the calculation of topography and occlusion)
- 2020-10-24 08:57:22下载
- 积分：1
-
LP_pdi_feasible_eqined
应用内点法中原-对偶路径跟踪法，求解线性规划问题，也可以用于求解最优潮流问题，不过KKT方程较复杂。(using the original- dual path following method is used to solve linear programming problems)
- 2016-05-08 09:07:33下载
- 积分：1
-
huffman_coding
) Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
() Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
)
- 2009-04-04 22:16:39下载
- 积分：1
-
Solving-scale-free-networks
求解无标度网络,用于求解无标度网络模型的(Solving scale-free networks, for solving scale-free network model)
- 2011-08-18 14:40:53下载
- 积分：1
-
f_ant.m
This m-file creates 3D polar plots of normalized array factors
- 2014-11-07 06:33:52下载
- 积分：1
-
Dijkstra
该程序用Dijkstra算法寻找最小路径。输入为起点，终点，邻接矩阵。输出为最短距离，最短距离对应的路程。代码有详细注释说明。(The procedure used Dijkstra algorithm to find the minimum path. Enter as a starting point, end point adjacency matrix. The output is the shortest distance, shortest distance corresponds to the distance. Codes are detailed explanatory notes.)
- 2015-05-08 17:11:21下载
- 积分：1
