The increase globally fossil fuel consumption as it represents the main source of energy around the world, and the sources of heavy oil more than light, different techniques were used to reduce the viscosity and increase mobility of heavy crude oil. this study focusing on the experimental tests  and modeling with Back Feed Forward Artificial Neural Network (BFF-ANN) of the dilution technique to reduce a  heavy oil viscosity that was collected from the south- Iraq oil fields using organic solvents, organic diluents with different weight percentage  (5, 10 and  20 wt.% )  of  (n-heptane, toluene, and a mixture of  different ratio

The research aims to characterize the strategic plan of the Educational Professional Development Center, to reveal the most important training needs for teachers from this center, to reveal the extent to which this center meets those needs, and to identify the differences between teacher responses about the degree of importance, availability of those needs according to variables of sex, specialization, and years of experience. This descriptive study adopted a questionnaire applied to (256) teachers in the K.S.A. The results of the study showed that all training needs ranged in the degree of importance from large to very large and that the most important were the skills associated with communicating with members of the learning community.

This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)

Let R be a ring with 1 and W is a left Module over R. A Submodule D of an R-Module W is small in W(D ≪ W) if whenever a Submodule V of W s.t W = D + V then V = W. A proper Submodule Y of an R-Module W is semismall in W(Y ≪_S W) if Y = 0 or Y/F ≪ W/F ∀ nonzero Submodules F of Y. A Submodule U of an R-Module E is essentially semismall(U ≪es E), if for every non zero semismall Submodule V of E, V∩U ≠ 0. An R-Module E is essentially semismall quasi-Dedekind(ESSQD) if Hom(E/W, E) = 0 ∀ W ≪es E. A ring R is ESSQD if R is an ESSQD R-Module. An R-Module E is a scalar R-Module if, ∀ , ∃ s.t V(e) = ze ∀ . In this paper, we study the relationship between ESSQD Modules with scalar and multiplication Modules. We show that

Abstract
The research aims to build a training program to develop some executive functions for kindergarten children. To achieve this goal, the two researchers built the program according to the following steps:
1. Determining the general objective of the program.
2. Determining the behavioral objectives of the program.
3. Determining the included content in the program.
4. Implementing the content of the activities of the program.
5. Evaluating the Program.
The program included (12) training activities, the training activities included several items: the title of the activity, the time of implementation of the activity, the general objective of the activity, the procedural behavioral objective, the means and tools u

An Optimal Algorithm for HTML Page Building Process

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th