代码搜索：plot
找到约 10,000 项符合「plot」的源代码
代码结果 10,000
www.eeworm.com/read/331559/12820864
m chap5_3.m
%Equivalent Discrete Sliding Mode Control based on RBF neural control
clear all;
close all;
ts=0.001;
a=25;
b=133;
A=[0,1;0,-a];
B=[0;b];
C=[1,0];
D=0;
[A1,B1,C1,D1]=c2dm(A,B,C,D,ts,'z');
www.eeworm.com/read/144013/12823500
m exa11041.m
%-----------------------------------------------------------------
% exa110401.m 产生db2～db9正交小波的尺度函数和小波函数
%------------------------------------------------------------------
clear;
iter=8
[phi2,
www.eeworm.com/read/144013/12823587
m exa120501.m
%--------------------------------------------------------------------------
% exa120501.m, for example 12.5.1 and fig12.5.3
%-----------------------------------------------------------------------
www.eeworm.com/read/144013/12823638
m exa010201b.m
%---------------------------------------------------------------------------------------
% exa010201b.m, for example 1.2.3
% 说明信号的子带分解；
%----------------------------------------------------------
www.eeworm.com/read/144013/12823695
m exa090702.m
% -------------------------------------------------------------------
% exa090702.m, for example 9.7.2 and fig 9.7.2
% 连续小波变换。noissin 是MATLAB中带噪声的正弦信号。
% 本程序给出的是连续小波变换的灰度图表示。
%--------------------
www.eeworm.com/read/144013/12823748
m exa120502.m
%--------------------------------------------------------------------------
% exa120502.m, for example 12.5.2 and fig12.5.4
%-----------------------------------------------------------------------
www.eeworm.com/read/144013/12823808
m exa010201a.m
%---------------------------------------------------------------------------------------
% exa010201a.m, for example 1.2.2
% 说明信号的子带分解；
%----------------------------------------------------------
www.eeworm.com/read/244945/12829555
m kruskal.m
function [out,len]=kruskal(map)
%求最小生成树算法,通过kruskal算法求最优树,并给出相应图像.
%用法:
% 首先输入矩阵:
% map=[起点1 终点1 边长1;起点2 终点2 边长2;............;起点n 终点n 边长n]
% 再用[out,len]=kruskal(map)求最优树
%参数说明
% map----3列邻接
www.eeworm.com/read/244945/12829558
m dijkstra.m
function [p,v]=dijkstra(map,u1,u2)
%求网络最短路径的dijkstra算法
%用法:
% 首先输入矩阵:
% map=[起点1 终点1 边长1;起点2 终点2 边长2;............;起点n 终点n 边长n]
% 和u1,u2
% 注意：这里map为无向图。
% 再用[p,v]=dijkstra(map,u1,u2)求最短路径
www.eeworm.com/read/244937/12830442
mdl bpsnrzbw.mdl
Model {
Name "bpsnrzbw"
Version 6.4
MdlSubVersion 0
GraphicalInterface {
NumRootInports 0
NumRootOutports 0
ParameterArgumentNames ""
ComputedModelVe