Realizing the full potential of wireless sensor networks (WSNs) highlights many design issues, particularly the trade-offs concerning multiple conflicting improvements such as maximizing the route overlapping for efficient data aggregation and minimizing the total link cost. While the issues of data aggregation routing protocols and link cost function in a WSNs have been comprehensively considered in the literature, a trade-off improvement between these two has not yet been addressed. In this paper, a comprehensive weight for trade-off between different objectives has been employed, the so-called weighted data aggregation routing strategy (WDARS) which aims to maximize the overlap routes for efficient data aggregation and link cost issues in cluster-based WSNs simultaneously. The proposed methodology is evaluated for energy consumption, network lifetime, throughput, and packet delivery ratio and compared with the InFRA and DRINA. These protocols are cluster-based routing protocols which only aim to maximize the overlap routes for efficient data aggregation. Analysis and simulation results revealed that the WDARS delivered a longer network lifetime with more proficient and reliable performance over other methods.
Average per capita GDP income is an important economic indicator. Economists use this term to determine the amount of progress or decline in the country's economy. It is also used to determine the order of countries and compare them with each other. Average per capita GDP income was first studied using the Time Series (Box Jenkins method), and the second is linear and non-linear regression; these methods are the most important and most commonly used statistical methods for forecasting because they are flexible and accurate in practice. The comparison is made to determine the best method between the two methods mentioned above using specific statistical criteria. The research found that the best approach is to build a model for predi
... Show MoreBased on the results of standard penetration tests (SPTs) conducted in Al-Basrah governorate, this research aims to present thematic maps and equations for estimating the bearing capacity of driven piles having several lengths. The work includes drilling 135 boreholes to a depth of 10 m below the existing ground level and three standard penetration tests (SPT) at depths of 1.5, 6, and 9.5 m were conducted in each borehole. MATLAB software and corrected SPT values were used to determine the bearing capacity of driven piles in Al-Basrah. Several-order interpolation polynomials are suggested to estimate the bearing capacity of driven piles, but the first-order polynomial is considered the most straightforward. Furthermore, the root means squar
... Show MoreThis research seeks to try to address one of the important issues in society that prevents the state from achieving its social, economic, political and financial goals, represented by the low tax proceeds, through which it can achieve those goals. What is reflected on the tax proceeds, knowing that the General Tax Authority does not take into account the issue of analyzing the opportunity cost of corporate capital as one of the profit indicators when setting the annual controls, which leads to a decrease in the tax proceeds, and therefore the research objective will be to shed light on the importance of adopting the concept of analysis The opportunity cost by the General Tax Authority to achieve a tax proceeds commensurate with t
... Show MoreThe first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o
... Show MoreThe first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o
... Show MoreThe tourism services provided in the hotel organizations are a set of material and moral elements that represent tourist attractions that are offered to the guests in order to satisfy their needs and desires are accommodation, food, drink and other facilities to reach the satisfaction and satisfaction of guests.Where these tourist services need a mechanism to ensure their quality by working to identify and calculate the costs of these services properly and accurately with the attempt to referendum and reduce the waste and loss to reduce these costs while providing the finest types of tourism services by calculating the cost of production and the administration seeks to reduce Non-essential activities through hotel activities that add val
... Show MoreA skip list data structure is really just a simulation of a binary search tree. Skip lists algorithm are simpler, faster and use less space. this data structure conceptually uses parallel sorted linked lists. Searching in a skip list is more difficult than searching in a regular sorted linked list. Because a skip list is a two dimensional data structure, it is implemented using a two dimensional network of nodes with four pointers. the implementation of the search, insert and delete operation taking a time of upto . The skip list could be modified to implement the order statistic operations of RANKand SEARCH BY RANK while maintaining the same expected time. Keywords:skip list , parallel linked list , randomized algorithm , rank.