Several million tons of solid waste are produced each year as a result of construction and demolition activities around the world, and brick waste is one of the most widely wastes. Recently, there has been growing number in studies that conducted on using of recycling brick waste (RBW) to produce environmentally friendly concrete. The use of brick waste (BW) as potential partial cement or aggregate replacement materials is summarized in this review where the performance is discussed in the form of the mechanical strength and properties that related to durability of concrete. It was found that, because the pozzolanic activity of clay brick powder, it can be utilized as substitute for cement in replacement level up to 10%. Whereas, for natural coarse aggregate, recycled aggregate can be used instead of it, but in limited replacement level. Concrete manufacturing from recycled aggregate can give adequate strength and can be suitable for the producing medium or low strength concrete. On the other side, the utilization of fine recycled brick waste as aggregate in the concrete manufacturing provide development of the properties of concrete and it develops the durability of concrete in some cases when used with replacement level up to 10% by the weight of fine aggregate.
In this paper, we used four classification methods to classify objects and compareamong these methods, these are K Nearest Neighbor's (KNN), Stochastic Gradient Descentlearning (SGD), Logistic Regression Algorithm(LR), and Multi-Layer Perceptron (MLP). Weused MCOCO dataset for classification and detection the objects, these dataset image wererandomly divided into training and testing datasets at a ratio of 7:3, respectively. In randomlyselect training and testing dataset images, converted the color images to the gray level, thenenhancement these gray images using the histogram equalization method, resize (20 x 20) fordataset image. Principal component analysis (PCA) was used for feature extraction, andfinally apply four classification metho
... Show MoreThis dissertation depends on study of the topological structure in graph theory as well as introduce some concerning concepts, and generalization them into new topological spaces constructed using elements of graph. Thus, it is required presenting some theorems, propositions, and corollaries that are available in resources and proof which are not available. Moreover, studying some relationships between many concepts and examining their equivalence property like locally connectedness, convexity, intervals, and compactness. In addition, introducing the concepts of weaker separation axioms in α-topological spaces than the standard once like, α-feebly Hausdorff, α-feebly regular, and α-feebly normal and studying their properties. Furthermor
... Show MoreFace Identification is an important research topic in the field of computer vision and pattern recognition and has become a very active research area in recent decades. Recently multiwavelet-based neural networks (multiwavenets) have been used for function approximation and recognition, but to our best knowledge it has not been used for face Identification. This paper presents a novel approach for the Identification of human faces using Back-Propagation Adaptive Multiwavenet. The proposed multiwavenet has a structure similar to a multilayer perceptron (MLP) neural network with three layers, but the activation function of hidden layer is replaced with multiscaling functions. In experiments performed on the ORL face database it achieved a
... Show MoreDocument analysis of images snapped by camera is a growing challenge. These photos are often poor-quality compound images, composed of various objects and text; this makes automatic analysis complicated. OCR is one of the image processing techniques which is used to perform automatic identification of texts. Existing image processing techniques need to manage many parameters in order to clearly recognize the text in such pictures. Segmentation is regarded one of these essential parameters. This paper discusses the accuracy of segmentation process and its effect over the recognition process. According to the proposed method, the images were firstly filtered using the wiener filter then the active contour algorithm could b
... Show MoreAspect-Oriented Software Development (AOSD) is a technology that helps achieving
better Separation of Concern (SOC) by providing mechanisms to identify all relevant points
in a program at which aspectual adaptations need to take place. This paper introduces a
banking application using of AOSD with security concern in information hiding.
In this paper, visible image watermarking algorithm based on biorthogonal wavelet
transform is proposed. The watermark (logo) of type binary image can be embedded in the
host gray image by using coefficients bands of the transformed host image by biorthogonal
transform domain. The logo image can be embedded in the top-left corner or spread over the
whole host image. A scaling value (α) in the frequency domain is introduced to control the
perception of the watermarked image. Experimental results show that this watermark
algorithm gives visible logo with and no losses in the recovery process of the original image,
the calculated PSNR values support that. Good robustness against attempt to remove the
watermark was s
In this paper, the developed sprite allocation method is designed to be coherent with the introduced block-matching method in order to minimize the allocation process time for digital video. The accomplished allocation process of sprite region consists of three main steps. The first step is the detection of sprite area; where the sequence of frames belong to Group of Video sequence are analysed to detect the sprite regions which survive for long time, and to determine the sprite type (i.e., whether it is static or dynamic). Then as a second step, the flagged survived areas are passed through the gaps/islands removal stage to enhance the detected sprite areas using post-processing operations. The third step is partitioning the sprite area in
... Show MoreAssociation rules mining (ARM) is a fundamental and widely used data mining technique to achieve useful information about data. The traditional ARM algorithms are degrading computation efficiency by mining too many association rules which are not appropriate for a given user. Recent research in (ARM) is investigating the use of metaheuristic algorithms which are looking for only a subset of high-quality rules. In this paper, a modified discrete cuckoo search algorithm for association rules mining DCS-ARM is proposed for this purpose. The effectiveness of our algorithm is tested against a set of well-known transactional databases. Results indicate that the proposed algorithm outperforms the existing metaheuristic methods.