In this paper, we derive and prove the stability bounds of the momentum coefficient µ and the learning rate ? of the back propagation updating rule in Artificial Neural Networks .The theoretical upper bound of learning rate ? is derived and its practical approximation is obtained
The Iraqi marshes are considered the most extensive wetland ecosystem in the Middle East and are located in the middle and lower basin of the Tigris and Euphrates Rivers which create a wetlands network and comprise some shallow freshwater lakes that seasonally swamped floodplains. Al-Hawizeh marsh is a major marsh located east of Tigris River south of Iraq. This study aims to assess water quality through water quality index (WQI) and predict Total Dissolved Solids (TDS) concentrations in Al-Hawizeh marsh based on artificial neural network (ANN). Results showed that the WQI was more than 300 for years 2013 and 2014 (Water is unsuitable for drinking) and decreased within the range 200-300 in years 2015 and 2016 (Very poor water). The develope
... Show MoreThe Iraqi marshes are considered the most extensive wetland ecosystem in the Middle East and are located in the middle and lower basin of the Tigris and Euphrates Rivers which create a wetlands network and comprise some shallow freshwater lakes that seasonally swamped floodplains. Al-Hawizeh marsh is a major marsh located east of Tigris River south of Iraq. This study aims to assess water quality through water quality index (WQI) and predict Total Dissolved Solids (TDS) concentrations in Al-Hawizeh marsh based on artificial neural network (ANN). Results showed that the WQI was more than 300 for years 2013 and 2014 (Water is unsuitable for drinking) and decreased within the range 200-300 in years 2015 and 2016 (Very poor water). The
... 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 MoreSoftware 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.
In digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. Th
... Show More