A model using the artificial neural networks and genetic algorithm technique is developed for obtaining optimum dimensions of the foundation length and protections of small hydraulic structures. The procedure involves optimizing an objective function comprising a weighted summation of the state variables. The decision variables considered in the optimization are the upstream and downstream cutoffs lengths and their angles of inclination, the foundation length, and the length of the downstream soil protection. These were obtained for a given maximum difference in head, depth of impervious layer and degree of anisotropy. The optimization carried out is subjected to constraints that ensure a safe structure against the uplift pressure force and sufficient protection length at the downstream side of the structure to overcome an excessive exit gradient. The Geo-studio software was used to analyze 1200 different cases. For each case the
length of protection (L) and volume of structure (V) required to satisfy the safety factors mentioned previously were estimated for the input values, namely, the upstream cutoff depth (S1), the downstream cutoff depth (S2), the foundation width (B), the angle of inclination of the upstream cutoff (Ɵ1) and the angle of inclination of the downstream cutoff (Ɵ2), H (differencehead), kr (degree of anisotropy) and D (depth of impervious layer). An ANN model was developed and verified using these cases input-output sets as its data base. A MatLAB code was written to perform a genetic algorithm optimization modeling coupled with this ANN model using a formulated optimization model. A sensitivity analysis was done for selecting the crossover probability, the mutation probability and level,
the number of population, the position of the crossover and the weights distribution for all the terms of the objective function. Results indicate
that the most factors that affects. the optimum solution is the $ number of population required. The minimum value that gives stable global optimum solution of this parameter is (30000) while other variables have little effect on the optimum solution.
The research shed light on the historic evolution of Baghdad through its long, expansive history. The starting point focuses on the geographic characteristics, and the nature of its habitation, prior to laying the circular plan of Baghdad. Then the research proceeds to cover the stage of building the round city of Baghdad. The research continue to cover the expansion and sequential growth across the banks of Tigris river.
A concentrated attention is devoted to analyses the morphological, geographical and above all the makeup of present day city of Baghdad, pinpointing the apathetic plans, decisions, and actions which completely disfigured the image, and tradition of the old city of Baghdad, behind the delusive slogans of “comprehens
(1)
The Taylor series is defined by the f and g series. The solution to the satellite's equation of motion is expanding to generate Taylor series through the coefficients f and g. In this study, the orbit equation in a perifocal system is solved using the Taylor series, which is based on time changing. A program in matlab is designed to apply the results for a geocentric satellite in low orbit (height from perigee, hp= 622 km). The input parameters were the initial distance from perigee, the initial time, eccentricity, true anomaly, position, and finally the velocity. The output parameters were the final distance from perigee and the final time values. The results of radial distance as opposed to time were plotted for dissimilar times in
... Show More
In this paper, we will present proposed enhance process of image compression by using RLE algorithm. This proposed yield to decrease the size of compressing image, but the original method used primarily for compressing a binary images [1].Which will yield increasing the size of an original image mostly when used for color images. The test of an enhanced algorithm is performed on sample consists of ten BMP 24-bit true color images, building an application by using visual basic 6.0 to show the size after and before compression process and computing the compression ratio for RLE and for the enhanced RLE algorithm.
(2)
In this paper, a method for hiding cipher text in an image file is introduced . The
proposed method is to hide the cipher text message in the frequency domain of the image.
This method contained two phases: the first is embedding phase and the second is extraction
phase. In the embedding phase the image is transformed from time domain to frequency
domain using discrete wavelet decomposition technique (Haar). The text message encrypted
using RSA algorithm; then Least Significant Bit (LSB) algorithm used to hide secret message
in high frequency. The proposed method is tested in different images and showed success in
hiding information according to the Peak Signal to Noise Ratio (PSNR) measure of the the
original ima
(11)
(7)
Root-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