The present theoretical study analyzes the legacy of the Chicago School of Urban Sociology and evaluates it in the light of the growth and development of Chicago City and the establishment of sociology in it. Sociology has become an academic discipline recognized in the United States of America in the late nineteenth century, particularly, after the establishment of the first department of sociology in the University of Chicago in 1892. That was during the period of the rapid industrialization and sustainable growth of the Chicago City. The Chicago School relied on Chicago City in particular, as one of the American cities that grew and expanded rapidly in the first two decades of the twentieth century. At the end of the nineteenth centur

* Khalifa E. Sharquie1, Hayder Al-Hamamy2, Adil A. Noaimi1, Mohammed A. Al-Marsomy3, Husam Ali Salman4, American Journal of Dermatology and Venereology, 2014 - Cited by 2

This paper deals with constructing mixed probability distribution from mixing exponential

Stenography is the art of hiding the very presence of communication by embedding secret message into innocuous looking cover document, such as digital image, videos, sound files, and other computer files that contain perceptually irrelevant or redundant information as covers or carriers to hide secret messages.

In this paper, a new Least Significant Bit (LSB) nonsequential embedding technique in wave audio files is introduced. To support the immunity of proposed hiding system, and in order to recover some weak aspect inherent with the pure implementation of stego-systems, some auxiliary processes were suggested and investigated including the use of hidden text jumping process and stream ciphering algorithm. Besides, the suggested

Today, data security is a major problem concerning organizations and indi- viduals. The confidentiality of information is associated with using reliable and robust encryption algorithms in systems. Cyber-attacks on data and systems have become prevalent and sophisticated, and are increasing rapidly; hence, the need for developing robust encryption algorithms is crucial nowadays. This paper proposes a new encryption algorithm using dynamic symmetric key cryptography to encrypt text files. It utilizes a secret key for encryption and decryption processes, where the key’s length is varied depending on the text size. This presented approach gives a trade-off between speed and security, making it suitable for various applications, such as secur

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 Hopfield network is one of the easiest types, and its architecture is such that each neuron in the network connects to the other, thus called a fully connected neural network. In addition, this type is considered auto-associative memory, because the network returns the pattern immediately upon recognition, this network has many limitations, including memory capacity, discrepancy, orthogonally between patterns, weight symmetry, and local minimum. This paper proposes a new strategy for designing Hopfield based on XOR operation; A new strategy is proposed to solve these limitations by suggesting a new algorithm in the Hopfield network design, this strategy will increase the performance of Hopfield by modifying the architecture of t

          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