The confirming of security and confidentiality of multimedia data is a serious challenge through the growing dependence on digital communication. This paper offers a new image cryptography based on the Chebyshev chaos polynomials map, via employing the randomness characteristic of chaos concept to improve security. The suggested method includes block shuffling, dynamic offset chaos key production, inter-layer XOR, and block 90 degree rotations to disorder the correlations intrinsic in image. The method is aimed for efficiency and scalability, accomplishing  complexity order for n-pixels over specific cipher rounds. The experiment outcomes depict great resistant to cryptanalysis attacks, containing statistical, differential and brut

A submoduleA of amodule M is said to be strongly pure , if for each finite subset {ai} in A , (equivalently, for each a ?A) there exists ahomomorphism f : M ?A such that f(ai) = ai, ?i(f(a)=a).A module M is said to be strongly F–regular if each submodule of M is strongly pure .The main purpose of this paper is to develop the properties of strongly F–regular modules and study modules with the property that the intersection of any two strongly pure submodules is strongly pure .

   Hiding secret information in the image is a challenging and painstaking task in computer security and steganography system. Certainly, the absolute intricacy of attacks to security system makes it more attractive.in this research on steganography system involving information hiding,Huffman codding used to compress the secret code before embedding which provide high capacity and some security. Fibonacci decomposition used to represent the pixels in the cover image, which increase the robustness of the system. One byte used for mapping all the pixels properties. This makes the PSNR of the system higher due to random distribution of embedded bits. Finally, three kinds of evaluation are applied such as PSNR, chi-square attack, a

New data on jumping spiders (Salticidae) and tangle-web spiders (Theridiidae) of Armenia are provided on the basis of recently collected specimens in various regions of Armenia. One species, Ballus rufipes (Simon, 1868) is recorded as new to the Caucasus Region, in addition to the following species: Neon reticulatus (Blackwall, 1853), Pellenes brevis (Simon, 1868), Salticus scenicus (Clerck, 1757) and Synageles dalmaticus (Keyserling, 1863) that belong to a family Salticidae, are recorded in Armenia for the first time.
A further 7 species of Theridiidae are recorded in Armenia for the first time Kochiura aulica (C. L. Koch, 1838), Steatoda albomaculata (De Geer, 1778), Steatoda bipunctata (Linnaeus, 1758), Steatoda castanea Clerk, 175

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise Lindelöf and locally Lindelöf topological spaces, which are generalizations of will-known concepts: Lindelöf topological space (1) "A topological space X is called a Lindelöf space if for every open cover of X has a countable subcover" and locally Lindelöf topological space (1) "A topological space X is called a locally Lindelöf space if for every point x in X, there exist a nbd U of x such that the closure of U in X is Lindelöf space". Either the new concepts are: "A fibrewise topological space X over B is called a fibrewise Lindelöf if the projection function p : X→B is Lindelöf" and "The fibrewise topological space X over B

To achieve safe security to transfer data from the sender to receiver, cryptography is one way that is used for such purposes. However, to increase the level of data security, DNA as a new term was introduced to cryptography. The DNA can be easily used to store and transfer the data, and it becomes an effective procedure for such aims and used to implement the computation. A new cryptography system is proposed, consisting of two phases: the encryption phase and the decryption phase. The encryption phase includes six steps, starting by converting plaintext to their equivalent ASCII values and converting them to binary values. After that, the binary values are converted to DNA characters and then converted to their equivalent complementary DN

SM ADAI, BN RASHID, Journal of Current Researches on Social Sciences, 2023

<p>In this paper, a simple color image compression system has been proposed using image signal decomposition. Where, the RGB image color band is converted to the less correlated YUV color model and the pixel value (magnitude) in each band is decomposed into 2-values; most and least significant. According to the importance of the most significant value (MSV) that influenced by any simply modification happened, an adaptive lossless image compression system is proposed using bit plane (BP) slicing, delta pulse code modulation (Delta PCM), adaptive quadtree (QT) partitioning followed by an adaptive shift encoder. On the other hand, a lossy compression system is introduced to handle the least significant value (LSV), it is based on

This work is concerned with the design and performance evaluation of a shell and double concentric tubes heat exchanger using Solid Works and ANSY (Computational Fluid Dynamics).

Computational fluid dynamics technique which is a computer-based analysis is used to simulate the heat exchanger involving fluid flow, heat transfer. CFD resolve the entire heat exchanger in discrete elements to find: (1) the temperature gradients, (2) pressure distribution, and (3) velocity vectors.  The RNG k-ε model of turbulence is used to determining the accurate results from CFD.

The heat exchanger design for this work consisted of a shell and eight double concentric tubes. The number of inlets are three and that of o