Abstract

      The nuclear structure of ^28-40Si isotopes toward neutron dripline has been investigated in framework of shell model with Skyrme-Hrtree-Fock method using certain Skyrme parameterizations. Moreover, investigations of static properties such as nuclear densities for proton, neutron, mass, and, charge densities with their corresponding rms radii, neutron skin thicknesses, binding energies, separation energies, shell gap, and pairing gap have been performed using the most recent Skyrme parameterization. The calculated results have been compared with available experimental data to identify which of these parameterizations introduced equivalent results with the ex

This paper presents seven modified Adomian Decomposition Method (ADM) techniques for efficiently solving initial value problems, especially those involving non-homogeneous and nonlinear differential equations. While the classical ADM is effective for linear homogeneous cases, it has difficulties solving more complex problems. The proposed modifications—from MADM1 to MLADM—include Maclaurin and Taylor expansions, Laplace transforms, and single-step iterations.• These modifications enhance convergence, reduce complexity, and improve accuracy.• Each method offers specific advantages, such as accelerating convergence (MADM2, RADM4), simplifying computation (TSADM5), and achieving higher accuracy (MLADM).• Numerical examples confirm th

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

Deepfake is a type of artificial intelligence used to create convincing images, audio, and video hoaxes and it concerns celebrities and everyone because they are easy to manufacture. Deepfake are hard to recognize by people and current approaches, especially high-quality ones. As a defense against Deepfake techniques, various methods to detect Deepfake in images have been suggested. Most of them had limitations, like only working with one face in an image. The face has to be facing forward, with both eyes and the mouth open, depending on what part of the face they worked on. Other than that, a few focus on the impact of pre-processing steps on the detection accuracy of the models. This paper introduces a framework design focused on this asp

With the growth of mobile phones, short message service (SMS) became an essential text communication service. However, the low cost and ease use of SMS led to an increase in SMS Spam. In this paper, the characteristics of SMS spam has studied and a set of features has introduced to get rid of SMS spam. In addition, the problem of SMS spam detection was addressed as a clustering analysis that requires a metaheuristic algorithm to find the clustering structures. Three differential evolution variants viz DE/rand/1, jDE/rand/1, jDE/best/1, are adopted for solving the SMS spam problem. Experimental results illustrate that the jDE/best/1 produces best results over other variants in terms of accuracy, false-positive rate and false-negative

Multiple sclerosis (MS) is a neurodegenerative disorder with various clinical types. Glial fibrillary acidic protein (GFAP) is significantly elevated in the cerebrospinal fluid (CSF) of MS patients compared with that of healthy controls. The aim of this study is to evaluate serum levels of GFAP in relation to disease activity in relapsing-remitting MS patients and to compare them with those of healthy controls. Method: This study involved 58 MS patients of relapsing-remitting MS (RRMS) type, 22 in an active stage of the disease and 36 in remission, and 50 healthy individuals as age- and sex-matched controls. Blood samples were taken from the patients at the MS Clinic of the Baghdad Teaching Hospital, and the serum levels of GFAP were determ

The university course timetable problem (UCTP) is typically a combinatorial optimization problem. Manually achieving a useful timetable requires many days of effort, and the results are still unsatisfactory. unsatisfactory. Various states of art methods (heuristic, meta-heuristic) are used to satisfactorily solve UCTP. However, these approaches typically represent the instance-specific solutions. The hyper-heuristic framework adequately addresses this complex problem. This research proposed Particle Swarm Optimizer-based Hyper Heuristic (HH PSO) to solve UCTP efficiently. PSO is used as a higher-level method that selects low-level heuristics (LLH) sequence which further generates an optimal solution. The proposed a