The application of the test case prioritization method is a key part of system testing intended to think it through and sort out the issues early in the development stage. Traditional prioritization techniques frequently fail to take into account the complexities of big-scale test suites, growing systems and time constraints, therefore cannot fully fix this problem. The proposed study here will deal with a meta-heuristic hybrid method that focuses on addressing the challenges of the modern time. The strategy utilizes genetic algorithms alongside a black hole as a means to create a smooth tradeoff between exploring numerous possibilities and exploiting the best one. The proposed hybrid algorithm of genetic black hole (HGBH) uses the

The main idea of this paper is to define other types of a fuzzy local function and study the advantages and differences between them in addition to discussing some definitions of finding new fuzzy topologies. Also in this research, a new type of fuzzy closure has been defined, where the relation between the new type and different types of fuzzy local function has been studied

Background: Several studies linked the development of steroid-resistant nephrotic syndrome (SRNS) to genetic variations in the multidrug resistance 1 (MDR1) gene, though a disparity in findings was underlined among children with different ethnic origins. Objective: This study examined the relationship between MDR1 variants (rs2032582 and rs2032583) and the risk of developing SRNS in Iraqi patients with idiopathic nephrotic syndrome (INS). Methods: This case-control study included children with steroid-sensitive INS (SSNS; n=30) and SRNS (n=30) from the Babylon Hospital for Maternity and Pediatrics. Sanger sequencing was used to determine the participants’ genotypes. Results: The rs2032582 genotypes and alleles were not associated

Optimizing system performance in dynamic and heterogeneous environments and the efficient management of computational tasks are crucial. This paper therefore looks at task scheduling and resource allocation algorithms in some depth. The work evaluates five algorithms: Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Firefly Algorithm (FA) and Simulated Annealing (SA) across various workloads achieved by varying the task-to-node ratio. The paper identifies Finish Time and Deadline as two key performance metrics for gauging the efficacy of an algorithm, and a comprehensive investigation of the behaviors of these algorithms across different workloads was carried out. Results from the experiment

Original Research Paper Mathematics 1-Introduction : In the light of the progress and rapid development of the applications of research in applications fields, the need to rely on scientific tools and cleaner for data processing has become a prominent role in the resolution of decisions in industrial and service institutions according to the real need of these methods to make them scientific methods to solve the problem Making decisions for the purpose of making the departments succeed in performing their planning and executive tasks. Therefore, we found it necessary to know the transport model in general and to use statistical methods to reach the optimal solution with the lowest possible costs in particular. And you know The Transportatio

The regressor-based adaptive control is useful for controlling robotic systems with uncertain parameters but with known structure of robot dynamics. Unmodeled dynamics could lead to instability problems unless modification of control law is used. In addition, exact calculation of regressor for robots with more than 6 degrees of freedom is hard to be calculated, and the task could be more complex for robots. Whereas the adaptive approximation control is a powerful tool for controlling robotic systems with unmodeled dynamics. The local (partitioned) approximation-based adaptive control includes representation of the uncertain matrices and vectors in the robot model as finite combinations of basis functions. Update laws for the weighting matri

The influx of data in bioinformatics is primarily in the form of DNA, RNA, and protein sequences. This condition places a significant burden on scientists and computers. Some genomics studies depend on clustering techniques to group similarly expressed genes into one cluster. Clustering is a type of unsupervised learning that can be used to divide unknown cluster data into clusters. The k-means and fuzzy c-means (FCM) algorithms are examples of algorithms that can be used for clustering. Consequently, clustering is a common approach that divides an input space into several homogeneous zones; it can be achieved using a variety of algorithms. This study used three models to cluster a brain tumor dataset. The first model uses FCM, whic