A Genetic Algorithm optimization model is used in this study to find the optimum flow values of the Tigris river branches near Ammara city, which their water is to be used for central marshes restoration after mixing in Maissan River. These tributaries are Al-Areed, AlBittera and Al-Majar Al-Kabeer Rivers. The aim of this model is to enhance the water quality in Maissan River, hence provide acceptable water quality for marsh restoration. The model is applied for different water quality change scenarios ,i.e. , 10%,20% increase in EC,TDS and BOD. The model output are the optimum flow values for the three rivers while, the input data are monthly flows(1994-2011),monthly water requirements and water quality parameters (EC, TDS, BOD, DO and pH).The objective function adopted in the optimization model is in a form the sum of difference in each of the 5 water quality parameters, resulting from the
mixing equation of the waters of the rivers, from the accepted limits of these parameters , weighted by a penalty factor assigned for each water quality parameter according to its importance. The adopted acceptable limits are 1500,1000, 6,4 and 7, while the penalty factors are 1,0.8,0.8,0.8,and 0.2 for EC,TDS,BOD,DO,and pH respectively. The constraints adopted on the decision variables which the monthly flows of the three rivers are those that provide the monthly demands downstream each river, and not exceed a maximum monthly flow
limits. The maximum flow limits adopted are for three flow cases, wet, average and dry years. For each flow case three scenarios for the monthly water quality parameters were adopted , the average values(scenario 1),the 10% increase in EC,TDS, and BOD (Scenario
2),and the 20% increase in these three water quality parameters (Scenario 3). Hence nine cases are adopted and for each an optimum monthly flows are found for each river. The genetic optimization model adopt a variable number of population of 100 to 1000 in a step of
100,0.8 and 0.2 cross over and mutation rates, and three iterations to reach the stable optimum solutions. The results indicates that the flow analysis shows a significant decrease in the flow values of the three rives after year 2000,hence, the flow values for the period of (1994-1999), are excluded and the only used values are those for (2000-2011). The estimated monthly demands exhibits low variation. The observed optimum monthly flow values decrease in general as the case flow changed from wet to normal and dry cases. The change in Scenarios from S1 to S2 and S3 , do not necessarily increase all the required optimum monthly flow values. The obtained minimum objective functions do not exhibits a certain trend with the change in the flow cases and/or the change in the scenarios.
LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2
Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing
... Show Moreconventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation.
Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding
... Show MoreIn this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons
... Show MoreRoot-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are