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.

     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 .

Considering the magnitude of its economic, social and political impact, unemployment represents a crucial challenge confronting the majority of the countries of the world. The problem of the study was the high rates of unemployment in Sudan and the inability of economic growth rates to keep pace with the steady increases in unemployment rates during the study period. This study aimed to identify the economic and social variables influencing unemployment rate in Sudan, in addition to measuring the impact of these variables over the period (1981-2015). Data were collected from databases of the World Bank and Atlas of the World's data .The study hypothesized the presence of statistically significant and direct relationship between u

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.

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 pure relative to submodule T of M (Simply T-pure) if for each ideal A of R, N?AM=AN+T?(N?AM). In this paper, the properties of the following concepts were studied: Pure essential submodules relative to submodule T of M (Simply T-pure essential),Pure closed submodules relative to submodule T of M (Simply T-pure closed) and relative pure complement submodule relative to submodule T of M (Simply T-pure complement) and T-purely extending. We prove that; Let M be a T-purely extending module and let N be a T-pure submodule of M. If M has the T-PIP, then N is T-purely extending.

In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la