网站首页

simulinkrumenjiaocheng

于 2013-04-01 发布文件大小:1119KB

 0  202

下载积分: 1 下载次数: 1

我要下载

代码说明：

simulink入门教程，从零开始，学习的好材料(simulink introductory tutorial, starting from scratch, learning materials)

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

phaseshort
长周期光纤光栅的源程序代码,可用来模拟其传输特性(LPFG the source code can be used to simulate transmission characteristics)

2006-07-16 15:02:10下载

积分：1
untitled
this file is dtc for pmsm machine with simulink matlab, 12 sector

2011-09-25 15:05:14下载

积分：1
Elmane_modeling
利用Elmane方法对动态系统进行建模。(Elmane method is used to analyse the dynamic system modeling.)

2013-11-08 12:08:16下载

积分：1
VideoGameTheory
Video Game Theory to develop game

2014-01-22 09:37:53下载

积分：1
calFourier
This function alculates Fourier Amplitude spectra of the time series of uncorrected acceleration and velocity depending on the FFTformat argument and produce a plot.Visual inspection of the fas is helpful for setting a low cut frequency in filter design and implementation.

2015-04-20 00:59:31下载

积分：1
sdp
semi conductor text book

2014-11-21 12:32:55下载

积分：1
fwdblockstego
this source code based on steganography and developed in matlab. in steganography we can hide any data like images in another image. this method based on block processing method.

2009-03-23 22:25:05下载

积分：1
saliency
一篇经典论文的代码，“Saliency,Scale,image description”，用于寻找视觉显著性的区域，matlab代码(A classic papers of the code, " Saliency, Scale, image description" , for the visual search of the area significantly, matlab code)

2009-06-17 23:39:12下载

积分：1
wandden
it is a transform for copmpressing and decompressing and removing noise effectively.

2011-01-06 00:57:33下载

积分：1
0
说明：给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入. 输入:第一行两个正整数n(物品数)和C(容量) 第二行n个正整数n,表示物品价值第三行n个正整数n,表示物品重量输出:第一行表示总价值第二行n个数(0/1),0表示物品不装入,1表示装入例如, 输入: 5 10 6 3 5 4 6 2 2 6 5 4 输出 15 1 1 0 0 1 (Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)

2009-07-01 23:07:01下载

积分：1

696516资源总数
106554会员总数
12今日下载

simulinkrumenjiaocheng

0 个回复

热门标签

热门下载