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 reliable computational methods (RCMs) based on the monomial stan-dard polynomials have been executed to solve the problem of Jeffery-Hamel flow (JHF). In addition, convenient base functions, namely Bernoulli, Euler and Laguerre polynomials, have been used to enhance the reliability of the computational methods. Using such functions turns the problem into a set of solvable nonlinear algebraic system that MathematicaⓇ12 can solve. The JHF problem has been solved with the help of Improved Reliable Computational Methods (I-RCMs), and a review of the methods has been given. Also, published facts are used to make comparisons. As further evidence of the accuracy and dependability of the proposed methods, the maximum error remainder
... Show MoreAbstract
The research aims to measure family negligence and its relationship with internet addiction among university students. The researcher has developed a scale of (20) items to measure the negligence of family, which was applied to (308) male and female university students in the first and fourth stages. The research concluded that University students suffer from family negligence. The research sample has an addiction to the Internet. There is a relationship between family neglect and addiction to the Internet among university students. The researcher came out with a number of suggestions and recommendations.
The financial statements must accurately, clearly and fairly present the financial situation and financial statements should be reliable as well. Pursuant to Board Decision No. (74) 2020, CBI obliges banks, according to the Banking Law No. (94) for the year 2004, Article (33) paragraph 2 concerning real estate owned from previous years and expropriated as a result debt settlement , to apply a real estate liquidation provision at a rate of 20% for each property expropriated and at a rate of 100% for each year of delay up to (5) years .also from the significance of the issue of real estates that become a property of banks as a result of debt settlement and the pr
... 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 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 MoreThe success of any media work in our contemporary life is based on proper planning. Television in Iraq is like any media outlet that adopts clear planning and programming in order to achieve the goals set in the news, entertainment, education. Iraq TV relies on four programming plans in one year (short term), but we often receive central instructions directly from the Minister of Information ordering to cancel the program plan and what was scheduled for broadcast to be finally replaced by alternative or emergency program associated with an incident, occasion or important news, these programs are all called (emergency programs).
In this present research we will be dealing with these programs as well as the extent of their impact o
... Show More