Slurry infiltrated fibrous concrete (SIFCON) is a modern type of fibre reinforced concrete (FRC). It has unique properties; SIFCON is superior in compressive strength, flexural strength, tensile strength, impact resistance, energy absorption and ductility. Because of this superiority in these characteristics, SIFCON was qualified for applications of special structures, which require resisting sudden dynamic loads such as explosions and earthquakes. The main aim of this investigation is to determine the effect of fibre type on the apparent density of SIFCON and on performance under impact load. In this investigation, hook-end steel fibre and polyolefin fibre were used. Purely once and hybrid in different portions again. After reviewing previous research, including [1, 2, 3] references three trail mixes were tested with a volume fraction of fibres (4, 6 and 8)%, and after testing them, a volume fraction of 6% was chosen. We chose the volume fraction of 6% and made the type of fibre the variable for comparison in this research. In hybrid fibres this fraction was divided once 2/3 steel fibres with 1/3 polyolefin fibres and vice versa. The specimens of the Impact resistance test were made with two specimens for each series, which are panels with dimensions of 50×50×5 cm. Three cubes were made for each series in the SIFCON apparent density test. Test results prove SIFCON produced from 2/3 polyolefin and 1/3 steel fibres achieved a good density reduction that contributes to reducing the self-weight of the structural element, which is a major aim in this investigation, reducing cost and maintaining high impact resistance.
This paper adapted the neural network for the estimating of the direction of arrival (DOA). It uses an unsupervised adaptive neural network with GHA algorithm to extract the principal components that in turn, are used by Capon method to estimate the DOA, where by the PCA neural network we take signal subspace only and use it in Capon (i.e. we will ignore the noise subspace, and take the signal subspace only).
Even though image retrieval is considered as one of the most important research areas in the last two decades, there is still room for improvement since it is still not satisfying for many users. Two of the major problems which need to be improved are the accuracy and the speed of the image retrieval system, in order to achieve user satisfaction and also to make the image retrieval system suitable for all platforms. In this work, the proposed retrieval system uses features with spatial information to analyze the visual content of the image. Then, the feature extraction process is followed by applying the fuzzy c-means (FCM) clustering algorithm to reduce the search space and speed up the retrieval process. The experimental results show t
... Show MoreThe research deals with Environmental Management and how to develop its programs with the use of Knowledge Management, the environmental programs that integrate with processes can add strategic value to business through improving rates of resource utilization , efficiencies , reduce waste, use risk management, cut costs, avoid fines and reduce insurance. All these activities and processes can improve it through knowledge management, the optimal usage for all organizations information , employ it in high value and share it among all organizations members who involves in modify its strategy . Choosing suitable environmental management information system, develop it and modify it with organization processes, can greatly serve the en
... Show MoreA loS.sless (reversible) data hiding (embedding) method inside an image (translating medium) - presented in the present work using L_SB (least significant bit). technique which enables us to translate data using an image (host image), using a secret key, to be undetectable without losing any data or without changing the size and the external scene (visible properties) of the image, the hid-ing data is then can be extracted (without losing) by reversing &n
... Show MoreThis paper presents a proposed neural network algorithm to solve the shortest path problem (SPP) for communication routing. The solution extends the traditional recurrent Hopfield architecture introducing the optimal routing for any request by choosing single and multi link path node-to-node traffic to minimize the loss. This suggested neural network algorithm implemented by using 20-nodes network example. The result shows that a clear convergence can be achieved by 95% valid convergence (about 361 optimal routes from 380-pairs). Additionally computation performance is also mentioned at the expense of slightly worse results.
This paper introduces a relation between resultant and the Jacobian determinant
by generalizing Sakkalis theorem from two polynomials in two variables to the case of (n) polynomials in (n) variables. This leads us to study the results of the type: , and use this relation to attack the Jacobian problem. The last section shows our contribution to proving the conjecture.
in this paper we adopted ways for detecting edges locally classical prewitt operators and modification it are adopted to perform the edge detection and comparing then with sobel opreators the study shows that using a prewitt opreators
Data hiding is the process of encoding extra information in an image by making small modification to its pixels. To be practical, the hidden data must be perceptually invisible yet robust to common signal processing operations. This paper introduces a scheme for hiding a signature image that could be as much as 25% of the host image data and hence could be used both in digital watermarking as well as image/data hiding. The proposed algorithm uses orthogonal discrete wavelet transforms with two zero moments and with improved time localization called discrete slantlet transform for both host and signature image. A scaling factor ? in frequency domain control the quality of the watermarked images. Experimental results of signature image
... Show MoreIn this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .