Let A be a unital algebra, a Banach algebra module M is strongly fully stable Banach A-module relative to ideal K of A, if for every submodule N of M and for each multiplier θ : N → M such that θ(N) ⊆ N ∩ KM. In this paper, we adopt the concept of strongly fully stable Banach Algebra modules relative to an ideal which generalizes that of fully stable Banach Algebra modules and we study the properties and characterizations of strongly fully stable Banach A-module relative to ideal K of A.

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

Rare earth metal oxides (REMOs) have gained considerable attention in recent years owing to their distinctive properties and potential applications in electronic devices and catalysts. Particularly, cerium dioxide (CeO2), also known as ceria, has emerged as an interesting material in a wide variety of industrial, technological, and medical applications. Ceria can be synthesized with various morphologies, including rods, cubes, wires, tubes, and spheres. This comprehensive review offers valuable perceptions into the crystal structure, fundamental properties, and reaction mechanisms that govern the well-established surface-assisted reactions over ceria. The activity, selectivity, and stability of ceria, either as a stand-alone catalyst or as

Objective(s): To evaluate nurses’ Practice toward neonatal endotracheal suctioning procedure, and to determine the effectiveness of the interventional program on nurses’ practices, as well as to find out the relationship between nurses’ practice and their demographic characteristics.

Methodology: A Pre-experimental, one group design, was carried out to achieve the objectives of the current study using the evaluation approach and the implementation of the education program for the period from January 17 to June 31, 2022. A non- probability, purposive sample of (24) nurses were selected from the Neonatal Intensive Care Unit at Pediatric Teaching Hospital/ Medical City Department. A checklist w

      The present study deals with the strategies used in the Arabic translations of the most popular genres of children’s literature; namely fairy tales and fables as an attempt to identify the best methods and strategies to be adopted in translating these genres to fulfill the ultimate purpose of enriching the children’s knowledge in addition to attracting their interest and arousing the joy sought for in every piece of literature.

The study sets off from three dominating trends: the first calls for the adoption of domestication strategy of translation as the most appropriate and effective strategy in translation for children. In the same line, the second opposes using the foreignization strategy, w

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

     Evolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust E