حاكم عادل كاظم كنبي

The tremendous recent involvement of technology in our life generates a lot of advantages and disadvantages. Nevertheless, and to profoundly augment its positive influence, at the expense of the negatives, most technology be deployed to serve humanity and society. Researchers attractive in developing robust and cooperative robotics that capable of solving difficult tasks without any human control. Metal detector robot is one of the robotics principles due to its effectiveness as compared with manually operated and very slow traditional methods. In this article, three main points that are concentrated 1) Design a robot which is vehicle-mounted sensors that capable of carries the sensors of the metal and obstacle; 2) Control and management system wirelessly by a computer-based to command the robot functions by several sets of user's rules and manage the robot instructions; and 3) Conduct an integrated system that achieving navigated data via metal detector based on online structured query language database registry. Also, discussed a comparison of the previous detector systems and highlights on several merits. The proposed system capable of fully control the robot also, set the robot operator permissions and rules, stored and archived the navigated results and printed reports and stored in an independent database.

String or pattern matching is an essential part of most computer applications that are widely used in text processors, Internet-based search engines and computer security. A key concept of string matching is identifying the existence of a pattern with m characters in a much longer text string. String matching operations are basic to many algorithms such as indexing algorithms, search algorithms and bioinformatics algorithms that are used in molecular biology, adopted pattern matching concept in their programming structure. Although the mathematical and algorithmic calculations of pattern matching algorithms are simple, they are still the main reason of a large ratio of the computational load in many applications This research proposes to parallelize a hybrid string matching algorithm called Maximum-Shift algorithm, by using CUDA device (GPU) to increase its speed up during the matching process.

: Recent years, many applications have exploited graph-based computations for searching massive data through distributed processors and memories. In this study, we present Breadth First Search algorithm as a graphbased algorithm to organize large DNA dataset and parallelize the algorithm using two highly tuned parallel approaches named OpenMP and MPI on a cluster, besides tuning the serial version of the algorithm. OpenMP is implemented using domain decomposition method. MPI is applied after dividing the dataset into equal parts and changing it to a two-dimensional array. Both approaches are tested in Khwarizmi cluster with 8 Intel Xeon Processors at the School of Computer Sciences in USM. The two aforementioned experiments are implemented and evaluated with certain characteristics and the results show high performance is achieved in terms of speedup and efficiency in comparison with the serial version of the algorithm

The string matching algorithms have broad applications in many areas of computer sciences. These areas include operating systems, information retrieval, editors, Internet searching engines, security applications and biological applications. Two important factors used to evaluate the performance of the sequential string matching algorithms are number of attempts and total number of character comparisons during the matching process. This research proposes to integrate the good properties of three single string matching algorithms, Quick-Search, Zuh-Takaoka and Horspool, to produce hybrid string matching algorithm called Maximum-Shift algorithm. Three datasets are used to test the proposed algorithm, which are, DNA, Protein sequence and English text. The hybrid algorithm, Maximum-Shift, shows efficient results compared to four string matching algorithms, Quick-Search, Horspool, Smith and Berry-Ravindran, in terms of the number of attempts and the total number of character comparisons.