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 this work, the surface of the telescope’s mirror is cleaned using an atmospheric-pressure radio frequency plasma jet (APRFPJ), which is generated by Argon gas between two coaxial metal electrodes. The RF power supply is set to 2 MHz frequencies with three different power levels: 20, 50, and 80 W. Carbon, that has adhered to the surface, can be effectively removed using the plasma cleaning technique, which also modifies any residual bonds. The cleaned surface was clearly distinguished using an optical emission spectroscopy (OES) technique and a water contact angle (WCA) analyzer for the activation property on their surfaces. The sample showed a super hydrophilic surface at an angle of 1° after 2.5 minutes of plasma tre
... Show MoreFuture wireless communication systems must be able to accommodate a large number of users and simultaneously to provide the high data rates at the required quality of service. In this paper a method is proposed to perform the N-Discrete Hartley Transform (N-DHT) mapper, which are equivalent to 4-Quadrature Amplitude Modulation (QAM), 16-QAM, 64-QAM, 256-QAM, … etc. in spectral efficiency. The N-DHT mapper is chosen in the Multi Carrier Code Division Multiple Access (MC-CDMA) structure to serve as a data mapper instead of the conventional data mapping techniques like QPSK and QAM schemes. The proposed system is simulated using MATLAB and compared with conventional MC-CDMA for Additive White Gaussian Noise, flat, and multi-path selective fa
... Show More
XML is being incorporated into the foundation of E-business data applications. This paper addresses the problem of the freeform information that stored in any organization and how XML with using this new approach will make the operation of the search very efficient and time consuming. This paper introduces new solution and methodology that has been developed to capture and manage such unstructured freeform information (multi information) depending on the use of XML schema technologies, neural network idea and object oriented relational database, in order to provide a practical solution for efficiently management multi freeform information system.
It is important to note that Posaconazole (POCZ) is a newly developed extended-spectrum triazole that belongs to BCS class II and has a solubility of less than 1µg/ml. In patients with a weakened immune system, POCZ has been shown to be effective as an antifungal treatment for invasive infections caused by candida and aspergillus species. The nano-micelles technique can be used to increase POCZ solubility. In order to increase their apparent solubility in water, nano-micelles are made by combining macromolecules that self-assemble into ordered structures capable of entrapping hydrophobic drug molecules in the interior domain. Dispersed colloidal systems, of which nano-micelles are a subset, are a large and diverse group. Composed of a p
... Show MoreAn efficient networks’ energy consumption and Quality of Services (QoS) are considered the most important issues, to evaluate the route quality of the designed routing protocol in Wireless Sensor Networks (WSNs). This study is presented an evaluation performance technique to evaluate two routing protocols: Secure for Mobile Sink Node location using Dynamic Routing Protocol (SMSNDRP) and routing protocol that used K-means algorithm to form Data Gathered Path (KM-DGP), on small and large network with Group of Mobile Sinks (GMSs). The propose technique is based on QoS and sensor nodes’ energy consumption parameters to assess route quality and networks’ energy usage. The evaluation technique is conducted on two routing protocols i
... Show MoreWireless sensor networks (WSNs) are emerging in various application like military, area monitoring, health monitoring, industry monitoring and many more. The challenges of the successful WSN application are the energy consumption problem. since the small, portable batteries integrated into the sensor chips cannot be re-charged easily from an economical point of view. This work focusses on prolonging the network lifetime of WSNs by reducing and balancing energy consumption during routing process from hop number point of view. In this paper, performance simulation was done between two types of protocols LEACH that uses single hop path and MODLEACH that uses multi hop path by using Intel Care i3 CPU (2.13GHz) laptop with MATLAB (R2014a). Th
... Show MoreThis paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord
... Show More