Master M2 Student in Parallel and Distributed Systems at UGA.
Master M1 in Computer Science (MOSIG) at UGA
bachelor degree at Lebanese University
Born in 1998. A motivated programmer with problem-solving and critical thinking skills, as well as meticulous attention to detail and methodical nature. Reliable and hard worker. Forward-thinking and resourceful with a diligent mindset and a disciplined approach.
I have a big concern toward parallel and distributed systems (Digital Infrastructure), I'm looking to improve my concepts more deeply in this domain to have better knowledge, I'm excited to do a Ph.D in this domain to involve in improving the characteristic of the operating systems after my graduation from the M2 Master degree in Digital Infrastructure Domain.
For more information please see my paper :) click here
the language used is java and RMI library to create a server that manages communication between clients.
An overlay network is a computer network that is built on top of another network.
It was developed using two technologies:
1- RMI
2- RabbitMQ
matrix multiplication. It has beem developed using message passing MPI
Parallel-Genetic-Algorithm-to-Solve-Traveling-Salesman-Problem
Traveling Salesman Problem (TSP) is one of the most common studied problems in combinatorial optimization. Given the list of cities and distances between them, the problem is to find the shortest tour possible which visits all the cities in list exactly once and ends in the city where it starts. Procedure that has been followed: • Arguments parsing • Reading input file • Population initialization • Fitness Calculation • Loop • Selection • Crossover • Mutation • Evaluation • Replacement there are two versions of crossover: Greedy Crossover V1 For a pair of parents i & j • Pick 1st city from parent i • Next choose nearest next city not causing cycle from i (or else j) (i.e. not already figuring so far in chromosome) • If nearest next city from both parents is causing a cycle, then a random city (not introducing a cycle) is chosen • Loop until all cities are chosen Greedy Crossover V2 For a pair of parents • Rand-pick a city as start • Next chosen city is the k-th nearest one not causing cycle (i.e. not already figuring so far in chromosome) • If nearest next city from both parents is causing a cycle, then a random city (not introducing a cycle) is chosen • Loop until all cities are chosen
Built using JavaFX and applying GUI concepts and methods using eclipse.
Implementation of a client-server application providing a Twitter-like service, includes register, publish, follow, and history services. It is handled using three types of threads, communicator thread that receives clients' requests, executor thread that executes clients' commands, and answer thread that sends answers back to clients. The structure of the code contains one communicator thread, and multiple executor and answer threads, with giving some priority to some requests that others. The code implemented in C and tested with extreme configuration.
Bubble, Quick and Merge sort algorithms are paralalized, Developed using c and OpenMP library.
software that detects the ID number of our Lebanese University ID card to manage attendance. It was implemented using Python language. OpenCV library has been used.
Senior projects for Lebanese University
The System is close to facebook, A user can upload a book to the social and a user can perform rating and comments, Developed using PHP/MySQL, and other interesting technologies; Html 5, Ajax, jQuery.