Let  be an n-Banach space, M be a nonempty closed convex subset of , and S:M→M be a mapping that belongs to the class  mapping. The purpose of this paper is to study the stability and data dependence results of a Mann iteration scheme on n-Banach space

     In this work, new di-acid monomers 4, 4’-di-carboxillic-2”-chloro-4”- nitro triphenylamine (Di-CO2H-1), 4, 4’- di-carboxylic -2”,4”,6”-trichloro-triphenylamine (Di-CO2H-2) were synthesized by reaction of p-cyanobenzofluride with two aromatic amines (2-chloro 4-nitro aniline and 2,4,6-trichloro aniline by aromatic nucleophilc substitution method to produce two di cyano intermediates compounds 4, 4’-Dicyano-2”-chloro-4”- nitro triphenylamine (Di-CN1) and 4, 4’-dicyano-2”,4”,6”-trichloro-triphenylamine (Di-CN2) which form final di-carboxylic monomers after alkaline hydrolysis. Finally, these monomers react with two different arom

The cross section evaluation for (α,n) reaction was calculated according to the available International Atomic Energy Agency (IAEA) and other experimental published data . These cross section are the most recent data , while the well known international libraries like ENDF , JENDL , JEFF , etc.   We considered an energy range from threshold to 25 MeV in interval (1 MeV).   The average weighted cross sections for all available experimental and theoretical(JENDL) data and for all the considered isotopes was calculated . The cross section of the element is then calculated according to the cross sections of the isotopes of that element taking into account their abundance . A mathematical representative equation for eac

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord

The aim of this research is to prove the idea of maximum m_X-N-open set, m-N-extremally disconnected with respect to t and provide some definitions by utilizing the idea of m_X-N-open sets. Some properties of these sets are studied.

The subject of multi- ethnics is one of the most important subjects in the study of political
geography, as multi- ethnics and its consequent problems are global geopolitical phenomena
that started early and reached its peak with the beginning of the twentieth century, because of
major changes in the political landscape that resulted by wars and led to the collapse of many
empires and major powers, a matter which led to put new political maps according to certain
considerations of the colonial powers, especially in Africa and Asia. All these things led to
the most serious challenges based on ethnic and sectarian conflict and led to the development
of geopolitical problems. Among the examples what most countries in th

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

Nowad ays, with the development of internet communication that provides many facilities to the user leads in turn to growing unauthorized access. As a result, intrusion detection system (IDS) becomes necessary to provide a high level of security for huge amount of information transferred in the network to protect them from threats. One of the main challenges for IDS is the high dimensionality of the feature space and how the relevant features to distinguish the normal network traffic from attack network are selected. In this paper, multi-objective evolutionary algorithm with decomposition (MOEA/D) and MOEA/D with the injection of a proposed local search operator are adopted to solve the Multi-objective optimization (MOO) followed by Naï

Pathology reports are necessary for specialists to make an appropriate diagnosis of diseases in general and blood diseases in particular. Therefore, specialists check blood cells and other blood details. Thus, to diagnose a disease, specialists must analyze the factors of the patient’s blood and medical history. Generally, doctors have tended to use intelligent agents to help them with CBC analysis. However, these agents need analytical tools to extract the parameters (CBC parameters) employed in the prediction of the development of life-threatening bacteremia and offer prognostic data. Therefore, this paper proposes an enhancement to the Rabin–Karp algorithm and then mixes it with the fuzzy ratio to make this algorithm suitable