Exact(6)
AUC area under the plasma concentration-time curve, C max peak concentration, T max time to reach peak concentration.
Within- and between-subject variability to the technique was assessed by measuring the maximum recorded values (max), time to maximum value (tmax) and area under the curve (AUC(0 1 h)) of each of the endpoints.
AUC, area under the curve; C max, maximum plasma methylphenidate concentration; T max, time to maximum plasma methylphenidate concentration.
Abbreviations: C max, maximum plasma concentration; CV, coefficient of variation; t max, time to reach C max; AUC0-24, area under plasma concentration-time curve from 0 to 24 hour; t1/2λz, half-life associated with terminal slope of a semilogarithmic concentration-time curve.
CV coefficient of variation, GIR glucose infusion rate, max maximum, SD single dose, tGIR max time to maximum glucose infusion rate aGeometric mean bMedian This study was performed as a single-dose trial but it is possible to extrapolate the comparison of IDegAsp OD GIR profiles to the SS setting.
> -wrap-foot> Mean ± standard deviation t 1/2 half-life in plasma, C max peak concentration, t max time to reach peak concentration, AUC 0→t area under the concentration time curve where t is the last time of blood sampling at 168 h (7 days) after treatment AUC0→t strongly correlated with the dose (400 2,000 mg) of FM-VP4 for DACP (R = 0.93) and DASP (R = 0.90).
Similar(54)
Pharmacokinetic parameters included AUCins, peak concentration of insulin (Cins-max), and time to Cins-max (Tins-max).
The maximum enhancement (MAX) and time to peak anhancement (TTP maps) allow for a further characterisation of the perfusion impairment.
For training one free parameter in the HMM with the above algorithm, each iterations requires O (MT max L) time to calculate the f m and the p m values and to calculate the cumulative counts for one training sequence.
This can be directly compared to the default algorithm for Viterbi training described above with first calculates the entire Viterbi matrix and which requires O (M L) memory and O (T max LM) time to achieve the same.
For training one free parameter in the HMM with the above algorithm, each iteration requires O (MT max L) time to calculate the v m values and to calculate the cumulative counts.
More suggestions(5)
Write better and faster with AI suggestions while staying true to your unique style.
Since I tried Ludwig back in 2017, I have been constantly using it in both editing and translation. Ever since, I suggest it to my translators at ProSciEditing.

Justyna Jupowicz-Kozak
CEO of Professional Science Editing for Scientists @ prosciediting.com