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

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

Chaotic systems have been proved to be useful and effective for cryptography. Through this work, a new Feistel cipher depend upon chaos systems and Feistel network structure with dynamic secret key size according to the message size have been proposed. Compared with the classical traditional ciphers like Feistel-based structure ciphers, Data Encryption Standards (DES), is the common example of Feistel-based ciphers, the process of confusion and diffusion, will contains the dynamical permutation choice boxes, dynamical substitution choice boxes, which will be generated once and hence, considered static,

            While using chaotic maps, in the suggested system, called

The evolution of cryptography has been crucial to preservation subtle information in the digital age. From early cipher algorithms implemented in earliest societies to recent cryptography methods, cryptography has developed alongside developments in computing field. The growing in cyber threats and the increase of comprehensive digital communications have highlighted the significance of selecting effective and robust cryptographic techniques. This article reviews various cryptography algorithms, containing symmetric key and asymmetric key cryptography, via evaluating them according to security asset, complexity, and execution speed. The main outcomes demonstrate the growing trust on elliptic curve cryptography outstanding its capabi

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

The results of studying the effects of M. anisopiliae spores on mosquito, C. quinquefasciatus showed a biological effects represented by immature mortality. The mortality increased proportionally with the concentrations of fungal spores, which reached (at high concentration 2×1011 spores / ml), to 86.6, 56.6% in first and late instar larvae, respectively. An important to mention that cumulative death rate was significantly associated with the time, which reached to 56% at 7 day after treatment. In addition, M. anisopiliae had a long period permanence in aquatic habitats; in which the residual effects stay 30 days in aquatic habitats after treatment at laboratory conditions. Interestingly, the long period exposure of fungal spores (30 minut

<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