Assuming three simple physical models with different phase distributions, we have calculated the dependence of coercivity on the grain size and volume fraction of hard phase by using the statistical mean.
The models were established using statistical regression technique and their accuracies evaluated using the statistical indicators of mean percentage error (MPE), mean bias error (MBE) and root mean square error (RMSE); hence the best model in each category was recognized.
The RBFN-PSO performance is evaluated using published experimental results and compared with the backpropagation radial basis function network (RBFN-BP) by using the statistical indexes Root Mean Square Error (RMSE), Mean Absolute Error (MAE) and average absolute deviation.
The effect of dietary treatment, lines and line/diet interaction on real-time PCR data were tested using the statistical software SAS® by means of a two-way ANOVA.
The deviation of model result from experimental values is quantified using the statistical parameter of root mean square (RMS) error, {text{RMS }} = sqrt {frac{{mathop sum nolimits left( {X_{text{e}} ; - ;X_{text{p}} } right)^{2} }}{N}} (17 where X e, X p and N are experimental data, predicted value and number of observations, respectively.
Data were coded and entered using the statistical package SPSS version 22. Mean values ± Standard Deviation (SD) were calculated.
All data were expressed as the mean ± SD using the statistical software program PRISM (GraphPad Software, San Diego, CA, USA).
A purely atom-based approach, ultrafast shape recognition (USR) uses the statistical moments (mean, standard deviation and skewness) generated from the interatomic distance distributions.
This can be ascribed to the use of the statistical mean for watermarking.
The metric used by DXFP is the (statistical) mean latency T ̄ that a packet undergoes from S to D. Given two intermediate nodes i, j and the link between them (i,j), the metric can be defined as T ¯ i, j = W ¯ i + R ¯ i, j where W ¯ i is the average waiting time in the queue at node i and R ¯ i, j is the average time to send a packet through the link (i,j) successfully.
