Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 4 of 4

Full-Text Articles in Engineering

Genetic Algorithm Optimization Of Experiment Design For Targeted Uncertainty Reduction, Alexander Amedeo Depillis May 2024

Genetic Algorithm Optimization Of Experiment Design For Targeted Uncertainty Reduction, Alexander Amedeo Depillis

Masters Theses

Nuclear cross sections are a set of parameters that capture probability information about various nuclear reactions. Nuclear cross section data must be experimentally measured, and this results in simulations with nuclear data-induced uncertainties on simulation outputs. This nuclear data-induced uncertainty on most parameters of interest can be reduced by adjusting the nuclear data based on the results from an experiment. Integral nuclear experiments are experiments where the results are related to many different cross sections. Nuclear data may be adjusted to have less uncertainty by adjusting them to match the results obtained from integral experiments. Different integral experiments will adjust …


Milp Modeling Of Matrix Multiplication: Cryptanalysis Of Klein And Prince, Murat Burhan İlter, Ali Aydın Selçuk Feb 2024

Milp Modeling Of Matrix Multiplication: Cryptanalysis Of Klein And Prince, Murat Burhan İlter, Ali Aydın Selçuk

Turkish Journal of Electrical Engineering and Computer Sciences

Mixed-integer linear programming (MILP) techniques are widely used in cryptanalysis, aiding in the discovery of optimal linear and differential characteristics. This paper delves into the analysis of block ciphers KLEIN and PRINCE using MILP, specifically calculating the best linear and differential characteristics for reduced-round versions. Both ciphers employ matrix multiplication in their diffusion layers, which we model using multiple XOR operations. To this end, we propose two novel MILP models for multiple XOR operations, which use fewer variables and constraints, proving to be more efficient than standard methods for XOR modeling. For differential cryptanalysis, we identify characteristics with a probability …


Optimal Algorithm For Managing On-Campus Student Transportation, Youssef Harrath Dr. Jan 2024

Optimal Algorithm For Managing On-Campus Student Transportation, Youssef Harrath Dr.

Research & Publications

This study analyzed the transportation issues at the University of Bahrain Sakhir campus, where a bus system with an unorganized and fixed number of buses allocated each semester was in place. Data was collected through a survey, on-site observations, and student schedules to estimate the number of buses needed. The study was limited to students who require to move between buildings for academic purposes and not those who choose to ride buses for other reasons. An algorithm was designed to calculate the optimal number of buses for each time slot, and for each day. This solution could improve transportation efficiency, …


Segac: Sample Efficient Generalized Actor Critic For The Stochastic On-Time Arrival Problem, Honglian Guo, Zhi He, Wenda Sheng, Zhiguang Cao, Yingjie Zhou, Weinan Gao Jan 2024

Segac: Sample Efficient Generalized Actor Critic For The Stochastic On-Time Arrival Problem, Honglian Guo, Zhi He, Wenda Sheng, Zhiguang Cao, Yingjie Zhou, Weinan Gao

Research Collection School Of Computing and Information Systems

This paper studies the problem in transportation networks and introduces a novel reinforcement learning-based algorithm, namely. Different from almost all canonical sota solutions, which are usually computationally expensive and lack generalizability to unforeseen destination nodes, segac offers the following appealing characteristics. segac updates the ego vehicle’s navigation policy in a sample efficient manner, reduces the variance of both value network and policy network during training, and is automatically adaptive to new destinations. Furthermore, the pre-trained segac policy network enables its real-time decision-making ability within seconds, outperforming state-of-the-art sota algorithms in simulations across various transportation networks. We also successfully deploy segac …