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.
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 MoreMultiple 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 MoreSmart systems are the trend for modern organizations and should meet the quality of services that expect to produce. Internet of Everything (IoE) helped smart systems to adopt microcontrollers for improving the performance. Analyzing and controlling data in such a system are critical issues. In this study, a survey of IoE systems conducted to show how to apply a suitable model that meets such system requirements. The analysis of some microcontroller boards is explored based on known features. Factors for applying IoE devices have been defined such as connectivity, power consumption, compatibility, and cost. Different methods have been explained as an overview of applying IoE systems. Further, different approaches for applying IoE technology
... Show MoreTransport 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 MoreMost of the medical datasets suffer from missing data, due to the expense of some tests or human faults while recording these tests. This issue affects the performance of the machine learning models because the values of some features will be missing. Therefore, there is a need for a specific type of methods for imputing these missing data. In this research, the salp swarm algorithm (SSA) is used for generating and imputing the missing values in the pain in my ass (also known Pima) Indian diabetes disease (PIDD) dataset, the proposed algorithm is called (ISSA). The obtained results showed that the classification performance of three different classifiers which are support vector machine (SVM), K-nearest neighbour (KNN), and Naïve B
... Show MoreAn experiment was carried out in the fields of Agriculture College-Baghdad University during spring and autumn of 2015 by using a randomized complete blocks design with three replications. The first season hybridization was established among three pure cultivars of cowpea (Vigna uniguiculata L.) which: Ramshorn, California black eye and Rahawya in full diallel crosses according to Griffing with first method and fixed model (3 parents+ 3 diallel hybrids +3 reciprocal hybrids) and a comparison experiment was in autumn season. The result of statistical analysis showed that there was a significant difference among the parents and their hybrids for all the studied characters. The parent 1 was the higher for root nodules number , leaf number, pod
... Show MoreAbstract
This research presents a on-line cognitive tuning control algorithm for the nonlinear controller of path-tracking for dynamic wheeled mobile robot to stabilize and follow a continuous reference path with minimum tracking pose error. The goal of the proposed structure of a hybrid (Bees-PSO) algorithm is to find and tune the values of the control gains of the nonlinear (neural and back-stepping method) controllers as a simple on-line with fast tuning techniques in order to obtain the best torques actions of the wheels for the cart mobile robot from the proposed two controllers. Simulation results (Matlab Package 2012a) show that the nonlinear neural controller with hybrid Bees-PSO cognitive algorithm is m
... Show MoreA new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte
... Show MoreIn this article, the nonlinear problem of Jeffery-Hamel flow has been solved analytically and numerically by using reliable iterative and numerical methods. The approximate solutions obtained by using the Daftardar-Jafari method namely (DJM), Temimi-Ansari method namely (TAM) and Banach contraction method namely (BCM). The obtained solutions are discussed numerically, in comparison with other numerical solutions obtained from the fourth order Runge-Kutta (RK4), Euler and previous analytic methods available in literature. In addition, the convergence of the proposed methods is given based on the Banach fixed point theorem. The results reveal that the presented methods are reliable, effective and applicable to solve other nonlinear problems.
... Show MoreIn this paper, a computational method for solving optimal problem is presented, using indirect method (spectral methodtechnique) which is based on Boubaker polynomial. By this method the state and the adjoint variables are approximated by Boubaker polynomial with unknown coefficients, thus an optimal control problem is transformed to algebraic equations which can be solved easily, and then the numerical value of the performance index is obtained. Also the operational matrices of differentiation and integration have been deduced for the same polynomial to help solving the problems easier. A numerical example was given to show the applicability and efficiency of the method. Some characteristics of this polynomial which can be used for solvin
... Show More