Preferred Language
Articles
/
UhfwN48BVTCNdQwCGWPE
A Genetic Algorithm for Task Allocation Problem in the Internet of Things
...Show More Authors

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonical definition for network lifetime in the IoT is to increase the period of cooperation between objects to carry out all the assigned tasks. The main contribution in this paper is to address the problem of task allocation in the IoT as an optimization problem with a lifetime-aware model. A genetic algorithm is proposed as a task allocation protocol. For the proposed algorithm, a problem-tailored individual representation and a modified uniform crossover are designed. Further, the individual initialization and perturbation operators (crossover and mutation) are designed so as to remedy the infeasibility of any solution located or reached by the proposed genetic algorithm. The results showed reasonable performance for the proposed genetic-based task allocation protocol. Further, the results prove the necessity for designing problem-specific operators instead of adopting the canonical counterparts.

Scopus Crossref
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
Three Weighted Residuals Methods for Solving the Nonlinear Thin Film Flow Problem
...Show More Authors
Abstract<p>In this paper, the methods of weighted residuals: Collocation Method (CM), Least Squares Method (LSM) and Galerkin Method (GM) are used to solve the thin film flow (TFF) equation. The weighted residual methods were implemented to get an approximate solution to the TFF equation. The accuracy of the obtained results is checked by calculating the maximum error remainder functions (MER). Moreover, the outcomes were examined in comparison with the 4<sup>th</sup>-order Runge-Kutta method (RK4) and good agreements have been achieved. All the evaluations have been successfully implemented by using the computer system Mathematica®10.</p>
View Publication
Crossref (1)
Crossref
Publication Date
Mon Jan 01 2018
Journal Name
Research Journal Of Pharmacy And Technology
Molecular Genetic variability in the D-loop region for females with Breast Cancer and the effect of the Chemotherapy
...Show More Authors

View Publication
Scopus (7)
Crossref (2)
Scopus Crossref
Publication Date
Sat Jan 01 2022
Journal Name
Aip Conference Proceedings
Appraisal of intelligent notification system for smart university campus based internet of objects for social activities
...Show More Authors

View Publication
Scopus (1)
Scopus Crossref
Publication Date
Tue Mar 01 2022
Journal Name
International Journal Of Early Childhood Special Education
The effect of cognitive trips via the Internet (web quest) accompanying practical lessons in learning some basic handball skills for female students
...Show More Authors

The effect of cognitive trips via the Internet (web quest) accompanying practical lessons in learning some basic handball skills for female students

View Publication
Publication Date
Fri Jan 01 2021
Journal Name
International Journal Of Innovation, Creativity And Change
The importance of using the World Wide Web (the Internet) for professors of Arabic Language Department at the University of Baghdad‏
...Show More Authors

Preview PDF
Publication Date
Tue Mar 01 2016
Journal Name
International Journal Of Engineering Research And Advanced Technology (ijerat)
Speeding Up Back-Propagation Learning (SUBPL) Algorithm: A New Modified Back_Propagation Algorithm
...Show More Authors

The convergence speed is the most important feature of Back-Propagation (BP) algorithm. A lot of improvements were proposed to this algorithm since its presentation, in order to speed up the convergence phase. In this paper, a new modified BP algorithm called Speeding up Back-Propagation Learning (SUBPL) algorithm is proposed and compared to the standard BP. Different data sets were implemented and experimented to verify the improvement in SUBPL.

View Publication
Publication Date
Tue Sep 08 2020
Journal Name
Baghdad Science Journal
A comparison among Different Methods for Estimating Regression Parameters with Autocorrelation Problem under Exponentially Distributed Error
...Show More Authors

Multiple linear regressions are concerned with studying and analyzing the relationship between the dependent variable and a set of explanatory variables. From this relationship the values of variables are predicted. In this paper the multiple linear regression model and three covariates were studied in the presence of the problem of auto-correlation of errors when the random error distributed the distribution of exponential. Three methods were compared (general least squares, M robust, and Laplace robust method). We have employed the simulation studies and calculated the statistical standard mean squares error with sample sizes (15, 30, 60, 100). Further we applied the best method on the real experiment data representing the varieties of

... Show More
View Publication Preview PDF
Scopus Clarivate Crossref
Publication Date
Mon Jun 19 2023
Journal Name
Journal Of Engineering
A Linear Programming Method Based Optimal Power Flow Problem for Iraqi Extra High Voltage Grid (EHV)
...Show More Authors

The objective of an Optimal Power Flow (OPF) algorithm is to find steady state operation point which minimizes generation cost, loss etc. while maintaining an acceptable system performance in terms of limits on generators real and reactive powers, line flow limits etc. The OPF solution includes an objective function. A common objective function concerns the active power generation cost. A Linear programming method is proposed to solve the OPF problem. The Linear Programming (LP) approach transforms the nonlinear optimization problem into an iterative algorithm that in each iteration solves a linear optimization problem resulting from linearization both the objective function and constrains. A computer program, written in MATLAB environme

... Show More
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Sun Apr 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
Solving a three dimensional transportation problem using linear programming
...Show More Authors

Transport is a problem and one of the most important mathematical methods that help in making the right decision for the transfer of goods from sources of supply to demand centers and the lowest possible costs, In this research, the mathematical model of the three-dimensional transport problem in which the transport of goods is not homogeneous was constructed. The simplex programming method was used to solve the problem of transporting the three food products (rice, oil, paste) from warehouses to the student areas in Baghdad, This model proved its efficiency in reducing the total transport costs of the three products. After the model was solved in (Winqsb) program, the results showed that the total cost of transportation is (269,

... Show More
View Publication Preview PDF
Crossref
Publication Date
Wed Sep 05 2007
Journal Name
Neural Network World
A canonical generic algorithm for likelihood estimator of first order moving average model parameter
...Show More Authors

The increasing availability of computing power in the past two decades has been use to develop new techniques for optimizing solution of estimation problem. Today's computational capacity and the widespread availability of computers have enabled development of new generation of intelligent computing techniques, such as our interest algorithm, this paper presents one of new class of stochastic search algorithm (known as Canonical Genetic' Algorithm ‘CGA’) for optimizing the maximum likelihood function strategy is composed of three main steps: recombination, mutation, and selection. The experimental design is based on simulating the CGA with different values of are compared with those of moment method. Based on MSE value obtained from bot

... Show More
Scopus (3)
Scopus