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

tock markets changed up and down during time. Some companies’ affect others due to dependency on each other . In this work, the network model of the stock market is discribed as a complete weighted graph. This paper aims to investigate the Iraqi stock markets using graph theory tools. The vertices of this graph correspond to the Iraqi markets companies, and the weights of the edges are set ulrametric distance of minimum spanning tree.

     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

In our research, we dealt with one of the most important issues of linguistic studies of the Holy Qur’an, which is the words that are close in meaning, which some believe are synonyms, but in the Arabic language they are not considered synonyms because there are subtle differences between them. Synonyms in the Arabic language are very few, rather rare, and in the Holy Qur’an they are completely non-existent. And how were these words, close in meaning, translated in the translation of the Holy Qur’an by Almir Kuliev into the Russian language.

The substantial key to initiate an explicit statistical formula for a physically specified continua is to consider a derivative expression, in order to identify the definitive configuration of the continua itself. Moreover, this statistical formula is to reflect the whole distribution of the formula of which the considered continua is the most likely to be dependent. However, a somewhat mathematically and physically tedious path to arrive at the required statistical formula is needed. The procedure in the present research is to establish, modify, and implement an optimized amalgamation between Airy stress function for elastically-deformed media and the multi-canonical joint probability density functions for multivariate distribution complet

The article states that the Russian verbs of destruction belong to the lexical-semantic group of physical impact. They include verbs with the meaning of “damage” and “destroy”. It is emphasized that each of these groups is relatively independent; the cut line between them is fuzzy and arbitrary. It is postulated that when the object is completely destroyed, then the verb has the meaning of “destruction”,  and when the object is partially destroyed, then the  verb has the meaning of “damage”. It is this feature that individualizes the meaning of verbs. The study distinguishes between the groups and the nature of the object as- animate / inanimate. The object of the action of the “destruction” can only be inan

      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