Mayez A. Al-Mouhamed

Learn More
In 1], Al-Mohummed proposed a method for evaluating a lower bound on the completion time and the number of processors required for scheduling precedence graphs with communication costs. In this note, we show that the method in 1] for evaluating a lower bound on the number of processors is incorrect. As a result, some precedence graphs can be feasibly(More)
This paper presents a model-based vision system to achieve robust recognition of planar contours that are scale invariant of known models. Planar contours are partitioned into segments by using constant curvature criterion. A set of descriptors that are invariant with respect to scale, rotation, and translation are extracted from the geometric features of(More)
In the recent years, the Graphics Processing Units (GPUs) have gained popularity for general purpose applications, immensely outperforming traditional optimized CPU based implementations. A class of such applications implemented on GPUs to achieve faster execution than CPUs include cryptographic techniques like the Advanced Encryption Standard (AES) which(More)
The class scheduling problem can be modeled by a graph where the vertices and edges represent the courses and the common students, respectively. The problem is to assign the courses a given number of time slots (colors), where each time slot can be used for a given number of class rooms. The Vertex Coloring (VC) algorithm is a polynomial time algorithm(More)
This paper presents a robust telerobotic system that consists of a real-time vision-based operator hand tracking system (client) and a slave robot (server) which are interconnected through a LAN. The tracking system (1) monitors the operator hand motion and (2) determines its position and orientation which are used to control the slave robot. Two digital(More)
Abstract— A telerobotic system consists of master (client) and slave (server) stations which are usually connected by a computer network. A reliable real-time connection between master and slave systems is proposed using Distributed Components (.NET Remoting). This has a number of benefits such as software reusability, ease of extensibility, debugging, and(More)
Scheduling precedence graphs with communication times is the theoretical basis for achieving efficient parallelism in message-passing machines. The lack of global information on the tasks, due to communication, has lead to develop local scheduling heuristics such as the Earliest-Task-First. Using knowledge on computation, communication, and system topology,(More)
In this paper we present the performance evaluation of a Distributed Component based Telerobotic Framework that implements a real-time interaction between a telrobotic client and server. The objective is to optimize delays in multistreaming of force feedback, stereo data and master-slave commands. Different scenarios are considered and statistically(More)