In this paper, some commonly used hierarchical cluster techniques have been compared. A comparison was made between the agglomerative hierarchical clustering technique and the k-means technique, which includes the k-mean technique, the variant K-means technique, and the bisecting K-means, although the hierarchical cluster technique is considered to be one of the best clustering methods. It has a limited usage due to the time complexity. The results, which are calculated based on the analysis of the characteristics of the cluster algorithms and the nature of the data, showed that the bisecting K-means technique is the best compared to the rest of the other methods used.

     The rapid evolution of wireless networking technologies opens the door to the evolution of the Wireless Sensor Networks (WSNs) and their applications in different fields. The WSN consists of small energy sensor nodes used in a harsh environment. The energy needed to communicate between the sensors networks can be identified as one of the major challenges. It is essential to avoid massive loss, or loss of packets, as well as rapid energy depletion and grid injustice, which lead to lower node efficiency and higher packet delivery delays. For this purpose, it was very important to track the usage of energy by nodes in order to improve general network efficiency by the use of intelligent methods to reduce the energy

The limitations of wireless sensor nodes are power, computational capabilities, and memory. This paper suggests a method to reduce the power consumption by a sensor node. This work is based on the analogy of the routing problem to distribute an electrical field in a physical media with a given density of charges. From this analogy a set of partial differential equations (Poisson's equation) is obtained. A finite difference method is utilized to solve this set numerically. Then a parallel implementation is presented. The parallel implementation is based on domain decomposition, where the original calculation domain is decomposed into several blocks, each of which given to a processing element. All nodes then execute computations in parall

Regression analysis models are adopted by using SPSS program to predict the 28-day compressive strength as dependent variable and the accelerated compressive strength as independent variable. Three accelerated curing method was adopted, warm water (35ºC) and autogenous according to ASTM C C684-99 and the British method (55ºC) according to BS1881: Part 112:1983. The experimental concrete mix design was according to ACI 211.1. Twenty eight concrete mixes with slump rang (25-50) mm and (75-100)mm for rounded and crushed coarse aggregate with cement content (585, 512, 455, 410, 372 and 341)Kg/m³.

      The experimental results showed that the acc

The main objective of this work is to propose a new routing protocol for wireless sensor network employed to serve IoT systems. The routing protocol has to adapt with different requirements in order to enhance the performance of IoT applications. The link quality, node depth and energy are used as metrics to make routing decisions. Comparison with other protocols is essential to show the improvements achieved by this work, thus protocols designed to serve the same purpose such as AODV, REL and LABILE are chosen to compare the proposed routing protocol with. To add integrative and holistic, some of important features are added and tested such as actuating and mobility. These features are greatly required by some of IoT applications and im

A Mobile Ad hoc Network (MANET) is a collection of mobile nodes, that forms on the fly a temporary wireless multi-hop network in a self-organizing way, without relying on any established infrastructure. In MANET, a pair of nodes exchange messages either over a direct wireless link, or over a sequence of wireless links including one or more intermediate nodes. For this purpose, an efficient routing protocol is required. This paper introduced performance study of three of MANET protocols (AODV, GRP and OSPFv3). This study was one of the newer studies because wireless communication played an important role in today’s application and the field of mobile ad hoc network becomes very popular for the researchers in the last years. This study w

Support vector machine (SVM) is a popular supervised learning algorithm based on margin maximization. It has a high training cost and does not scale well to a large number of data points. We propose a multiresolution algorithm MRH-SVM that trains SVM on a hierarchical data aggregation structure, which also serves as a common data input to other learning algorithms. The proposed algorithm learns SVM models using high-level data aggregates and only visits data aggregates at more detailed levels where support vectors reside. In addition to performance improvements, the algorithm has advantages such as the ability to handle data streams and datasets with imbalanced classes. Experimental results show significant performance improvements in compa

    Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the proble