the calculator s usage!
after you have inputed 2 operators,choose + - * / function!
But the only situation I did t deal with is that
when you choos + fuction ,and the operaters signs is like this
-A+B,just turn it to B-A!
this a sample about the VGA BLUE,the function of this code is show blue in VGA,it s default installation is D:\RedLogic\RCII_samples, and the software environment is quatrusII 5.0,it is usefull for studying hardware.
This program is a new way to estimate the coherence function. It s based on the MVDR and is much more reliable than the classical Welch s method implemented in MATLAB.
There are 2 programs: the main program called coherence_MVDR.m and and an example, called illustrate.m, that calls the main function to show how it works. There also included 2 papers that we published on this algorithm.
This function calculates Akaike s final prediction error
％ estimate of the average generalization error.
％
％ [FPE,deff,varest,H] = fpe(NetDef,W1,W2,PHI,Y,trparms) produces the
％ final prediction error estimate (fpe), the effective number of
％ weights in the network if the network has been trained with
％ weight decay, an estimate of the noise variance, and the Gauss-Newton
％ Hessian.
％
This function calculates Akaike s final prediction error
％ estimate of the average generalization error for network
％ models generated by NNARX, NNOE, NNARMAX1+2, or their recursive
％ counterparts.
％
％ [FPE,deff,varest,H] = nnfpe(method,NetDef,W1,W2,U,Y,NN,trparms,skip,Chat)
％ produces the final prediction error estimate (fpe), the effective number
％ of weights in the network if it has been trained with weight decay,
％ an estimate of the noise variance, and the Gauss-Newton Hessian.
％
function [r_path, r_cost] = dijkstra(pathS, pathE, transmat)
The Dijkstra s algorithm, Implemented by Yi Wang, 2005
This version support detecting _cyclic-paths_
