This paper is concerned with introducing and studying the new approximation operators based on a finite family of d. g. 'swhich are the core concept in this paper. In addition, we study generalization of some Pawlak's concepts and we offer generalize the definition of accuracy measure of approximations by using a finite family of d. g. 's.

Cyber security is a term utilized for describing a collection of technologies, procedures, and practices that try protecting an online environment of a user or an organization. For medical images among most important and delicate data kinds in computer systems, the medical reasons require that all patient data, including images, be encrypted before being transferred over computer networks by healthcare companies. This paper presents a new direction of the encryption method research by encrypting the image based on the domain of the feature extracted to generate a key for the encryption process. The encryption process is started by applying edges detection. After dividing the bits of the edge image into (3×3) windows, the diffusions

I noticed a researcher while working in the kindergarten that there is a group of
parameters resort to the use of different methods may be some undesirable and some
undesirable So felt researcher detection methods used parameters Riyadh in the face of the
pressures of life, being engaged in kindergarten eligibility, governmental or being married or
unmarried, as well as educational attainment for this parameter.
To achieve the objectives of the research: -
The researcher prepare a scale methods face the pressures of life of the parameters
have been confirmed the veracity of the paragraphs of the scale of the presentation to a group
of experts in this area, and extracted power discriminatory clauses scale and extra

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of cove

"In this article, "we introduce the concept of a WE-Prime submodule", as a stronger form of a weakly prime submodule". "And as a "generalization of WE-Prime submodule", we introduce the concept of WE-Semi-Prime submodule, which is also a stronger form of a weakly semi-prime submodule". "Various basic properties of these two concepts are discussed. Furthermore, the relationships between "WE-Prime submodules and weakly prime submodules" and studied". "On the other hand the relation between "WE-Prime submodules and WE-Semi-Prime submodules" are consider". "Also" the relation of "WE-Sime-Prime submodules and weakly semi-prime submodules" are explained. Behind that, some characterizations of these concepts are investigated".

        The Rivest–Shamir–Adleman (RSA) and the Diffie-Hellman (DH) key exchange are famous methods for encryption. These methods  depended on selecting the primes p and q in order  to be secure enough . This paper shows that the named methods used the primes which are found by some arithmetical function .In the other sense, no need to think about getting primes p and q and how they are secure enough, since the arithmetical function enable to build the primes in such complicated way to be secure. Moreover, this article   gives  new construction  of the  RSA  algorithm and DH key  exchange using the

primes p,qfrom areal number x.

   The current paper focuses on the studying the forms of (even-even) nuclei for the heavy elements with mass numbers in the range from (A=226 - 252) for  isotopes. This work will consist of studying deformation parameters  which is deduced from the "Reduced Electric Transition Probability" which is in its turn dependent on the first Excited State . The "Intrinsic Electric Quadrupole Moments" (non-spherical charge distribution)  were also calculated. In addition to that the Roots Mean Square Radii (Isotope Shift) are accounted for in order to compare them with the theoretical results.

The difference and variation in shapes of nuclei for the selected isotopes were detected using &