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 time is the main goal of the NMRAVNS algorithm. The improvement of the proposed algorithm boosts the exploitation capability of the basic NMRA and gives a greater possibility, with the emerging search strategies, to find the global best solution. This algorithm proved successful and outperformed other algorithms and studies with a remarkable target. A detailed comparison is performed, and the data results are presented with the relevant numbers and values. NMRA and NMRAVNS comparisons are implemented and recorded. Later on, a comparison between the Meerkat Clan Algorithm, Genetic Algorithm, Particle Swarm Optimization, and NMRAVNS is tested and presented. Finally, NMRAVNS is evaluated against the examined genetic-based algorithm and listed to prove the success of the proposed algorithm. NMRAVNS outperformed previous findings and scored competitive results with a high number of queen sizes, where an average time reduction reached about 87% of other previous findings.
In this paper the concept of (m, n)- fully stable Banach Algebra-module relative to ideal (F − (m, n) − S − B − A-module relative to ideal) is introducing, we study some properties of F − (m, n) − S − B − A-module relative to ideal and another characterization is given
Necessary and sufficient conditions for the operator equation I AXAX n  ï€* , to have a real positive definite solution X are given. Based on these conditions, some properties of the operator A as well as relation between the solutions X andAare given.
This paper proposes improving the structure of the neural controller based on the identification model for nonlinear systems. The goal of this work is to employ the structure of the Modified Elman Neural Network (MENN) model into the NARMA-L2 structure instead of Multi-Layer Perceptron (MLP) model in order to construct a new hybrid neural structure that can be used as an identifier model and a nonlinear controller for the SISO linear or nonlinear systems. Two learning algorithms are used to adjust the parameters weight of the hybrid neural structure with its serial-parallel configuration; the first one is supervised learning algorithm based Back Propagation Algorithm (BPA) and the second one is an intelligent algorithm n
... Show MoreIn this paper, we design a fuzzy neural network to solve fuzzy singularly perturbed Volterra integro-differential equation by using a High Performance Training Algorithm such as the Levenberge-Marqaurdt (TrianLM) and the sigmoid function of the hidden units which is the hyperbolic tangent activation function. A fuzzy trial solution to fuzzy singularly perturbed Volterra integro-differential equation is written as a sum of two components. The first component meets the fuzzy requirements, however, it does not have any fuzzy adjustable parameters. The second component is a feed-forward fuzzy neural network with fuzzy adjustable parameters. The proposed method is compared with the analytical solutions. We find that the proposed meth
... Show MoreThis paper presents a hybrid genetic algorithm (hGA) for optimizing the maximum likelihood function ln(L(phi(1),theta(1)))of the mixed model ARMA(1,1). The presented hybrid genetic algorithm (hGA) couples two processes: the canonical genetic algorithm (cGA) composed of three main steps: selection, local recombination and mutation, with the local search algorithm represent by steepest descent algorithm (sDA) which is defined by three basic parameters: frequency, probability, and number of local search iterations. The experimental design is based on simulating the cGA, hGA, and sDA algorithms with different values of model parameters, and sample size(n). The study contains comparison among these algorithms depending on MSE value. One can conc
... Show MoreWireless sensor networks (WSNs) represent one of the key technologies in internet of things (IoTs) networks. Since WSNs have finite energy sources, there is ongoing research work to develop new strategies for minimizing power consumption or enhancing traditional techniques. In this paper, a novel Gaussian mixture models (GMMs) algorithm is proposed for mobile wireless sensor networks (MWSNs) for energy saving. Performance evaluation of the clustering process with the GMM algorithm shows a remarkable energy saving in the network of up to 92%. In addition, a comparison with another clustering strategy that uses the K-means algorithm has been made, and the developed method has outperformed K-means with superior performance, saving ener
... Show MoreObjective: To conduct a standardized method for cavity preparation on the palatal surface of rat maxillary molars and to introduce a standardized method for tooth correct alignment within the specimen during the wax embedding procedure to better detect cavity position within the examined slides. Materials and methods: Six male Wistar rats, aged 4-6 weeks, were used. The maxillary molars of three animals were sectioned in the frontal plane to identify the thickness of hard tissue on the palatal surface of the first molar which was (250-300µm). The end-cutting bur (with a cutting head diameter of 0.2mm) was suitable for preparing a dentinal cavity (70-80µm) depth. Cavity preparation was then performed using the same bur on the tooth surf
... Show MoreIn this study, He's parallel numerical algorithm by neural network is applied to type of integration of fractional equations is Abel’s integral equations of the 1st and 2nd kinds. Using a Levenberge – Marquaradt training algorithm as a tool to train the network. To show the efficiency of the method, some type of Abel’s integral equations is solved as numerical examples. Numerical results show that the new method is very efficient problems with high accuracy.
Background: The repair of bone defects remains a major clinical orthopaedic challenge. Bone is a highly vascularised tissue reliant on the close spatial and temporal connection between blood vessels and bone cells to maintain skeletal integrity. Angiogenesis thus plays a pivotal role in skeletal development and bone fracture repair. The role of angiogenic and osteogenic factors in the adaptive response and interaction of osteoblasts and endothelial cells during the multi step process of bone development and repair will be highlighted in this study. This study aimed to identify the role of local exogenous vascular endothelial growth factor in bone healing and to analyze the expression of VEGF by immunohistochemistry in created bone defect af
... Show MoreAbstract. This work presents a detailed design of a three-jointed tendon-driven robot finger with a cam/pulleys transmission and joint Variable Stiffness Actuator (VSA). The finger motion configuration is obtained by deriving the cam/pulleys transmission profile as a mathematical solution that is then implemented to achieve contact force isotropy on the phalanges. A VSA is proposed, in which three VSAs are designed to act as a muscle in joint space to provide firm grasping. As a mechatronic approach, a suitable type and number of force sensors and actuators are designed to sense the touch, actuate the finger, and tune the VSAs. The torque of the VSAs is controlled utilizing a designed Multi Input Multi Output (MIMO) fuzzy controll
... Show More