-
1
说明： 使用抖动创建图像。使用抖动得到的图像看上去有更多的颜色数；不适用抖动得到的图像看上去颜色数少，大门空间分辨率要高些。(Creating images using dithering. Jitter by using the image appears to have more number of colors not apply to jitter resulting image looks small number of colors, the door to higher spatial resolution.)
- 2011-02-12 14:11:26下载
- 积分：1
-
xinhao
信号，噪声，信号加噪声，FFT，matlab仿真,时域波形，频谱图(Signal, noise, signal plus noise, FFT, Matlab simulation, time-domain waveform, spectrogram)
- 2012-04-13 15:35:58下载
- 积分：1
-
max
Max Lyapunov 可以计算最大的Lyapunov 指数(Max LyapunovMax Lyapunov 可以计算最大的Lyapunov 指数Max Lyapunov 可以计算最大的Lyapunov 指数)
- 2010-01-03 00:36:16下载
- 积分：1
-
BER_OFDM_OQAM
OFDM/OQAM系统代码，采用PHYDYAS滤波器，包括PPN结构和IFFT模块。(Code of OFDM/OQAM system, shape impulse is PHYDYAS filter,with PPN network for transmitting.)
- 2021-04-22 13:08:48下载
- 积分：1
-
RS_sim
(7,3) rs code bit error probability simulation
- 2014-01-15 16:05:53下载
- 积分：1
-
傅里叶变换
说明： 使用matlab实现傅里叶变换（数字图像处理算法）(Using Matlab to implement Fourier transform (digital image processing algorithm))
- 2020-06-24 11:00:02下载
- 积分：1
-
MATALBR2007
小波分析理论与matlab2007配套程序(Wavelet analysis theory and matching procedure matlab2007)
- 2009-05-23 14:39:39下载
- 积分：1
-
chapter-7
说明： 《matlab语言常用算法程序集》源代码 第七章(" Matlab common algorithms assembly language" source code under Chapter VII)
- 2011-03-24 11:08:49下载
- 积分：1
-
0-1programming
0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。另：胡运权所著的《运筹学基础及应用（第三版）》第97页的例3，我用本程序求解得到的结果是：最优解是x*=(1,0, 0, 0, 0)，最优值是f(x*)=8，但书求得最优解是x*=(1,0, 1, 0, 0)，最优值是f(x*)=4，是不是书中写错了，请大家验证。以下是源程序，大家可以任意使用无版权问题，另外，如果大家有大规模的0-1规划的问题也希望提供给我，谢谢。变量个数至少是3个(0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source)
- 2006-07-01 10:33:18下载
- 积分：1
-
Codigos_de_Erro_Midea
Descriç ã o de Erros de Splint Midea
- 2015-02-12 05:46:05下载
- 积分：1
