1El-Sayed Badr received the B.Sc. (Mathematics) the M.Sc. (Pure Mathematics) degree from Benha University, Benha, Egypt in 1994, 2000 respectively. Also, he received Ph.D. ( Computer Science) degree from Department of Applied Informatics, Macedonia University, Thessaloniki, Greece, in 2006. He is a University associate Prof. of Computer Science with the Benha University, Faculty of Computer Science, Department of Scientific Computing. His current research is Parallel Programming, linear programming and Graph Theory.
Three contributions are proposed. Firstly, a novel hybrid classifier (HHO-SVM) is introduced, whi... more Three contributions are proposed. Firstly, a novel hybrid classifier (HHO-SVM) is introduced, which is a combination between the Harris hawks optimization (HHO) and a support vector machine (SVM) is introduced. Second, the performance of the HHO-SVM is enhanced using the conventional normalization method. The final contribution is to improve the efficiency of the HHO-SVM by adopting a parallel approach that employs the data distribution. The proposed models are evaluated using the Wisconsin Diagnosis Breast Cancer (WDBC) dataset. The results show that the HHO-SVM achieves a 98.24% accuracy rate with the normalization scaling technique, outperforming other related works. On the other hand, the HHO-SVM achieves a 99.47% accuracy rate with the equilibration scaling technique, which is better than other previous works. Finally, to compare the three effective scaling strategies on four CPU cores, the parallel version of the proposed model provides an acceleration of 3.97.
Efficient time complexities for partial ordered sets or posets are well-researched field. Hopcrof... more Efficient time complexities for partial ordered sets or posets are well-researched field. Hopcroft and Karp introduced an algorithm that solves the minimal chain decomposition in O (n2.5) time. Felsner et al. proposed an algorithm that reduces the time complexity to O (kn2) such that n is the number of elements of the poset and k is its width. The main goal of this paper is proposing an efficient algorithm to compute the width of a given partially ordered set P according to Dilworth’s theorem. It is an efficient and simple algorithm. The time complexity of this algorithm is O (kn), such that n is the number of elements of the partially ordered set P and k is the width of P. The computational results show that the proposed algorithm outperforms other related algorithms.
A radio mean square labeling of a connected graph is motivated by the channel assignment problem ... more A radio mean square labeling of a connected graph is motivated by the channel assignment problem for radio transmitters to avoid interference of signals sent by transmitters. It is an injective map h from the set of vertices of the graph G to the set of positive integers N , such that for any two distinct vertices x , y , the inequality d x , y +   h x 2 + h y 2 / 2   ≥ dim G + 1 holds. For a particular radio mean square labeling h , the maximum number of h v taken over all vertices of G is called its spam, denoted by rmsn h , and the minimum value of rmsn h taking over all radio mean square labeling h of G is called the radio mean square number of G , denoted by rmsn G . In this study, we investigate the radio mean square numbers rmsn P n and rmsn C n for path and cycle, respectively. Then, we present an approximate algorithm to determine rmsn G for graph G . Finally, a new mathematical model to find the upper bound of rmsn G for graph G is introduced. A comparison between the prop...
Three contributions are proposed. Firstly, a novel hybrid classifier (HHO-SVM) is introduced, whi... more Three contributions are proposed. Firstly, a novel hybrid classifier (HHO-SVM) is introduced, which is a combination between the Harris hawks optimization (HHO) and a support vector machine (SVM) is introduced. Second, the performance of the HHO-SVM is enhanced using the conventional normalization method. The final contribution is to improve the efficiency of the HHO-SVM by adopting a parallel approach that employs the data distribution. The proposed models are evaluated using the Wisconsin Diagnosis Breast Cancer (WDBC) dataset. The results show that the HHO-SVM achieves a 98.24% accuracy rate with the normalization scaling technique, outperforming other related works. On the other hand, the HHO-SVM achieves a 99.47% accuracy rate with the equilibration scaling technique, which is better than other previous works. Finally, to compare the three effective scaling strategies on four CPU cores, the parallel version of the proposed model provides an acceleration of 3.97.
Efficient time complexities for partial ordered sets or posets are well-researched field. Hopcrof... more Efficient time complexities for partial ordered sets or posets are well-researched field. Hopcroft and Karp introduced an algorithm that solves the minimal chain decomposition in O (n2.5) time. Felsner et al. proposed an algorithm that reduces the time complexity to O (kn2) such that n is the number of elements of the poset and k is its width. The main goal of this paper is proposing an efficient algorithm to compute the width of a given partially ordered set P according to Dilworth’s theorem. It is an efficient and simple algorithm. The time complexity of this algorithm is O (kn), such that n is the number of elements of the partially ordered set P and k is the width of P. The computational results show that the proposed algorithm outperforms other related algorithms.
A radio mean square labeling of a connected graph is motivated by the channel assignment problem ... more A radio mean square labeling of a connected graph is motivated by the channel assignment problem for radio transmitters to avoid interference of signals sent by transmitters. It is an injective map h from the set of vertices of the graph G to the set of positive integers N , such that for any two distinct vertices x , y , the inequality d x , y +   h x 2 + h y 2 / 2   ≥ dim G + 1 holds. For a particular radio mean square labeling h , the maximum number of h v taken over all vertices of G is called its spam, denoted by rmsn h , and the minimum value of rmsn h taking over all radio mean square labeling h of G is called the radio mean square number of G , denoted by rmsn G . In this study, we investigate the radio mean square numbers rmsn P n and rmsn C n for path and cycle, respectively. Then, we present an approximate algorithm to determine rmsn G for graph G . Finally, a new mathematical model to find the upper bound of rmsn G for graph G is introduced. A comparison between the prop...
Uploads