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

Subjects:

QSAR model for predicting neuraminidase inhibitors of influenza A viruses (H1N1) based on adaptive grasshopper optimization algorithm by Z.Y. Algamal (5547620)

“…The binary grasshopper optimization algorithm (BGOA) is a new meta-heuristic optimization algorithm, which has been used successfully to perform feature selection. …”

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

An exemplar procedure for activity flow modeling based on the direct and shortest paths at a network density of 15%. by Zhengdong Wang (35299)

Data_Sheet_1_A real-time driver fatigue identification method based on GA-GRNN.ZIP by Xiaoyuan Wang (492534)

“…<p>It is of great practical and theoretical significance to identify driver fatigue state in real time and accurately and provide active safety warning in time. In this paper, a non-invasive and low-cost method of fatigue driving state identification based on genetic algorithm optimization of generalized regression neural network model is proposed. …”

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

Bayesian Spatial Binary Regression for Label Fusion in Structural Neuroimaging by D. Andrew Brown (6584837)

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

“…In this way, for each binary problem, the CSP algorithm produces features to determine if the specific body part is engaged in the task or not. …”

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

Flowchart scheme of the ML-based model. by Noshaba Qasmi (20405009)

The data processing and analysis pipeline. by Xin Zhang (35492)

Active Learning Accelerated Discovery of Stable Iridium Oxide Polymorphs for the Oxygen Evolution Reaction by Raul A. Flores (2910539)

“…We emphasize that the proposed AL algorithm can be easily generalized to search for any binary metal oxide structure with a defined stoichiometry.…”

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

“…In the context of facies recovery using simulations, the task of optimal sampling is formalized and addressed using a maximum information extraction criterion. …”

Models and Dataset by M RN (9866504)

“…</p><p dir="ltr"><br></p><p dir="ltr"><b>RAO (Rao Optimization Algorithm):</b><br>RAO is a parameter-less optimization algorithm that updates solutions based on simple arithmetic operations involving the best and worst individuals in the population. …”