Systems and Software Development Department
2021 – Present
Conduct applied research to address and solve local problems in Kuwait, contributing to the advancement of scientific and technological solutions.
Gulf Financial Center
2019 – 2021
Facilitated the use of advanced financial software and tools for students and academics, providing instruction and support to enhance applied finance education and research. Extended GFC services to corporate clients.
Math Foundation Unit
2015 – 2019
Implemented innovative teaching models, promoted technology-driven learning, automated exam scheduling, and contributed to achieving NADE accreditation.
2018
Founded and managed an IT and graphic design company with a focus on innovative software solutions, blending IT development with investment in creative ideas.
IT Department, Development Unit
2014 – 2015
Led a programming team to efficiently develop multiple systems within tight deadlines while identifying and mitigating security vulnerabilities to safeguard company systems against potential threats.
Hesham Almansouri, Zaid Hussain
2024
Cluster Computing (Q1)
Disjoint paths are defined as paths between the source and destination nodes where the intermediate nodes in any two paths are disjoint. They are helpful in fault-tolerance routing and securing message distribution in the network. Several research papers were proposed to solve the problem of finding disjoint paths for a variety of interconnection networks such as Hypercube, Generalized Hypercube, Mesh, Torus, Gaussian, Eisenstein-Jacobi, and many other topologies. In this research, we have developed a general algorithm that constructs maximal node-to-node disjoint paths for symmetric networks where all paths are shortest. The algorithm presented in this paper outperforms other algorithms in finding not only the disjoint paths but shortest and maximal disjoint paths with a complexity of O(n2). In addition, we have simulated the proposed algorithm on different networks. The solution of unsolved problem in Cube-Connected-Cycles is given in the simulation results.
Interconnection network; Symmetric network; Edge disjoint; Disjoint paths; Fault-tolerant; Routing; Node-to-node
Mohammad Awadh, Zaid Hussain, Hesham Almansouri
2023
Kuwait Journal of Science (Q2)
The cycles in an interconnection network are one of the communication types that are considered as a factor to measure the efficiency and reliability of the networks’ topology. The network is said to be panconnected if there are cycles of length l between two nodes u and v, for all l = d(u, v), d(u, v) + 1, d(u, v) + 2, …, n − 1 where d(u, v) is the shortest distance between u and v in a given network, and n is the total number of nodes in the network. In this paper, we propose an algorithm that proves the existence of panconnectivity of Eisenstein-Jacobi networks by constructing all cycles between any two nodes in the network of length l such that 3 ≤ l < n. The correctness of the proposed algorithm is given with the time complexity O(n4). The proposed algorithm adopts and modifies the idea of Dynamic Source Routing (DSR) to find all possible shortest paths. The results of some test cases using the proposed algorithm are provided.
Eisenstein-Jacobi networks; Fault-tolerant; Interconnection network; Panconnectivity; Pancyclic
Yousef Abdulrazzaq, Mohammad Ali, Hesham Almansouri
2022
The Journal of Asian Finance, Economics and Business (Q2)
COVID-19; Stock Returns; Pedroni; VECM; Panel Data
Developed machine learning models to predict case resolution times, assign the best officer for each case, and provide decision support for optimal investigation procedures.
Developed a machine learning model to predict high-impact philanthropic projects, supporting decision-making in charitable organizations.
Led the collection of genomic data for chicken breeds and developed an online database with advanced search capabilities to support researchers.
Created an online system to record and analyze interrogation results, enhancing investigative efficiency.
Built an ensemble machine learning model to predict criminal characteristics based on victim and crime information.
Created a web application for managing real estate portfolios, including properties, units, contracts, maintenance, invoices, legal cases, and reporting.
Developed a program to schedule exam sessions for approximately 800 students, ensuring no time conflicts with their class schedules and minimizing the time students spend at the university.
Successfully developed a CRM web application for the wealth management department at Global Investment House.
Developed multiple e-commerce and informational websites for various clients.
Year: 2023
Venue: KISR
Delivered a comprehensive Full-Stack Web Development course, encompassing HTML, CSS, JavaScript, PHP, MySQL, and fundamental concepts of web servers and programming.
Year: 2024
Venue: Crime Investigation Department
Conducted an introductory course on penetration testing, covering command line interface basics, port scanning, directory enumeration, SQL injection, and password brute forcing, alongside essential concepts of networks and protocols.