代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/161587/10393708
cpp avgdata.cpp
#include
#include
void main(void)
{
int a[1000], step = 10;
int num[19] = {10000, 10000, 10000, 5000, 5000, 5000, 2000, 2000, 1000, 1000,
1000, 50
www.eeworm.com/read/424859/10406104
m chap3_1.m
%Expert PID Controller
clear all;
close all;
ts=0.001;
sys=tf(5.235e005,[1,87.35,1.047e004,0]);
dsys=c2d(sys,ts,'z');
[num,den]=tfdata(dsys,'v');
u_1=0.0;u_2=0.0;u_3=0.0;
y_1=0;y_2=0;y_3=0
www.eeworm.com/read/353818/10415935
c leddt.c
/**************************************************************************
动态数码管显示
COPYRIGHT (c) 2007 BY GSM.
-- ALL RIGHTS RESERVED --
File Name: LEDdt.c
A
www.eeworm.com/read/353818/10415940
lst shumaguan.lst
C51 COMPILER V8.02 SHUMAGUAN 02/09/2007 22:21:13 PAGE 1
C51 COMPILER V8.02, COMPILATION OF MODULE SHUMAGUAN
OBJECT MODULE PLACED
www.eeworm.com/read/353818/10415971
c shumaguan.c
#include
void disp(unsigned char *x,db);
void delay(unsigned int c);
void timerint () ;
sbit D1=P2^0;
sbit D2=P2^1;
sbit D3=P2^2;
sbit D4=P2^3;
sbit DP=P1^7;
#define DT P1
www.eeworm.com/read/424747/10417846
m select.m
% 函数 - 轮盘赌选择要交叉的个体
function Num = select(sumfitness,oldpop,gen,maxgen)
popsize = length(oldpop);
Psum = 0;
if(sumfitness ~= 0)
for i = 1:popsize
P(i) = oldpop(i).fitness/sumf
www.eeworm.com/read/424747/10418130
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/424747/10418487
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