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

Flowchart of software workflow. by Gavrielle R. Untracht (11820311)

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

Steps in the extraction of 14 coordinates from the CT slices for the curved MPR. by Linus Woitke (22783534)

“…Protruding paths are then eliminated using graph-based optimization algorithms, as demonstrated in f). …”

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

Presentation_1_Modified GAN Augmentation Algorithms for the MRI-Classification of Myocardial Scar Tissue in Ischemic Cardiomyopathy.PPTX by Umesh C. Sharma (10785063)

“…Currently, there are no optimized deep-learning algorithms for the automated classification of scarred vs. normal myocardium. …”

DataSheet_1_Multi-Parametric MRI-Based Radiomics Models for Predicting Molecular Subtype and Androgen Receptor Expression in Breast Cancer.docx by Yuhong Huang (115702)

“…We applied several feature selection strategies including the least absolute shrinkage and selection operator (LASSO), and recursive feature elimination (RFE), the maximum relevance minimum redundancy (mRMR), Boruta and Pearson correlation analysis, to select the most optimal features. We then built 120 diagnostic models using distinct classification algorithms and feature sets divided by MRI sequences and selection strategies to predict molecular subtype and AR expression of breast cancer in the testing dataset of leave-one-out cross-validation (LOOCV). …”

Table_1_An efficient decision support system for leukemia identification utilizing nature-inspired deep feature optimization.pdf by Muhammad Awais (263096)

“…To optimize feature selection, a customized binary Grey Wolf Algorithm is utilized, achieving an impressive 80% reduction in feature size while preserving key discriminative information. …”

Symmetry test result. by Jiyong Moon (16819302)

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

Supplementary file 1_Comparative evaluation of fast-learning classification algorithms for urban forest tree species identification using EO-1 hyperion hyperspectral imagery.docx by Veera Narayana Balabathina (22518524)

“…</p>Methods<p>Thirteen supervised classification algorithms were comparatively evaluated, encompassing traditional spectral/statistical classifiers—Maximum Likelihood, Mahalanobis Distance, Minimum Distance, Parallelepiped, Spectral Angle Mapper (SAM), Spectral Information Divergence (SID), and Binary Encoding—and machine learning algorithms including Decision Tree (DT), K-Nearest Neighbor (KNN), Support Vector Machine (SVM), Random Forest (RF), and Artificial Neural Network (ANN). …”

DataSheet_1_Exploring deep learning radiomics for classifying osteoporotic vertebral fractures in X-ray images.docx by Jun Zhang (48506)

“…Utilizing the binary “One-vs-Rest” strategy, the model based on the RadImageNet dataset demonstrated superior efficacy in predicting Class 0, achieving an AUC of 0.969 and accuracy of 0.863. …”

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

Fig 12 - by Nisha Yadav (366131)

IUTF Dataset(Enhanced): Enabling Cross-Border Resource for Analysing the Impact of Rainfall on Urban Transportation Systems by Xuhui Lin (19505503)

“…</p><p dir="ltr"><b>Quality Assurance</b>: Comprehensive technical validation demonstrates the dataset's integrity, sensitivity to rainfall impacts, and capability to reveal complex traffic-weather interaction patterns.</p><h2>Data Structure</h2><p dir="ltr">The dataset is organized into four primary components:</p><ol><li><b>Road Network Data</b>: Topological representations including spatial geometry, functional classification, and connectivity information</li><li><b>Traffic Sensor Data</b>: Sensor metadata, locations, and measurements at both 5-minute and hourly resolutions</li><li><b>Precipitation Data</b>: Hourly meteorological information with spatial grid cell metadata</li><li><b>Derived Analytical Matrices</b>: Pre-computed structures for advanced spatial-temporal modelling and network analyses</li></ol><h2>File Formats</h2><ul><li><b>Tabular Data</b>: Apache Parquet format for optimal compression and fast query performance</li><li><b>Numerical Matrices</b>: NumPy NPZ format for efficient scientific computing</li><li><b>Total Size</b>: Approximately 2 GB uncompressed</li></ul><h2>Applications</h2><p dir="ltr">The IUTF dataset enables diverse analytical applications including:</p><ul><li><b>Traffic Flow Prediction</b>: Developing weather-aware traffic forecasting models</li><li><b>Infrastructure Planning</b>: Identifying vulnerable network components and prioritizing investments</li><li><b>Resilience Assessment</b>: Quantifying system recovery curves, robustness metrics, and adaptive capacity</li><li><b>Climate Adaptation</b>: Supporting evidence-based transportation planning under changing precipitation patterns</li><li><b>Emergency Management</b>: Improving response strategies for weather-related traffic disruptions</li></ul><h2>Methodology</h2><p dir="ltr">The dataset creation involved three main stages:</p><ol><li><b>Data Collection</b>: Sourcing traffic data from UTD19, road networks from OpenStreetMap, and precipitation data from ERA5 reanalysis</li><li><b>Spatio-Temporal Harmonization</b>: Comprehensive integration using novel algorithms for spatial alignment and temporal synchronization</li><li><b>Quality Assurance</b>: Rigorous validation and technical verification across all cities and data components</li></ol><h2>Code Availability</h2><p dir="ltr">Processing code is available at: https://github.com/viviRG2024/IUTDF_processing</p>…”