This article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f

High performance self-consolidating concrete HP-SCC is one of the most complex types of concrete which have the capacity to consolidated under its own weight, have excellent homogeneity and high durability. This study aims to focus on the possibility of using industrial by-products like Silica fumes SF in the preparation of HP-SCC enhanced with discrete steel fibers (DSF) and monofilament polypropylene fibers (PPF). From experimental results, it was found that using DSF with volume fraction of 0.50 %; a highly improvements were gained in the mechanical properties of HP-SCC. The compressive strength, splitting tensile strength, flexural strength and elastic modulus improved about 65.7 %, 70.5 %, 41.7 % and 80.3 % at 28 days age, respectively

    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.

This paper presents a linear fractional programming problem (LFPP) with rough interval coefficients (RICs) in the objective function. It shows that the LFPP with RICs in the objective function can be converted into a linear programming problem (LPP) with RICs by using the variable transformations. To solve this problem, we will make two LPP with interval coefficients (ICs). Next, those four LPPs can be constructed under these assumptions; the LPPs can be solved by the classical simplex method and used with MS Excel Solver. There is also argumentation about solving this type of linear fractional optimization programming problem. The derived theory can be applied to several numerical examples with its details, but we show only two examples

  In this paper, we introduce a new class of sets, namely , s*g--open sets and we show that the family of all s*g--open subsets of a topological space ) ,X(  from a topology on X which is finer than  . Also , we study the characterizations and basic properties of s*g-open sets and s*g--closed sets . Moreover, we use these sets to define and study a new class of functions, namely , s*g-  -continuous functions and s*g-  -irresolute functions in topological spaces . Some properties of these functions have been studied .

   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 aim of this paper is to introduce the concept of N  and Nβ -closed sets in terms of neutrosophic topological spaces. Some of its properties are also discussed.

A substantial matter to confidential messages' interchange through the internet is transmission of information safely. For example, digital products' consumers and producers are keen for knowing those products are genuine and must be distinguished from worthless products. Encryption's science can be defined as the technique to embed the data in an images file, audio or videos in a style which should be met the safety requirements. Steganography is a portion of data concealment science that aiming to be reached a coveted security scale in the interchange of private not clear commercial and military data. This research offers a novel technique for steganography based on hiding data inside the clusters that resulted from fuzzy clustering. T