In this scientific paper, we describe an algorithm to test if the weighted
Dynkin diagram of type -Cn corresponds to one of the nilpotent orbits of sp2n,
then we defined the necessary and sufficient condition on this representative
that makes the
diagram even. We applied this algorithm on one of the weighted
Dynkin diagrams of type –C3 to prove that it is true
This paper introduces some isomorphism-invariants for groups and uses
them to test two finitely presented groups. The introduced algorithm starts with
the construction of all cyclic groups contained in the groups under test, then it
compares the d
istribution of a particular set of elements in the constructed
cyclic groups. The algorithm leads to one of these two results:
1. The groups have the same "fingerprint"
2. The groups are not isomorphic
This papers reports the investigation of extensions of the group by means of the cyclic group A=<a> of order p, where p is a prime number.
It has been concluded from this work that, all non isomorphic extensions of
the group C(n) by means of the group A ,that correspond to irreducible
representations of the group A , are: - p Z
Through this study we will explain the application of data mining
and business intelligence using the data existed in the library of
the Arab International University. This data has been linked to the
data of the students on the academic system of
the university.
The study will also answer questions that affect the work of the
educational institution in general and the library in particular,
propose solutions to improve the work of the library and its
services, enhance library working methods, and specify indicators
related to the role of information resources in the educational
operation.
