The sensitive and important data are increased in the last decades rapidly, since the tremendous updating of networking infrastructure and communications. to secure this data becomes necessary with increasing volume of it, to satisfy securing for data, using different cipher techniques and methods to ensure goals of security that are integrity, confidentiality, and availability. This paper presented a proposed hybrid text cryptography method to encrypt a sensitive data by using different encryption algorithms such as: Caesar, Vigenère, Affine, and multiplicative. Using this hybrid text cryptography method aims to make the encryption process more secure and effective. The hybrid text cryptography method depends on circular queue. Using circ

Nowadays, it is quite usual to transmit data through the internet, making safe online communication essential and transmitting data over internet channels requires maintaining its confidentiality and ensuring the integrity of the transmitted data from unauthorized individuals. The two most common techniques for supplying security are cryptography and steganography. Data is converted from a readable format into an unreadable one using cryptography. Steganography is the technique of hiding sensitive information in digital media including image, audio, and video. In our proposed system, both encryption and hiding techniques will be utilized. This study presents encryption using the S-DES algorithm, which generates a new key in each cyc

Purpose: The concept of complete street is one of the modern trends concerned with diversifying means of transportation and reducing the disadvantages of mechanical transportation modes. This paper discusses the role of complete streets can play in developing the urban environment in the Alyarmok District of Baghdad.   Method/design/approach: The linear regression method used to analyze the opinions of 100 respondents surveyed in the study area in order to find the relationship between the urban environment and the complete street elements.   Theoretical framework: The Modern trends in urban planning aim to find alternatives to the policies of traditional transportation planning that focus on vehicular mobi

Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal ima

Background. Body mass index (BMI) is a person's weight in kilograms (or pounds) divided by the square of height in meters (or feet). Obesity affects a wide spectrum of age groups, from the young to the elderly, and there are several eye diseases related to obesity like diabetic retinopathy, floppy eyelid syndrome, retinal vein occlusion, stroke-related vision loss, age-related macular degeneration, and possibly, refractive errors. Refractive errors (RE) are optical imperfections related to the focusing ability of the eye and are the main cause of visual impairment which may result in missed education and employment opportunities, lower productivity and impaired quality of life. Aim. The study aimed to find an association between bod

Given a matrix, the Consecutive Ones Submatrix (C1S) problem which aims to find the permutation of columns that maximizes the number of columns having together only one block of consecutive ones in each row is considered here. A heuristic approach will be suggested to solve the problem. Also, the Consecutive Blocks Minimization (CBM) problem which is related to the consecutive ones submatrix will be considered. The new procedure is proposed to improve the column insertion approach. Then real world and random matrices from the set covering problem will be evaluated and computational results will be highlighted.