Preferred Language
Articles
/
jih-475
Error Analysis in Numerical Algorithms
...Show More Authors

   In this paper, we applied the concept of the error analysis using the linearization method and new condition numbers constituting optimal bounds in appraisals of the possible errors. Evaluations of finite continued fractions, computations of determinates of tridiagonal systems, of determinates of second order and a "fast" complex multiplication. As in Horner's scheme, present rounding error analysis of product and summation algorithms. The error estimates are tested by numerical examples. The executed program for calculation is "MATLAB 7" from the website "Mathworks.com

View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Mar 08 2021
Journal Name
Baghdad Science Journal
B-splines Algorithms for Solving Fredholm Linear Integro-Differential Equations
...Show More Authors

Algorithms using the second order of B -splines [B (x)] and the third order of B -splines [B,3(x)] are derived to solve 1' , 2nd and 3rd linear Fredholm integro-differential equations (F1DEs). These new procedures have all the useful properties of B -spline function and can be used comparatively greater computational ease and efficiency.The results of these algorithms are compared with the cubic spline function.Two numerical examples are given for conciliated the results of this method.

View Publication Preview PDF
Publication Date
Fri Nov 20 2020
Journal Name
Solid State Technology
Comparative Study for Bi-Clustering Algorithms: Historical and Methodological Notes
...Show More Authors

View Publication
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
A New Hybrid Meta-Heuristics Algorithms to Solve APP Problems
...Show More Authors
Abstract<p>In this paper, a new hybrid algorithm for linear programming model based on Aggregate production planning problems is proposed. The new hybrid algorithm of a simulated annealing (SA) and particle swarm optimization (PSO) algorithms. PSO algorithm employed for a good balance between exploration and exploitation in SA in order to be effective and efficient (speed and quality) for solving linear programming model. Finding results show that the proposed approach is achieving within a reasonable computational time comparing with PSO and SA algorithms.</p>
View Publication
Scopus (5)
Crossref (4)
Scopus Crossref
Publication Date
Wed Mar 10 2021
Journal Name
Baghdad Science Journal
New algorithms to Enhanced Fused Images from Auto-Focus Images
...Show More Authors

Enhancing quality image fusion was proposed using new algorithms in auto-focus image fusion. The first algorithm is based on determining the standard deviation to combine two images. The second algorithm concentrates on the contrast at edge points and correlation method as the criteria parameter for the resulted image quality. This algorithm considers three blocks with different sizes at the homogenous region and moves it 10 pixels within the same homogenous region. These blocks examine the statistical properties of the block and decide automatically the next step. The resulted combined image is better in the contras

... Show More
View Publication Preview PDF
Scopus (6)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Thu Jul 25 2019
Journal Name
Advances In Intelligent Systems And Computing
Solving Game Theory Problems Using Linear Programming and Genetic Algorithms
...Show More Authors

View Publication
Scopus (15)
Crossref (10)
Scopus Crossref
Publication Date
Fri Jan 01 2021
Journal Name
Indonesian Journal Of Electrical Engineering And Computer Science
Stamps extraction using local adaptive k- means and ISODATA algorithms
...Show More Authors

<span>One of the main difficulties facing the certified documents documentary archiving system is checking the stamps system, but, that stamps may be contains complex background and surrounded by unwanted data. Therefore, the main objective of this paper is to isolate background and to remove noise that may be surrounded stamp. Our proposed method comprises of four phases, firstly, we apply k-means algorithm for clustering stamp image into a number of clusters and merged them using ISODATA algorithm. Secondly, we compute mean and standard deviation for each remaining cluster to isolate background cluster from stamp cluster. Thirdly, a region growing algorithm is applied to segment the image and then choosing the connected regi

... Show More
View Publication
Scopus (13)
Crossref (4)
Scopus Crossref
Publication Date
Sun Dec 06 2009
Journal Name
Baghdad Science Journal
Automatic Block Selection for Synthesizing Texture Images using Genetic Algorithms
...Show More Authors

Texture synthesis using genetic algorithms is one way; proposed in the previous research, to synthesis texture in a fast and easy way. In genetic texture synthesis algorithms ,the chromosome consist of random blocks selected manually by the user .However ,this method of selection is highly dependent on the experience of user .Hence, wrong selection of blocks will greatly affect the synthesized texture result. In this paper a new method is suggested for selecting the blocks automatically without the participation of user .The results show that this method of selection eliminates some blending caused from the previous manual method of selection.

View Publication Preview PDF
Crossref
Publication Date
Sat Mar 19 2022
Journal Name
Al-khwarizmi Engineering Journal
Enhancement of System Security by Using LSB and RSA Algorithms
...Show More Authors

A steganography hides information within other information, such as file, message, picture, or video. A cryptography is the science of converting the information from a readable form to an unreadable form for unauthorized person. The main problem in the stenographic system is embedding in cover-data without providing information that would facilitate its removal. In this research, a method for embedding data into images is suggested which employs least significant bit Steganography (LSB) and ciphering (RSA algorithm) to protect the data. System security will be enhanced by this collaboration between steganography and cryptography.

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Wed Apr 25 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Local Search Algorithms for Multi-criteria Single Machine Scheduling Problem
...Show More Authors

   Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.

We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑

... Show More
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Mon May 20 2019
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
An Improved Image Compression Technique Using EZW and SPHIT Algorithms
...Show More Authors

 Uncompressed form of the digital images are needed a very large storage capacity amount, as a consequence requires large communication bandwidth for data transmission over the network. Image compression techniques not only minimize the image storage space but also preserve the quality of image. This paper reveal image compression technique which uses distinct image coding scheme based on wavelet transform that combined effective types of compression algorithms for further compression. EZW and SPIHT algorithms are types of significant compression techniques that obtainable for lossy image compression algorithms. The EZW coding is a worthwhile and simple efficient algorithm. SPIHT is an most powerful technique that utilize for image

... Show More
View Publication Preview PDF
Crossref (2)
Crossref