This research is devoted to study the strengthening technique for the existing reinforced concrete beams using external post-tensioning. An analytical methodology is proposed to predict the value of the effective prestress force for the external tendons required to close cracks in existing beams. The external prestressing force required to close cracks in existing members is only a part from the total strengthening force.
A computer program created by Oukaili (1997) and developed by Alhawwassi (2008) to evaluate curvature and deflection for reinforced concrete beams or internally prestressed concrete beams is modified to evaluate the deflection and the stress of the external tendons for the externally strengthened beams using Matlab

This paper presents a proposed neural network algorithm to solve the shortest path problem (SPP) for communication routing. The solution extends the traditional recurrent Hopfield architecture introducing the optimal routing for any request by choosing single and multi link path node-to-node traffic to minimize the loss. This suggested neural network algorithm implemented by using 20-nodes network example. The result shows that a clear convergence can be achieved by 95% valid convergence (about 361 optimal routes from 380-pairs). Additionally computation performance is also mentioned at the expense of slightly worse results.

  In this paper, we introduce and study the concept of S-coprime submodules, where a proper submodule N of an R-module M is called S-coprime submodule if M N is S-coprime Rmodule. Many properties about this concept are investigated.

  Let L be a commutative ring with identity and let W be a unitary left L- module. A submodule D of an L- module W is called  s- closed submodule denoted by  D ≤sc W, if D has   no  proper s- essential extension in W, that is , whenever D ≤ W such that D ≤se H≤ W, then D = H. In  this  paper,  we study  modules which satisfies  the ascending chain  conditions (ACC) and descending chain conditions (DCC) on this kind of submodules.

Let R be a commutative ring with identity 1 and M be a unitary left R-module. A submodule N of an R-module M is said to be approximately pure submodule of an R-module, if for each ideal I of R. The main purpose of this paper is to study the properties of the following concepts: approximately pure essentialsubmodules, approximately pure closedsubmodules and relative approximately pure complement submodules. We prove that: when an R-module M is an approximately purely extending modules and N be Ap-puresubmodulein M, if M has the Ap-pure intersection property then N is Ap purely extending.

Data security is a significant requirement in our time. As a result of the rapid development of unsecured computer networks, the personal data should be protected from unauthorized persons and as a result of exposure AES algorithm is subjected to theoretical attacks such as linear attacks, differential attacks, and practical attacks such as brute force attack these types of attacks are mainly directed at the S-BOX and since the S-BOX table in the algorithm is static and no dynamic so this is a major weakness for the S-BOX table, the algorithm should be improved to be impervious to future dialects that attempt to analyse and break the algorithm  in order to remove these weakness points, Will be generated dynamic substitution box (S-B

The global food supply heavily depends on utilizing fertilizers to meet production goals. The adverse impacts of traditional fertilization practices on the environment have necessitated the exploration of new alternatives in the form of smart fertilizer technologies (SFTs). This review seeks to categorize SFTs, which are slow and controlled-release Fertilizers (SCRFs), nano fertilizers, and biological fertilizers, and describes their operational principles. It examines the environmental implications of conventional fertilizers and outlines the attributes of SFTs that effectively address these concerns. The findings demonstrate a pronounced environmental advantage of SFTs, including enhanced crop yields, minimized nutrient loss, improved nut

     Let R be a commutative ring with unity and an R-submodule N is called semimaximal if and only if

 the sufficient conditions of F-submodules to be semimaximal .Also the concepts of (simple , semisimple) F- submodules and quotient F- modules are  introduced and given some  properties .

Merging biometrics with cryptography has become more familiar and a great scientific field was born for researchers. Biometrics adds distinctive property to the security systems, due biometrics is unique and individual features for every person. In this study, a new method is presented for ciphering data based on fingerprint features. This research is done by addressing plaintext message based on positions of extracted minutiae from fingerprint into a generated random text file regardless the size of data. The proposed method can be explained in three scenarios. In the first scenario the message was used inside random text directly at positions of minutiae in the second scenario the message was encrypted with a choosen word before ciphering

Let M be an R-module, where R is a commutative ring with unity. A submodule N of M is called e-small (denoted by N e  M) if N + K = M, where K e  M implies K = M. We give many properties related with this type of submodules.