-
suiji
能一次性产生多组随机数。如果有些数字不想产生可以动态地剔除。可以控制产生随机数的范围，个数。功能很强大，交互式！(Can produce a one-time multiple sets of random numbers. If some do not want to produce can be dynamically removed. can control to produce the range of random numbers, the number of Very powerful, interactive)
- 2012-03-22 10:26:29下载
- 积分：1
-
2D RVE
2Dimensional RVE MATLAB code
- 2017-12-06 15:50:08下载
- 积分：1
-
chapter20基于遗传模拟退火算法的聚类算法
说明： matlab 经典算法，基于遗传模拟退火算法的聚类算法(Matlab classic algorithm, clustering algorithm based on genetic simulated annealing algorithm)
- 2020-11-21 10:59:36下载
- 积分：1
-
Simplecoordinatesearchalgorithm
Simple coordinate search algorithm
- 2010-07-09 13:31:02下载
- 积分：1
-
zikong
自动控制原理，包含matlab的多个实验仿真，希望对你们有所帮助(Automatic control theory, a number of experimental simulation contains matlab, I hope to help you)
- 2012-04-23 10:52:31下载
- 积分：1
-
ImageRegistrationmodel
image affine transformation using linear an nonlinear methods
- 2013-04-05 12:02:03下载
- 积分：1
-
chuong-trinh-ver-2.0
This paper presents a novel algorithm of hiding
secret messages by applying mathematical lemmas and
information theory. The proposed algorithm can hide more
information with acceptable embedded rate and achieves
requirements of information hiding algorithm and simply
information extracting. The main idea is applying modern
algebra to solve the information hiding problem in multimedia.
In order to prevent some attacks on stganography, hidden
initial bits of image data pixels are chosen randomly. The
extracted information are achieved without the reference of the
original image and extracted keys. The experiment results
show that our approach is effective and reliable.
- 2014-02-20 20:49:27下载
- 积分：1
-
SVD
说明： 通过奇异值分解的方法对数字图像进行压缩达到节省存储空间的目的(Compression of digital image by singular value decomposition to save storage space)
- 2019-03-22 16:23:28下载
- 积分：1
-
huffmancoding
格式：[huffcodes，氢，領 ，电子] = huffmancoding（磷，氮）
％输入：p是每个字母符号的概率
（如：对= [0.3 0.2 0.2 0.2 .06 .04]）
n是一个整数，决定在每个帧的符号数量
（默认：n = 1时）
％输出：huffcodes：huffmancodes
答：源熵
甲肝：平均熵编码
电子邮件：科丁效率(format : [huffcodes,H,Hav,e]=huffmancoding(p,n)
inputs: p is the probability of each alphabet symbol
( eg:p=[.3 .2 .2 .2 .06 .04] )
n is an integer that determines number of symbols at each frame
(default:n=1)
outputs: huffcodes: huffmancodes
H: source entropy
Hav: average entropy for coding
e: codding efficiency
)
- 2010-07-05 12:07:29下载
- 积分：1
-
gmmtest
gmm estimation and significance test
- 2009-10-18 10:01:41下载
- 积分：1
