-
Khaled Hossam Mahfouz
- Instructor
- Ext: 6723
Graduated from Ajman University with Excellence with Honors majoring in Electrical Engineering and Electronics. Pursuing a M.Sc. in Artficial Intelligence Degree whilst working as an Instructor at Ajman University.
Education
- B.Sc. In Electrical Engineering/Electronics, Ajman University, United Arab Emirates, 2016
B.Sc. In Electrical Engineering/Electronics, Ajman University, United Arab Emirates, 2016
Experience
- Assistant Instructor, Electrical and Computer Engineering Department, Ajman Univrsity, United Arab Emirates, 2017 to 2022
- Instructor, Electrical and Computer Engineering Department, Ajman Univrsity, United Arab Emirates, 2022 to Present
Assistant Instructor, Electrical and Computer Engineering Department, Ajman Univrsity, United Arab Emirates, 2017 to 2022
Instructor, Electrical and Computer Engineering Department, Ajman Univrsity, United Arab Emirates, 2022 to Present
Teaching Area
- Electronic Devices and Circuits
- Circuit Analysis
- Sensors and Instrumentation
- Digital Logic Design
- Renewable Energy Systems
- Design with Integrated Circuits
- Power Electronics
- Power Systems and Electrical Machines
Electronic Devices and Circuits
Circuit Analysis
Sensors and Instrumentation
Digital Logic Design
Renewable Energy Systems
Design with Integrated Circuits
Power Electronics
Power Systems and Electrical Machines
Research
- Evolutionary Computations
- Artificial Intelligence
- Machine Learning
- Embedded Systems
Evolutionary Computations
Artificial Intelligence
Machine Learning
Embedded Systems
Publications
-
ConferenceK. Mahouz, S. Rameshi, M. Rafat, M.Elsayed, M. Sheikh, H. Zidan, Route Mapping and Biometric Attendance System in School Buses, 2020 Advances in Science and Engineering Technology International Conferences (ASET), Dubai
-
ConferenceK. Mahfouz, S. Ali, M. Al-Betar, M. Awadallah, Solving 0-1 Knaosack Problems Using Sine-Cosine Algorithm, 2021 Palestinian International Conference on Information and Communication Technology (PICICT), State of Gaza
K. Mahouz, S. Rameshi, M. Rafat, M.Elsayed, M. Sheikh, H. Zidan, Route Mapping and Biometric Attendance System in School Buses, 2020 Advances in Science and Engineering Technology International Conferences (ASET), Dubai
Many students are reported to be left behind in school buses unwittingly due to several reasons. Locked-in students might face adverse health issues and might even die due to the suffocation and extreme climate conditions. Hence, tracking a student's entry and exit to a school bus helps avoid the problem. This paper illustrates an attendance approach using biometrics. The system comprises of the smart tablet, a microcontroller-based fingerprint sensor, an automated gate and a developed android application. When integrated in school buses, a student can only board/exit the school bus when his/her fingerprint is recognized. Once students are to be dropped off back home, the system generates a route based on the attended students and furthermore detects and alerts the bus driver if an attended student has not boarded/exited the bus.
About the journal
K. Mahfouz, S. Ali, M. Al-Betar, M. Awadallah, Solving 0-1 Knaosack Problems Using Sine-Cosine Algorithm, 2021 Palestinian International Conference on Information and Communication Technology (PICICT), State of Gaza
The task of optimization is no easy task and from a computational point of view, it often involves scanning a large search space to find the best solution that adheres to all the constraints and desired specifications. Designing a customized algorithm to solve several optimization problems is also a challenging task, therefore scientists and engineers utilize metaheuristic algorithms that can provide an optimal solution within a reasonable time. This optimal solution may or may not be the best solution in the search space, but it is usually good enough to satisfy the requirements without spending a lot of computational resources or time. The 0–1 knapsack problem is an constraint-based optimization problem in which a number of items have to be packed into a container by maximizing the value of the items in the container while also adhering to the weight limit of the container. In this paper, sine-cosine algorithm (SCA) is adopted to solve 0–1 knapsack problems. The proposed algorithm is called binary sine-cosine algorithm (BSCA). Due to the binary nature of 0–1 knapsack problem, the SCA is manipulated using a mapping function. The performance of the proposed BSCA is evaluated using 15 well-known datasets. Furthermore, the performance of the proposed BSCA is compared with other comparative algorithms (i.e., GA, PSO, and BFPA) from the literature using the same datasests. It can be observed from the results that the performance of the proposed BSCA is similar to other algorithms by obtaining the optimal results on 10 datasets. While the results of the proposed BSCA are convergent with others for the remaining five datasets.
About the journal
Memberships, Awards and Honors
- Excellence with Honors and Head of Electrical Engineering Batch of 2012, Ajman University, United Arab Emirates