my1234

说明：  一段三维重建的MATLAB代码，拿来分享！(Three-dimensional reconstruction of the MATLAB code to be shared!)

这是梅林矩的MATLAB源代码,代码质量较好,可供研究图像图形处理和水印技术方面的朋友参考!(This is the Mellin moments of MATLAB source code, source better quality for the study of image and graphics processing and technical aspects watermark friends reference!)

说明：  matlab程序模拟微分方程。各种流行的系统显示混沌运动特征。(This toolbox contains the functions which can be used to simulate some of the well-known fractional order chaotic systems, such as: - Chen s system, - Arneodo s system, - Genesio-Tesi s system, - Lorenz s system, - Newton-Leipnik s system, - Rossler s system, - Lotka-Volterra system, - Duffing s system, - Van der Pol s oscillator, - Volta s system, - Lu s system, - Liu s system, - Chua s systems, - Financial system, - 3 cells CNN. The functions numerically compute a solution of the fractional nonlinear differential equations, which describe the chaotic system. Each function returns the state trajectory (attractor) for total simulation time. )

MIMO FILE IF YOU WANT TO SLOVE SOME DISTRIBUTION YOU CAN

this file introduce binary pso 2010

AP算法源码代 运行可以画出图 AP算法源码代 运行可以画出图(AP algorithm source code to run on behalf of AP algorithm source code can be drawn diagram can be drawn map on behalf of running)

通过MATLAB仿真来讨论比较二元霍夫曼编码、三元霍夫曼编码以及信源扩展编码的效率，来实现霍夫曼码的优化构造(By MATLAB simulation to compare two yuan Huffman discussed, ternary Huffman coding and source coding efficiency extended to achieve optimization of Hoffman Construction Code)

用镜像矩阵求出矩阵的QR分解（正交三角分解），并求解线性方程组，该方法不必选主元，但其计算过程非常稳定。也可用于求矩阵的广义逆和求解线性最小二乘问题。子过程QRDCMP用镜像矩阵求m*n矩阵A的QR分解，A=Q^TR,其中Q是m*m正交矩阵，R为m*n上三角矩阵；子过程QRBKSB用矩阵的QR分解求解线性方程组Ax=b，其中A为n阶非奇异方阵。(Matrix obtained with the mirror matrix QR decomposition (orthogonal triangular decomposition), and solving linear equations, the method does not have to choose the main element, but its calculation process is very stable. Can also be used to find the generalized inverse matrix and solving linear least squares problems. Sub-process of the mirror matrix QRDCMP m* n matrix A QR decomposition, A = Q ^ TR, wherein Q is a m* m orthogonal matrix, R is m* n upper triangular matrix subprocess QRBKSB a QR decomposition to solve the matrix linear equations Ax = b, where A is non-singular square matrix of order n.)

An Information Hiding Scheme for the MDC-OFDM Wireless Networks

用于综合排序，根据评价对象与正理想解、负理想解之间的距离排序(Used for comprehensive sorting, according to the distance between the evaluation object and positive ideal solution and negative ideal solution)