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 environment, is developed to represent the proposed method. The adopted program is applied for the first time on Iraqi 24 bus Extra High Voltage (EHV) network (400 kV). The required are data taken from the operation and control office, which belongs to the ministry of electricity.
This study discussed a biased estimator of the Negative Binomial Regression model known as (Liu Estimator), This estimate was used to reduce variance and overcome the problem Multicollinearity between explanatory variables, Some estimates were used such as Ridge Regression and Maximum Likelihood Estimators, This research aims at the theoretical comparisons between the new estimator (Liu Estimator) and the estimators
Community detection is useful for better understanding the structure of complex networks. It aids in the extraction of the required information from such networks and has a vital role in different fields that range from healthcare to regional geography, economics, human interactions, and mobility. The method for detecting the structure of communities involves the partitioning of complex networks into groups of nodes, with extensive connections within community and sparse connections with other communities. In the literature, two main measures, namely the Modularity (Q) and Normalized Mutual Information (NMI) have been used for evaluating the validation and quality of the detected community structures. Although many optimization algo
... Show MoreIn this paper, Touchard polynomials (TPs) are presented for solving Linear Volterra integral equations of the second kind (LVIEs-2k) and the first kind (LVIEs-1k) besides, the singular kernel type of this equation. Illustrative examples show the efficiency of the presented method, and the approximate numerical (AN) solutions are compared with one another method in some examples. All calculations and graphs are performed by program MATLAB2018b.
In this paper new methods were presented based on technique of differences which is the difference- based modified jackknifed generalized ridge regression estimator(DMJGR) and difference-based generalized jackknifed ridge regression estimator(DGJR), in estimating the parameters of linear part of the partially linear model. As for the nonlinear part represented by the nonparametric function, it was estimated using Nadaraya Watson smoother. The partially linear model was compared using these proposed methods with other estimators based on differencing technique through the MSE comparison criterion in simulation study.
In recent decades, the identification of faces with and without masks from visual data, such as video and still images, has become a captivating research subject. This is primarily due to the global spread of the Corona pandemic, which has altered the appearance of the world and necessitated the use of masks as a vital measure for epidemic prevention. Intellectual development based on artificial intelligence and computers plays a decisive role in the issue of epidemic safety, as the topic of facial recognition and identifying individuals who wear masks or not was most prominent in the introduction and in-depth education. This research proposes the creation of an advanced system capable of accurately identifying faces, both with and
... Show MoreFinding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith
... Show More