代码搜索:Num

找到约 10,000 项符合「Num」的源代码

代码结果 10,000
www.eeworm.com/read/297402/8025078

m ex5_10.m

den=[conv([1,5],conv([1,20],[1,50])),0,0]; num=[1,0.125]; G=tf(num,den); rltool(G)
www.eeworm.com/read/297382/8026334

c c5.c

/*5.3.4 源程序*/ #include #include #include #define LEFTPRESS 0xff01 #define LEFTCLICK 0xff10 #define LEFTDRAG 0xff19 #define MOUSEMOVE 0xff08 struct { int nu
www.eeworm.com/read/397700/8028257

php 6-1.php

IF判断使用实例1
www.eeworm.com/read/397700/8028264

php 6-2.php

IF判断使用实例2
www.eeworm.com/read/297303/8032083

m facialoutline-detect.m

clear; %清空工作区变量 Image=imread('zjt.JPG'); %读取图像文件 imshow(Image); Iycbcr=rgb2ycbcr(Image); %颜色空间转换 [m,n,k]=size(Image); for i=1:1:m %根据CbCr的阈值生成二值图像 for j=1:1:n
www.eeworm.com/read/197077/8032123

txt 分数.txt

struct frac{ int num,den; }; double fabs(double x){ return x>0?x:-x; } int gcd(int a,int b){ int t; if (a
www.eeworm.com/read/197077/8032133

txt 置换(polya).txt

//求置换的循环节,polya原理 //perm[0..n-1]为0..n-1的一个置换(排列) //返回置换最小周期,num返回循环节个数 #define MAXN 1000 int gcd(int a,int b){ return b?gcd(b,a%b):a; } int polya(int* perm,int n,int& num){ int i,j,p,v[M
www.eeworm.com/read/196927/8041321

asp onlinecount.asp

www.eeworm.com/read/397445/8050262

java mypanel.java

import java.awt.event.*; import java.awt.*; import java.util.Date; public class MyPanel extends Panel {public MyPanel(Color bgcolor) {this.setBackground(bgcolor); for(int k=0;k
www.eeworm.com/read/297039/8057846

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