The aim of the present work to study the effect of changing velocity (Reynold's number) on oxygen cathodic polarization using brass rotating cylinder electrode in 0.1, 0.3 and 0.5N NaCl solutions (PH = 7) at temperatures 40, 50 and 600 C. Cathodic polarization experiments were conducted as a function of electrode rotational speed and concentration.

The effect of using three different interpolation methods (nearest neighbour, linear and non-linear) on a 3D sinogram to restore the missing data due to using angular difference greater than 1° (considered as optimum 3D sinogram) is presented. Two reconstruction methods are adopted in this study, the back-projection method and Fourier slice theorem method, from the results the second reconstruction proven to be a promising reconstruction with the linear interpolation method when the angular difference is less than 20°.

In this paper, a fast lossless image compression method is introduced for compressing medical images, it is based on splitting the image blocks according to its nature along with using the polynomial approximation to decompose image signal followed by applying run length coding on the residue part of the image, which represents the error caused by applying polynomial approximation. Then, Huffman coding is applied as a last stage to encode the polynomial coefficients and run length coding. The test results indicate that the suggested method can lead to promising performance.

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com

Information about soil consolidation is essential in geotechnical design. Because of the time and expense involved in performing consolidation tests, equations are required to estimate compression index from soil index properties. Although many empirical equations concerning soil properties have been proposed, such equations may not be appropriate for local situations. The aim of this study is to investigate the consolidation and physical properties of the cohesive soil. Artificial Neural Network (ANN) has been adapted in this investigation to predict the compression index and compression ratio using basic index properties. One hundred and ninety five consolidation results for soils tested at different construction sites

Abstract

   The aim of this research is to concentrate on the of knowledge management activities, initial activities: (Acquisition, Selection, Generation, Assimilation, Emission) knowledge, and support activities: (Measurement, Control, Coordination, Leadership) that is manipulate and controlling in achieving knowledge management cases in organization, that’s is leads to  knowledge chain model, then determining the level of membership for these activities to knowledge chain model in a sample of Iraqi organization pushed by knowledge (Universities). The research depends on check list for gaining the data required, theses check list designed by apparently  in diagnosing research dimensions and measurem

      It is frequently asserted that an advantage of a binary search tree implementation of a set over linked list implementation is that for reasonably well balanced binary search trees the average search time (to discover whether or not a particular element is present in the set) is O(log N) to the base 2 where N is the number of element in the set (the size of the tree).  This paper presents an experiment for measuring and comparing the obtained binary search tree time with the expected time (theoretical), this experiment proved the correctness of the hypothesis, the experiment is carried out using a program in turbo Pascal with recursion technique implementation and a statistical method  to prove th

he concept of small monoform module was introduced by Hadi and Marhun, where a module U is called small monoform if for each non-zero submodule V of U and for every non-zero homomorphism f ∈ Hom R (V, U), implies that ker f is small submodule of V. In this paper the author dualizes this concept; she calls it co-small monoform module. Many fundamental properties of co-small monoform module are given. Partial characterization of co-small monoform module is established. Also, the author dualizes the concept of small quasi-Dedekind modules which given by Hadi and Ghawi. She show that co-small monoform is contained properly in the class of the dual of small quasi-Dedekind modules. Furthermore, some subclasses of co-small monoform are investiga