This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori

After the success of the reforms Keynesian save the capitalist system from collapse and to apply the concepts of state intervention in economic activity in order to revive aggregate demand to achieve the purposes of macro-economic policies which draw their scope of economic (John Keynes) theory of effective demand, which created the new role of the state away from the classical concepts. Valley transmission role of the State of (State Guardian) to the process of state overlapping that increased and social functions have become responsible for raising the standard of living of classes with limited incomes, in particular, and the rest of the classes in general, through the expansion of the delivery of public servic

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

يعد التقطيع الصوري من الاهداف الرئيسة والضرورية في المعالجات الصورية للصور الرقمية، فهو يسعى الى تجزئة الصور المدروسة الى مناطق متعددة اكثر نفعاً تلخص فيها المناطق ذات الافادة لصور الاقمار الصناعية، وهي صور متعددة الاطياف ومجهزة من الاقمار الصناعية باستخدام مبدأ الاستشعار عن بعد والذي اصبح من المفاهيم المهمة التي تُعتمد تطبيقاته في اغلب ضروريات الحياة اليومية، وخاصة بعد التطورات المتسارعة التي شهد

Purpose: The present study seeks to examine various history stages in which undergone by the concept of scenarios, and development of this concept to integration with the strategic management practices:
Methodology: The current study relied on a literature review and approach in providing total picture of different stages undergone by this concept.
The main results: the scenarios did not reach maturity in their quest for integration with strategic management, and still need a great effort for the maturation of this thought in the framework of strategic management, and through it can contribute in creating important knowledge evolution.
Originality and value: providing a contemporary model linking the roots of this concept and cu

Maximizing the net present value (NPV) of oil field development is heavily dependent on optimizing well placement. The traditional approach entails the use of expert intuition to design well configurations and locations, followed by economic analysis and reservoir simulation to determine the most effective plan. However, this approach often proves inadequate due to the complexity and nonlinearity of reservoirs. In recent years, computational techniques have been developed to optimize well placement by defining decision variables (such as well coordinates), objective functions (such as NPV or cumulative oil production), and constraints. This paper presents a study on the use of genetic algorithms for well placement optimization, a ty

In this paper, a compact genetic algorithm (CGA) is enhanced by integrating its selection strategy with a steepest descent algorithm (SDA) as a local search method to give I-CGA-SDA. This system is an attempt to avoid the large CPU time and computational complexity of the standard genetic algorithm. Here, CGA dramatically reduces the number of bits required to store the population and has a faster convergence. Consequently, this integrated system is used to optimize the maximum likelihood function lnL(φ1, θ1) of the mixed model. Simulation results based on MSE were compared with those obtained from the SDA and showed that the hybrid genetic algorithm (HGA) and I-CGA-SDA can give a good estimator of (φ1, θ1) for the ARMA(1,1) model. Anot

Infection with cryptosporidiosis endangers the lives of many people with immunodeficiency, especially HIV patients. Nitazoxanide is one of the main therapeutic drugs used to treat cryptosporidiosis. However, it is poorly soluble in water, which restricts its usefulness and efficacy in immunocompromised patients. Surfactants have an amphiphilic character which indicates their ability to improve the water solubility of the hydrophobic drugs. Our research concerns the synthesis of new cationic Gemini surfactants that have the ability to improve the solubility of the drug Nanazoxide. So, we synthesized cationic Gemini surfactants. N1,N1,N3,N3-tetramethyl-N1,N3-bis(2-octadecanamidoethyl)propane-1,3-diaminium bromide (CGSPS18) and 2,2‘-(etha

In this paper, new concepts which are called: left derivations and generalized left derivations in nearrings have been defined. Furthermore, the commutativity of the 3-prime near-ring which involves some
algebraic identities on generalized left derivation has been studied.