mekl

Performance analysis of BICM based cooperative network over AWGN channels.

This function takes a training-by-training matrix of distance scores, and the testing-by-training matrix of distance scores, and augments them by adding ghost points to the minority class.

[t, y]=EULER_forward_ODE(f, t0, y0, tend, Niter) 欧拉向前逼近法求解微分方程初值问题 f定义了函数f（t，y）的 t0时的初始值定义吨 Y0的定义y的初始值( [t, y]=EULER_forward_ODE(f, t0, y0, tend, Niter) Euler forward approximation method to solve IVP ODEs f defines the function f(t,y) t0 defines initial value of t y0 defines initial value of y)

AODV网络协议的matlab实现，运行主函数文件，输入始点和末点的序号，该程序会自动生成图显示基于AODV的从该始点到末点的路由(Matlab AODV network protocol implementations, run the main function of the file, enter the starting point and the end point of the serial number, the program will automatically generate AODV based on the start point to the end point of the route from the map display)

this is maximum power detection.

Model predictive control book nice one

matlab绘制连续时域信号时域波形，初学者可以借鉴一下这些程序熟悉命令。(matlab draw for time-domain signal waveform in time domain, beginners can learn from these procedures are familiar with the order.)

The alogrithm employed in this toolbox for determining Lyapunov exponents is according to the algorithms proposed in [1] A. Wolf, J. B. Swift, H. L. Swinney, and J. A. Vastano "Determining Lyapunov Exponents from a Time Series," Physica D, Vol. 16, pp. 285-317, 1985. [2] J. P. Eckmann and D. Ruelle, "Ergodic Theory of Chaos and Strange Attractors," Rev. Mod. Phys., Vol. 57, pp. 617-656, 1 The algorithm given in [1] is used for first-order systems while the QR-based algorithm proposed in [2] is applied for higher order systems. by Steve W. K. SIU, July 5, 1998. (The alogrithm employed in this toolbox for determining Lyapunov exponents is according to the algorithms proposed in [1] A. Wolf, J. B. Swift, H. L. Swinney, and J. A. Vastano, "Determining Lyapunov Exponents from a Time Series," Physica D, Vol. 16, pp. 285-317, 1985. [2] J. P. Eckmann and D. Ruelle, "Ergodic Theory of Chaos and Strange Attractors," Rev. Mod. Phys., Vol. 57, pp. 617-656, 1985. The algorithm given in [1] is used for first-order systems while the QR-based algorithm proposed in [2] is applied for higher order systems. by Steve W. K. SIU, July 5, 1998. )

Source Code For Watermarking

模糊邻域贪心向前粗糙集 基于胡清华博士程序改编 网上下载 非原创(rough set )