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

A number of aqueous samples were collected from river Tigris in Baghdad city, enriched ~1000 times using solid phase extraction (SPE), then extracted the trace concentrations of some polychlorinated biphenyls (PCB) using an aqueous two-phase system (ATPS) composed of 1Methylpyridinium chloride [MePy]Cl and KH2PO4 salt. High performance liquid chromatography technique coupled with ultraviolet (HPLC-UV) is used for the quantification. Extraction under the optimized conditions of pH, solvent composition, duration and temperature has given with a yield of PCB about 91%. The limit of detection (LOD) and limit of quantification (LOQ) for analyses are 0.11-0.62 µg.L−1 and 2.67–3.43 µg.L−1 respectively with relative stan

The presented work includes the Homotopy Transforms of Analysis Method (HTAM). By this method, the approximate solution of nonlinear Navier- Stokes equations of fractional order derivative was obtained.  The Caputo's derivative was used in the proposed method. The desired solution was calculated by using the convergent power series to the components. The obtained results are demonstrated by comparison with the results of Adomain decomposition method, Homotopy Analysis method and exact solution, as explained in examples (4.1) and (4.2). The comparison shows that the used method is powerful and efficient.

This paper introduces the Multistep Modified Reduced Differential Transform Method (MMRDTM). It is applied to approximate the solution for Nonlinear Schrodinger Equations (NLSEs) of power law nonlinearity. The proposed method has some advantages. An analytical approximation can be generated in a fast converging series by applying the proposed approach. On top of that, the number of computed terms is also significantly reduced. Compared to the RDTM, the nonlinear term in this method is replaced by related Adomian polynomials prior to the implementation of a multistep approach. As a consequence, only a smaller number of NLSE computed terms are required in the attained approximation. Moreover, the approximation also converges rapidly over a

      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

The DEM (Digital elevation model) means that the topography of the earth's surface (such as; Terrain relief and ocean floors), can be described mathematically by elevations as functions of three positions either in geographical coordinates, (Lat. Long. System) or in rectangular coordinates systems (X, Y, Z). Therefore, a DEM is an array number that represents spatial distributions of terrain characteristics. In this paper, the contour lines with different interval of high-resolution digital elevation model (1m) for AL-khamisah, The Qar Government was obtained. The altitudes ranging is between 1 m – 8.5 m, so characterized by varying heights within a small spatial region because it represents in multiple spots with flat surfaces.

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s