Theoretical spectroscopic study of  Beryllium Oxide has been carried out, Boltzmann distribution of P, Q and R branches in the range of (0<J<13) at temperature 4200K for (0-0) band for electronic transitions B¹Σ⁺-A¹Π and B¹Σ-X¹Σ. The Boltzmann distribution of these branches has a maximum values at equal J approximately while the values of relative population are different. For the B¹Σ⁺- X¹Σ⁺ transition the branch's lines extend towards lower wavenumber. This is because (B_v'-B_v") value is negative, i.e  B_v'< B_v" For B¹Σ⁺-A¹Π

The objective of the study was to identify the effectiveness of a training program based on the employment of the educational portal in the development of the skills of the administrative body in the basic education schools in Dhofar Governorate. To achieve the goal, a training program was designed that includes the skills of the educational portal to be met by the administrative body and measuring its effectiveness. A questionnaire to identify training needs, and a notecard to evaluate performance. The study sample consisted of (70) individuals of the administrative staff. The researchers used the descriptive-analytical method to identify the training needs, design and build the training program and the experimental method for applying

In this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates

The issue of increasing the range covered by a wireless sensor network with restricted sensors is addressed utilizing improved CS employing the PSO algorithm and opposition-based learning (ICS-PSO-OBL). At first, the iteration is carried out by updating the old solution dimension by dimension to achieve independent updating across the dimensions in the high-dimensional optimization problem. The PSO operator is then incorporated to lessen the preference random walk stage's imbalance between exploration and exploitation ability. Exceptional individuals are selected from the population using OBL to boost the chance of finding the optimal solution based on the fitness value. The ICS-PSO-OBL is used to maximize coverage in WSN by converting r

This paper discussed the solution of an equivalent circuit of solar cell, where a single diode model is presented. The nonlinear equation of this model has suggested and analyzed an iterative algorithm, which work well for this equation with a suitable initial value for the iterative. The convergence of the proposed method is discussed. It is established that the algorithm has convergence of order six. The proposed algorithm is achieved with a various values of load resistance. Equation by means of equivalent circuit of a solar cell so all the determinations is achieved using Matlab in ambient temperature. The obtained results of this new method are given and the absolute errors is demonstrated.

Background and Aim: due to the rapid growth of data communication and multimedia system applications, security becomes a critical issue in the communication and storage of images. This study aims to improve encryption and decryption for various types of images by decreasing time consumption and strengthening security. Methodology: An algorithm is proposed for encrypting images based on the Carlisle Adams and Stafford Tavares CAST block cipher algorithm with 3D and 2D logistic maps. A chaotic function that increases the randomness in the encrypted data and images, thereby breaking the relation sequence through the encryption procedure, is introduced. The time is decreased by using three secure and private S-Boxes rather than using si

Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over