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.

In the cool semi-arid highland areas of Sana'a, a plant
phonological study of forty two species revealed that there was one
major outburst of plant emergence corresponding with the first period
of the heavy rainfall which take place during March-April. The second
period of heavy rainfall which takes place during July-August shows
moderate effect on emergence and growth.
Plant Species included annuals, biennials and perennials. Perennials
showed
the
following
growth
forms
hemicryptophytes,
chamaephytes, phanerophytes, and cryptophytes. Most plants where
herbaceous and a few where woody
Different Individuals of the same species could behave as annuals,
biennials or perennials. In areas where

     The searching process using a binary codebook of combined Block Truncation Coding (BTC) method and Vector Quantization (VQ), i.e. a full codebook search for each input image vector to find the best matched code word in the codebook, requires a long time.   Therefore, in this paper, after designing a small binary codebook, we adopted a new method by rotating each binary code word in this codebook into 900 to 2700 step 900 directions. Then, we systematized each code word depending on its angle  to involve four types of binary code books (i.e. Pour when , Flat when  , Vertical when, or Zigzag). The proposed scheme was used for decreasing the time of the coding procedure, with very small distortion per block, by designing s

     The searching process using a binary codebook of combined Block Truncation Coding (BTC) method and Vector Quantization (VQ), i.e. a full codebook search for each input image vector to find the best matched code word in the codebook, requires a long time.   Therefore, in this paper, after designing a small binary codebook, we adopted a new method by rotating each binary code word in this codebook into 90⁰ to 270⁰ step 90⁰ directions. Then, we systematized each code word depending on its angle  to involve four types of binary code books (i.e. Pour when , Flat when  , Vertical when, or Zigzag). The proposed scheme was used for decreasing the time of the coding pro

In this paper, we present the almost approximately nearly quasi compactly packed (submodules) modules as an application of the almost approximately nearly quasiprime submodule. We give some examples, remarks, and properties of this concept. Also, as the strong form of this concept, we introduce the strongly, almost approximately nearly quasi compactly packed (submodules) modules. Moreover, we present the definitions of almost approximately nearly quasiprime radical submodules and almost approximately nearly quasiprime radical submodules and give some basic properties of these concepts that will be needed in section four of this research. We study these two concepts extensively.

      In this article, a numerical study of compressible and weak compressible Newtonian flows is achieved for a time marching, Galerkin algorithm. A comparison between two numerical techniques for such flows, namely the artificial compressibility method (AC–method) and the fully artificial compressibility method (FAC–method) is performed. In the first artificial compressibility parameter (  is added to the continuity equation, while this parameter is added to both continuity and momentum equations in the second technique. This strategy is implemented to treat the governing equations of Newtonian flow in cylindrical coordinates (axisymmetric). Particularly, this study concerns with the effect of the artificial compressibility p

In previous our research, the concepts of visible submodules and fully visible modules were introduced, and then these two concepts were fuzzified to fuzzy visible submodules and fully fuzzy. The main goal of this paper is to study the relationships between fully fuzzy visible modules and some types of fuzzy modules such as semiprime, prime, quasi, divisible, F-regular, quasi injective, and duo fuzzy modules, where under certain conditions it has been proven that each fully fuzzy visible module is fuzzy duo. In addition, there are many various properties and important results obtained through this research, which have been illustrated. Also, fuzzy Artinian modules and fuzzy fully stable modules have been introduced, and we study the rel

The research is an article that teaches some classes of fully stable Banach - Å modules. By using Unital algebra studies the properties and characterizations of all classes of fully stable Banach - Å modules. All the results are existing, and they've been listed to complete the requested information.