Elsayed Badr

Prof. Elsayed Badr

Benha University - Faculty of computers and AI
orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2022 in Alexandria Engineering Journal
Verified
Journal Article
Open access
Elsayed BadrElsayed Badr
Elsayed Badr
SASultan Almotairi
Sultan Almotairi
MSMustafa Abdul Salam
Mustafa Abdul Salam
HAHagar Ahmed
Hagar Ahmed

7 June 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
Elsayed BadrElsayed Badr
Elsayed Badr
SASultan Almotairi
Sultan Almotairi
AGAbdallah El Ghamry
Abdallah El Ghamry
In this paper, we propose a novel blended algorithm that has the advantages of the trisection method and the false position method. Numerical results indicate that the proposed algorithm outperforms the secant, the trisection, the Newton–Raphson, the bisection and the regula falsi methods, as well as the hybrid of the last two methods proposed by Sabharwal, with regard to the number of iterations and the average running time.

20 June 2024 in Scientific Reports
Verified
Journal Article
Open access
PDF file
SASultan Almotairi
Sultan Almotairi
Elsayed BadrElsayed Badr
Elsayed Badr
IAIbrahim Abdelbaky
Ibrahim Abdelbaky
MEMohamed Elhakeem
Mohamed Elhakeem
MSMustafa Abdul Salam
Mustafa Abdul Salam
Hemolysis is a crucial factor in various biomedical and pharmaceutical contexts, driving our interest in developing advanced computational techniques for precise prediction. Our proposed approach takes advantage of the unique capabilities of convolutional neural networks (CNNs) and transformers to detect complex patterns inherent in the data. The integration of CNN and transformers' attention mechanisms allows for the extraction of relevant information, leading to accurate predictions of hemolytic potential. The proposed method was trained on three distinct data sets of peptide sequences known as recurrent neural network-hemolytic (RNN-Hem), Hlppredfuse, and Combined. Our computational results demonstrated the superior efficacy of our models compared to existing methods. The proposed approach demonstrated impressive Matthews correlation coefficients of 0.5962, 0.9111, and 0.7788 respectively, indicating its effectiveness in predicting hemolytic activity. With its potential to guide experimental efforts in peptide design and drug development, this method holds great promise for practical applications. Integrating CNNs and transformers proves to be a powerful tool in the fields of bioinformatics and therapeutic research, highlighting their potential to drive advancement in this area.

18 March 2019 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
Elsayed BadrElsayed Badr
Elsayed Badr
MMMahmoud I. Moussa
Mahmoud I. Moussa

4 September 2020 in IEEE Access
Verified
Journal Article
Open access
Elsayed BadrElsayed Badr
Elsayed Badr
SASultan Almotairi
Sultan Almotairi
AEAshraf Eirokh
Ashraf Eirokh
AAAtef Abdel-Hay
Atef Abdel-Hay
BABadr Almutairi
Badr Almutairi
A Radio mean labeling of a connected graph G is an injective function h from the vertex set, V(G), to the set of natural numbers N such that for any two distinct vertices x and y of G, ⌈(h(x)+h(y))/2⌉ ≥ diam + 1 - d(x,y). The radio mean number of h, rmn(h), is the maximum number assigned to any vertex of G. The radio mean number of G, rmn(G), is the minimum value of rmn(h), taken over all radio mean labeling h of G. This work has three contributions. The first one is proving two theorems which find the radio mean number for cycles and paths. The second contribution is proposing an approximate algorithm which finds an upper bound for radio mean number of a given graph. The third contribution is that we introduce a novel integer linear programing formulation for the radio mean problem. Finally, the experimental results analysis and statistical test proved that the Integer Linear Programming Model overcame the proposed approximate algorithm according to CPU time only. On the other hand, both the Integer Linear Programming Model and the proposed approximate algorithm had the same upper bound of the radio mean number of G.

9 July 2024 in Fractal and Fractional
Verified
Journal Article
Open access
PDF file
SASultan Almotairi
Sultan Almotairi
Elsayed BadrElsayed Badr
Elsayed Badr
MEmohamed Elsisy
mohamed Elsisy
FFF. A. Farahat
F. A. Farahat
MFMohamed Ali El sayed Fahim
Mohamed Ali El sayed Fahim
An investigation is conducted in this paper into a performance analysis of fully intuitionistic fuzzy multi-objective multi-item solid fractional transport model (FIF-MMSFTM). It is to be anticipated that the parameters of the conveyance model will be imprecise by virtue of numerous uncontrollable factors. The model under consideration incorporates intuitionistic fuzzy (IF) quantities of shipments, costs and profit coefficients, supplies, demands, and transport. The FIF-MMSFTM that has been devised is transformed into a linear form through a series of operations. The accuracy function and ordering relations of IF sets are then used to reduce the linearized model to a concise multi-objective multi-item solid transportation model (MMSTM). Furthermore, an examination is conducted on several theorems that illustrate the correlation between the FIF-MMSFTM and its corresponding crisp model, which is founded upon linear, hyperbolic, and parabolic membership functions. A numerical example was furnished to showcase the efficacy and feasibility of the suggested methodology. The numerical data acquired indicates that the linear, hyperbolic, and parabolic models require fewer computational resources to achieve the optimal solution. The parabolic model has the greatest number of iterations, in contrast to the hyperbolic model which has the fewest. Additionally, the elapsed run time for the three models is a negligible amount of time: 0.2, 0.15, and 1.37 s, respectively. In conclusion, suggestions for future research are provided.