This search has introduced the techniques of multi-wavelet transform and neural network for recognition 3-D object from 2-D image using patches. The proposed techniques were tested on database of different patches features and the high energy subband of discrete multi-wavelet transform DMWT (gp) of the patches. The test set has two groups, group (1) which contains images, their (gp) patches and patches features of the same images as a part of that in the data set beside other images, (gp) patches and features, and group (2) which contains the (gp) patches and patches features the same as a part of that in the database but after modification such as rotation, scaling and translation. Recognition by back propagation (BP) neural network as compared with matching by minimum distance, gave (94%) and (83%) score by using group (1), (gp) and features respectively, which is much better than the minimum distance. Recognition using (gp) neural network (NN) gave a (94%) and (72%) score by using group (2), (gp) and features respectively, while the minimum distance gave (11%) and (33%) scores. Time consumption
through the recognition process using (NN) with (gp) is less than that minimum distance.
In modern technology, the ownership of electronic data is the key to securing their privacy and identity from any trace or interference. Therefore, a new identity management system called Digital Identity Management, implemented throughout recent years, acts as a holder of the identity data to maintain the holder’s privacy and prevent identity theft. Therefore, an overwhelming number of users have two major problems, users who own data and third-party applications will handle it, and users who have no ownership of their data. Maintaining these identities will be a challenge these days. This paper proposes a system that solves the problem using blockchain technology for Digital Identity Management systems. Blockchain is a powerful techniqu
... Show MoreAlPO4 solid acid catalyst was prepared in order to use it in transesterification reaction of edible oil after supporting it with tungsten oxide. The maximum conversion of edible oil was obtained 78.78% at catalyst concentration (5gm.), temperature 70°Ϲ, 30/1 methanol/edible oil molar ratio, and time 5hr. The study of kinetics of the transesterification reaction of edible oil indicates that the reaction has an order of 3/2, while the value of activation energy for transesterification reaction is 51.367 kJ/mole and frequency factor equal 26219.13(L/ mol.minute).
The manuscript should contain an abstract. The abstract should be self-contained and citation-free and should not exceed 200 words. The abstract should state the purpose, approach, results and conclusions of the work. The author should assume that the reader has some knowledge of the subject but has not read the paper. Thus, the abstract should be intelligible and complete in it-self (no numerical references); it should not cite figures, tables, or sections of the paper. The abstract should be written using third person instead of first perso The fast microwave assisted pyrolysis (FMWAP) of water hyacinth (WH) for biochar production is investigated. Taguchi’s method was used to optimize FMWAP parameters. The effects of microwave
... Show MoreBiosorption of cadmium ions from simulated wastewater using rice husk was studied with initial concentration of 25 mg/l. Equilibrium isotherm was studied using Langmuir, Freundlich, BET and Timken models. The results show that the Freundlich isotherm is the best fit model to describe this process with high determination coefficient equals to 0.983. There was a good compliance between the experimental and theoretical results. Highest removal efficiency 97% was obtained at 2.5g of adsorbent, pH 6 and contact time 100 min.
conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation.
Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are