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

Assessment the actual accuracy of laboratory devices prior to first use is very important to know the capabilities of such devices and employ them in multiple domains. As the manual of the device provides information and values in laboratory conditions for the accuracy of these devices, thus the actual evaluation process is necessary.

In this paper, the accuracy of laser scanner (stonex X-300) cameras were evaluated, so that those cameras attached to the device and lead supporting role in it. This is particularly because the device manual did not contain sufficient information about those cameras.

To know the accuracy when using these cameras in close range photogrammetry, laser scanning (stonex X-300) de

In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la

In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonical de

     Evolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust EA wit

     This paper presents an efficient system using a deep learning algorithm that recognizes daily activities and investigates the worst falling cases to save elders during daily life. This system is a physical activity recognition system based on the Internet of Medical Things (IoMT) and uses convolutional neural networks (CNNets) that learn features and classifiers automatically. The test data include the elderly who live alone. The performance of CNNets is compared against that of state-of-the-art methods, such as activity windowing, fixed sample windowing, time-weighted windowing, mutual information windowing, dynamic windowing, fixed time windowing, sequence prediction algorithm, and conditional random fields. Th

This work aims to provide a statistical analysis of metal removal during the Magnetic Abrasive Finishing process (MAF) and find out the mathematical model which describes the relationship between the process parameters and metal removal, also estimate the impact of the parameters on metal removal. In this study, the single point incremental forming was used to form the truncated cone made of low carbon steel (1008-AISI) based on the Z-level tool path. Then the finishing was accomplished using a magnetic abrasive process based on the Box-Behnken design of the experiment using Minitab 17 software was used to finish the surface of the formed truncated cone. The influences of different parameters (feed rate, machining step s

    This paper is concerned with a Coupled Reaction-diffusion system defined in a ball with homogeneous Dirichlet boundary conditions. Firstly, we studied the blow-up set showing that, under some conditions, the blow-up in this problem occurs only at a single point. Secondly, under some restricted assumptions on the reaction terms, we established the upper (lower) blow-up rate estimates. Finally, we considered the Ignition system in general dimensional space as an application to our results.

      Detecting protein complexes in protein-protein interaction (PPI) networks is a challenging problem in computational biology. To uncover a PPI network into a complex structure, different meta-heuristic algorithms have been proposed in the literature. Unfortunately, many of such methods, including evolutionary algorithms (EAs), are based solely on the topological information of the network rather than on biological information. Despite the effectiveness of EAs over heuristic methods, more inherent biological properties of proteins are rarely investigated and exploited in these approaches. In this paper, we proposed an EA with a new mutation operator for complex detection problems. The proposed mutation operator is formulated und