A novel median filter based on crow optimization algorithms (OMF) is suggested to reduce the random salt and pepper noise and improve the quality of the RGB-colored and gray images. The fundamental idea of the approach is that first, the crow optimization algorithm detects noise pixels, and that replacing them with an optimum median value depending on a criterion of maximization fitness function. Finally, the standard measure peak signal-to-noise ratio (PSNR), Structural Similarity, absolute square error and mean square error have been used to test the performance of suggested filters (original and improved median filter) used to removed noise from images. It achieves the simulation based on MATLAB R2019b and the resul

        In our research, we introduced new concepts, namely ^*and **-light mappings, after we knew ^*and **-totally disconnected mappings through the use of -open sets.

Many examples, facts, relationships and results have been given to support our work.

        In this paper, we introduce the notation of the soft bornological group to solve the problem of boundedness for the soft group. We combine soft set theory with bornology space to produce a new structure which is called    soft bornological group. So that both the product and inverse maps are soft bounded. As well as, we study the actions of the soft bornological group on the soft bornological sets. The aim soft bornological set is to partition into orbital classes by acting soft bornological group on the soft bornological set. In addition, we explain the centralizer, normalizer, and stabilizer in details. The main important results are to prove that the product of soft bornological groups is soft bornol

Studied red beetle life on each of the yen and wheat durum wheat, barley, corn, rice, chickpeas, ground peanuts and beans in Living situation constant temperature and relative humidity of 65% for a period of 66 days was the life cycle of the insect different from one substance to another ....

In this paper, new concepts which are called: left derivations and generalized left derivations in nearrings have been defined. Furthermore, the commutativity of the 3-prime near-ring which involves some
algebraic identities on generalized left derivation has been studied.

The continuous growth in technology and technological devices has led to the development of machines to help ease various human-related activities. For instance, irrespective of the importance of information on the Steam platform, buyers or players still get little information related to the application. This is not encouraging despite the importance of information in this current globalization era. Therefore, it is necessary to develop an attractive and interactive application that allows users to ask questions and get answers, such as a chatbot, which can be implemented on Discord social media. Artificial Intelligence is a technique that allows machines to think and be able to make their own decisions. This research showed that the dis

The revolution of multimedia has been a driving force behind fast and secured data transmission techniques. The security of image information from unapproved access is imperative. Encryptions technique is used to transfer data, where each kind of data has its own special elements; thus various methods should to be used to conserve distributing the image. This paper produces image encryption improvements based on proposed an approach to generate efficient intelligent session (mask keys) based on investigates from the combination between robust feature for ECC algebra and construction level in Greedy Randomized Adaptive Search Procedure (GRASP) to produce durable symmetric session mask keys consist of ECC points. Symmetric behavior for ECC

Our aim in this paper is to study the relationships between min-cs modules and some other known generalizations of cs-modules such as ECS-modules, P-extending modules and n-extending modules. Also we introduce and study the relationships between direct sum of mic-cs modules and mc-injectivity.

Let R be a commutative ring with identity 1 and M be a unitary left R-module. A submodule N of an R-module M is said to be pure relative to submodule T of M (Simply T-pure) if for each ideal A of R, N?AM=AN+T?(N?AM). In this paper, the properties of the following concepts were studied: Pure essential submodules relative to submodule T of M (Simply T-pure essential),Pure closed submodules relative to submodule T of M (Simply T-pure closed) and relative pure complement submodule relative to submodule T of M (Simply T-pure complement) and T-purely extending. We prove that; Let M be a T-purely extending module and let N be a T-pure submodule of M. If M has the T-PIP, then N is T-purely extending.

     The messages are ancient method to exchange information between peoples. It had many ways to send it with some security.

    Encryption and steganography was oldest ways to message security, but there are still many problems in key generation, key distribution, suitable cover image and others. In this paper we present proposed algorithm to exchange security message without any encryption, or image as cover to hidden. Our proposed algorithm depends on two copies of the same collection images set (CIS), one in sender side and other in receiver side which always exchange message between them.

      To send any message text the sender converts message to ASCII c