In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the compared blocks is achieved. Instead of pixels-wise comparisons a set of hierarchal similarity comparisons between few descriptors of the compared blocks is done. The computations of blocks descriptors have linear complexity, O(n) and small number of involved similarity comparisons is required. As final stage, the selected blocks as the best similar blocks according to their descriptors are only pushed to pixel-wise blocks comparison stage. The performance of the proposed system was tested for both cases: (i) without using prediction for assessing the initial motion vector and (ii) with using prediction that based on the determined motion vectors of already scanned neighbor blocks. The test results indicated that the introduced method for both cases (without/ with prediction) can lead to promising results in terms of time and error level; because there is reduction in search time and error level parameters in comparison with exhaustive search and three step search (TSS) algorithms.
This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)
... Show MoreThere has been a great deal of research into the considerable challenge of managing of traffic at road junctions; its application to vehicular ad hoc network (VANET) has proved to be of great interest in the developed world. Dynamic topology is one of the vital challenges facing VANET; as a result, routing of packets to their destination successfully and efficiently is a non-simplistic undertaking. This paper presents a MDORA, an efficient and uncomplicated algorithm enabling intelligent wireless vehicular communications. MDORA is a robust routing algorithm that facilitates reliable routing through communication between vehicles. As a position-based routing technique, the MDORA algorithm, vehicles' precise locations are used to establish th
... Show MoreBackground The Transportation Problem (TP) is a detailed model in operations study with applications in logistics, supply chain management, and resource allocation. The classical IBFS methods including North-West Corner, Least Cost and Vogel’s Approximation have competitive computational efficiency, but they are very sensitive to the structure of the problem and usually lead to a solution that is far from the global optimum. Classic enhancement strategies like the Generalized Distribution (MODI) and Stepping-Stone (SS) approaches have low computational complexity but may fall into a local optimum quickly, which makes them ineffective in large-scale or unbalanced problems. Methods We propose the first generic hybrid algorithm, calle
... Show MoreIn this paper, the botnet detection problem is defined as a feature selection problem and the genetic algorithm (GA) is used to search for the best significant combination of features from the entire search space of set of features. Furthermore, the Decision Tree (DT) classifier is used as an objective function to direct the ability of the proposed GA to locate the combination of features that can correctly classify the activities into normal traffics and botnet attacks. Two datasets namely the UNSW-NB15 and the Canadian Institute for Cybersecurity Intrusion Detection System 2017 (CICIDS2017), are used as evaluation datasets. The results reveal that the proposed DT-aware GA can effectively find the relevant features from
... Show MoreThis work aims to develop a secure lightweight cipher algorithm for constrained devices. A secure communication among constrained devices is a critical issue during the data transmission from the client to the server devices. Lightweight cipher algorithms are defined as a secure solution for constrained devices that require low computational functions and small memory. In contrast, most lightweight algorithms suffer from the trade-off between complexity and speed in order to produce robust cipher algorithm. The PRESENT cipher has been successfully experimented on as a lightweight cryptography algorithm, which transcends other ciphers in terms of its computational processing that required low complexity operations. The mathematical model of
... Show MoreThis study investigates the application of hydraulic acid fracturing to enhance oil production in the Mishrif Formation of the Al-Fakkah oilfield due to declining flow rates and wellhead pressures resulting from asphaltene deposition and inadequate permeability. Implementing acid fracturing, an established technique for low-permeability carbonate reserves, was essential due to the inadequacy of prior solvent cleaning and acidizing efforts. The document outlines the protocols established prior to and following the treatment, emphasizing the importance of careful oversight to guarantee safety and efficacy. In the MiniFrac treatment, 150 barrels of #30 cross-linked gel were injected at 25 barrels per minute, followed by an overflush wi
... Show MoreThe transverse electron scattering form factors have been studied for low –lying excited states of 7Li nucleus. These states are specified by J? T= (0.478MeV), (4.63MeV) and (6.68MeV). The transitions to these states are taking place by both isoscalar and isovector components. These form factors have been analyzed in the framework of the multi-nucleon configuration mixing of harmonic oscillator shell model with size parameter brms=1.74fm. The universal two-body of Cohen-Kurath is used to generate the 1p-shell wave functions. The core polarization effects are included in the calculations through effective g-factors and resolved many discrepancies with experiments. A higher configuration effect outside the 1p-shell model space, such
... Show MoreA computerized investigation has been carried out on the design of six electrodes electrostatic lenses used in electron gun application. The Finite-Element Method (FEM) was used in the solution of Laplace equation for determine the axial potential distribution. The electron trajectory under zero magnification condition. The optical properties, spherical and chromatic aberrations, the object and image focal length and object and image position are calculated. A very good futures for the electron gun with these lenses have been computed where are a beam current of 8.7*10-7A can be supplied using cathode tip of radius 10nm.