Specialized hardware implementations of Artificial Neural Networks (ANNs) can offer faster execution than general-purpose microprocessors by taking advantage of reusable modules, parallel processes and specialized computational components. Modern high-density Field Programmable Gate Arrays (FPGAs) offer the required flexibility and fast design-to-implementation time with the possibility of exploiting highly parallel computations like those required by ANNs in hardware. The bounded width of the data in FPGA ANNs will add an additional error to the result of the output. This paper derives the equations of the additional error value that generate from bounded width of the data and proposed a method to reduce the effect of the error to give

This study has dealt with, the issue of classification of rural road network , in addition to prepare a suggested for the classification for this network in Iraq , this classification account , the specifications and characteristics of rural roads, population, and the range taking of settlements , then this classification was applied on the rural road network in the Najaf province there are four categories of classification ,the first is major arterial rural roads divided into two major arterial and minor arterial roads , while the second category collected roads which was divided into minor arterial roads and main collected roads. The third category was represented by Local Roads , it has been divided into paved roads and unpaved, the f

Under-reamed piles defined by having one or more bulbs have the potential for sizeable major sides over conventional straight-sided piles, most of the studies on under-reamed piles have been conducted on the experimental side, while theoretical studies, such as the finite element method, have been mainly confined to conventional straight-sided piles. On the other hand, although several laboratory and experimental studies have been conducted to study the behavior of under-reamed piles, few numer­ical studies have been carried out to simulate the piles' performance. In addition, there is no research to compare and evaluate the behavior of these piles under dynamic loading. Therefore, this study aimed to numerically investigate bearing capaci

A three species food web model involving a stage structure and cannibalism in the top predator species is proposed and studied. It is assumed that the prey species growth logistically in the absence of predator and the predation process occurred according to theLotka-Volterra functional response. The existence, uniqueness and bounded-ness of the solution of the model are investigated. The local and global stability conditions of all possible equilibrium points are established.The persistence conditions of the model are also determined. The local bifurcation near each of the equilibrium points is analyzed. The global dynamics of the model is investigated numerically and compared with the obtained analytical results. It is observed that the p

Purpose: Despite the high clinical accuracy of dynamic navigation, inherent sources of error exist. The purpose of this study was to improve the accuracy of dynamic navigated surgical procedures in the edentulous maxilla by identifying the optimal configuration of intra-oral points that results in the lowest possible registration error for direct clinical implementation. Materials and methods: Six different 4-area configurations were tested by 3 operators against positive and negative controls (8-areas and 3-areas, respectively) using a skull model. The two dynamic navigation systems (X-Guide® and NaviDent®) and the two registration methods (bone surface tracing and fiducial markers) produced four registration groups. The accuracy of the

In this paper we describe several different training algorithms for feed forward neural networks(FFNN). In all of these algorithms we use the gradient of the performance function, energy function, to determine how to adjust the weights such that the performance function is minimized, where the back propagation algorithm has been used to increase the speed of training. The above algorithms have a variety of different computation and thus different type of form of search direction and storage requirements, however non of the above algorithms has a global properties which suited to all problems.