The dependence of the cross-section of the coherent and incoherent radiation peaks in the X-ray absorption experiment of different energies (20-800 Kev) was investigated. Cross-sectional dependence on the atomic number Z was included from the published data for (8) elements, ranging from carbon to silver (C-Ag). The proportional constant K was obtained between (σ_c/σ_i), with the atomic number Z from (6-47). The results show that the value of K exponentially changes with energy.

     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

 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

This paper is concerned with finding the approximation solution (APPS) of a certain type of nonlinear hyperbolic boundary value problem (NOLHYBVP).  The given BVP is written in its discrete (DI) weak form (WEF), and is proved that  it has a unique APPS, which is obtained via the mixed Galerkin finite element method (GFE) with implicit method (MGFEIM) that reduces the problem to solve the Galerkin nonlinear algebraic system  (GNAS).  In this part, the predictor and the corrector technique (PT and CT) are proved convergent and are used to transform the obtained GNAS to  linear (GLAS ), then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are studied. The results

     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

The main work of this paper is devoted to a new technique of constructing approximated solutions for linear delay differential equations using the basis functions power series functions with the aid of Weighted residual methods (collocations method, Galerkin’s method and least square method).