Schematic representation of semi-automated algorithm for organoids analyzing. by Anna Demchenko (18449439)

Design and implementation of the Multiple Criteria Decision Making (MCDM) algorithm for predicting the severity of COVID-19. by Jiaqing Luo (10975030)

“…<p>(A). The MCDM algorithm-Stage 1. Preprocessing, this stage is the process of refining the collected raw data to eliminate noise, including correlation analysis and feature selection based on P values. …”

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

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

Summary of literature review. by Muhammad Ayyaz Sheikh (18610943)

“…To overcome this limitation, recent advancements have introduced multi-objective evolutionary algorithms for ATS. This study proposes an enhancement to the performance of ATS through the utilization of an improved version of the Binary Multi-Objective Grey Wolf Optimizer (BMOGWO), incorporating mutation. …”

Topic description. by Muhammad Ayyaz Sheikh (18610943)

“…To overcome this limitation, recent advancements have introduced multi-objective evolutionary algorithms for ATS. This study proposes an enhancement to the performance of ATS through the utilization of an improved version of the Binary Multi-Objective Grey Wolf Optimizer (BMOGWO), incorporating mutation. …”

Notations along with their descriptions. by Muhammad Ayyaz Sheikh (18610943)

“…To overcome this limitation, recent advancements have introduced multi-objective evolutionary algorithms for ATS. This study proposes an enhancement to the performance of ATS through the utilization of an improved version of the Binary Multi-Objective Grey Wolf Optimizer (BMOGWO), incorporating mutation. …”

Detail of the topics extracted from DUC2002. by Muhammad Ayyaz Sheikh (18610943)

“…To overcome this limitation, recent advancements have introduced multi-objective evolutionary algorithms for ATS. This study proposes an enhancement to the performance of ATS through the utilization of an improved version of the Binary Multi-Objective Grey Wolf Optimizer (BMOGWO), incorporating mutation. …”

Natural language processing for automated quantification of bone metastases reported in free-text bone scintigraphy reports by Olivier Q. Groot (9370461)

“…The aim of this study was to develop a natural language processing (NLP) algorithm for binary classification (single metastasis versus two or more metastases) in bone scintigraphy reports of patients undergoing surgery for bone metastases.…”

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

Parameter settings. by Yang Cao (53545)

“…<div><p>Differential Evolution (DE) is widely recognized as a highly effective evolutionary algorithm for global optimization. …”

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

tUbenet Foundation Model Weights by Natalie Holroyd (7099391)

datasheet1_Graph Neural Networks for Maximum Constraint Satisfaction.pdf by Jan Tönshoff (10192709)

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

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

Table_1_bSRWPSO-FKNN: A boosted PSO with fuzzy K-nearest neighbor classifier for predicting atopic dermatitis disease.docx by Yupeng Li (507508)

“…</p>Methods<p>This paper establishes a medical prediction model for the first time on the basis of the enhanced particle swarm optimization (SRWPSO) algorithm and the fuzzy K-nearest neighbor (FKNN), called bSRWPSO-FKNN, which is practiced on a dataset related to patients with AD. …”

Fig 1 - by Jakub Stoklosa (3315042)

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

Segmentation, trace denoising and spike extraction framework. by Changjia Cai (10647521)