代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/424691/10426169
m myga.m
function [f,x]=myga(num,bounds,N,CP,P)
%[f,x]=ga(num,bounds,fun,N,CP,P)
%[f,x]=myga([],bounds,[],[],[])
%该遗传算法适用于：
% 目标函数为求最大值，且解非负整数解
%bounds 边界约束
%Myfun 为目标函数
%num
www.eeworm.com/read/279424/10438789
m tfrview.m
function tfrview(tfr,sig,t,method,param,p1,p2,p3,p4,p5);
%TFRVIEW Visualization of time-frequency representations.
% TFRVIEW(TFR,SIG,T,METHOD,PARAM,P1,P2,P3,P4,P5)
% allows to visualize
www.eeworm.com/read/424568/10438958
m ch2_101.m
x=rand(1,10);
disp(['向量x中的最大值为:' num2str((max(x)))]);
www.eeworm.com/read/279422/10439066
m sgrpdlay.m
function [gd,fnorm]=sgrpdlay(x,fnorm);
%SGRPDLAY Group delay estimation of a signal.
% [GD,FNORM]=SGRPDLAY(X,FNORM) estimates the group delay of
% signal X at the normalized frequency(ies) FNORM.
%
%
www.eeworm.com/read/424540/10440035
asv pcnn.asv
function[Edge,Numberofaera] = pcnn(X)
% X:输入的灰度图像，Edge:为检测到的一些边界点
% Numberofaera:表明了在各次迭代激活的块区域
X = double(imread('C:\shi.BMP'));
ADD = imnoise(X,'salt & pepper', 0.1);
%X=ADD./max(max(ADD))
fig
www.eeworm.com/read/424540/10440048
m pcnn.m
function[Edge,Numberofaera] = pcnn(X)
% X:输入的灰度图像，Edge:为检测到的一些边界点
% Numberofaera:表明了在各次迭代激活的块区域
X = (imread('C:\shi.BMP'));
ADD = imnoise(X,'salt & pepper', 0.1);
%X=ADD./max(max(ADD))
figure,im
www.eeworm.com/read/161171/10440782
m tfrview.m
function tfrview(tfr,sig,t,method,param,p1,p2,p3,p4,p5);
%TFRVIEW Visualization of time-frequency representations.
% TFRVIEW(TFR,SIG,T,METHOD,PARAM,P1,P2,P3,P4,P5)
% allows to visualize
www.eeworm.com/read/161171/10441278
m sgrpdlay.m
function [gd,fnorm]=sgrpdlay(x,fnorm);
%SGRPDLAY Group delay estimation of a signal.
% [GD,FNORM]=SGRPDLAY(X,FNORM) estimates the group delay of
% signal X at the normalized frequency(ies) FNORM.
%
%
www.eeworm.com/read/279355/10445378
c 15rkey0.c
#define HEAPSORT struct student
#define KEY score
HEAPSORT
{ int num;
char name[8];
char sex;
int age;
double score;
};
#include "stdio.h"
#includ
www.eeworm.com/read/279355/10445499
c 15hkey0.c
#define HEAPSORT struct student
#define KEY name
HEAPSORT
{ int num;
char name[8];
char sex;
int age;
double score;
};
#include "stdio.h"
#include