Preferred Language
Articles
/
kxZgl4cBVTCNdQwC2Ffm
Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm
...Show More Authors

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-hop basis based on the maximum distance toward the destination from the sender and sufficient communication lifetime, which guarantee the completion of the data transmission process. Moreover, communication overhead is minimized by finding the next hop and forwarding the packet directly to it without the need to discover the whole route first. A comparison is performed between MDORA and ad hoc on-demand distance vector (AODV) protocol in terms of throughput, packet delivery ratio, delay, and communication overhead. The outcome of the proposed algorithm is better than that of AODV.

Scopus Clarivate Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Jun 10 2024
Journal Name
Iraqi Journal For Computer Science And Mathematics
Solving tri-criteria: total completion time, total late work, and maximum earliness by using exact, and heuristic methods on single machine scheduling problem
...Show More Authors

The presented study investigated the scheduling regarding  jobs on a single machine. Each  job will be processed with no interruptions and becomes available for the processing at time 0. The aim is finding a processing order with regard to jobs, minimizing total completion time , total late work , and maximal tardiness  which is an NP-hard problem. In the theoretical part of the present work, the mathematical formula for the examined problem will be presented, and a sub-problem of the original problem of minimizing the multi-objective functions  is introduced. Also, then the importance regarding the dominance rule (DR) that could be applied to the problem to improve good solutions will be shown. While in the practical part, two

... Show More
View Publication
Scopus (1)
Scopus Crossref
Publication Date
Sun Jun 01 2014
Journal Name
Baghdad Science Journal
Classification of fetal abnormalities based on CTG signal
...Show More Authors

The fetal heart rate (FHR) signal processing based on Artificial Neural Networks (ANN),Fuzzy Logic (FL) and frequency domain Discrete Wavelet Transform(DWT) were analysis in order to perform automatic analysis using personal computers. Cardiotocography (CTG) is a primary biophysical method of fetal monitoring. The assessment of the printed CTG traces was based on the visual analysis of patterns that describing the variability of fetal heart rate signal. Fetal heart rate data of pregnant women with pregnancy between 38 and 40 weeks of gestation were studied. The first stage in the system was to convert the cardiotocograghy (CTG) tracing in to digital series so that the system can be analyzed ,while the second stage ,the FHR time series was t

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Apr 23 2017
Journal Name
International Conference Of Reliable Information And Communication Technology
Classification of Arabic Writer Based on Clustering Techniques
...Show More Authors

Arabic text categorization for pattern recognitions is challenging. We propose for the first time a novel holistic method based on clustering for classifying Arabic writer. The categorization is accomplished stage-wise. Firstly, these document images are sectioned into lines, words, and characters. Secondly, their structural and statistical features are obtained from sectioned portions. Thirdly, F-Measure is used to evaluate the performance of the extracted features and their combination in different linkage methods for each distance measures and different numbers of groups. Finally, experiments are conducted on the standard KHATT dataset of Arabic handwritten text comprised of varying samples from 1000 writers. The results in the generatio

... Show More
Scopus (6)
Scopus
Publication Date
Sat Jan 20 2024
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Solving the Multi-criteria, Total Completion Time, Total Earliness Time, and Maximum Tardiness Problem
...Show More Authors

Machine scheduling problems (MSP) are     considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as  are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutio

... Show More
View Publication Preview PDF
Crossref
Publication Date
Mon May 01 2023
Journal Name
Periodicals Of Engineering And Natural Sciences
Solving the multi-criteria: total completion time, total late work, and maximum earliness problem
...Show More Authors

Within this research, The problem of scheduling jobs on a single machine is the subject of study to minimize the multi-criteria and multi-objective functions. The first problem, minimizing the multi-criteria, which include Total Completion Time, Total Late Work, and Maximum Earliness Time (∑𝐶𝑗, ∑𝑉𝑗, 𝐸𝑚𝑎𝑥), and the second problem, minimizing the multi-objective functions ∑𝐶𝑗 + ∑𝑉𝑗 +𝐸𝑚𝑎𝑥 are the problems at hand in this paper. In this study, a mathematical model is created to address the research problems, and some rules provide efficient (optimal) solutions to these problems. It has also been proven that each optimal solution for ∑𝐶𝑗 + ∑𝑉𝑗 + 𝐸𝑚𝑎𝑥 is an effic

... Show More
View Publication
Scopus (4)
Crossref (1)
Scopus Crossref
Publication Date
Sat Jan 01 2011
Journal Name
International Journal Of Computer Theory And Engineering
MIPOG - An Efficient t-Way Minimization Strategy for Combinatorial Testing
...Show More Authors

View Publication
Crossref (16)
Crossref
Publication Date
Fri Jan 01 2010
Journal Name
International Journal Of Advanced Intelligence Paradigms
Assessing IRPS as an efficient pairwise test data generation strategy
...Show More Authors

View Publication
Scopus (10)
Crossref (9)
Scopus Crossref
Publication Date
Sun Nov 01 2020
Journal Name
International Journal Of Nonlinear Analysis And Applications
Two Efficient Methods For Solving Non-linear Fourth-Order PDEs
...Show More Authors

This paper studies a novel technique based on the use of two effective methods like modified Laplace- variational method (MLVIM) and a new Variational method (MVIM)to solve PDEs with variable coefficients. The current modification for the (MLVIM) is based on coupling of the Variational method (VIM) and Laplace- method (LT). In our proposal there is no need to calculate Lagrange multiplier. We applied Laplace method to the problem .Furthermore, the nonlinear terms for this problem is solved using homotopy method (HPM). Some examples are taken to compare results between two methods and to verify the reliability of our present methods.

Scopus (9)
Scopus
Publication Date
Fri Jan 01 2016
Journal Name
Results In Physics
An efficient iterative method for solving the Fokker–Planck equation
...Show More Authors

View Publication
Crossref (8)
Crossref
Publication Date
Tue Feb 01 2022
Journal Name
Webology
Efficient Eye Recognition for Secure Systems using Convolutional Neural Network
...Show More Authors

Preview PDF