Preferred Language
Articles
/
M-bvH5wBmraWrQ4d5kdk
Modified Optimization Algorithms for Infinite Integro-Differential Equations via Generalized Laguerre Polynomials
...Show More Authors

This study emphasizes the infinite-boundary integro-differential equation. To examine the approximate solution of the problem, two modified optimization algorithms are proposed based on generalized Laguerre functions. In the first technique, the proposed method is applied to the original problem by approximating the solution using the truncated generalized Laguerre polynomial of the unknown function, optimizing coefficients through error minimization, and transforming the integro-differential equation into an algebraic equation. In contrast, the second approach incorporates a penalty term into the objective function to effectively enforce boundary and integral constraints. This technique reduces the original problem to a mathematical optimization problem, making it easier to manage. The proposed methods are examined through various experiments, including numerical applications such as thermal, pharmacokinetic, oscillatory, aerodynamic, and ecological models, to demonstrate the validity, efficiency, and applicability of the techniques. Error analysis indicates that the approximation becomes more accurate as the number of generalized Laguerre basis functions increases.

Scopus Crossref
View Publication
Publication Date
Sun Dec 22 2024
Journal Name
Journal Of Petroleum Research And Studies
Optimizing Well Placement with Genetic Algorithms: A Case Study
...Show More Authors

Maximizing the net present value (NPV) of oil field development is heavily dependent on optimizing well placement. The traditional approach entails the use of expert intuition to design well configurations and locations, followed by economic analysis and reservoir simulation to determine the most effective plan. However, this approach often proves inadequate due to the complexity and nonlinearity of reservoirs. In recent years, computational techniques have been developed to optimize well placement by defining decision variables (such as well coordinates), objective functions (such as NPV or cumulative oil production), and constraints. This paper presents a study on the use of genetic algorithms for well placement optimization, a ty

... Show More
View Publication
Crossref
Publication Date
Thu May 01 2008
Journal Name
2008 International Conference On Computer And Communication Engineering
A binary Particle Swarm Optimization for attacking knapsacks Cipher Algorithm
...Show More Authors

View Publication
Scopus (11)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Thu Oct 01 2015
Journal Name
Engineering And Technology Journal
Genetic Based Optimization Models for Enhancing Multi- Document Text Summarization
...Show More Authors

View Publication
Crossref
Publication Date
Sat Jan 01 2022
Journal Name
Turkish Journal Of Physiotherapy And Rehabilitation
classification coco dataset using machine learning algorithms
...Show More Authors

In this paper, we used four classification methods to classify objects and compareamong these methods, these are K Nearest Neighbor's (KNN), Stochastic Gradient Descentlearning (SGD), Logistic Regression Algorithm(LR), and Multi-Layer Perceptron (MLP). Weused MCOCO dataset for classification and detection the objects, these dataset image wererandomly divided into training and testing datasets at a ratio of 7:3, respectively. In randomlyselect training and testing dataset images, converted the color images to the gray level, thenenhancement these gray images using the histogram equalization method, resize (20 x 20) fordataset image. Principal component analysis (PCA) was used for feature extraction, andfinally apply four classification metho

... Show More
Publication Date
Fri Aug 23 2024
Journal Name
Aro-the Scientific Journal Of Koya University
Graphical User Authentication Algorithms Based on Recognition
...Show More Authors

In cyber security, the most crucial subject in information security is user authentication. Robust text-based password methods may offer a certain level of protection. Strong passwords are hard to remember, though, so people who use them frequently write them on paper or store them in file for computer .Numerous of computer systems, networks, and Internet-based environments have experimented with using graphical authentication techniques for user authentication in recent years. The two main characteristics of all graphical passwords are their security and usability. Regretfully, none of these methods could adequately address both of these factors concurrently. The ISO usability standards and associated characteristics for graphical

... Show More
View Publication Preview PDF
Scopus Clarivate Crossref
Publication Date
Sat Jul 20 2024
Journal Name
Journal Of Interdisciplinary Mathematics
Analytical solutions via coupled Elzaki adomian decomposition method for some applications
...Show More Authors

An efficient combination of Adomian Decomposition iterative technique coupled Elzaki transformation (ETADM) for solving Telegraph equation and Riccati non-linear differential equation (RNDE) is introduced in a novel way to get an accurate analytical solution. An elegant combination of the Elzaki transform, the series expansion method, and the Adomian polynomial. The suggested method will convert differential equations into iterative algebraic equations, thus reducing processing and analytical work. The technique solves the problem of calculating the Adomian polynomials. The method’s efficiency was investigated using some numerical instances, and the findings demonstrate that it is easier to use than many other numerical procedures. It has

... Show More
Scopus (4)
Scopus
Publication Date
Mon Mar 01 2021
Journal Name
Journal Of Physics: Conference Series
Iterative Methods for Approximation of Fixed Points Via Like Contraction Mappings
...Show More Authors
Abstract<p>The aim of this paper, is to study different iteration algorithms types two steps called, modified SP, Ishikawa, Picard-S iteration and M-iteration, which is faster than of others by using like contraction mappings. On the other hand, the M-iteration is better than of modified SP, Ishikawa and Picard-S iterations. Also, we support our analytic proof with a numerical example.</p>
View Publication
Scopus (2)
Crossref (2)
Scopus Crossref
Publication Date
Fri Apr 26 2019
Journal Name
Journal Of Contemporary Medical Sciences
Breast Cancer Decisive Parameters for Iraqi Women via Data Mining Techniques
...Show More Authors

Objective This research investigates Breast Cancer real data for Iraqi women, these data are acquired manually from several Iraqi Hospitals of early detection for Breast Cancer. Data mining techniques are used to discover the hidden knowledge, unexpected patterns, and new rules from the dataset, which implies a large number of attributes. Methods Data mining techniques manipulate the redundant or simply irrelevant attributes to discover interesting patterns. However, the dataset is processed via Weka (The Waikato Environment for Knowledge Analysis) platform. The OneR technique is used as a machine learning classifier to evaluate the attribute worthy according to the class value. Results The evaluation is performed using

... Show More
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Fri Apr 01 2022
Journal Name
Baghdad Science Journal
Positive Definiteness of Symmetric Rank 1 (H-Version) Update for Unconstrained Optimization
...Show More Authors

Several attempts have been made to modify the quasi-Newton condition in order to obtain rapid convergence with complete properties (symmetric and positive definite) of the inverse of  Hessian matrix (second derivative of the objective function). There are many unconstrained optimization methods that do not generate positive definiteness of the inverse of Hessian matrix. One of those methods is the symmetric rank 1( H-version) update (SR1 update), where this update satisfies the quasi-Newton condition and the symmetric property of inverse of Hessian matrix, but does not preserve the positive definite property of the inverse of Hessian matrix where the initial inverse of Hessian matrix is positive definiteness. The positive definite prope

... Show More
View Publication Preview PDF
Scopus (9)
Crossref (7)
Scopus Clarivate Crossref
Publication Date
Wed Jul 20 2022
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
A new technique for solving fractional nonlinear equations by sumudu transform and adomian decomposition method
...Show More Authors

A novel technique Sumudu transform Adomian decomposition method (STADM), is employed to handle some kinds of nonlinear time-fractional equations. We demonstrate that this method finds the solution without discretization or restrictive assumptions. This method is efficient, simple to implement, and produces good results. The fractional derivative is described in the Caputo sense. The solutions are obtained using STADM, and the results show that the suggested technique is valid and applicable and provides a more refined convergent series solution. The MATLAB software carried out all the computations and graphics. Moreover, a graphical representation was made for the solution of some examples. For integer and fractional order problems, solutio

... Show More