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 definition for network lifetime in the IoT is to increase the period of cooperation between objects to carry out all the assigned tasks. The main contribution in this paper is to address the problem of task allocation in the IoT as an optimization problem with a lifetime-aware model. A genetic algorithm is proposed as a task allocation protocol. For the proposed algorithm, a problem-tailored individual representation and a modified uniform crossover are designed. Further, the individual initialization and perturbation operators (crossover and mutation) are designed so as to remedy the infeasibility of any solution located or reached by the proposed genetic algorithm. The results showed reasonable performance for the proposed genetic-based task allocation protocol. Further, the results prove the necessity for designing problem-specific operators instead of adopting the canonical counterparts.
In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons
... Show MoreMixture experiments are response variables based on the proportions of component for this mixture. In our research we will compare the scheffʼe model with the kronecker model for the mixture experiments, especially when the experimental area is restricted.
Because of the experience of the mixture of high correlation problem and the problem of multicollinearity between the explanatory variables, which has an effect on the calculation of the Fisher information matrix of the regression model.
to estimate the parameters of the mixture model, we used the (generalized inverse ) And the Stepwise Regression procedure
... Show MoreThe purpose of this study is to diagnose factors that effect Thi-Qar behavioral intention to use internet. A sample of (127) internet users of university staff was taken in the study and were analyzed by using path analyze . The study concluded that there is a set of affecting correlation. It was founded that exogenous variables (gender, income, perceived fun, perceived usefulness, Image, and ease of use) has significant effect on endogenous (behavioral intention) . The result of analysis indicated that image hopeful gained users comes first, ease of use secondly, perceived fan and perceived usefulness on (dependent variables (daily internet usage and diversity of internet usage. Implication of these result are discussed . the st
... Show MoreTwelve species from Brassicaceae family were studied using two different molecular techniques: RAPD and ISSR; both of these techniques were used to detect some molecular markers associated with the genotype identification. RAPD results, from using five random primers, revealed 241 amplified fragments, 62 of them were polymorphic (26%).
ISSR results showed that out of seven primers, three (ISSR3, UBC807, UBC811) could not amplify the genomic DNA; other primers revealed 183 amplified fragments, 36 of them were polymorphic (20%). The similarity evidence and dendrogram for the genetic distances of the incorporation between the two techniques showed that the highest similarity was 0.897 between the va
... Show MoreBackground: Hypothyroidism is the most abundant thyroid disorder worldwide. For decades, levothyroxine was the main effective pharmacological treatment for hypothyroidism. A variety of factors can influence levothyroxine dose, such as genetic variations. Studying the impact of genetic polymorphisms on the administration of medications was risen remarkably. Different genetic variations were investigated that might affect levothyroxine dose requirements, especially the deiodinase enzymes. Deiodinase type 2 genetic polymorphisms’ impact on levothyroxine dose was studied in different populations. Objective: To examine the association of the two single nucleotide polymorphism (SNP)s of deiodinase type 2 (rs225013 and rs225014) and le
... Show MoreBackground: Hypothyroidism is the most abundant thyroid disorder worldwide. For decades, levothyroxine was the main effective pharmacological treatment for hypothyroidism. A variety of factors can influence levothyroxine dose, such as genetic variations. Studying the impact of genetic polymorphisms on the administration of medications was risen remarkably. Different genetic variations were investigated that might affect levothyroxine dose requirements, especially the deiodinase enzymes. Deiodinase type 2 genetic polymorphisms’ impact on levothyroxine dose was studied in different populations.
Objective: To examine the association of the two single nucleotide polymorphism (SNP)s of deiodinase t
... Show Moreplanning is among the most significant in the field of robotics research. As it is linked to finding a safe and efficient route in a cluttered environment for wheeled mobile robots and is considered a significant prerequisite for any such mobile robot project to be a success. This paper proposes the optimal path planning of the wheeled mobile robot with collision avoidance by using an algorithm called grey wolf optimization (GWO) as a method for finding the shortest and safe. The research goals in this study for identify the best path while taking into account the effect of the number of obstacles and design parameters on performance for the algorithm to find the best path. The simulations are run in the MATLAB environment to test the
... Show MoreA new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever
... Show More