We present a reliable algorithm for solving, homogeneous or inhomogeneous, nonlinear ordinary delay differential equations with initial conditions. The form of the solution is calculated as a series with easily computable components. Four examples are considered for the numerical illustrations of this method. The results reveal that the semi analytic iterative method (SAIM) is very effective, simple and very close to the exact solution demonstrate reliability and efficiency of this method for such problems.
The investigation of determining solutions for the Diophantine equation over the Gaussian integer ring for the specific case of is discussed. The discussion includes various preliminary results later used to build the resolvent theory of the Diophantine equation studied. Our findings show the existence of infinitely many solutions. Since the analytical method used here is based on simple algebraic properties, it can be easily generalized to study the behavior and the conditions for the existence of solutions to other Diophantine equations, allowing a deeper understanding, even when no general solution is known.
One of the main techniques to achieve phase behavior calculations of reservoir fluids is the equation of state. Soave - Redlich - Kwong equation of state can then be used to predict the phase behavior of the petroleum fluids by treating it as a multi-components system of pure and pseudo-components. The use of Soave – Redlich – Kwon equation of state is popular in the calculations of petroleum engineering therefore many researchers used it to perform phase behavior analysis for reservoir fluids (Wang and Orr (2000), Ertekin and Obut (2003), Hasan (2004) and Haghtalab (2011))
This paper presents a new flash model for reservoir fluids in gas – oil se
With time progress importance of hiding information become more and more and all steganography applications is like computer games between hiding and extracting data, or like thieves and police men always thieve hides from police men in different ways to keep him out of prison. The sender always hides information in new way in order not to be understood by the attackers and only the authorized receiver can open the hiding message. This paper explores our proposed random method in detail, how chooses locations of pixel in randomly , how to choose a random bit to hide information in the chosen pixel, how it different from other approaches, how applying information hiding criteria on the proposed project, and attempts to test out in code, and
... Show More