In this study, we present a new steganography method depend on quantizing the perceptual color spaces bands. Four perceptual color spaces are used to test the new method which is HSL, HSV, Lab and Luv, where different algorithms to calculate the last two-color spaces are used. The results reveal the validity of this method as a steganoic method and analysis for the effects of quantization and stegano process on the quality of the cover image and the quality of the perceptual color spaces bands are presented.

In this paper, we define a new type of pairwise separation axioms called pairwise semi-p- separation axioms in bitopological spaces, also we study some properties of these spaces and relationships of each one with the ordinary separation axioms in the bitopological spaces.

  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 offer and study a novel type generalized soft-open sets in topological spaces, named soft Æ„c-open sets. Relationships of this set with other types of generalized soft-open sets are discussed, definitions of soft Æ„ , soft bc- closure and soft bc- interior are introduced, and its properties are investigated. Also, we introduce and explore several characterizations and properties of this type of sets.

In this paper, we procure the notions of neutrosophic simply b-open set, neutrosophic simply b-open cover, and neutrosophic simply b-compactness via neutrosophic topological spaces. Then, we establish some remarks, propositions, and theorems on neutrosophic simply

b-compactness. Further, we furnish some counter examples where the result fails.

Realizing the full potential of wireless sensor networks (WSNs) highlights many design issues, particularly the trade-offs concerning multiple conflicting improvements such as maximizing the route overlapping for efficient data aggregation and minimizing the total link cost. While the issues of data aggregation routing protocols and link cost function in a WSNs have been comprehensively considered in the literature, a trade-off improvement between these two has not yet been addressed. In this paper, a comprehensive weight for trade-off between different objectives has been employed, the so-called weighted data aggregation routing strategy (WDARS) which aims to maximize the overlap routes for efficient data aggregation and link cost

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise near compact and fibrewise locally near compact spaces, which are generalizations of well-known concepts near compact and locally near compact topological spaces. Moreover, we study relationships between fibrewise near compact (resp., fibrewise locally near compact) spaces and some fibrewise near separation axioms.

In 2010, Long and Zeng introduced a new generalization of the Bernstein polynomials that depends on a parameter  and called -Bernstein polynomials. After that, in 2018, Lain and Zhou studied the uniform convergence for these -polynomials and obtained a Voronovaskaja-type asymptotic formula in ordinary approximation. This paper studies the convergence theorem and gives two Voronovaskaja-type asymptotic formulas of the sequence of -Bernstein polynomials in both ordinary and simultaneous approximations. For this purpose, we discuss the possibility of finding the recurrence relations of the -th order moment for these polynomials and evaluate the values of -Bernstein for the functions ,  is a non-negative integer

In this paper an improved weighted 0-1 knapsack method (WKM) is proposed to optimize the resource allocation process when the sum of items' weight exceeds the knapsack total capacity .The improved method depends on a modified weight for each item to ensure the allocation of the required resources for all the involved items. The results of the improved WKM are compared to the traditional 0-1 Knapsack Problem (KP). The proposed method dominates on the other one in term of the total optimal solution value of the knapsack .