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

    Feature selection represents one of the critical processes in machine learning (ML). The fundamental aim of the problem of feature selection is to maintain performance accuracy while reducing the dimension of feature selection. Different approaches were created for classifying the datasets. In a range of optimization problems, swarming techniques produced better outcomes. At the same time, hybrid algorithms have gotten a lot of attention recently when it comes to solving optimization problems. As a result, this study provides a thorough assessment of the literature on feature selection problems using hybrid swarm algorithms that have been developed over time (2018-2021). Lastly, when compared with current feature selection procedu

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 ....

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

     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

      In this work, the notion is defined by using    and some properties of this set are studied also,  and   Ù€ set are two concepts that are defined by using ; many examples have been cited to indicate that the reverse of the propositions and remarks is not achieved. In addition, new application example of nano was studied.

The concept of closed quasi principally injective acts over monoids is introduced ,which signifies a generalization for the quasi principally injective as well as for the closed quasi injective acts. Characterization of this concept is intended to show the behavior of a closed quasi principally injective property. At the same time, some properties of closed quasi principally injective acts are examined in terms of their endomorphism monoid. Also, the characterization of a closed self-principally injective monoid is given in terms of its annihilator. The relationship between the following concepts is also studied; closed quasi principally injective acts over monoids, Hopfian, co Hopfian, and directly finite property. Ultimately, based on

Abstract

These experiments seek to investigate the effects of the fixed variations to the basic box plot on subjects' judgments of the box lengths. The study consists of two experiments, were constructed as an extension to the experiments carried out previously by Hussin, M.M. (1989, 2006).  Subjects were asked to judge what percentage the shorter represented of the longer length in pairs of box lengths and give an estimate of percentage, one being a standard plot and the other being of a different box length and also varying with respect to other elements such as, box width or whisker length. When he (1989) suggested in the future research points (1, 2), the changing length of the st

  Let L be a commutative ring with identity and let W be a unitary left L- module. A submodule D of an L- module W is called  s- closed submodule denoted by  D ≤sc W, if D has   no  proper s- essential extension in W, that is , whenever D ≤ W such that D ≤se H≤ W, then D = H. In  this  paper,  we study  modules which satisfies  the ascending chain  conditions (ACC) and descending chain conditions (DCC) on this kind of submodules.