The flow measurements have increased importance in the last decades due to the shortage of water resources resulting from climate changes that request high control of the available water needed for different uses. The classical technique of open channel flow measurement by the integrating-float method was needed for measuring flow in different locations when there were no available modern devices for different reasons, such as the cost of devices. So, the use of classical techniques was taken place to solve the problem. The present study examines the integrating float method and defines the parameters affecting the acceleration of floating spheres in flowing water that was analyzed using experimental measurements. The method was investigated theoretically, as well as many experimental tests in a fixed floor laboratory flume were conducted. Different sizes of solid plastic spheres with different weights were used as floats to measure velocities and then discharge computation. The results indicate that the integrating-float technique is feasible and accurate for measuring low flow velocity in open channels. It was desirable to use small floats with specific gravity closer to unity to get more accurate results. The measured velocities and the estimated discharges were compared with discharges obtained using some other common laboratory measuring techniques. Good agreement was obtained between the integrating-float method results with the results of velocities obtained using other measurement techniques, with an error of less than 2.5%.
In Automatic Speech Recognition (ASR) the non-linear data projection provided by a one hidden layer Multilayer Perceptron (MLP), trained to recognize phonemes, and has previous experiments to provide feature enhancement substantially increased ASR performance, especially in noise. Previous attempts to apply an analogous approach to speaker identification have not succeeded in improving performance, except by combining MLP processed features with other features. We present test results for the TIMIT database which show that the advantage of MLP preprocessing for open set speaker identification increases with the number of speakers used to train the MLP and that improved identification is obtained as this number increases beyond sixty.
... Show MoreThe objective of this work is to design and implement a cryptography system that enables the sender to send message through any channel (even if this channel is insecure) and the receiver to decrypt the received message without allowing any intruder to break the system and extracting the secret information. In this work, we implement an interaction between the feedforward neural network and the stream cipher, so the secret message will be encrypted by unsupervised neural network method in addition to the first encryption process which is performed by the stream cipher method. The security of any cipher system depends on the security of the related keys (that are used by the encryption and the decryption processes) and their corresponding le
... Show Morein 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 .