Throughout this paper, we introduce the notion of weak essential F-submodules of F-modules as a generalization of  weak essential submodules. Also we study the homomorphic image and inverse image of weak essential F-submodules.

In this paper, as generalization of second modules we introduce type of modules namely (essentially second modules). A comprehensive study of this class of modules is given, also many results concerned with this type and other related modules presented.

      The concept of semi-essential semimodule has been studied by many researchers.

     In this paper, we will develop these results by setting appropriate conditions, and defining new properties, relating to our concept, for example (fully prime semimodule, fully essential semimodule and semi-complement subsemimodule) such that: if for each subsemimodule of -semimodule  is prime, then  is fully prime. If every semi-essential subsemimodule of -semimodule  is essential then  is fully essential. Finally, a prime subsemimodule  of  is called semi-relative intersection complement (briefly, semi-complement) of subsemimodule  in , if , and whenever  with  is a prime subsemimodule in , , then .  Furthermore, some res

Let R be a ring and let A be a unitary left R-module. A proper submodule H of an R-module A is called 2-absorbing , if rsa∈H, where r,s∈R,a∈A, implies that either ra∈H or sa∈H or rs∈[H:A], and a proper submodule H of an R-module A is called quasi-prime , if rsa∈H, where r,s∈R,a∈A, implies that either ra∈H or sa∈H. This led us to introduce the concept pseudo quasi-2-absorbing submodule, as a generalization of both concepts above, where a proper submodule H of an R-module A is called a pseudo quasi-2-absorbing submodule of A, if whenever rsta∈H,where r,s,t∈R,a∈A, implies that either rsa∈H+soc(A) or sta∈H+soc(A) or rta∈H+soc(A), where soc(A) is socal of an

With the wide developments of computer science and applications of networks, the security of information must be increased and make it more complex. The most important issues is how to control and prevent unauthorized access to secure information, therefore this paper presents a combination of two efficient encryption algorithms to satisfy the purpose of information security by adding a new level of encryption in Rijndael-AES algorithm. This paper presents a proposed Rijndael encryption and decryption process with NTRU algorithm, Rijndael algorithm is important because of its strong encryption. The proposed updates are represented by encryption and decryption Rijndael S-Box using NTRU algorithm. These modifications enhance the degree of

A total of 157 clinical samples were collected from different clinical specimens (urine, sputum, blood, swabs, and cannula) from several hospitals in Iraq. Among the samples, 51 isolates (32.48%) of Klebsiella pneumoniae were identified according to morphologicaland cultural characteristics as well as the Enterosystem 18R test. Higher numbers of K. pneumoniae isolates were observed in urine samples (26, 52%) than the other samples, and in females (70.6%) than males (29.4%) (female: male ratio of about 2.4:1). Antibiotic susceptibility of K. pneumoniae against 12 commonly used antibiotics was determined through the disc-diffusion method. The results revealed a higher resistance rate in 51 isolates (100%) against Cephalexin, followed by Ce

    The present study was performed to evaluate the anti-fungal effect of alcoholic extract of Solanum nigrum (AESn) on the growth of Microsporum canis, the causes agent of ring worm. The results of this work referred to the inhibitory effect of the studied extract on the growth of tested fungi. The percentages of inhibition were (7.88 %, 19.88%, 23.41%, 57.65%), in comparison to the control, when (2%, 4%, 6%,8% ) of tested extract were used, respectively. The data illustrated that the higher concentrations of the extract are applied, the more inhibition of fungal growth is produced. 

In this paper, the nonclassical approach to dynamic programming for the optimal control problem via strongly continuous semigroup has been presented. The dual value function VD ( .,. ) of the problem is defined and characterized. We find that it satisfied the dual dynamic programming principle and dual Hamilton Jacobi –Bellman equation. Also, some properties of VD (. , .) have been studied, such as, various kinds of continuities and boundedness, these properties used to give a sufficient condition for optimality. A suitable verification theorem to find a dual optimal feedback control has been proved. Finally gives an example which illustrates the value of the theorem which deals with the sufficient condition for optimality.

<

Often phenomena suffer from disturbances in their data as well as the difficulty of formulation, especially with a lack of clarity in the response, or the large number of essential differences plaguing the experimental units that have been taking this data from them. Thus emerged the need to include an estimation method implicit rating of these experimental units using the method of discrimination or create blocks for each item of these experimental units in the hope of controlling their responses and make it more homogeneous. Because of the development in the field of computers and taking the principle of the integration of sciences it has been found that modern algorithms used in the field of Computer Science genetic algorithm or ant colo

In thisipaper, we introduce the concepts of the modified tupledicoincidence points and the  mixed finiteimonotone property. Also the existenceiand uniquenessiof modified tupled coincidenceipoint is discusses without continuous condition for mappings having imixed finite monotoneiproperty in generalizedimetric spaces.