Preferred Language
Articles
/
joe-2056
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).

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Jan 13 2020
Journal Name
Day 3 Wed, January 15, 2020
Numerical Simulation of Gas Lift Optimization Using Genetic Algorithm for a Middle East Oil Field: Feasibility Study
...Show More Authors
<p>Gas-lift technique plays an important role in sustaining oil production, especially from a mature field when the reservoirs’ natural energy becomes insufficient. However, optimally allocation of the gas injection rate in a large field through its gas-lift network system towards maximization of oil production rate is a challenging task. The conventional gas-lift optimization problems may become inefficient and incapable of modelling the gas-lift optimization in a large network system with problems associated with multi-objective, multi-constrained, and limited gas injection rate. The key objective of this study is to assess the feasibility of utilizing the Genetic Algorithm (GA) technique to optimize t</p> ... Show More
View Publication
Scopus (15)
Crossref (8)
Scopus Crossref
Publication Date
Wed Feb 01 2023
Journal Name
Baghdad Science Journal
A Heuristic Approach to the Consecutive Ones Submatrix Problem
...Show More Authors

Given a matrix, the Consecutive Ones Submatrix (C1S) problem which aims to find the permutation of columns that maximizes the number of columns having together only one block of consecutive ones in each row is considered here. A heuristic approach will be suggested to solve the problem. Also, the Consecutive Blocks Minimization (CBM) problem which is related to the consecutive ones submatrix will be considered. The new procedure is proposed to improve the column insertion approach. Then real world and random matrices from the set covering problem will be evaluated and computational results will be highlighted.

View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Sun Jun 05 2022
Journal Name
Network
A Computationally Efficient Gradient Algorithm for Downlink Training Sequence Optimization in FDD Massive MIMO Systems
...Show More Authors

Future wireless networks will require advance physical-layer techniques to meet the requirements of Internet of Everything (IoE) applications and massive communication systems. To this end, a massive MIMO (m-MIMO) system is to date considered one of the key technologies for future wireless networks. This is due to the capability of m-MIMO to bring a significant improvement in the spectral efficiency and energy efficiency. However, designing an efficient downlink (DL) training sequence for fast channel state information (CSI) estimation, i.e., with limited coherence time, in a frequency division duplex (FDD) m-MIMO system when users exhibit different correlation patterns, i.e., span distinct channel covariance matrices, is to date ve

... Show More
View Publication
Scopus (3)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Computer And Communications
Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP
...Show More Authors

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Fri Dec 29 2017
Journal Name
Al-khwarizmi Engineering Journal
Design and Implementation of a Proposal Network Firewall
...Show More Authors

 

In today's world, most business, regardless of size, believe that access to Internet is imperative if they are going to complete effectively. Yet connecting a private computer (or a network) to the Internet can expose critical or confidential data to malicious attack from anywhere in the world since unprotected connections to the Internet (or any network topology) leaves the user computer vulnerable to hacker attacks and other Internet threats. Therefore, to provide high degree of protection to the network and network's user, Firewall need to be used.

Firewall provides a barrier between the user computer and the Internet (i.e. it prevents unauthor

... Show More
View Publication Preview PDF
Publication Date
Wed Feb 01 2023
Journal Name
Baghdad Science Journal
3-D Packing in Container using Teaching Learning Based Optimization Algorithm
...Show More Authors

The paper aims to propose Teaching Learning based Optimization (TLBO) algorithm to solve 3-D packing problem in containers. The objective which can be presented in a mathematical model is optimizing the space usage in a container. Besides the interaction effect between students and teacher, this algorithm also observes the learning process between students in the classroom which does not need any control parameters. Thus, TLBO provides the teachers phase and students phase as its main updating process to find the best solution. More precisely, to validate the algorithm effectiveness, it was implemented in three sample cases. There was small data which had 5 size-types of items with 12 units, medium data which had 10 size-types of items w

... Show More
View Publication Preview PDF
Scopus Clarivate Crossref
Publication Date
Sat Jul 20 2024
Journal Name
Journal Of Interdisciplinary Mathematics
Elzaki transform decomposition approach to solve Riccati matrix differential equations
...Show More Authors

Elzaki Transform Adomian decomposition technique (ETADM), which an elegant combine, has been employed in this work to solve non-linear Riccati matrix differential equations. Solutions are presented to demonstrate the relevance of the current approach. With the use of figures, the results of the proposed strategy are displayed and evaluated. It is demonstrated that the suggested approach is effective, dependable, and simple to apply to a range of related scientific and technical problems.

Scopus
Publication Date
Wed Jan 01 2025
Journal Name
Fusion: Practice And Applications
Enhanced EEG Signal Classification Using Machine Learning and Optimization Algorithm
...Show More Authors

This paper proposes a better solution for EEG-based brain language signals classification, it is using machine learning and optimization algorithms. This project aims to replace the brain signal classification for language processing tasks by achieving the higher accuracy and speed process. Features extraction is performed using a modified Discrete Wavelet Transform (DWT) in this study which increases the capability of capturing signal characteristics appropriately by decomposing EEG signals into significant frequency components. A Gray Wolf Optimization (GWO) algorithm method is applied to improve the results and select the optimal features which achieves more accurate results by selecting impactful features with maximum relevance

... Show More
View Publication
Scopus (1)
Scopus Crossref
Publication Date
Wed Jan 06 2021
Journal Name
Pierm
ULTRA-WIDEBAND FEATURING ENHANCED DELAY AND SUM ALGORITHM AND ORIENTED FOR DETECTING EARLY STAGE BREAST CANCER
...Show More Authors

Abstract—In this study, we present the experimental results of ultra-wideband (UWB) imaging oriented for detecting small malignant breast tumors at an early stage. The technique is based on radar sensing, whereby tissues are differentiated based on the dielectric contrast between the disease and its surrounding healthy tissues. The image reconstruction algorithm referred to herein as the enhanced version of delay and sum (EDAS) algorithm is used to identify the malignant tissue in a cluttered environment and noisy data. The methods and procedures are tested using MRI-derived breast phantoms, and the results are compared with images obtained from classical DAS variant. Incorporating a new filtering technique and multiplication procedure, t

... Show More
Publication Date
Wed Oct 17 2018
Journal Name
Journal Of Economics And Administrative Sciences
The use of the Principal components and Partial least squares methods to estimate the parameters of the logistic regression model in the case of linear multiplication problem
...Show More Authors

Abstract

  The logistic regression model is one of the nonlinear models that aims at obtaining highly efficient capabilities, It also the researcher an idea of the effect of the explanatory variable on the binary response variable.                                                                                  &nb

... Show More
View Publication Preview PDF
Crossref