The issue of image captioning, which comprises automatic text generation to understand an image’s visual information, has become feasible with the developments in object recognition and image classification. Deep learning has received much interest from the scientific community and can be very useful in real-world applications. The proposed image captioning approach involves the use of Convolution Neural Network (CNN) pre-trained models combined with Long Short Term Memory (LSTM) to generate image captions. The process includes two stages. The first stage entails training the CNN-LSTM models using baseline hyper-parameters and the second stage encompasses training CNN-LSTM models by optimizing and adjusting the hyper-parameters of

   In this paper, we introduce new classes of sets called g *sD -sets , g *sD −α -sets , g *spreD − sets , g *sbD − -sets and g *sD −β -sets . Also, we study some of their properties and relations among them . Moreover, we use these sets to define and study some associative separation axioms .
 

     The primary purpose of this subject is to define new games in ideal spaces via set. The relationships between games that provided and the winning and losing strategy for any player were elucidated.

Complex-valued regular functions that are normalized in the open unit disk are vastly studied. The current study introduces a new fractional integrodifferential (non-linear) operator. Based on the pre-Schwarzian derivative, certain appropriate stipulations on the parameters included in this con-structed operator to be univalent and bounded are investigated and determined.

    The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X ,  ) be a topological space, and let  A ⊆,    then Ais called semi-preopen set if ⊆∘ .        In this paper, we study the properties of semi-preopen sets but by another  definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.

      The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X ,  ) be a topological space, and let  A ⊆,    then A is called semi-preopen set if ⊆∘ .        In this paper, we study the properties of semi-preopen sets but by another  definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.

Csaszar introduced the concept of generalized topological space and a new open set in a generalized topological space called -preopen in 2002 and 2005, respectively. Definitions of -preinterior and -preclosuer were given. Successively, several studies have appeared to give many generalizations for an open set. The object of our paper is to give a new type of generalization of an open set in a generalized topological space called -semi-p-open set. We present the definition of this set with its equivalent. We give definitions of -semi-p-interior and -semi-p-closure of a set and discuss their properties. Also the properties of -preinterior and -preclosuer are discussed. In addition, we give a new type of continuous function

Sustainable development (SD) is an improvement that meets present needs but jeopardizes the ability of new populations to do the same. It is vital to acquaint EFL students with the terminology and idiomatic expressions of this discipline. Nowadays, sustainable development and the environment have been prioritized in every aspect of life. Since culture and the teaching of Foreign language English cannot be separated, the English language becomes the mean of communication in health, economics, education, and politics. Thus, integrating sustainable development goals within language learning and teaching is very important. This descriptive quantitative study aims to investigate the perception of EFL pre-service teachers of sustainable develo

Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric