Purpose:  The research aims to explore the impact Business Intelligence System (BIS) and Knowledge Conversion Processes (KCP) in the Building Learning Organization (LO) in KOREK Telecom Company in Baghdad city.

Design/methodology/approach: in order to achieve the objectives of the research has been the development of a questionnaire prepared for this purpose and then has tested the search in the telecommunications sector, representatives of one of the telecommunications companies in Baghdad city, has therefore chosen KOREK Telecom company as a sample for research, and the choice was based on the best standard international companies to serve mobile communications in terms o

Derivational word formation process is one of the most substantial linguistic procedures that solves many problems in the translation of the language new vocabulary and helps to comprehend the smallest language component that not simply semantically and structurally explain the elements  of both Russian and Arabic but also enables translators to comprehend the derivational method procedures of both languages. It also reveals the structural aspects of translation equivalences, cognitive and semantic foundations of translation. The rapid development of languages and the appearance of a new vocabulary like ṭabaʿa "print → ṭābiʿat "printer", kataba "to write" → kātib → kātibat, rafaʿa "to raise" → rāfiʿat "a crane" d

      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

The aim of the research is to study the comparison between (ARIMA) Auto Regressive Integrated Moving Average and(ANNs) Artificial Neural Networks models and to select the best one for prediction the monthly relative humidity values depending upon the standard errors between estimated and observe values . It has been noted that both can be used for estimation and the best on among is (ANNs) as the values (MAE,RMSE, R2) is )0.036816,0.0466,0.91) respectively for the best formula for model (ARIMA) (6,0,2)(6,0,1) whereas the values of estimates relative to model (ANNs) for the best formula (5,5,1) is (0.0109, 0.0139 ,0.991) respectively. so that model (ANNs) is superior than (ARIMA) in a such evaluation.

ABSTRUCT

In This Paper, some semi- parametric spatial models were estimated, these models are, the semi – parametric spatial error model (SPSEM), which suffer from the problem of spatial errors dependence, and the semi – parametric spatial auto regressive model (SPSAR). Where the method of maximum likelihood was used in estimating the parameter of spatial error          ( λ ) in the model (SPSEM), estimated  the parameter of spatial dependence ( ρ ) in the model ( SPSAR ), and using the non-parametric method in estimating the smoothing function m(x) for these two models, these non-parametric methods are; the local linear estimator (LLE) which require finding the smoo

       In this work, we prove that the triple linear partial differential equations (PDEs) of elliptic type (TLEPDEs) with a given classical continuous boundary control vector (CCBCVr) has a unique "state" solution vector (SSV)  by utilizing the Galerkin's method (GME). Also, we prove the existence of a classical continuous boundary optimal control vector (CCBOCVr) ruled by the TLEPDEs. We study the existence solution for the triple adjoint equations (TAJEs) related with the triple state equations (TSEs). The Fréchet derivative (FDe) for the objective function is derived. At the end we prove the necessary "conditions" theorem (NCTh) for optimality for the problem.

There are many tools and S/W systems to generate finite state automata, FSA, due to its importance in modeling and simulation and its wide variety of applications. However, no appropriate tool that can generate finite state automata, FSA, for DNA motif template due to the huge size of the motif template. In addition to the optional paths in the motif structure which are represented by the gap. These reasons lead to the unavailability of the specifications of the automata to be generated. This absence of specifications makes the generating process very difficult. This paper presents a novel algorithm to construct FSAs for DNA motif templates. This research is the first research presents the problem of generating FSAs for DNA motif temp

The main objective of this paper is to designed algorithms and implemented in the construction of the main program designated for the determination the tenser product of representation for the special linear group.

The most important topic for psychologist generally is factor of education and it's active tools because learning needs active perception for stimulus that recived by the educator and give it avalue and meaning , Need for cognition is
very important in the various daily fields of life , especially in learning and teaching and the academy work , it help with shifting the learning level for people , and icreas the intense and challenge between them
The research endeavored to achieve the following aim :
1- Measuring the level of peripheral perception for the university student .
2- Measuring the level of need for cognition for the university student .
3- Measuring the level of peripheral perception for the university student