This study aims to recognize the most common thinking styles and level of the need for cognitive university students , the relation between thinking styles and the need for cognitive, and there are differences according to gender .The sample consists of (250) males and females university students for the academic year (2013-2014), and the researcher uses two scales;" thinking styles scale (Harison &Bramson, 1986), and the need for cognitive scale" (Cacioppo, Petty & Kao , 1996).
The results show that there is difference in the range of the prevalence of the thinking styles among university students , the scientific thinking style is the most common , the students have got the arrange level of the need for cognitive , and there

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

Hypothesis CO2 geological storage (CGS) involves different mechanisms which can store millions of tonnes of CO2 per year in depleted hydrocarbon reservoirs and deep saline aquifers. But their storage capacity is influenced by the presence of different carboxylic compounds in the reservoir. These molecules strongly affect the water wetness of the rock, which has a dramatic impact on storage capacities and containment security. However, precise understanding of how these carboxylic acids influence the rock’s CO2-wettability is lacking. Experiments We thus systematically analysed these relationships as a function of pressure, temperature, storage depth and organic acid concentrations. A particular focus was on identifying organic acid conce

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

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

Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the

The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).