Analysis and design of algorithms for the manufacturing process of integrated circuits by Sonia Fleytas (16856403)

“…Additionally, the results obtained from our new ILP model indicate that our genetic algorithm results are very close to the optimal values.…”

Optimal Time Intervals of Breech Births Dataset by Emma Spillane (11249121)

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

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

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

Parameter settings. by Yang Cao (53545)

“…<div><p>Differential Evolution (DE) is widely recognized as a highly effective evolutionary algorithm for global optimization. It has proven its efficacy in tackling diverse problems across various fields and real-world applications. …”

Data_Sheet_1_Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer.pdf by Maliheh Aramon (6557906)

“…The Digital Annealer's algorithm is currently based on simulated annealing; however, it differs from it in its utilization of an efficient parallel-trial scheme and a dynamic escape mechanism. …”

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

Symmetry test result. by Jiyong Moon (16819302)

Algoritmo de clasificación de expresiones de odio por tipos en español (Algorithm for classifying hate expressions by type in Spanish) by Daniel Pérez Palau (11097348)

“…</li></ul><p dir="ltr"><b>File Structure</b></p><p dir="ltr">The code generates and saves:</p><ul><li>Weights of the trained model (.h5)</li><li>Configured tokenizer</li><li>Training history in CSV</li><li>Requirements file</li></ul><p dir="ltr"><b>Important Notes</b></p><ul><li>The model excludes category 2 during training</li><li>Implements transfer learning from a pre-trained model for binary hate detection</li><li>Includes early stopping callbacks to prevent overfitting</li><li>Uses class weighting to handle category imbalances</li></ul><p dir="ltr">The process of creating this algorithm is explained in the technical report located at: Blanco-Valencia, X., De Gregorio-Vicente, O., Ruiz Iniesta, A., & Said-Hung, E. (2025). …”

Summary of LITNET-2020 dataset. by Asmaa Ahmed Awad (16726315)

“…In this paper, a novel, and improved version of the Long Short-Term Memory (ILSTM) algorithm was proposed. The ILSTM is based on the novel integration of the chaotic butterfly optimization algorithm (CBOA) and particle swarm optimization (PSO) to improve the accuracy of the LSTM algorithm. …”

SHAP analysis for LITNET-2020 dataset. by Asmaa Ahmed Awad (16726315)

“…In this paper, a novel, and improved version of the Long Short-Term Memory (ILSTM) algorithm was proposed. The ILSTM is based on the novel integration of the chaotic butterfly optimization algorithm (CBOA) and particle swarm optimization (PSO) to improve the accuracy of the LSTM algorithm. …”

Comparison of intrusion detection systems. by Asmaa Ahmed Awad (16726315)

“…In this paper, a novel, and improved version of the Long Short-Term Memory (ILSTM) algorithm was proposed. The ILSTM is based on the novel integration of the chaotic butterfly optimization algorithm (CBOA) and particle swarm optimization (PSO) to improve the accuracy of the LSTM algorithm. …”

Parameter setting for CBOA and PSO. by Asmaa Ahmed Awad (16726315)

“…In this paper, a novel, and improved version of the Long Short-Term Memory (ILSTM) algorithm was proposed. The ILSTM is based on the novel integration of the chaotic butterfly optimization algorithm (CBOA) and particle swarm optimization (PSO) to improve the accuracy of the LSTM algorithm. …”

NSL-KDD dataset description. by Asmaa Ahmed Awad (16726315)

“…In this paper, a novel, and improved version of the Long Short-Term Memory (ILSTM) algorithm was proposed. The ILSTM is based on the novel integration of the chaotic butterfly optimization algorithm (CBOA) and particle swarm optimization (PSO) to improve the accuracy of the LSTM algorithm. …”

The architecture of LSTM cell. by Asmaa Ahmed Awad (16726315)

“…In this paper, a novel, and improved version of the Long Short-Term Memory (ILSTM) algorithm was proposed. The ILSTM is based on the novel integration of the chaotic butterfly optimization algorithm (CBOA) and particle swarm optimization (PSO) to improve the accuracy of the LSTM algorithm. …”

The architecture of ILSTM. by Asmaa Ahmed Awad (16726315)

“…In this paper, a novel, and improved version of the Long Short-Term Memory (ILSTM) algorithm was proposed. The ILSTM is based on the novel integration of the chaotic butterfly optimization algorithm (CBOA) and particle swarm optimization (PSO) to improve the accuracy of the LSTM algorithm. …”