This article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

In this paper a system is designed on an FPGA using a Nios II soft-core processor, to detect the colour of a specific surface and moving a robot arm accordingly. The surface being detected is bounded by a starting mark and an ending mark, to define the region of interest. The surface is also divided into sections as rows and columns and each section can have any colour. Such a system has so many uses like for example warehouses or even in stores where their storing areas can be divided to sections and each section is coloured and a robot arm collects objects from these sections according to the section’s colour also the robot arm can organize objects in sections according to the section’s colour.

We define L-contraction mapping in the setting of D-metric spaces analogous to L-contraction mappings [1] in complete metric spaces. Also, give a definition for general D- matric spaces.And then prove the existence of fixed point for more general class of mappings in generalized D-metric spaces.

MK Al-Janabi, NA Nasir, RK Jaber, AO Oleiwe, Iraqi Postgraduate Medical Journal, 2018 - Cited by 7

Background: The grading systems of salivary mucoepidermoid carcinoma depend on different histologic and morphologic features. The aim of this study was to compare between Auclair and Brandwein systems according to their histologic criteria, and the type of cell predominant. Materials and Methods: Twenty-one case included hematoxylin-eosin (H&E) stained tissue slides that were diagnosed as MEC, originally categorized into low and high grade type regardless of the grading system, have meticulously undergone histopathologic review. The sample was graded according to criteria owing to Auclair and Brandwein methods. The predominant type of cells was determined by microscopic examination according to grade of tumor. Results: Regarding the

In Computer-based applications, there is a need for simple, low-cost devices for user authentication. Biometric authentication methods namely keystroke dynamics are being increasingly used to strengthen the commonly knowledge based method (example a password) effectively and cheaply for many types of applications. Due to the semi-independent nature of the typing behavior it is difficult to masquerade, making it useful as a biometric. In this paper, C4.5 approach is used to classify user as authenticated user or impostor by combining unigraph features (namely Dwell time (DT) and flight time (FT)) and digraph features (namely Up-Up Time (UUT) and Down-Down Time (DDT)). The results show that DT enhances the performance of digraph features by i