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

Binary contingency table. by Lu Xiao (314030)

Python-Based Algorithm for Estimating NRTL Model Parameters with UNIFAC Model Simulation Results by Se-Hee Jo (20554623)

“…The algorithm was applied to aqueous, binary mixture systems composed of 37 common biochemical substances such as amino acids, organic acids, and sugars. …”

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

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

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

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

DataSheet_1_Raman Spectroscopic Differentiation of Streptococcus pneumoniae From Other Streptococci Using Laboratory Strains and Clinical Isolates.pdf by Marcel Dahms (9160118)

“…Improvement of the classification rate is expected with optimized model parameters and algorithms as well as with a larger spectral data base for training.…”

MCLP_quantum_annealer_V0.5 by Anonymous Anonymous (4854526)

“…Currently, classical high-performance and parallel spatial computing architectures are commonly employed to solve geospatial optimization problems. …”

Generalized Tensor Decomposition With Features on Multiple Modes by Jiaxin Hu (1327875)

“…An efficient alternating optimization algorithm with provable spectral initialization is further developed. …”

Contextual Dynamic Pricing with Strategic Buyers by Pangpang Liu (18886419)

“…This underscores the rate optimality of our policy. Importantly, our policy is not a mere amalgamation of existing dynamic pricing policies and strategic behavior handling algorithms. …”

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

Bayesian sequential design for sensitivity experiments with hybrid responses by Yuxia Liu (1779592)

“…<p>In experimental design, a common problem seen in practice is when the result includes one binary response and multiple continuous responses. …”

Table_1_Machine Learning Techniques in Blood Pressure Management During the Acute Phase of Ischemic Stroke.DOCX by Orit Mazza (12081914)

“…Decision trees were constructed by a hierarchical binary recursive partitioning algorithm to predict the BP-lowering of 10–30% off the maximal value when antihypertensive treatment was given in patients with an extremely high BP (above 220/110 or 180/105 mmHg for patients receiving thrombolysis), according to the American Heart Association/American Stroke Association (AHA/ASA), the European Society of Cardiology, and the European Society of Hypertension (ESC/ESH) guidelines. …”

Supplementary Material 8 by Nishitha R Kumar (19750617)

“…</li><li><b>XGboost: </b>An optimized gradient boosting algorithm that efficiently handles large genomic datasets, commonly used for high-accuracy predictions in <i>E. coli</i> classification.…”

PathOlOgics_RBCs Python Scripts.zip by Ahmed Elsafty (16943883)

“…</p><p dir="ltr">In terms of classification, a second algorithm was developed and employed to preliminary sort or group the individual cells (after excluding the overlapping cells manually) into different categories using five geometric measurements applied to the extracted contour from each binary image mask (see PathOlOgics_script_2; preliminary shape measurements). …”

Psoas muscle CT radiomics-based machine learning models to predict response to infliximab in patients with Crohn’s disease by Zhuoyan Chen (12193358)

“…<i>Z</i> score standardization and independent sample <i>t</i> test were applied to identify optimal predictive features, which were then utilized in seven ML algorithms for training and validation. …”