代码搜索：TFN
找到约 2,024 项符合「TFN」的源代码
代码结果 2,024
www.eeworm.com/read/185932/8972483
cpp tfn.cpp
#include "TFN.h"
#include
#include
using namespace std;
const double ESP = 0.0001;
CTFN::CTFN(int nSize)
{
if (nSize
www.eeworm.com/read/185932/8972511
h tfn.h
#pragma once
class CTFN
{
private:
double *m_pdNum;
int m_nSize;
public:
CTFN(const CTFN &otherTFN);
int GetSize() const;
void SetSize(int nSize);
CTFN (int nSize = 3);
void I
www.eeworm.com/read/152398/12117332
m tfn.m
function [p]=tfn(k,n,d,td)
% tfn takes a scalar gain, k, matricies n and d, and dead time, td
% to form a single input, single output transfer function, using the rows
% of n and d to form the nume
www.eeworm.com/read/119555/14826472
c tfn.c
/*
* Tribe FloodNet - 2k edition
* by Mixter
*
* tfn.c - tribe floodnet client
*
* This program is distributed for educational purposes and without any
* explicit or
www.eeworm.com/read/409232/2235327
c tfn.c
/*
* Tribe FloodNet - 2k edition
* by Mixter
*
* tfn.c - tribe floodnet client
*
* This program is distributed for educational purposes and without any
* explicit or
www.eeworm.com/read/414697/11105722
m tfn.m
function [p]=tfn(k,n,d,td)
% tfn takes a scalar gain, k, matricies n and d, and dead time, td
% to form a single input, single output transfer function, using the rows
% of n and d to form the nume
www.eeworm.com/read/100450/15873567
c tfn.c
/*
* Tribe FloodNet - 2k edition
* by Mixter
*
* tfn.c - tribe floodnet client
*
* This program is distributed for educational purposes and without any
* explicit or
www.eeworm.com/read/152398/12117536
m tfn2.m
function [p]=tfn2(k,n,d,td)
% tfn takes a scalar gain, k, matricies n and d, and dead time, td
% to form a single input, single output transfer function, using the rows
% of n and d to form the num
www.eeworm.com/read/152398/12117561
m tfn3.m
function [p]=tfn3(k,n,d,td)
[nr,nc]=size(n);
[dr,dc]=size(d);
T=td;
numstr='';
if nr==0
numstr='';
else
for i=1:nr
str_n=['(',poly2str(n(i,:),'s'),')'];
numstr=[numstr
www.eeworm.com/read/152398/12117631
m tfn1.m
function [p]=tfn1(k,n,d,td)
% tfn takes a scalar gain, k, matricies n and d, and dead time, td
% to form a single input, single output transfer function, using the rows
% of n and d to form the num