This paper is used for solving component Volterra nonlinear systems by means of the combined Sumudu transform with Adomian decomposition process. We equate the numerical results with the exact solutions to demonstrate the high accuracy of the solution results. The results show that the approach is very straightforward and effective.

        This paper is concerned with the solution of the nanoscale structures consisting of the   with an effective mass envelope function theory, the electronic states of the  quantum ring are studied.  In calculations, the effects due to the different effective masses of electrons in and out the rings are included. The energy levels of the electron are calculated in the different shapes of rings, i.e., that the inner radius of rings sensitively change the electronic states. The energy levels of the electron are not sensitively dependent on the outer radius for large rings. The structures of  quantum rings are studied by the one electronic band Hamiltonian effective mass approximati

This paper propose the semi - analytic technique using two point osculatory interpolation to construct polynomial solution for solving some well-known classes of Lane-Emden type equations which are linear ordinary differential equations, and disusse the behavior of the solution in the neighborhood of the singular points along with its numerical approximation. Many examples are presented to demonstrate the applicability and efficiency of the methods. Finally , we discuss behavior of the solution in the neighborhood of the singularity point which appears to perform satisfactorily for singular problems.

    Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the proble

A computational investigation has been carried out on the design and properties of the electrostatic mirror. In this research, we suggest a mathematical expression to represent the axial potential of an electrostatic mirror. The electron beam path under zero magnification condition had been investigated as mirror trajectory with the aid of fourth – order – Runge – Kutta method. The spherical and chromatic aberration coefficients of mirror has computed and normalized in terms of the focal length. The choice of the mirror depends on the operational requirements, i.e. each optical element in optical system has suffer from the chromatic aberration, for this case, it is use to operate the mirror in optical system at various values

In this paper, a compact genetic algorithm (CGA) is enhanced by integrating its selection strategy with a steepest descent algorithm (SDA) as a local search method to give I-CGA-SDA. This system is an attempt to avoid the large CPU time and computational complexity of the standard genetic algorithm. Here, CGA dramatically reduces the number of bits required to store the population and has a faster convergence. Consequently, this integrated system is used to optimize the maximum likelihood function lnL(φ1, θ1) of the mixed model. Simulation results based on MSE were compared with those obtained from the SDA and showed that the hybrid genetic algorithm (HGA) and I-CGA-SDA can give a good estimator of (φ1, θ1) for the ARMA(1,1) model. Anot

The problem of job burnout has become one of the main problems for researchers in social welfare organizations (social protection bodies) - one of the formations of the Ministry of Labor and Social Affairs. Its negative effects increased in light of the COVID-19 pandemic, and in light of the Corona pandemic, the pressures and burdens of workers varied, which resulted in high rates of anxiety, tension, and intellectual and physical exhaustion, and then negatively affected their efficiency in performing work at the individual and organizational level, especially after the increasing tasks of these Bodies in carrying out their role in achieving the general goals and objectives as beingThe general goals are that they are responsible for providi

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the