-
imagecat
说明： matlab实现的arnold置乱变换,很好用(matlab implementation arnold scrambling transformation, useful)
- 2010-04-27 01:34:34下载
- 积分：1
-
plotbar
做金融 K 线图, 比matlab自携带的效率高，特别在动态显示的时候比较有优势(plot candle figure)
- 2013-03-20 21:40:31下载
- 积分：1
-
interpsinprocess
正弦插值函数源码及应用，成像方面的可以参考。。。(Sine interpolation function source code and applications, imaging can refer. . .)
- 2013-04-16 13:46:32下载
- 积分：1
-
matlab-gui-serial-comunication
一个 gui 界面的 matlab 串口通信演示程序(A gui interface matlab serial communication demo)
- 2011-06-27 17:00:28下载
- 积分：1
-
ofdm_im-master
说明： ofdmIM仿真系统设计源代码，有不对的地方请指教谢谢大家(Ofdmim simulation system design source code, there are wrong places please advise, thank you)
- 2021-03-19 16:56:13下载
- 积分：1
-
CSArcticInChinese
说明： 关于压缩感知理论综述性的中文期刊论文，包括理论原理与应用，以及该理论的研究现状和公开性问题等。(Review on the theory of compressed sensing of Chinese journal articles, including theoretical principles and applications, and research status of the theory and openness issues.)
- 2011-04-06 09:32:15下载
- 积分：1
-
capon(doa)
doa估计经典capon算法,
简单波达方向估计算法,空间角度分辨率有限,有待进一步改进算法(doa estimation algorithm capon classic, simple DOA estimation algorithm, space limited angular resolution, need to be further improved algorithm)
- 2006-10-31 15:44:14下载
- 积分：1
-
Face-Recognition
face recognition for matlab program , maybe be coplicated
- 2014-10-04 13:58:32下载
- 积分：1
-
vad
说明： 利用短时能量和短时过零率的语音端点检测算法(Short-term energy and zero crossing rate of the voice activity detection algorithm)
- 2010-04-13 15:38:55下载
- 积分：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
