Preferred Language
Articles
/
bsj-2019
An Algorithm for nth Order Intgro-Differential Equations by Using Hermite Wavelets Functions
...Show More Authors

In this paper, the construction of Hermite wavelets functions and their operational matrix of integration is presented. The Hermite wavelets method is applied to solve nth order Volterra integro diferential equations (VIDE) by expanding the unknown functions, as series in terms of Hermite wavelets with unknown coefficients. Finally, two examples are given

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sun Jan 01 2023
Journal Name
Computers, Materials & Continua
An Optimal Algorithm for Resource Allocation in D2D Communication
...Show More Authors

View Publication
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Tue Dec 01 2020
Journal Name
Baghdad Science Journal
Approximate Numerical Solutions for Linear Volterra Integral Equations Using Touchard Polynomials
...Show More Authors

In this paper, Touchard polynomials (TPs) are presented for solving Linear Volterra integral equations of the second kind (LVIEs-2k) and the first kind (LVIEs-1k) besides, the singular kernel type of this equation. Illustrative examples show the efficiency of the presented method, and the approximate numerical (AN) solutions are compared with one another method in some examples. All calculations and graphs are performed by program MATLAB2018b.

View Publication Preview PDF
Scopus (5)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Thu May 05 2022
Journal Name
Periodicals Of Engineering And Natural Sciences (pen)
Classification SINGLE-LEAD ECG by using conventional neural network algorithm
...Show More Authors

View Publication
Scopus Crossref
Publication Date
Thu Jan 01 2015
Journal Name
Journal Of Al-mansoor College
An Improvement to Face Detection Algorithm for Non-Frontal Faces
...Show More Authors

Publication Date
Fri Apr 01 2022
Journal Name
Baghdad Science Journal
An Evolutionary Algorithm for Solving Academic Courses Timetable Scheduling Problem
...Show More Authors

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti

... Show More
View Publication Preview PDF
Scopus (10)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Sun Jul 01 2018
Journal Name
Computers & Mathematics With Applications
Analytical and numerical solutions for the nonlinear Burgers and advection–diffusion equations by using a semi-analytical iterative method
...Show More Authors

View Publication
Crossref (20)
Crossref
Publication Date
Tue May 05 2015
Journal Name
International Journal Of Advanced Scientific And Technical Research
Fuzzy Stochastic Probability of The Solution of Single Stationary Non- Homogeneous Linear Fuzzy Random Differential Equations
...Show More Authors

Publication Date
Mon Dec 01 2014
Journal Name
2014 Ieee Symposium On Differential Evolution (sde)
Comparative analysis of a modified differential evolution algorithm based on bacterial mutation scheme
...Show More Authors

A new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever

... Show More
View Publication
Scopus (3)
Crossref (2)
Scopus Crossref
Publication Date
Fri Aug 30 2024
Journal Name
Iraqi Journal Of Science
The Dissipation of the Kinetic Energy for 2D Bounded Flow by Using Moment-Based Boundary Conditions with Burnett Order Stress for LBM
...Show More Authors

     In this article, the lattice Boltzmann method with two relaxation time  (TRT)  for the  D2Q9 model is used to investigate numerical results for 2D flow. The problem is performed to show the dissipation of the kinetic energy rate and its relationship with the enstrophy growth for 2D dipole wall collision. The investigation is carried out for normal collision and oblique incidents at an angle of . We prove the accuracy of moment -based boundary conditions with slip and Navier-Maxwell slip conditions to simulate this flow. These conditions are under the effect of Burnett-order stress conditions that are consistent with the discrete Boltzmann equation. Stable results are found by using this kind of boundary condition where d

... Show More
Scopus Crossref
Publication Date
Sun Apr 01 2018
Journal Name
2018 9th International Conference On Information And Communication Systems (icics)
An intersection-based segment aware algorithm for geographic routing in VANETs
...Show More Authors

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

... Show More
View Publication
Scopus (4)
Crossref (2)
Scopus Crossref