Wireless sensor applications are susceptible to energy constraints. Most of the energy is consumed in communication between wireless nodes. Clustering and data aggregation are the two widely used strategies for reducing energy usage and increasing the lifetime of wireless sensor networks. In target tracking applications, large amount of redundant data is produced regularly. Hence, deployment of effective data aggregation schemes is vital to eliminate data redundancy. This work aims to conduct a comparative study of various research approaches that employ clustering techniques for efficiently aggregating data in target tracking applications as selection of an appropriate clustering algorithm may reflect positive results in the data aggregation process. In this paper, we have highlighted the gains of the existing schemes for node clustering based data aggregation along with a detailed discussion on their advantages and issues that may degrade the performance. Also, the boundary issues in each type of clustering technique have been analyzed. Simulation results reveal that the efficacy and validity of these clustering-based data aggregation algorithms are limited to specific sensing situations only, while failing to exhibit adaptive behavior in various other environmental conditions.
In this research, the effect of changing the flood level of Al-Shuwaija marsh was studied using the geographic information systems, specifically the QGIS program, and the STRM digital elevation model with a spatial analysis accuracy of 28 meters, was used to study the marsh. The hydraulic factors that characterize the marsh and affecting on the flooding such as the ranks of the water channels feeding the marsh and the degree of slope and flat areas in it are studied. The area of immersion water, the mean depth, and the accumulated water volume are calculated for each immersion level, thereby, this study finds the safe immersion level for this marsh was determined.
By driven the moment estimator of ARMA (1, 1) and by using the simulation some important notice are founded, From the more notice conclusions that the relation between the sign and moment estimator for ARMA (1, 1) model that is: when the sign is positive means the root gives invertible model and when the sign is negative means the root gives invertible model. An alternative method has been suggested for ARMA (0, 1) model can be suitable when
In this paper the definition of fuzzy normed space is recalled and its basic properties. Then the definition of fuzzy compact operator from fuzzy normed space into another fuzzy normed space is introduced after that the proof of an operator is fuzzy compact if and only if the image of any fuzzy bounded sequence contains a convergent subsequence is given. At this point the basic properties of the vector space FC(V,U)of all fuzzy compact linear operators are investigated such as when U is complete and the sequence ( ) of fuzzy compact operators converges to an operator T then T must be fuzzy compact. Furthermore we see that when T is a fuzzy compact operator and S is a fuzzy bounded operator then the composition TS and ST are fuzzy compact
... Show MoreIn this work, we study several features of the non-zero divisor graphs (ℵZD- graph) for the ring Zn of integer modulo n. For instance, the clique number, radius, girth, domination number, and the local clustering coefficient are determined. Furthermore, we present an algorithm that calculates the clique number and draws the non-zero divisor for the ring Zn.
Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall
... Show MoreThe cuneiform images need many processes in order to know their contents
and by using image enhancement to clarify the objects (symbols) founded in the
image. The Vector used for classifying the symbol called symbol structural vector
(SSV) it which is build from the information wedges in the symbol.
The experimental tests show insome numbersand various relevancy including
various drawings in online method. The results are high accuracy in this research,
and methods and algorithms programmed using a visual basic 6.0. In this research
more than one method was applied to extract information from the digital images
of cuneiform tablets, in order to identify most of signs of Sumerian cuneiform.