Preferred Language
Articles
/
YRf-Q48BVTCNdQwCwWh8
Fast Hybrid String Matching Algorithm based on the Quick-Skip and Tuned Boyer-Moore Algorithms
...Show More Authors

Crossref
View Publication
Publication Date
Sat Sep 30 2023
Journal Name
Iraqi Journal Of Chemical And Petroleum Engineering
Petrophysical Analysis Based on Well Logging Data for Tight Carbonate Reservoir: The SADI Formation Case in Halfaya Oil Field
...Show More Authors

Carbonate reservoirs are an essential source of hydrocarbons worldwide, and their petrophysical properties play a crucial role in hydrocarbon production. Carbonate reservoirs' most critical petrophysical properties are porosity, permeability, and water saturation. A tight reservoir refers to a reservoir with low porosity and permeability, which means it is difficult for fluids to move from one side to another. This study's primary goal is to evaluate reservoir properties and lithological identification of the SADI Formation in the Halfaya oil field. It is considered one of Iraq's most significant oilfields, 35 km south of Amarah. The Sadi formation consists of four units: A, B1, B2, and B3. Sadi A was excluded as it was not filled with h

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Wed May 10 2023
Journal Name
Journal Of Engineering
A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem
...Show More Authors

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Mon Aug 01 2011
Journal Name
Journal Of Engineering
IMPLEMENTATION OF ROOT FINDING ALGORITHM OF MINIMUM PHASE FILTER USING VHDL
...Show More Authors

Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are

... Show More
View Publication Preview PDF
Crossref
Publication Date
Tue Sep 23 2025
Journal Name
Journal Of Plant Protection Research
Smart sprayer for weed control using an object detection algorithm (yolov5)
...Show More Authors

Spraying pesticides is one of the most common procedures that is conducted to control pests. However, excessive use of these chemicals inversely affects the surrounding environments including the soil, plants, animals, and the operator itself. Therefore, researchers have been encouraged to...

View Publication
Scopus Clarivate Crossref
Publication Date
Sun Dec 01 2019
Journal Name
Applied Soft Computing
A new evolutionary multi-objective community mining algorithm for signed networks
...Show More Authors

View Publication
Scopus (8)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Sun Jul 09 2023
Journal Name
Journal Of Engineering
MR Brain Image Segmentation Using Spatial Fuzzy C- Means Clustering Algorithm
...Show More Authors

conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation. 

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Sat Jun 01 2019
Journal Name
Journal Of Engineering And Applied Sciences
Enhancing LSB algorithm against brute-force attack using ASCII mapping technique
...Show More Authors

Publication Date
Fri May 05 2017
Journal Name
International Journal Of Science And Research (ijsr)
Automatic brain tumor segmentation from MRI images using region growing algorithm
...Show More Authors

LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2

View Publication
Publication Date
Tue Oct 01 2019
Journal Name
2019 International Conference On Electrical Engineering And Computer Science (icecos)
An Evolutionary Algorithm for Community Detection Using an Improved Mutation Operator
...Show More Authors

View Publication
Scopus (5)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Thu Feb 15 2024
Journal Name
Evolving Systems
Boosted Aquila Arithmetic Optimization Algorithm for multi-level thresholding image segmentation
...Show More Authors

View Publication
Scopus (10)
Crossref (6)
Scopus Clarivate Crossref