代码搜索：plot
找到约 10,000 项符合「plot」的源代码
代码结果 10,000
www.eeworm.com/read/238634/13870866
m hop3.m
%例5.3, hop3.m
%
clear
T=[1 -1;-1 1];
net=newhop(T); %创建Hopfield网络
w=net.lw{1,1},b=net.b{1} %输出权值和偏差
Ai ={T};
[Y,Pf,Af] = s
www.eeworm.com/read/238634/13870883
m hop4.m
%例5.4, hop4.m
%
clear
T=[1 -1;-1 1];
net=newhop(T); %创建Hopfield网络
w=net.lw{1,1},b=net.b{1} %输出权值和偏差
plot(T(1,:),T(2,:),'r*') %作目标节点图
P=[-1 -0.
www.eeworm.com/read/238632/13871030
m eventplot.m
function h = eventplot(X)
% h = eventplot(X)
% Method for seismicdecon example supplied with SA Tools.
% See http://www.frostconcepts.com/software for information on SA Tools.
%
% h = eventplot
www.eeworm.com/read/300970/13873993
m eyediag.m
% eyediag.m plot eye diagrams for pulse shape ps
N=1000; m=pam(N,2,1); % random signal of length N
M=20; mup=zeros(1,N*M); mup(1:M:end)=m; % oversampling by factor of M
ps=hamming(M)
www.eeworm.com/read/238545/13876376
m plotcorana.m
function [z, a] = coranaEval(per)
i=0;
a=-0.9:per:0.9;
sz=size(a,2);
z=zeros(sz,sz);
for x=a
i=i+1; j=0;
for y=a
j=j+1;
z(i,j)=coranaFeval([x y]);
end
end
%Done!
%First let's look at it
www.eeworm.com/read/238545/13876428
m orderbasedexample.m
echo on
% This script shows how to use the ga using an order-based representation.
% You should see the demos for
% more information as well. gademo1, gademo2, gademo3
global distMatrix
% Setting the
www.eeworm.com/read/147529/5728673
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/147529/5728674
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/147529/5728883
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/147529/5728884
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)求最短路径