Data security is an important component of data communication and transmission systems. Its main role is to keep sensitive information safe and integrated from the sender to the receiver. The proposed system aims to secure text messages through two security principles encryption and steganography. The system produced a novel method for encryption using graph theory properties; it formed a graph from a password to generate an encryption key as a weight matrix of that graph and invested the Least Significant Bit (LSB) method for hiding the encrypted message in a colored image within a green component. Practical experiments of (perceptibility, capacity, and robustness) were calculated using similarity measures like PSNR, MSE, and

The bubbled slab, a type of reinforced concrete (RC) slab with plastic voids, is an innovative design that employs a biaxial distribution of voiding formers within the slab to reduce the slab’s self-weight while preserving a load-carrying capacity that is approximately comparable to that of solid slabs. This paper presents a new approach for figuring out the effective critical shear perimeter of voided slabs using the reduced-volume concept of concrete. This approach aims to reduce the coefficient of variation of the current design standards, namely the ACI 318-19 and Eurocode 2, for assessing the slabs’ resistance to punching shear. Our experimental program investigated the impact of voiding former patterns and the location of

Abstract. One of the fibrewise micro-topological space is one in which the topology is decided through a group of fibre bundles, in comparison to the usual case in normal, fibrewise topological space. The micro-topological spaces draw power from their ability to be used in descriptions of a wide range of mathematical objects. These can be used to describe the topology of a manifold or even the topology of a group. Apart from easy manipulation, the fibrewise micro-topological spaces yield various mathematical applications, but the one being mentioned here is the possibility for geometric investigation of space or group structure. In this essay, we shall explain what fibrewise micro-topological spaces are, indicate why they are useful in math

We introduce and discuss recent type of fibrewise topological spaces, namely fibrewise soft bitopological spaces. Also, we introduce the concepts of fibrewise closed soft bitopological spaces, fibrewise open soft bitopological spaces, fibrewise locally sliceable soft bitopological spaces and fibrewise locally sectionable soft bitopological spaces. Furthermore, we state and prove several propositions concerning these concepts.

In this paper, an efficient method for compressing color image is presented. It allows progressive transmission and zooming of the image without need to extra storage. The proposed method is going to be accomplished using cubic Bezier surface (CBI) representation on wide area of images in order to prune the image component that shows large scale variation. Then, the produced cubic Bezier surface is subtracted from the image signal to get the residue component. Then, bi-orthogonal wavelet transform is applied to decompose the residue component. Both scalar quantization and quad tree coding steps are applied on the produced wavelet sub bands. Finally, adaptive shift coding is applied to handle the remaining statistical redundancy and attain e

This research introduce a study with application on Principal Component Regression obtained from some of the explainatory variables to limitate Multicollinearity problem among these variables and gain staibilty in their estimations more than those which yield from Ordinary Least Squares. But the cost that we pay in the other hand losing a little power of the estimation of the predictive regression function in explaining the essential variations. A suggested numerical formula has been proposed and applied by the researchers as optimal solution, and vererifing the its efficiency by a program written by the researchers themselves for this porpuse through some creterions: Cumulative Percentage Variance, Coefficient of Determination, Variance

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.