Global Analysis and Discrete Mathematics
Volume:1 Issue: 2, Summer and Autumn 2016

In this paper, the nonlinear dynamic system of equations, a type of nuclear ssion reactor is solved analytically and numerically. Considering that the direct solution of three-dimensional dynamical systems analysis and more in order to determine the stability and instability, in terms of algebraic
systems is dicult. Using certain situations in mathematics called Hurwitz criterion, Necessary and sucient conditions for a stable dynamical system is determined and the parameters that most in uence the quality of the dynamic behavior of a nuclear ssion reactor have been determined.

This paper presents a brief instructions to nd geodesics equa-tions on two dimensional surfaces in R3. The resulting geodesic equations are solved numerically using Computer Program Matlab, the geodesics are dis-played through Figures.

In this paper we are supposed to define the θ−vector field on the n−surface S and then investigate about the existence and uniqueness of its integral curves by the Theory of Ordinary Differential Equations. Then the subject is followed through some examples.

In this study, we aim to construct a traveling wave solution for nonlinear partial differential equations. In this regards, a cosine-function method is used to find and generate the exact solutions for three different types of nonlinear partial differential equations such as general regularized long wave equation (GRLW), general Korteweg-de Vries equation (GKDV) and general equal width wave equation (GEWE) which are the major soliton equations.

We consider the Lax representation of the new two-component coupled integrable system recently discovered by the author. Connection of the hierarchy of infinitely many Lax pairs with each other is presented.

Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and a hybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all examples the hybrid method results better solutions than genetic algorithm.

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic- ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed by t - 1 or fewer participants. The proposed schemes by Shamir and Blakley have some drawbacks. Multi-secret and veri able schemes were invented to improve old schemes. We analysis the security of hash based secret sharing schemes, and show that the schemes have some drawbacks. In particular it is shown that the the schemes are not resistant against deceptive behavior by dealer and participants.