Maximum values of one particle radial electronic density distribution has been calculated by using Hartree-Fock (HF)wave function with data published by[A. Sarsa et al. Atomic Data and Nuclear Data Tables 88 (2004) 163–202] for K and L shells for some Be-like ions. The Results confirm that there is a linear behavior restricted the increasing of maximum points of one particle radial electronic density distribution for K and L shells throughout some Be-like ions. This linear behavior can be described by using the nth term formula of arithmetic sequence, that can be used to calculate the maximum radial electronic density distribution for any ion within Be like ions for Z<20.

A mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc

Iraqi oil crudes have some of the physical and chemical characteristics that distinguish it from other types of oil crudes in the world. Some of these features such us molecular composition, rheological, viscosity and emulsions are studied carefully by researchers. In this work, a comparative study of the linear and the non-linear optical properties for typical heavy and light crude oils of Iraqi origin was studied utilizing Z-scan technique. The He -Ne laser of wavelength 632.8 nm had been used for this purpose. These samples were collected from Basra and Kut oil fields. The values of the non-linear refractive index (n₂), non-linear absorption coefficient (β), and third-order electrical susceptibility (χ³) were e

Many of the dynamic processes in different sciences are described by models of differential equations. These models explain the change in the behavior of the studied process over time by linking the behavior of the process under study with its derivatives. These models often contain constant and time-varying parameters that vary according to the nature of the process under study in this We will estimate the constant and time-varying parameters in a sequential method in several stages. In the first stage, the state variables and their derivatives are estimated in the method of penalized splines(p- splines) . In the second stage we use pseudo lest square to estimate constant parameters, For the third stage, the rem

Smart cities have recently undergone a fundamental evolution that has greatly increased their potentials. In reality, recent advances in the Internet of Things (IoT) have created new opportunities by solving a number of critical issues that are allowing innovations for smart cities as well as the creation and computerization of cutting-edge services and applications for the many city partners. In order to further the development of smart cities toward compelling sharing and connection, this study will explore the information innovation in smart cities in light of the Internet of Things (IoT) and cloud computing (CC). IoT data is first collected in the context of smart cities. The data that is gathered is uniform. The Internet of Things,

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