Journal of Kufa for Mathematics and Computer

The main purpose of this paper is to find the
rational valued characters table of the group Q2p×D4 when p is a prime number, which is denoted by ≡*(Q2p×D4), where Q2p is denoted to quaternion group of order 4p, such that for each positive integer p, there are two generators x and y for Q2p satisfies Q2p={xh yk, 0 ,k=0,1}which has the properties x2p=y4=I, yxry-1=x-rand D4 is the dihedral group of order 8 is generate by a rotation r of order 4 and reflection s of order 2. The eight elements of D4 can be written as: {I *,r,r2 ,r3 ,s,sr,sr2 ,sr3 }with properties srk s = r-k , k = 0,1,2,3.

character matrix ( ) from the character table of and finding the invariant factors of this matrix, the primary decomposition of the factor group where is determined. Also, we found the general form of this decomposition for .

—Software-defined networking SDN is
gaining a sharp increase in adoption by very wellknown companies Like Google and Microsoft.
Currently, the two stands out reliability and security
are the most issues that hampering the SDN rapid
growth. This paper aims to contribute to this growing
area of research by exploring the SDN security
issues. Novel approach will be proposed by utilizing
the well-known access control approach called
theusage control UCON model and also the Flog
policy language of software defined networks SDNs.
This work will be produced as a formal modelling
via high-level abstract language like Flog.

Image matching techniques play an essential
role in many real world applications such as
content based image retrieval (CBIR),
computer vision, and near duplicate images.
The state of the art methods are generally
assumed that the content of images is not
private. This reduces the utilization of these
methods to work within only environments
where images are publicly access. Essentially,
this assumption limits more practical
applications, e.g., image matching between
two security agencies, where images are
confidential. This paper addresses the problem
of privacy-preserving image matching between
two parties where images should not be
revealed to each other. The descriptor set of
the queried party needs to be generated and
encrypted properly using a secret key at the
queried party side before being transferred to
the other party. We have developed a secure
scheme to measure the cosine similarity
between two descriptor sets without
decryption. Several experiments are conducted
to investigate the performance of the proposed
scheme.

Clustering represents one of the most popular
knowledge extraction algorithms in data mining techniques.
Hierarchical and partitioning approaches are widely used in this
field. Each has its own advantages, drawbacks and goals. Kmeans represents the most popular partitioning
clusteringtechnique, however it suffers from two major
drawbacks; time complexity and its sensitivity to the initial
centroid values. The work in this paper presents an approach for
estimating the starting initial centroids throughout three process
including density based, normalization and smoothing ideas. The
proposed algorithm has a strong mathematical foundation.
The proposed approach was tested using a free standard data
(20000 records). The results showed that the approach has better
complexity and ensures the clustering convergence.

In this research, the well-known encryption
algorithms in the encryption Systems, namely DES
& RC4 and the advantages and disadvantages of
each algorithm are reviewed and evaluated. These
two algorithms are combined to produce of new
algorithm which is more efficient unscrambling due
to the increasing of the level of complexity that
make it highly resistance to several attacks. The
new algorithm is implemented to show its
efficiency in term of time complexity, (i.e.
Breaking the code will be much more complicated
than if it would have been occurring through the
use of each algorithm individually), this process
can be achieved with a very small time difference
(approximately neglected in the encryption
process(. When this algorithm is applied and tested
in practice the following result has been obtained:
When a block is encrypted using the DES
algorithm, the time spent may be (0.000034)
milliseconds, but when using the new algorithm to
encrypt the same block, the time taken will be
about (0.000042) milliseconds. To encrypt 1024
blocks using the DES algorithm, it will take a time
of (0.0406),while by using the new algorithm the
time taken for encryption is only (0.051). This
gives very little increase in time compared to
increasing of complexity obtained. Since the new
algorithm combining from the two previous, ones
allows us to encrypt each block with a key differs
from the other one (i.e. each block is encrypted
with a different key depending on the preceding
block), making it very difficult to break the code
leading to an increase in security and information
protection against decoding

In this paper, we will consider
variationaliteration method (VIM) for solvingtime fractional non linear wave like
with variable coeffcient. In this method we usean approximate value for time fractional derivativewhen find Lagrange
multiplier.Three examples show theefficiency and the importance of the method.