-
JM98A1
说明: 风险投资模型求解,用此程序求解出投资风险组合。(Venture capital model to solve, using this procedure for solving a portfolio of investment risks.)
- 2010-03-26 16:44:37下载
- 积分:1
-
Ultrasonic-latest-V2.0
matlab设计的GUI操作界面,用于超声几何声场仿真使用。非常实用(matlab GUI interface designed for the use of ultrasonic sound field simulation geometry. Very useful)
- 2010-05-26 10:56:24下载
- 积分:1
-
simd-viterbi-2.0.1
convolutional coding and Viterbi decoding using matlab
- 2012-05-17 08:33:34下载
- 积分:1
-
弹道导弹被动段
说明: 内附有弹道导弹弹道要求及过程,有完整的matlab程序,可以借鉴学习。自己大三时的远程火箭弹道学大作业。(t includes ballistic missile trajectory requirements and process, complete matlab program, which can be used for reference and learning. My junior year of long-range rocket ballistics homework.)
- 2019-02-20 18:13:55下载
- 积分:1
-
16QAMfangzhen
16QAM下行链路仿真 调制 解调 误码率(16QAM MODULATION Demodulation)
- 2009-05-09 13:55:50下载
- 积分:1
-
Thedirectsequencespreadspectrumsimulation
simulink 实现了直接序列扩频通信系统,含详细模型图(simulink realization of the direct sequence spread spectrum communications systems, including a detailed model)
- 2009-06-03 14:52:40下载
- 积分:1
-
MPI
Fortran进行并行计算的讲稿,台湾网站上下的。(Fortran for parallel computing of the script, Taiwan Web site from top to bottom.)
- 2010-06-28 21:59:24下载
- 积分:1
-
dwt_embed
说明: 简单的视频水印嵌入算法 matlab开发。(simple video watermarking algorithm developed Matlab.)
- 2006-04-17 12:11:36下载
- 积分:1
-
main winner
WINNERⅡ信道代码的主程序,主要是参考历程进行系统的配置,给出WINNERⅡ信道调用的参考例程(WINNER ii main channel code, mainly with reference to the history of the system configuration, the channel is given WINNERⅡ reference routine calling)
- 2015-04-08 10:57:58下载
- 积分:1
-
101259363Desktop
传统的K-medoids聚类算法的聚类结果随初始中心点的 不同而波动,且计算复杂度较高不适宜处理大规模数据集; 快速K-medoids聚类算法通过选择合适的初始聚类中心改进 了传统K-medoids聚类算法,但是快速K-medoids聚类算法 的初始聚类中心有可能位于同一类簇。为了克服传统的K- medoids聚类算法和快速K-medoids聚类算法的缺陷,提出 一种基于粒计算的K-medoids聚类算法。(The traditional K-medoids clustering algorithm clustering results with different initial center points and volatility, and high computational complexity is not suitable for processing large data sets; K-medoids clustering algorithm by choosing proper initial cluster centers to improve the traditional K-medoids clustering algorithm, but the initial cluster center of K-medoids clustering algorithm can be located in the same cluster. In order to overcome the shortcomings of the traditional K- medoids clustering algorithm and the fast K-medoids clustering algorithm, a K-medoids clustering algorithm based on granular computing is proposed.)
- 2017-07-18 12:05:32下载
- 积分:1