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.
Every so often, a confluence of novel technologies emerges that radically transforms every aspect of the industry, the global economy, and finally, the way we live. These sharp leaps of human ingenuity are known as industrial revolutions, and we are currently in the midst of the fourth such revolution, coined Industry 4.0 by the World Economic Forum. Building on their guideline set of technologies that encompass Industry 4.0, we present a full set of pillar technologies on which Industry 4.0 project portfolio management rests as well as the foundation technologies that support these pillars. A complete model of an Industry 4.0 factory which relies on these pillar technologies is presented. The full set of pillars encompasses cyberph
... Show MoreThis study proposed using color components as artificial intelligence (AI) input to predict milk moisture and fat contents. In this sense, an adaptive neuro‐fuzzy inference system (ANFIS) was applied to milk processed by moderate electrical field‐based non‐thermal (NP) and conventional pasteurization (CP). The differences between predicted and experimental data were not significant (
A resume is the first impression between you and a potential employer. Therefore, the importance of a resume can never be underestimated. Selecting the right candidates for a job within a company can be a daunting task for recruiters when they have to review hundreds of resumes. To reduce time and effort, we can use NLTK and Natural Language Processing (NLP) techniques to extract essential data from a resume. NLTK is a free, open source, community-driven project and the leading platform for building Python programs to work with human language data. To select the best resume according to the company’s requirements, an algorithm such as KNN is used. To be selected from hundreds of resumes, your resume must be one of the best. Theref
... Show MoreA complete metric space is a well-known concept. Kreyszig shows that every non-complete metric space can be developed into a complete metric space , referred to as completion of .
We use the b-Cauchy sequence to form which “is the set of all b-Cauchy sequences equivalence classes”. After that, we prove to be a 2-normed space. Then, we construct an isometric by defining the function from to ; thus and are isometric, where is the subset of composed of the equivalence classes that contains constant b-Cauchy sequences. Finally, we prove that is dense in , is complete and the uniqueness of is up to isometrics
Concealing the existence of secret hidden message inside a cover object is known as steganography, which is a powerful technique. We can provide a secret communication between sender and receiver using Steganography. In this paper, the main goal is for hiding secret message into the pixels using Least Significant Bit (LSB) of blue sector of the cover image. Therefore, the objective is by mapping technique presenting a model for hiding text in an image. In the model for proposing the secret message, convert text to binary also the covering (image) is divided into its three original colors, Red, Green and Blue (RGB) , use the Blue sector convert it to binary, hide two bits from the message in two bits of the least significant b
... Show MoreR. Vasuki [1] proved fixed point theorems for expansive mappings in Menger spaces. R. Gujetiya and et al [2] presented an extension of the main result of Vasuki, for four expansive mappings in Menger space. In this article, an important lemma is given to prove that the iteration sequence is Cauchy under suitable condition in Menger probabilistic G-metric space (shortly, MPGM-space). And then, used to obtain three common fixed point theorems for expansive type mappings.
In thisipaper, we introduce the concepts of the modified tupledicoincidence points and the mixed finiteimonotone property. Also the existenceiand uniquenessiof modified tupled coincidenceipoint is discusses without continuous condition for mappings having imixed finite monotoneiproperty in generalizedimetric spaces.
In this research, we introduce and study the concept of fibrewise bitopological spaces. We generalize some fundamental results from fibrewise topology into fibrewise bitopological space. We also introduce the concepts of fibrewise closed bitopological spaces,(resp., open, locally sliceable and locally sectionable). We state and prove several propositions concerning with these concepts. On the other hand, we extend separation axioms of ordinary bitopology into fibrewise setting. The separation axioms we extend are called fibrewise pairwise T_0 spaces, fibrewise pairwise T_1 spaces, fibrewise pairwise R_0 spaces, fibrewise pairwise Hausdorff spaces, fibrewise pairwise functionally Hausdorff spaces, fibrewise pairwise regular spaces, fibrewise
... Show MoreIn 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.
<p>In this paper, we prove there exists a coupled fixed point for a set- valued contraction mapping defined on X× X , where X is incomplete ordered G-metric. Also, we prove the existence of a unique fixed point for single valued mapping with respect to implicit condition defined on a complete G- metric.</p>