Journal of Kufa for Mathematics and Computer

Our aim in this paper is to solve some
special types of second order partial
differential equations with variable
coefficients and the general form:
Such that , , ,
, and are functions
of and ,
by using the assumption
. This assumption
will transforms the second order partial
differential equations to first order linear
ordinary differential equations with two
independent functions and .

In this paper ,we will find the solution
of some kinds of homogeneous non-linear
ordinary differential equations of second
order which are defined as the following
\"The equation that each degree of any term
in it is equal in the degree with the other
terms in its dependent variable and
derivatives \".Specific assumptions is used
to find the general solution of these kinds
of equations, this assumption transforms
the non-linear differential equations of
second order to the simple formula of
differential equations of first order .

In this paper the stability of linear large scale system is studied, by using definite
matrices. The concept of family of linear system is introduced, by using permutation
matrices. A proposition is introduced to study the linear system in the large.

Information hiding techniques have recently been useful in a many
application areas, there are many techniques to achieve hiding data, and hiding text inside
image is one field of them. In this paper we hiding our data in round of image without
changing the details of image. The basic idea of the paper is to present a method that
hides information in cover image using Least Significant Bit (LSB) of light part of image
(.jpg) and coding method along with encryption so as to increase the security

In this work, we introduce the
concept of T- sequentially absolutely closed
spaces which is a generalization of the
concept of sequentially absolutely closed
spaces [1]. Several properties of this new
concept are proved.

By using a linear integral operator , a
class of multivalent functions of power order
is introduced. Some important results of this
class such as coefficient estimates , integral
means inequalities and other property are
found.

. The purpose of this work is to
construct an examples of arcs of type
when the points of weight zero are
greater than or equal seventy. We constructed a
monoidal arc when the points of weight
zero form a arc of type ( ),
also we constructed a maximum arc
of type ( ) in . Finally, we
proved that there are arcs of type
when the points of weight one lies on
only one weighting line of arcsand
the points of weight two lies on exactly two
weighting lines of arcs

In this research we will estimate the parameter of binomial distribution that has exponential family using
T.O.M (Term Omission Method) and compare it with (MLE) method using MSE (Mean Square Error) with
simulation.

In this paper, we studied the
geometric structure of one important
class of almost Hermitian manifold
which is called Viasman-Gray manifold.
This manifold is a generalization of the
classes nearly Kahler manifold and the
locally conformal Kahler manifold. We
provedthat, if Mis Viasman-Gray
manifold with flat conformal curvature
tensor, then M is a manifold of class
if and only if,Mis a manifold of flat
Ricci tensor. The necessary condition
that is of zero scalar curvature tensor
has been found. Finally, we proved that,
ifM is VG-manifold of class and of
flat Ricci tensor then Mis Kahler
manifold.

Let be a simple graph.
set is a dominating set of , if every vertex in
is adjacent to at least one vertex in . Let be
complete graph with order n. Let be the family of
dominating sets of a complete with cardinality , and
let . In this paper, we construct , and
obtain a recursive formula for . Using this
recursive formula, we consider the polynomial
, which we call domination
polynomial of complete graphs and obtain some
properties of this polynomial.

A Script worm is defined as a self-replicating and self-containing malicious scripting program that
can copy itself to remote computer in network and execute automatically.
In our work, we surveyed different types of script worms according to their spreading method like
Drive, Email, Network and Chat script worms, and analyzed the characteristics of their source codes
during the target finding and propagation phases of a worm‟s life cycle. From analyzing process, we
extracted general objects and methods that are mostly used by different types of script worms and
established the malicious common fixed patterns from them. Analyzed source code and extracted
malicious patterns enable us to identify the behavior of worms that could be helpful in developing a
broad spectrum of Anti-Script worm system software to detect and remove script worms.
When we implemented the proposed Anti-Script worm on the large number of the mentioned
above script worms, we saw that this system could detect and remove nearly all the known and
unknown script worms. Furthermore, the proposed system could distinguish between the malicious
scripts and the benign script files that contained the suspicious objects and methods by checking all
commands in every script files.

Let U denote the unit ball in the
complex plane, the Hardy space
2 H
is the
set of functions




n 0
^ n
f(z) f (n) z
holomorphic on U such that
  


2
n 0
^
f (n)
with
f (n)
^
denotes the Taylor coefficient of
f .
Let  be a holomorphic self-map of
U, the composition operator
C
induced by
 is defined on
2 H
by the equation
C f f (f H )
2

  
We have studied the composition
operator induced by the bijective map  and
discussed the adjoint of the composition
operator .We have look also at some
known properties of composition operator
and tried to get the analogue properties in
order to show how the results are changed
by changing the map  in U.
In order to make the work accessible
to the reader , we have included some
known results with the details of the proofs
for some cases and proved some results.

Our aim of this research is to find the complete
solution of some kinds of linear third order
partial differential equations of constant
coefficients which have the general form
where
Ai
i 1,2,...20
are constants.
By use the assumption
 
 u x dx v y dy w t dt Z x y t e
( ) ( ) ( )
( , , )
will
transform the above equation to the nonlinear
second order ordinary differential equation with
three independent functions
u(x) , v( y) and w(t)
.

This paper introduces a new topological
concept of v-semi-connected spaces which
depends on the works ofHamza[6] and
Dorsett[4].This space is stronger than the
semi-connected space, that is every v-semiconnected space is a semi-connected space
but the converse is not always true as well as
giving the condition that make the converse is
true which is the semi-normality. We prove
thatthis property is a topological property.

The aim of this paper is to introduce the
concepts of alpha star generalized ω - closed
sets, alpha star generalized ω - open sets and
study their basic properties in bitopological
spaces

. The main purpose of this paper is to
construct a ( ) arcs of type ( )
in projective plane of order 8. We proved that
there exist ( ) arc of type (12, 16)
when the points of weight 0 form a ( ) arc
of type (7, 0, 42, 24 ) and ( ) arc of
type (11, 15) when the points of weight 0 form
(7, ) arc of types (3, 12, 30, 28) and (2,15,
27, 29)

This work does not use the classical methods
(simplex method, Branch and Bound
techniques) which were normally used for
solving Linear programming models. The
proposed algorithm was considered for
implementation with Artificial Neural Network
(ANN) using MatLab tool box. It was found that
implementation of the neural network will
provide comprehensive results when applied
with any linear programming models. Besides
Artificial Neural Networks are artificial
intelligence methods for modeling complex
target functions, and are considered to be
among the most effective learning methods
currently known. Implementation in solving
linear programming models became very
interesting, as ANNs became appropriate
solution where a huge data (number of
variables and constraints) is considered. In this
work, general model of ANN specified for
solving the problem of linear programming will
be shown and discussed. The results show a
great improvement in prediction of results with
a minimum percentage error.