The best proximity point is a generalization of a fixed point that is beneficial when the contraction map is not a self-map. On other hand, best approximation theorems offer an approximate solution to the fixed point equation . It is used to solve the problem in order to come up with a good approximation. This paper's main purpose is to introduce new types of proximal contraction for nonself mappings in fuzzy normed space and then proved the best proximity point theorem for these mappings. At first, the definition of fuzzy normed space is given. Then the notions of the best proximity point and - proximal admissible in the context of fuzzy normed space are presented. The notion of α ̃–ψ ̃- proximal contractive mapping is introduced. After that, the best proximity point theorem for such type of mapping in a fuzzy normed space is state and prove. In addition, the idea of α ̃–ϕ ̃-proximal contractive mapping is presented in a fuzzy normed space and under specific conditions, the best proximity point theorem for such type of mappings is proved. Furthermore, some examples are offered to show the results' usefulness.
This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t
... Show MoreThis research has discussed the origins of ESP, addressed key notions about ESP and examined issues in ESP syllabus design. The content of the paper was determined by a need identified based on my experience as an ESL instructor designing and delivering the content-based language program - Language Preparation for the Cadets and Employment in the Iraqi College of Police . These issues, where possible, have been supported by current and pertinent academic literature. It is my sincerest hope that these observations will lend insight into the challenges facing the ESL instructor acting as ESP syllabus developer.
The purpose of this paper is to solve the stochastic demand for the unbalanced transport problem using heuristic algorithms to obtain the optimum solution, by minimizing the costs of transporting the gasoline product for the Oil Products Distribution Company of the Iraqi Ministry of Oil. The most important conclusions that were reached are the results prove the possibility of solving the random transportation problem when the demand is uncertain by the stochastic programming model. The most obvious finding to emerge from this work is that the genetic algorithm was able to address the problems of unbalanced transport, And the possibility of applying the model approved by the oil products distribution company in the Iraqi Ministry of Oil to m
... Show MoreThis study aimed at analyzing and studying the strategic and geopolitical importance of the Sahel region, which increased the regional competition for the resources of the region, especially the energy resources that have been and continue to be one of the axes of conflict and competition between these forces.
The researcher tried to review the competition between the international force, France, the United States of America, China, Algeria and Libya, and the African coast. We note that there is a positive correlation between the severity of the conflict and the intensity of the competition of the major powers to control the countries of the region and the extent of political and economic stability These countries are directly affecte
Let be an infinite dimensional separable complex Hilbert space and let , where is the Banach algebra of all bounded linear operators on . In this paper we prove the following results. If is a operator, then 1. is a hypercyclic operator if and only if D and for every hyperinvariant subspace of . 2. If is a pure, then is a countably hypercyclic operator if and only if and for every hyperinvariant subspace of . 3. has a bounded set with dense orbit if and only if for every hyperinvariant subspace of , .
