Illustration of the transformed binary images of normal, benign, and malignant samples into grayscale. by Tehnan I. A. Mohamed (16846175)

Reproducing kernel-based semiparametric functional smoothed score estimation with binary responses by Meichen Liu (8168148)

Calibration curves for the test set of four models. by Meng Cao (105914)

Subjects:

SHAP bar plot. by Meng Cao (105914)

Subjects:

ROC curves for the test set of four models. by Meng Cao (105914)

Subjects:

Display of the web prediction interface. by Meng Cao (105914)

Subjects:

Sample screening flowchart. by Meng Cao (105914)

Subjects:

Descriptive statistics for variables. by Meng Cao (105914)

Subjects:

SHAP summary plot. by Meng Cao (105914)

Subjects:

Performance metrics of the models on the training and test set. by Meng Cao (105914)

Subjects:

<i>hi</i>PRS algorithm process flow. by Michela C. Massi (14599915)

Random forest model performs better than support vector machine algorithms and when it primarily uses spontaneous photopic ERG of 60-s duration in humans. by Ramsés Noguez Imm (6658637)

Multicategory Angle-Based Learning for Estimating Optimal Dynamic Treatment Regimes With Censored Data by Fei Xue (24567)

“…In this article, we develop a novel angle-based approach to search the optimal DTR under a multicategory treatment framework for survival data. …”

Sample image for illustration. by Indhumathi S. (19173013)

“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”

Quadratic polynomial in 2D image plane. by Indhumathi S. (19173013)

“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”

Comparison analysis of computation time. by Indhumathi S. (19173013)

“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”

Process flow diagram of CBFD. by Indhumathi S. (19173013)

“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”

Precision recall curve. by Indhumathi S. (19173013)

“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”

Spontaneous ERG-based random forest model discriminates control and disease cases in rodent models of obesity and type 1 diabetes and predicts disease evolution in the type 1 diabe... by Ramsés Noguez Imm (6658637)

Fortran & C++: design fractal-type optical diffractive element by I-Lin Ho (13768960)

“…</p> <p>(2) calculate diffraction fields for fractal and/or grid-matrix (binary) phase-holograms.</p> <p>(3) optimize the fractal and/or grid-matrix holograms for given target diffraction images, using annealing algorithms. …”