This paper deals with the F-compact operator defined on probabilistic Hilbert space and gives some of its main properties.

The main purpose of this paper is to study some results concerning reduced ring with another concepts as semiprime ring ,prime ring,essential ideal ,derivations and homomorphism ,we give some results a bout that.

The present work describes numerical and experimental investigation of the heat transfer characteristics in a plate-fin, having built-in piezoelectric actuator mounted on the base plate (substrate). The geometrical configuration considered in the present work is representative of a single element of the plate-fin and triple fins. Air is taken as the working fluid. A performance data for a single rectangular fin and triple fins are provided for different frequency levels (5, 30 and
50HZ) , different input power (5,10,20,30,40 and 50W) and different inlet velocity (0.5, 1, 2, 3, 4, 5 and 6m/s) for the single rectangular fin and triple fins with and without oscillation. The investigation was also performed with different geometrical fin

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

     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 .