Let  be a commutative ring with 1 and  be left unitary  . In this paper we introduced and studied concept of semi-small compressible module (a     is said to be semi-small compressible module if  can be embedded in every nonzero semi-small submodule of . Equivalently,  is  semi-small compressible module if there exists a monomorphism  , ,     is said to be semi-small retractable module if  , for every non-zero  semi-small sub module in . Equivalently,  is semi-small retractable if there exists a homomorphism  whenever  .     In this paper we introduce and study the concept of semi-small compressible and semi-small retractable s as a generalization of compressible  and retractable  respectively and give some of their adv

Let be an associative ring with identity and let be a unitary left -module. Let  be a non-zero submodule of .We say that  is a semi- - hollow module if for every submodule  of  such that  is a semi- - small submodule ( ). In addition, we say that  is a semi- - lifting module if for every submodule  of , there exists a direct summand  of  and  such that  

The main purpose of this work was to develop the properties of these classes of module.

Let  be a commutative ring with 1 and  be left unitary  . In this paper we introduced and studied concept of semi-small compressible module (a     is said to be semi-small compressible module if  can be embedded in every nonzero semi-small submodule of . Equivalently,  is  semi-small compressible module if there exists a monomorphism  , ,     is said to be semi-small retractable module if  , for every non-zero  semi-small sub module in . Equivalently,  is semi-small retractable if there exists a homomorphism  whenever  .

    In this paper we introduce and study the concept of semi-small compressible and semi-small retractable s as a generalization of compressible  and retractable  respectively and give some of

     In this study, an efficient novel technique is presented to obtain a more accurate analytical solution to nonlinear pantograph differential equations. This technique combines the Adomian decomposition method (ADM) with the homotopy analysis method concepts (HAM). The whole integral part of HAM is used instead of an integral part of ADM approach to get higher accurate results. The main advantage of this technique is that it  gives a large and more extended convergent region of iterative approximate solutions for long time intervals that rapidly converge to the exact solution. Another advantage is capable of providing a continuous representation of the approximate solutions, which gives  better information over whole time interv

This paper discussed the solution of an equivalent circuit of solar cell, where a single diode model is presented. The nonlinear equation of this model has suggested and analyzed an iterative algorithm, which work well for this equation with a suitable initial value for the iterative. The convergence of the proposed method is discussed. It is established that the algorithm has convergence of order six. The proposed algorithm is achieved with a various values of load resistance. Equation by means of equivalent circuit of a solar cell so all the determinations is achieved using Matlab in ambient temperature. The obtained results of this new method are given and the absolute errors is demonstrated.

Simulated annealing (SA) has been an effective means that can address difficulties related to optimization problems. is now a common discipline for research with several productive applications such as production planning. Due to the fact that aggregate production planning (APP) is one of the most considerable problems in production planning, in this paper, we present multi-objective linear programming model for APP and optimized by . During the course of optimizing for the APP problem, it uncovered that the capability of was inadequate and its performance was substandard, particularly for a sizable controlled problem with many decision variables and plenty of constraints. Since this algorithm works sequentially then the current state wi

The swarm intelligence and evolutionary methods are commonly utilized by researchers in solving the difficult combinatorial and Non-Deterministic Polynomial (NP) problems. The N-Queen problem can be defined as a combinatorial problem that became intractable for the large ‘n’ values and, thereby, it is placed in the NP class of problems. In the present study, a solution is suggested for the N-Queen problem, on the basis of the Meerkat Clan Algorithm (MCA). The problem of n-Queen can be mainly defined as one of the generalized 8-Queen problem forms, for which the aim is placing 8 queens in a way that none of the queens has the ability of killing the others with the use of the standard moves of the chess queen. The Meerkat Clan environm