This research analyzes the level of the short circuit effect of the Iraqi super network and decides the suitable location for the High Voltage Direct Current (HVDC) connections in order to obtain the best short circuit reduction of the total currents of the buses in the network. The proposed method depends on choosing the transmission lines for Alternating current (AC) system that suffers from high Short Circuit Levels (SCLs) in order to reduce its impact on the transmission system and on the lines adjacent to it and this after replacing the alternating current (AC) line by direct current (DC) line. In this paper, Power System Simulator for Engineering (PSS/E) is used to model two types of HVDC lines in an effective regi

In this study, we review the ARIMA (p, d, q), the EWMA and the DLM (dynamic linear moodelling) procedures in brief in order to accomdate the ac(autocorrelation)  structure of data .We consider the recursive estimation and prediction algorithms based on Bayes and KF (Kalman filtering) techniques for correlated observations.We investigate the effect on the MSE of  these procedures and compare them using generated data.

Through recent years many researchers have developed methods to estimate the self-similarity and long memory parameter that is best known as the Hurst parameter. In this paper, we set a comparison between nine different methods. Most of them use the deviations slope to find an estimate for the Hurst parameter like Rescaled range (R/S), Aggregate Variance (AV), and Absolute moments (AM), and some depend on filtration technique like Discrete Variations (DV), Variance versus level using wavelets (VVL) and Second-order discrete derivative using wavelets (SODDW) were the comparison set by a simulation study to find the most efficient method through MASE. The results of simulation experiments were shown that the performance of the meth

Transport layer is responsible for delivering data to the appropriate application process on the host computers. The two most popular transport layer protocols are Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). TCP is considered one of the most important protocols in the Internet. UDP is a minimal message-oriented Transport Layer protocol. In this paper we have compared the performance of TCP and UDP on the wired network. Network Simulator (NS2) has been used for performance Comparison since it is preferred by the networking research community. Constant bit rate (CBR) traffic used for both TCP and UDP protocols.

            A spectrophotometric- reverse flow injection analysis (rFIA) method has been proposed for the   determination of Nitrazepam (NIT) in pure and pharmaceutical preparations. The method is based upon the coupling reaction of NIT with a new reagent O-Coumaric acid (OCA) in the presence of sodium periodate in an aqueous solution. The blue color product was measured at 632 nm. The variation (chemical and physical parameters) related with reverse flow system were estimated. The linearity was over the range 15 - 450 µg/mL of NIT with detection limits and limit of quantification of 3.425 and 11.417 µg mL^-1 NIT,respectively. The sample throughput of 28 samples

A new spectrophotometric method has been developed for the assay of olanzapine (OLN.) in pure and dosage forms. The method is based on the diazocoupling of (OLN.) with diazotized p-nitroaniline in alkaline medium to form a stable brown colored water-soluble azo dye with a maximum absorption at 405 nm.  The variables that affect the completion of reaction have been carefully optimized. Beer’s law is obeyed over the concentration range of (0.5-45.0 μg.mL^-1) with a molar absorptivity of 1.5777×10⁴ L.mol^-1.cm^-1.  The limit of detection was  0.3148  Î¼g.mL^-1 and  Sandell’s  sensitivity value was 0.0198 μg.cm^-2. The propose

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord