A series of nine new Schiff bases based on N-(4-acetophenyl)succinimide were synthesized via multistep synthesis. In the first step N-(4-acetophenyl)succinamic acid was prepared via reaction of succinic anhydride with 4-aminoacetophenone. The prepared amic acid was dehydrated in the second step producing N-(4-acetophenyl)succinimide. The prepared succinimide represents a modified methyl ketone bearing succinimde cycle and ready for introducing in condensation reaction thus in the third step the prepared imide was introduced in acid-catalyzed condensation reaction with a variety of primary aromatic amines affording the new target Schiff bases. The results of antibacterial screening of the newly synthesized Schiff bases indicated that they

A remarkable correlation between chaotic systems and cryptography has been established with sensitivity to initial states, unpredictability, and complex behaviors. In one development, stages of a chaotic stream cipher are applied to a discrete chaotic dynamic system for the generation of pseudorandom bits. Some of these generators are based on 1D chaotic map and others on 2D ones. In the current study, a pseudorandom bit generator (PRBG) based on a new 2D chaotic logistic map is proposed that runs side-by-side and commences from random independent initial states. The structure of the proposed model consists of the three components of a mouse input device, the proposed 2D chaotic system, and an initial permutation (IP) table. Statist

In this paper a modified approach have been used to find the approximate solution of ordinary delay differential equations with constant delay using the collocation method based on Bernstien polynomials.

This paper proposes a new encryption method. It combines two cipher algorithms, i.e., DES and AES, to generate hybrid keys. This combination strengthens the proposed W-method by generating high randomized keys. Two points can represent the reliability of any encryption technique. Firstly, is the key generation; therefore, our approach merges 64 bits of DES with 64 bits of AES to produce 128 bits as a root key for all remaining keys that are 15. This complexity increases the level of the ciphering process. Moreover, it shifts the operation one bit only to the right. Secondly is the nature of the encryption process. It includes two keys and mixes one round of DES with one round of AES to reduce the performance time. The W-method deals with

Twelve compounds containing a sulphur- or oxygen-based heterocyclic core, 1,3- oxazole or 1,3-thiazole ring with hydroxy, methoxy and methyl terminal substituent, were synthesized and characterized. The molecular structures of these compounds were performed by elemental analysis and different spectroscopic tequniques. The liquid crystalline behaviors were studied by using hot-stage optical polarizing microscopy and differential scanning calorimetry. All compounds of 1,4- disubstituted benzene core with oxazole ring display liquid crystalline smectic A (SmA) mesophase. The compounds of 1,3- and 1,4-disubstituted benzene core with thiazole ring exhibit exclusively enantiotropic nematic liquid crystal phases.

          The aim of this paper is to present a new methodology to find the private key of RSA. A new initial value which is generated from a new equation is selected to speed up the process. In fact, after this value is found, brute force attack is chosen to discover the private key. In addition, for a proposed equation, the multiplier of Euler totient function to find both of the public key and the private key is assigned as 1. Then, it implies that an equation that estimates a new initial value is suitable for the small multiplier. The experimental results show that if all prime factors of the modulus are assigned larger than 3 and the multiplier is 1, the distance between an initial value and the private key

In this paper reliable computational methods (RCMs) based on the monomial stan-dard polynomials have been executed to solve the problem of Jeffery-Hamel flow (JHF). In addition, convenient base functions, namely Bernoulli, Euler and Laguerre polynomials, have been used to enhance the reliability of the computational methods. Using such functions turns the problem into a set of solvable nonlinear algebraic system that MathematicaⓇ12 can solve. The JHF problem has been solved with the help of Improved Reliable Computational Methods (I-RCMs), and a review of the methods has been given. Also, published facts are used to make comparisons. As further evidence of the accuracy and dependability of the proposed methods, the maximum error remainder

Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over