Nuclear structure of 20,22Ne isotopes has been studied via the shell model with Skyrme-Hartree-Fock calculations. In particular, the transitions to the low-lying positive and negative parity excited states have been investigated within three shell model spaces; sd for positive parity states, spsdpf large-basis (no-core), and zbme model spaces for negative parity states. Excitation energies, reduced transition probabilities, and elastic and inelastic form factors were estimated and compared to the available experimental data. Skyrme interaction was used to generate a one-body potential in the Hartree-Fock calculations for each selected excited states, which is then used to calculate the single-particle matrix elements. Skyrme interac

The erythrocyte aggregation is an important physiological phenomenon in the circulation of blood. It is a basic characteristic of normal blood that plays a major role in the cardiovascular system, especially in the microcirculation. This study explained the kinetics of single cells rouleaux formation one- dimensional aggregate and three- dimensional aggregate, during simultaneous, and the effect of hematocrit on the process of aggregation and sedimentation. The present study was done on forty one healthy subjects. Laser light is passed through a well mixed sample of blood and the forward scattered light intensities recorded continuously. The samples were prepared with different hematocrit, (10%, 15%, 20%, and 25%). Increasing

In this paper, the theoretical cross section in pre-equilibrium nuclear reaction has been studied for the reaction  at energy 22.4 MeV. Ericson’s formula of partial level density PLD and their corrections (William’s correction and spin correction) have been substituted  in the theoretical cross section and compared with the experimental data for  nucleus. It has been found that the theoretical cross section with one-component PLD from Ericson’s formula when  doesn’t agree with the experimental value and when . There is little agreement only at the high value of energy range with  the experimental cross section. The theoretical cross section that depends on the one-component William's formula and on-component corrected to spi

Face Identification is an important research topic in the field of computer vision and pattern recognition and has become a very active research area in recent decades. Recently multiwavelet-based neural networks (multiwavenets) have been used for function approximation and recognition, but to our best knowledge it has not been used for face Identification. This paper presents a novel approach for the Identification of human faces using Back-Propagation Adaptive Multiwavenet. The proposed multiwavenet has a structure similar to a multilayer perceptron (MLP) neural network with three layers, but the activation function of hidden layer is replaced with multiscaling functions. In experiments performed on the ORL face database it achieved a

Face Identification is an important research topic in the field of computer vision and pattern recognition and has become a very active research area in recent decades. Recently multiwavelet-based neural networks (multiwavenets) have been used for function approximation and recognition, but to our best knowledge it has not been used for face Identification. This paper presents a novel approach for the Identification of human faces using Back-Propagation Adaptive Multiwavenet. The proposed multiwavenet has a structure similar to a multilayer perceptron (MLP) neural network with three layers, but the activation function of hidden layer is replaced with multiscaling functions. In experiments performed on the ORL face database it achieved a

With time progress importance of hiding information become more and more and all steganography applications is like computer games between hiding and extracting data, or like thieves and police men always thieve hides from police men in different ways to keep him out of prison. The sender always hides information in new way in order not to be understood by the attackers and only the authorized receiver can open the hiding message. This paper explores our proposed random method in detail, how chooses locations of pixel in randomly , how to choose a random bit to hide information in the chosen pixel, how it different from other approaches, how applying information hiding criteria on the proposed project, and attempts to test out in code, and

In today's digital era, the importance of securing information has reached critical levels. Steganography is one of the methods used for this purpose by hiding sensitive data within other files. This study introduces an approach utilizing a chaotic dynamic system as a random key generator, governing both the selection of hiding locations within an image and the amount of data concealed in each location. The security of the steganography approach is considerably improved by using this random procedure. A 3D dynamic system with nine parameters influencing its behavior was carefully chosen. For each parameter, suitable interval values were determined to guarantee the system's chaotic behavior. Analysis of chaotic performance is given using the