rrrrr

VB和Matlab/Simulink的接口方法(VB and Matlab/Simulink interface methods)

采用小波变化来完成数字水印的加密和解密，并且加入了猫脸变换(Wavelet change digital the watermark encryption and decryption, and cat face transform.)

Construct the short length of QC LDPC codes without girth 4 and girth 6(The Program to construct the short length of QC LDPC codes without girth 4 and girth 6 Copyright (C) Yang XIAO, Jun FAN, BJTU, July 26, 2007, E-Mail: yxiao@bjtu.edu.cn. This program presents an approach [1] for constructing the short length of LDPC codes with girth 8. First, we design 3 submatrices with different shifting functions given by our schemes, then combine them into a matrix according to our approach, finally, expand the matrix into a desired parity-check matrix using identity matrices and cyclic shift matrices of the identity matrices. The simulation results in AWGN channels show that the codes which can be obtained by the generator matrix derived from this check matrix for encoding the random information bits are as good as random LDPC codes [1]. Ref: [1] J. Fan, Y. Xiao, “A design of LDPC codes with large girth based on the sub-matrix shifting”, IET International Conference on Wireless Mobile and Multimedia Networks Proceedings (ICWMMN 2006), (CP525), p. )

说明：  麻省理工学院MATLAB使用指南，是入门学习不错的资料(Massachusetts Institute of Technology MATLAB User Guide is a good entry-learning information)

利用music算法进行谱估计的MATLAB程序(Music algorithm for spectral estimation MATLAB program)

说明：  电力电子电路中的BUCK电路开环控制simulink仿真(Simulink simulation of open loop control of buck circuit in power electronic circuit)

BGA Binary Genetic Algorithm Matlab Code

首先用matlab实现了识别算法的仿真，因为只是对特定的数字组合的识别，所以非常的简单，放弃采用比较复杂的识别算法，采用最普通的像素比较的识别算法。(First, to achieve the recognition algorithm using matlab simulation, because the only identification of a specific combination of numbers, it is very simple, give up the use of more complex recognition algorithms compare the most common pixel identification algorithm.)

The optimization behavior of the self-adaptation (SA) evolution strategy (ES) with intermediate multirecombination (the (=I )-SA-ES) using isotropic mutations is investigated on the general elliptic objective function. An asymptotically exact quadratic progress rate formula is derived. This is used to model the dynamical ES system by a set of difference equations. The solutions of this system are used to analytically calculate the optimal learning parameter  . The theoretical results are compared and validated by comparison with real (=I )-SA-ES runs on typical elliptic test model cases. The theoretical results clearly indicate that using a model-independent learning parameter  leads to suboptimal performance of the (=I )-SA-ES on objective functions with changing local condition numbers as often encountered in practical problems with complex fitness landscapes.

leaf recognition by Flavia