-
koch
koch曲线，分型课程中经常用到的，很好(koch)
- 2010-12-23 11:03:50下载
- 积分：1
-
MATLAB-SIMULINK
本書系統地介紹了通信建模仿真方法和模型驗證技術，並結合作者近年在教學科研中所
設計的大量基礎的和較深入的建模仿真實例，詳細討論了Matlab/Simulink 作為仿真實現平
台在電子與通信工程中應用的基本方法、技巧和難點(This book systematically describes the modeling and simulation of communication methods and model validation techniques, combined with the author in recent years in teaching and research in the design of a large number of basic and more in-depth modeling and simulation examples are discussed in detail Matlab/Simulink as a simulation platform for the realization of electronic and communication engineering application of the basic methods, techniques and difficulties)
- 2011-09-21 22:54:26下载
- 积分：1
-
STD-(1)
对所采集的数据进行分析，可进行模态分析，阻尼特性的识别等。(Data were collected for analysis, modal analysis, identification damping characteristics.)
- 2014-09-25 22:00:05下载
- 积分：1
-
Pade
用MATLAB语言编写的pade近似程序，本人保留版权(the analysis of pade)
- 2009-03-30 10:28:08下载
- 积分：1
-
P13-ParticleSwarmOptimization
MATLAB最优化计算第13章 粒子群优化算法(failed to translate)
- 2013-05-04 10:35:19下载
- 积分：1
-
matlabchengxu_100
用matlab的各种100个最基础的编程例子，可以供大家更好的理解掌握MATLAB，当做模板在其基础上修改也比较简单。(Matlab variety of 100 examples of the most basic programming, for everyone to better understand and grasp MATLAB as a template to be modified based on relatively simple.)
- 2012-11-18 09:43:16下载
- 积分：1
-
Wienerfilernoisereducement
说明： 是用matlab编译的wiener滤波器，实现噪声的消除和语音质量的提高(Is compiled matlab wiener filter, to achieve noise cancellation and voice quality improvement)
- 2010-05-01 21:22:52下载
- 积分：1
-
mtspf_ga
遗传算法的matlab实现。本人已经运行通过，只需换下数据即可直接使用(Genetic algorithm matlab realize. I have run through, just replaced the data can be used directly)
- 2013-09-11 23:45:41下载
- 积分：1
-
lm
Levenberg-Marquardt算法
使用Levenberg-Marquardt算法来最小化(Levenberg-Marquardt algorithm
using the Levenberg-Marquardt algorithm to minimize the model)
- 2013-11-19 20:22:40下载
- 积分：1
-
mathmodel2
说明： 1.1 背包问题
有一个徒步旅行者，已知他能承受的旅行背包的重量不超过a（kg）。设有n种物品可供他选择装入背包，这n种物品分别编号为1，2，…，n。其中第i种物品每件的重量为ai（kg），其使用价值（指一件第i种物品对旅行者来说所带来的好处的一种数量指标）为ci（i＝1，2，…，n）。问这位旅行者应如何选择携带这n种物品的件数，使得总价值最大？
(1.1 knapsack problem is a hikers. he is known to travel to withstand the weight of the backpack not exceed a (kg). N Species with articles for his choice loaded backpack, n product were numbered 1, 2, ..., n. I first of which product each ai of the weight (kg), its value (i refers to a section of the types of items travelers the benefits brought by a number of indicators) for the ci (i = 1, 2, ..., n). Asked how travelers who choose to bring this product to the n pieces, making the total value of the largest?)
- 2006-04-13 18:47:43下载
- 积分：1
|
联系客服（QQ：3324461878）
