HV-line-simulation

画出二阶戴维南RC等效电路的奈奎斯特曲线和一组数据的三维散点图，剖面图(Draw the second-order thevenin RC the Nyquist curve of equivalent circuit and a set of 3 d scatter plot of data, profilet)

多种类型在一起,我不知道如何分类了,而且需要下些东西,所以没有分开来上传,希望站长通融下,程序已经够 5个了:> MATLAB:TD_SCDMA系统性能仿真,QAM调制,7-4编译码的实现,CAM算法仿真(simulink) VC:huffman编译码的实现文件压缩解压缩(7-4 codec realization, CAM simulation algorithm (simulink) VC: huffman codec realize the file compression decompression)

说明：  BD-OFDM的接收和发射，是用Matlab编程实现的++matlab，程序比较简洁，易懂。(BD-OFDM receiver and the launch is the use of Matlab programming of the++ matlab, procedure is simple and easy to understand.)

Multiple kernel learning is a model to merge multiple kernels by linear combination. Mostly solving the models are slow due to explicit computation of kernels. Here, we propose to approximate kernel map function explicitly in finite dimensional space. Then, we use dual coordinate descent to solve the SVM. By storing the solutions in primal, we do not have to compute the kernel explicitly. A group lasso regularization on kernel weights is solved with SVM alternatingly. This is a side-project in my research projects with Dr. Yi-Ren Yeh and Dr. Frank Wang in Academia Sinica.

非常不错的书籍，《微粒群算法》供8章和2个附录，依次上传第5章(Very good books, Particle Swarm Optimization for Chapter 8 and Appendix 2, followed by From Chapter 5)

费诺编码,用MATLAB仿真平台，实现费诺编码的MATLAB仿真研究。(Connaught coding costs by MATLAB simulation platform, to achieve cost Connaught MATLAB simulation code.)

used to detect colours

蒙特卡洛算法的例程，包含所需的全部相关程序(Monte Carlo algorithm routine)

说明：  对信号进行小波变换，确定小波基的选择和分解层数，再求解信号的信息熵，可用于故障诊断。(The wavelet transform is performed on the signal to determine the selection and decomposition layers of the wavelet base, and then the information entropy of the signal is solved, which can be used for fault diagnosis.)

出一种实现不同维间估计结果自动配对的二维频率估计算法。首先把二维频率估计问题转化成两个矩阵束的特征值问题。根据矩阵束的特征求出两个矩阵束的公共特征向量，并以此为基础同时求出两个矩阵束的特征值。算法估计误差与现有算法相近，但解决了现有算法普遍存在的配对难题。 (Matrix pencils play an important role in numerical linear algebra. The problem of finding the eigenvalues of a pencil is called the generalized eigenvalue problem. The most popular algorithm for this task is the QZ algorithm, which is an implicit version of the QR algorithm to solve the associated eigenvalue problem B − 1Ax = λx without forming explicitly the matrix B − 1A (which could be impossible or ill-conditioned if B is singular or near-singular) )