代码搜索：fprintf
找到约 10,000 项符合「fprintf」的源代码
代码结果 10,000
www.eeworm.com/read/328078/13047198
m disp.m
function c = disp(f)
%CLASSIFIER/DISP Display CLASSIFIER object.
% Copyright (c) 1999 Michael Kiefte.
% $Log$
n = f.counts;
g = length(n);
prior = f.prior;
if isempty(prior)
prior = n./sum(n)
www.eeworm.com/read/140948/13051205
m qpsk.m
% Program 3-5
% qpsk.m
%
% Simulation program to realize QPSK transmission system
%
% Programmed by H.Harada and T.Yamamura
%
%******************** Preparation part **************************
www.eeworm.com/read/140880/13054433
c testfor.c
/*
** Author: Tapas Kanungo, kanungo@cfar.umd.edu
** Date: 4 May 1999
** File: testfor.c
** Purpose: driver for testing the Forward, ForwardWithScale code.
** Organizatio
www.eeworm.com/read/140880/13054489
c testvit.c
/*
** Author: Tapas Kanungo, kanungo@cfar.umd.edu
** Date: 15 December 1997
** File: testvit.c
** Purpose: driver for testing the Viterbi code.
** Organization: University
www.eeworm.com/read/140880/13054551
c esthmm.c
/*
** Author: Tapas Kanungo, kanungo@cfar.umd.edu
** Date: 22 February 1988
** File: esthmm.c
** Purpose: estimate HMM parameters from observation.
** Organization: Univ
www.eeworm.com/read/140870/13056242
c sniff.c
/*
nast
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either
www.eeworm.com/read/140850/13059549
m compilemex.m
clear mex;
% class smosvctutor
cd @smosvctutor
fprintf(1, 'recompiling method @smosvctutor/smosvctrain...\n');
mex smosvctrain.cpp InfCache.cpp LrrCache.cpp SmoTutor.cpp -lm
cd ..
% class string
www.eeworm.com/read/140700/13065957
txt alg028.txt
> restart;
> # MULLER'S ALGORITHM 2.8
> #
> # To find a solution to f(x) = 0 given three approximations x0, x1
> # and x2:
> #
> # INPUT: x0,x1,x2; tolerance TOL; maximum number of iterations N
www.eeworm.com/read/140700/13066255
txt alg028.txt
> restart;
> # MULLER'S ALGORITHM 2.8
> #
> # To find a solution to f(x) = 0 given three approximations x0, x1
> # and x2:
> #
> # INPUT: x0,x1,x2; tolerance TOL; maximum number of iterations N
www.eeworm.com/read/140698/13066475
c alg051.c
/*
* EULER'S ALGORITHM 5.1
*
* TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM:
* Y' = F(T,Y), A