Metaheuristics under the swarm intelligence (SI) class have proven to be efficient and have become popular methods for solving different optimization problems. Based on the usage of memory, metaheuristics can be classified into algorithms with memory and without memory (memory-less). The absence of memory in some metaheuristics will lead to the loss of the information gained in previous iterations. The metaheuristics tend to divert from promising areas of solutions search spaces which will lead to non-optimal solutions. This paper aims to review memory usage and its effect on the performance of the main SI-based metaheuristics. Investigation has been performed on SI metaheuristics, memory usage and memory-less metaheuristics, memory char

Let G be a graph with p vertices and q edges and  be an injective function, where k is a positive integer. If the induced edge labeling   defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G. A graph which admits an odd Fibonacci edge irregular labeling is called an odd Fibonacci edge irregular graph. The odd Fibonacci edge irregularity strength ofes(G) is the minimum k for which G admits an odd Fibonacci edge irregular labeling. In this paper, the odd Fibonacci edge irregularity strength for some subdivision graphs and graphs obtained from vertex identification is determined.

Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing

Tchebichef polynomials (TPs) play a crucial role in various fields of mathematics and applied sciences, including numerical analysis, image and signal processing, and computer vision. This is due to the unique properties of the TPs and their remarkable performance. Nowadays, the demand for high-quality images (2D signals) is increasing and is expected to continue growing. The processing of these signals requires the generation of accurate and fast polynomials. The existing algorithms generate the TPs sequentially, and this is considered as computationally costly for high-order and larger-sized polynomials. To this end, we present a new efficient solution to overcome the limitation of sequential algorithms. The presented algorithm us

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit

in this paper we adopted ways for detecting edges locally classical prewitt operators and modification it are adopted to perform the edge detection and comparing then with sobel opreators the study shows that using a prewitt opreators

Each school of Islamic jurisprudence has principles and rules upon which the diligent work in these schools is based. This is due to the view of sanctification of these rulings, as they are divine rulings. Therefore, the goal is to reach a ruling that represents the intent of the legislator as much as possible.
Hence, these schools of thought established rules for issuing fatwas with the intention of restricting the performance of a fatwa to the hands of those who are qualified for it and have met its conditions, so they gave priority to the most knowledgeable person over others to perform the fatwa. In the Hanafi school of thought, for example, the saying of Imam Abu Hanifa (may God have mercy on him) is given precedence over others,

Two simple methods spectrophotometric were suggested for the determination of Cefixime (CFX) in pure form and pharmaceutical preparation. The first method is based without cloud point (CPE) on diazotization of the Cefixime drug by sodium nitrite at 5Cº followed by coupling with ortho nitro phenol in basic medium to form orange colour. The product was stabilized and measured 400 nm. Beer’s law was obeyed in the concentration range of (10-160) μg∙mL^-1 Sandell’s sensitivity was 0.0888μg∙cm^-1, the detection limit was 0.07896μg∙mL^-1, and the limit of Quantitation was 0.085389μg∙mL^-1.The second method was cloud point extraction (CPE) with using  Trtion X-114 as surfactant. Beer

A sensitive spectrophotometric method was developed for the estimation of cefdinir (CFD), a cephalosporin species. This study involves two methods, and the first method includes the preparing of azo dye by the reaction of CFD diazonium salt with 4-Tert-Butylphenol (4-TBP) and 2-Naphthol (2-NPT) in alkaline medium, which shows colored dyes measured at λmax 490 and 535 nm, respectively. Beer's law was obeyed along the concentration range of (3-100) μg.ml-1. The limits of detection were 0.246, 0.447 μg.ml-1 and molar absorptivities were 0.6129×104, 0.3361×104 L.mol-1cm-1 for (CFD-4-TBP) and (CFD-2-NPT), respectively. The second method includes preconcentration for cefdinir dyes by using cloud point extraction in the presence of Triton