Solving problems via artificial intelligence techniques has widely prevailed in different aspects. Implementing artificial intelligence optimization algorithms for NP-hard problems is still challenging. In this manuscript, we work on implementing the Naked Mole-Rat Algorithm (NMRA) to solve the n-queens problems and overcome the challenge of applying NMRA to a discrete space set. An improvement of NMRA is applied using the aspect of local search in the Variable Neighborhood Search algorithm (VNS) with 2-opt and 3-opt. Introducing the Naked Mole Rat algorithm based on variable neighborhood search (NMRAVNS) to solve N-queens problems with different sizes. Finding the best solution or set of solutions within a plausible amount of t

Abstract:

               Today, the financial and banking sector is witnessing a qualitative shift thanks to financial technology services, which provide their services to many individuals and companies in quick, easy and less expensive ways compared to traditional means. Financial technology is a new form of financial science that combines financial transactions and technological skills concerned with providing financial services and improving the work environment within Banking institutions, and financial technology provides many advantages such as lower transaction costs, instant payment, and saving more time and effort in conducting banking

A multidimensional systolic arrays realization of LMS algorithm by a method of mapping regular algorithm onto processor array, are designed. They are based on appropriately selected 1-D systolic array filter that depends on the inner product sum systolic implementation. Various arrays may be derived that exhibit a regular arrangement of the cells (processors) and local interconnection pattern, which are important for VLSI implementation. It reduces latency time and increases the throughput rate in comparison to classical 1-D systolic arrays. The 3-D multilayered array consists of 2-D layers, which are connected with each other only by edges. Such arrays for LMS-based adaptive (FIR) filter may be opposed the fundamental requirements of fa

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

Abstract 

This paper presents mechanical and electrical design, and implementation  process of industrial robot, 3-DoF type SCARA (selective compliment assembly robot arm),with two rotations and one translation used for welding applications.The design process also included the controller design which was based on PLC(programmable logic controller) as well as selection of mechanical and electrical components.The challenge was to use the available components in Iraq with reasonable costs. The robot mentioned is fully automated using programmable logic controller PLC(Zelio type SR3-B261BD),with 16inputs and 10 outputs. The PLC was implemented in FBD logic to obtain three different automatic motions with hi

The goals of endodontic preparation were to shape and clean the space of the root canal and remove microorganisms, affected dentin and pulp, the apical foramen and the canal curve should be protected from being transported during endodontic canal preparation. The aim of this study was to evaluate the curve straightening of curved root canals and apical transportation after preparation with four rotary systems. Forty mesial roots of the lower 1st molars teeth only the mesiobuccal canals were used, these roots were immersed into cold clear acrylic , the teeth roots divided into four groups according to rotary system used for preparation of the canals (ten roots for each group):. group I: ProTaper Next rotary system, group II: IRaCe Plus rotar

            The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons