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

S1 Code - by Gaosha Li (20570760)

Data_Sheet_2_Computational Neural Modeling of Auditory Cortical Receptive Fields.pdf by Jordan D. Chambers (6732224)

Data_Sheet_1_Computational Neural Modeling of Auditory Cortical Receptive Fields.PDF by Jordan D. Chambers (6732224)

Data_Sheet_3_Computational Neural Modeling of Auditory Cortical Receptive Fields.PDF by Jordan D. Chambers (6732224)

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. …”

Table_1_Screening of Long Non-coding RNAs Biomarkers for the Diagnosis of Tuberculosis and Preliminary Construction of a Clinical Diagnosis Model.docx by Juli Chen (12187358)

“…Background<p>Pathogenic testing for tuberculosis (TB) is not yet sufficient for early and differential clinical diagnosis; thus, we investigated the potential of screening long non-coding RNAs (lncRNAs) from human hosts and using machine learning (ML) algorithms combined with electronic health record (EHR) metrics to construct a diagnostic model.…”

Malware detection workflow in compressed archives by Paul A. Gagniuc (1818325)

Distributions of model parameters mirror differentially expressed ion channel genes. by Daniele Linaro (227790)

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. …”

Input features. by Nicola Lazzarini (3528197)

Baseline characteristics of patients in the study cohort. by Nicola Lazzarini (3528197)

ECE6379_PSOM.zip by Xingpeng Li (11825663)

“…Optimization algorithms that are commonly used to solve these problems will also be covered including linear programming, mixed-integer linear programming, Lagrange relaxation, dynamic programming, branch and bound, and duality theory.…”

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. …”

Data_Sheet_1_Early Prediction of Sepsis in the ICU Using Machine Learning: A Systematic Review.PDF by Michael Moor (10887888)

Data_Sheet_1_Multiclass Classification Based on Combined Motor Imageries.pdf by Cecilia Lindig-León (7889777)

“…And we propose two new multilabel uses of the Common Spatial Pattern (CSP) algorithm to optimize the signal-to-noise ratio, namely MC2CMI and MC2SMI approaches. …”

Thesis-RAMIS-Figs_Slides by Felipe Santibañez-Leal (10967991)

“…<br><br>Finally, although the developed concepts, ideas and algorithms have been developed for inverse problems in geostatistics, the results are applicable to a wide range of disciplines where similar sampling problems need to be faced, included but not limited to design of communication networks, optimal integration and communication of swarms of robots and drones, remote sensing.…”