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

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 the latest years there has been a profound evolution in computer science and technology, which incorporated several fields. Under this evolution, Content Base Image Retrieval (CBIR) is among the image processing field. There are several image retrieval methods that can easily extract feature as a result of the image retrieval methods’ progresses. To the researchers, finding resourceful image retrieval devices has therefore become an extensive area of concern. Image retrieval technique refers to a system used to search and retrieve images from digital images’ huge database. In this paper, the author focuses on recommendation of a fresh method for retrieving image. For multi presentation of image in Convolutional Neural Network (CNN),

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