Suppose that A be an abelain ring with identity, B be a unitary (left) A-module, in this paper ,we introduce a type of modules ,namely Quasi-semiprime A-module, whenever is a Prime Ideal For proper submodule N of B,then B is called Quasi-semiprime module ,which is a Generalization of Quasi-Prime A-module,whenever annAN is a prime ideal for proper submodule N of B,then B is Quasi-prime module .A comprchensive study of these modules is given,and we study the Relationship between quasi-semiprime module and quasi-prime .We put the codition coprime over cosemiprime ring for the two cocept quasi-prime module and quasi-semiprime module are equavelant.and the cocept of prime module and quasi-semiprime module are equavelant.The codition of anti-hopfain make Quasi-Prime is Quasi-Semiprime A-module.Whenever B is Cyclic,Coprime C-Module,Where C be ring each ideal is semiprim,imlies Quasi-Prime,Quasi-SimePrime and annCB is Prime ideal are equaivelant.If F be eipemorphism from B1 B2 ,Whenever B1 is Quasi-SemiPrime Module,implies B2 is Quasi-semiprime A-Module and the iverse Image Of Quasi-Semiprime Is Quasi-SemiPrime A-Module.
The first step in this research is to find some of the necessary estimations in approximation by using certain algebraic polynomials, as well as we use certain specific points in approximation. There are many estimations that help to find the best approximation using algebraic polynomials and geometric polynomials. Throughout this research, we deal with some of these estimations to estimate the best approximation error using algebraic polynomials where the basic estimations in approximation are discussed and proven using algebraic polynomials that are discussed and proven using algebraic polynomials that are specified by the following points and if as well as if .
For the second step of the work, the estimatio
... Show MoreIn this paper, the Normality set will be investigated. Then, the study highlights some concepts properties and important results. In addition, it will prove that every operator with normality set has non trivial invariant subspace of .
The focus of this article is to add a new class of rank one of modified Quasi-Newton techniques to solve the problem of unconstrained optimization by updating the inverse Hessian matrix with an update of rank 1, where a diagonal matrix is the first component of the next inverse Hessian approximation, The inverse Hessian matrix is generated by the method proposed which is symmetric and it satisfies the condition of modified quasi-Newton, so the global convergence is retained. In addition, it is positive definite that guarantees the existence of the minimizer at every iteration of the objective function. We use the program MATLAB to solve an algorithm function to introduce the feasibility of
... Show MoreIn this paper, estimation of system reliability of the multi-components in stress-strength model R(s,k) is considered, when the stress and strength are independent random variables and follows the Exponentiated Weibull Distribution (EWD) with known first shape parameter θ and, the second shape parameter α is unknown using different estimation methods. Comparisons among the proposed estimators through Monte Carlo simulation technique were made depend on mean squared error (MSE) criteria
This paper describes a number of new interleaving strategies based on the golden section. The new interleavers are called golden relative prime interleavers, golden interleavers, and dithered golden interleavers. The latter two approaches involve sorting a real-valued vector derived from the golden section. Random and so-called “spread” interleavers are also considered. Turbo-code performance results are presented and compared for the various interleaving strategies. Of the interleavers considered, the dithered golden interleaver typically provides the best performance, especially for low code rates and large block sizes. The golden relative prime interleaver is shown to work surprisingly well for high puncture rates. These interleav
... Show MoreThis work generalizes Park and Jung's results by introducing the concept of generalized permuting 3-derivation on Lie ideal.
Let R be a prime ring and δ a right (σ,τ)-derivation on R. In the present paper we will prove the following results:
First, suppose that R is a prime ring and I a non-zero ideal of R if δ acts as a homomorphism on I then δ=0 on R, and if δ acts an anti- homomorphism on I then either δ=0 on R or R is commutative.
Second, suppose that R is 2-torsion-free prime ring and J a non-zero Jordan ideal and a subring of R, if δ acts as a homomorphism on J then δ=0 on J, and if δ acts an anti- homomorphism on J then either δ=0 on J or J
Z(R).
Solar cells has been assembly with electrolytes including I−/I−3 redox duality employ polyacrylonitrile (PAN), ethylene carbonate (EC), propylene carbonate (PC), with double iodide salts of tetrabutylammonium iodide (TBAI) and Lithium iodide (LiI) and iodine (I2) were thoughtful for enhancing the efficiency of the solar cells. The rendering of the solar cells has been examining by alteration the weight ratio of the salts in the electrolyte. The solar cell with electrolyte comprises (60% wt. TBAI/40% wt. LiI (+I2)) display elevated efficiency of 5.189% under 1000 W/m2 light intensity. While the solar cell with electrolyte comprises (60% wt. LiI/40% wt. TBAI (+I2)) display a lower efficiency of 3.189%. The conductivity raises with the
... Show MoreThe encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure. Most QC-LDPC codes have rank deficient parity matrix and this introduces extra complexity over the codes with full rank parity matrix. In this paper an encoding scheme of QC-LDPC codes is presented that is suitable for codes with full rank parity matrix and rank deficient parity matrx. The extra effort required by the codes with rank deficient parity matrix over the codes of full rank parity matrix is investigated.
Let M be a prime Γ-ring satisfying abc abc for all a,b,cM and
, with center Z, and U be a Lie (Jordan) ideal. A mapping d :M M
is called Γ- centralizing if u d u Z [ , ( )] for all uU and .In this paper
, we studied Lie and Jordan ideal in a prime Γ - ring M together with Γ -
centralizing derivations on U.