Let R be a commutative ring with identity, and let M be a unity R-module. M is called a bounded R-module provided that there exists an element x?M such that annR(M) = annR(x). As a generalization of this concept, a concept of semi-bounded module has been introduced as follows: M is called a semi-bounded if there exists an element x?M such that . In this paper, some properties and characterizations of semi-bounded modules are given. Also, various basic results about semi-bounded modules are considered. Moreover, some relations between semi-bounded modules and other types of modules are considered.

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

      Faintly continuous (FC) functions, entitled faintly S-continuous and faintly δS-continuous functions have been introduced and investigated via a -open and -open sets. Several characterizations and properties of faintly S-continuous and faintly -Continuous functions were obtained. In addition, relationships between faintly s- Continuous and faintly S-continuous function and other forms of FC function were investigated. Also, it is shown that every faintly  S-continuous is weakly S-continuous. The Convers is shown to be satisfied only if the co-domain of the function is almost regular.

In this work,  an explicit formula for a class of Bi-Bazilevic univalent functions involving differential operator is given, as well as the determination of upper bounds for the general Taylor-Maclaurin coefficient of a functions belong to this class, are established Faber polynomials are used as a coordinated system to study the geometry of the manifold of coefficients for these functions. Also determining bounds for the first two coefficients of such functions.

         In certain cases, our initial estimates improve some of the coefficient bounds and link them to earlier thoughtful results that are published earlier.

      A new approach presented in this study to determine the optimal edge detection threshold value. This approach is base on extracting small homogenous blocks from unequal mean targets. Then, from these blocks we generate small image with known edges (edges represent the lines between the contacted blocks). So, these simulated edges can be assumed as true edges .The true simulated edges, compared with the detected edges in the small generated image is done by using different thresholding values. The comparison based on computing mean square errors between the simulated edge image and the produced edge image from edge detector methods. The mean square error computed for the total edge image (Er), for edge regio

In this work, an analytical approximation solution is presented, as well as a comparison of the Variational Iteration Adomian Decomposition Method (VIADM) and the Modified Sumudu Transform Adomian Decomposition Method (M STADM), both of which are capable of solving nonlinear partial differential equations (NPDEs) such as nonhomogeneous Kertewege-de Vries (kdv) problems and the nonlinear Klein-Gordon. The results demonstrate the solution’s dependability and excellent accuracy.