In this paper, three approximate methods namely the Bernoulli, the Bernstein, and the shifted Legendre polynomials operational matrices are presented to solve two important nonlinear ordinary differential equations that appeared in engineering and applied science. The Riccati and the Darcy-Brinkman-Forchheimer moment equations are solved and the approximate solutions are obtained. The methods are summarized by converting the nonlinear differential equations into a nonlinear system of algebraic equations that is solved using Mathematica®12. The efficiency of these methods was investigated by calculating the root mean square error (RMS) and the maximum error remainder (𝑀𝐸𝑅n) and it was found that the accuracy increases with increasi
... Show MoreOriginal Research Paper Mathematics 1-Introduction : In the light of the progress and rapid development of the applications of research in applications fields, the need to rely on scientific tools and cleaner for data processing has become a prominent role in the resolution of decisions in industrial and service institutions according to the real need of these methods to make them scientific methods to solve the problem Making decisions for the purpose of making the departments succeed in performing their planning and executive tasks. Therefore, we found it necessary to know the transport model in general and to use statistical methods to reach the optimal solution with the lowest possible costs in particular. And you know The Transportatio
... Show MoreExtended utilization of adaptive algorithms, Evaluative Algorithms (EAs), to address these issues offers a way to handle massive multi-objective optimization, even if the algorithmic method for handling combinations of objectives (CO) has been accessible for quite some time. Combining the idea of superiority with the Hypervolume (HV) tag approach, the GSA algorithm utilizes various target effects to explain several algorithms depending on the Hypervolume (HV) spacing. The Multi-objective Gravitational Search Algorithm with Hypervolume (MOGSA/HV). Since rapid convergence could result from GSA foundation work, Hypervolume rewrites the multi-objective problem (MOP) as a sequence of Tchebycheff solutions, improving it. Since the one in charge h
... Show MoreABSTRUCT
This research aims at examining the expected gap between the fact of planning and controlling process of production at the State Company for Electric Industries and implementation of material requirements planning system in fuzzy environment. Developing solutions to bridge the gap is required to provide specific mechanisms subject to the logic of fuzzy rules that will keep pace with demand for increased accuracy and reduced waiting times depending on demand forecast, investment in inventory to reduce costs to a minimum.
The proposed solutions for overcoming the research problem has required some questions reflecting the problem with its multiple dimensions, which ar
... Show MoreIn 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 canonic
... Show Morein this article, we present a definition of k-generalized map independent of non-expansive map and give infinite families of non-expansive and k-generalized maps new iterative algorithms. Such algorithms are also studied in the Hilbert spaces as the potential to exist for asymptotic common fixed point.
The rapid and enormous growth of the Internet of Things, as well as its widespread adoption, has resulted in the production of massive quantities of data that must be processed and sent to the cloud, but the delay in processing the data and the time it takes to send it to the cloud has resulted in the emergence of fog, a new generation of cloud in which the fog serves as an extension of cloud services at the edge of the network, reducing latency and traffic. The distribution of computational resources to minimize makespan and running costs is one of the disadvantages of fog computing. This paper provides a new approach for improving the task scheduling problem in a Cloud-Fog environme
String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co
... Show More