The present study focuses on the deformation of neutron-rich nuclei near the neutron drip line. The nuclei of interest include 28O, 42Si, 58Ca, 80Ni, 100Kr, 122Ru, 152Ba, 166Sm, and 176Er. The relativistic Hartree - Bogoliubov (RHB) approach with effective density-dependent point coupling is utilized to investigate the triaxial deformation, and Skyrme - Hartree - Fock + Bardeen - Cooper - Schrieffer is used to analyze the axial deformation. The study aimed to understand the interplay between nuclear forces, particle interactions, and shell structure to gain insights into the unique behavior of neutron-rich nuclei. Despite these nuclei containing magic numbers, their shapes are still affected by the nucleons' collective behavior and

In this article, a numerical method integrated with statistical data simulation technique is introduced to solve a nonlinear system of ordinary differential equations with multiple random variable coefficients. The utilization of Monte Carlo simulation with central divided difference formula of finite difference (FD) method is repeated n times to simulate values of the variable coefficients as random sampling instead being limited as real values with respect to time. The mean of the n final solutions via this integrated technique, named in short as mean Monte Carlo finite difference (MMCFD) method, represents the final solution of the system. This method is proposed for the first time to calculate the numerical solution obtained fo

This paper presents the motion programming and control of omni-directional mobile robot through the process of building and programming a small robotic platform with secondary design criteria of modularity and simplified control. This is accomplished by combining the positive aspects of several different robotics platform ideas. The platform is shaped like an equilateral triangle with a servo motor, sensors, and omni-wheel, controlled by a PIC microcontroller.

      In this work the kinematics, inverse kinematics and dynamic module for the platform is derived. Two search algorithms (the wall-following search and the “most-open-area” search) is designed, tested, and analyzed experimentally.

In this paper, the developed sprite allocation method is designed to be coherent with the introduced block-matching method in order to minimize the allocation process time for digital video. The accomplished allocation process of sprite region consists of three main steps. The first step is the detection of sprite area; where the sequence of frames belong to Group of Video sequence are analysed to detect the sprite regions which survive for long time, and to determine the sprite type (i.e., whether it is static or dynamic). Then as a second step, the flagged survived areas are passed through the gaps/islands removal stage to enhance the detected sprite areas using post-processing operations. The third step is partitioning the sprite area in

Abstract

      In this study, we compare between the autoregressive approximations (Yule-Walker equations, Least Squares , Least Squares ( forward- backword ) and Burg’s (Geometric and Harmonic ) methods, to determine the optimal approximation to the time series generated from the first - order moving Average non-invertible process, and fractionally - integrated noise process, with several values for d (d=0.15,0.25,0.35,0.45) for different sample sizes (small,median,large)for two processes . We depend on figure of merit function which proposed by author Shibata in 1980, to determine the theoretical optimal order according to min

Gumbel distribution was dealt with great care by researchers and statisticians. There are traditional methods to estimate two parameters of Gumbel distribution known as Maximum Likelihood, the Method of Moments and recently the method of re-sampling called (Jackknife). However, these methods suffer from some mathematical difficulties in solving them analytically. Accordingly, there are other non-traditional methods, like the principle of the nearest neighbors, used in computer science especially, artificial intelligence algorithms, including the genetic algorithm, the artificial neural network algorithm, and others that may to be classified as meta-heuristic methods. Moreover, this principle of nearest neighbors has useful statistical featu

A new approach for baud time (or baud rate) estimation of a random binary signal is presented. This approach utilizes the spectrum of the signal after nonlinear processing in a way that the estimation error can be reduced by simply increasing the number of the processed samples instead of increasing the sampling rate. The spectrum of the new signal is shown to give an accurate estimate about the baud time when there is no apriory information or any restricting preassumptions. The performance of the estimator for random binary square waves perturbed by white Gaussian noise and ISI is evaluated and compared with that of the conventional estimator of the zero crossing detector.