We use the idea of the grill. This study generalized a new sort of linked space like -connected and -hyperconnected and investigated its features, as well as the relationship between it and previously described notions. It also developed new sorts of functions, such as hyperconnected space, and identified their relationship by offering numerous instances and attributes that belong to this set. This set will serve as a starting point for further research into the set many future possibilities. We also use some theorems and observations previously studied and related to the grill and the semi-open to obtain results in this research. We applied the concept of connected to them and obtained results related to connected. The sources related t

Background/objectives: To study the motion equation under all perturbations effect for Low Earth Orbit (LEO) satellite. Predicting a satellite’s orbit is an important part of mission exploration. Methodology: Using 4th order Runge–Kutta’s method this equation was integrated numerically. In this study, the accurate perturbed value of orbital elements was calculated by using sub-steps number m during one revolution, also different step numbers nnn during 400 revolutions. The predication algorithm was applied and orbital elements changing were analyzed. The satellite in LEO influences by drag more than other perturbations regardless nnn through semi-major axis and eccentricity reducing. Findings and novelty/improvement: The results demo

Iraqi siliceous rocks were chosen to be used as raw materials in this study which is concern with the linear shrinkage and their related parameters. They are porcelinite from Safra area (western desert) and Kaolin Duekla, their powders were mixed in certain percentage, to shape compacts and sintered. The study followed with thermal and chemical treatments, which are calcination and acid washing. The effects on final compact properties such as linear shrinkage were studied. Linear shrinkage was calculated for sintered compacts to study the effects of calcination processes, chemical washing, weight percentage, sintering processes, loading moment were studied on this property where the compacts for groups is insulating materials.
Linear

     In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr

In this work, we first construct Hermite wavelets on the interval [0,1) with it’s product, Operational matrix of integration 2^k M×2^k M is derived, and used it for solving nonlinear Variational problems with reduced it to a system of algebric equations and aid of direct method. Finally, some examples are given to illustrate the efficiency and performance of presented method.

 The aim of this paper is to present a semi - analytic technique for solving singular initial value problems of ordinary differential equations with a singularity of different kinds to construct polynomial solution using two point  osculatory  interpolation.           The efficiency and accuracy of suggested method is assessed by comparisons with exact and other approximate solutions for a wide classes of non–homogeneous, non–linear singular initial value problems.             A new, efficient estimate of the global error is used for adaptive mesh selection. Also, analyze some of the numerical aspects

     Meerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of the meerkat animal. This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC). These two strategies increase the diversification and intensification of the proposed algorithm and boost the searching ability to find more quality solutions. The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems. The experimental results demonstrate that the proposed algorithm had overcome the basic algorithm in terms of solution quality, speed a

Metaheuristic is one of the most well-known fields of research used to find optimum solutions for non-deterministic polynomial hard (NP-hard) problems, for which it is difficult to find an optimal solution in a polynomial time. This paper introduces the metaheuristic-based algorithms and their classifications and non-deterministic polynomial hard problems. It also compares the performance of two metaheuristic-based algorithms (Elephant Herding Optimization algorithm and Tabu Search) to solve the Traveling Salesman Problem (TSP), which is one of the most known non-deterministic polynomial hard problems and widely used in the performance evaluations for different metaheuristics-based optimization algorithms. The experimental results of Ele