The set of all (n×n) non-singular matrices over the field F. And this set forms a group under the operation of matrix multiplication. This group is called the general linear group of dimension  over the field F, denoted by . The determinant of these matrices is a homomorphism from  into F* and the kernel of this homomorphism was the special linear group and denoted by  Thus  is the subgroup of  which contains all matrices of determinant one.

The rationally valued characters of the rational representations are written as a linear combination of the induced characters for the groups discussed in this paper. We find the Artin indicator for this group after studying the rationally valued characters of the rational

The set of all (n×n) non-singular matrices over the field F this set forms a group under the operation of matrix multiplication. This group is called the general linear group of dimension  over the field F, denoted by . The determinant of these matrices is a homomorphism from  into F* and the kernel of this homomorphism was the special linear group and denoted by  Thus  is the subgroup of  which contains all matrices of determinant one.

The rational valued characters of the rational representations written as a linear combination of the induced characters for the groups  discuss in this paper and find the Artin indicator for this group after study the rational valued characters of the rational representations and the induce

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

The wide spread of Computer Based Test in the Iraqi universities raised an important concern for some scholars thinking about integrating computers as an academic assessment tool before making big change in the examination systems, that concern is: how the computerized test score is effected in comparison to old paper and pencil . This paper researches whether test scores of Iraqi students varies in the computer, Pencil based tests, sixty-four postgraduate graduates from Iraqi universities. Thirty five female and twenty nine male, all graduated from colleges of science in specializations other than computer science and applying for postgraduate studies in the Iraqi

The present study aims to identify the effectiveness of deductive group patterns in developing the creative thinking of second-intermediate-grade pupils in history discipline. The current null hypothesis has been investigated: There are no statistically significant differences at (0.05) between the scores mean of the experimental group pupils who were taught according to the deductive group pattern and the scores mean of the control group pupils who were taught according to traditional method in creative thinking testing. the study sample was divided into two groups: an experimental group of (30) female students and a control group of (31) female students. The two groups are equalized based on the variables of age, the scores of the firs

Artificial Intelligence Algorithms have been used in recent years in many scientific fields. We suggest employing artificial TABU algorithm to find the best estimate of the semi-parametric regression function with measurement errors in the explanatory variables and the dependent variable, where measurement errors appear frequently in fields such as sport, chemistry, biological sciences, medicine, and epidemiological studies, rather than an exact measurement.

For several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.