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

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 aim of this work is to detect the best operating conditions that effect on the removal of Cu²⁺, Zn²⁺, and Ni²⁺ ions from aqueous solution using date pits in the batch adsorption experiments. The results have shown that the Al-zahdi Iraqi date pits demonstrated more efficient at certain values of operating conditions of adsorbent doses of 0.12 g/ml of aqueous solution, adsorption time 72 h, pH solution 5.5 ±0.2, shaking speed  300 rpm, and smallest adsorbent particle size needed for removal of metals.  At the same time the particle size of date pits has a little effect on the adsorption at low initial concentration of heavy metals. The adsorption of metals increases with increas

An innovative desalination method called electrosorption or capacitive deionization (CDI) has significant benefits for wastewater treatment. This process is performed by using a carbon fiber electrode as a working electrode to remove hexavalent chromium ions from an aqueous solution. The pH, NaCl concentration, and cell voltage were optimized using the Box-Behnken experimental design (BDD) in response surface methodology (RSM) to study the effects and interactions of selected variables. To attain the relationship between the process variables and chromium removal, the experimental data were subjected to an analysis of variance and fitted with a quadratic model. The optimum conditions to remove Cr(VI) ions were: pH of 2, a cell voltage of 4.

The aim of the research is to measure the relationship and effect of the application of total production maintenance TPM in the operational strategy, as it is considered one of the most important strategies for the process of restoring production losses because of inefficient equipment. Competitive edge in the global market by upgrading the operational strategies of OS in the application of TPM in those institutions that apply both H-OS-oriented and P-OS-oriented strategies where the strategy has been identified as a critical success factor. The aim of this study is to attempt to consider the application of comprehensive productive maintenance in industrial establishments

A variety of new phenolic Schiff bases derivatives have been synthesized starting from Terephthaladehyde compound, all proposed structures were supported by FTIR, 1H-NMR, 13C-NMR, Elemental analysis, some derivatives evaluated by Thermal analysis (TGA).

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi