The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).

المستخلص:

          في هذا البحث , استعملنا طرائق مختلفة لتقدير معلمة القياس للتوزيع الاسي كمقدر الإمكان الأعظم ومقدر العزوم ومقدر بيز في ستة أنواع مختلفة عندما يكون التوزيع الأولي لمعلمة القياس : توزيع لافي  (Levy) وتوزيع كامبل من النوع الثاني وتوزيع معكوس مربع كاي وتوزيع معكوس كاما وتوزيع غير الملائم (Improper) وتوزيع

In this paper, we presented new types of Mc-function by using 𝜔-open and 𝑁-open sets some of them are weaker than Mc-function and some are stronger, which are 𝜔Mc-function, M𝜔c-function, 𝜔M𝜔c-function, 𝑁Mc-function, M𝑁c-function and 𝑁M𝑁c-function, also we submitted new kinds of continuous functions and compact functions and we illustrated the relationships between these types. The purpose of this paper is to expand the study of Mcfunction and to get results that we need to find the relationship with the types that have been introduced.

The current study aimed to investigate the viability of biofilm formation klebsilla pneumoniae and Staphylococcus aureus. 440 urine samples were collected from patients suffering from urinary tract infection (UTI) from those who were admitted and visitors to Al-Ramadi Teaching Hospital, Al-Yarmouk Teaching Hospital, Al-Ramadi Teaching Hospital for women and children and , Teaching Laboratories in the Medical City for both genders for a period extended from 5 July, 2017 to 10 October, 2017. Samples were diagnosed by culturing them on a selective media and by biochemical testes , also, diagnosis was ensured by using VITEK-2 compact system. Results showed that K.pneumoniae isolation ratio was 17.1%(68) and S.aureus ratio was 13.1%(52). Thei

The theory of probabilistic programming  may be conceived in several different ways. As a method of programming it analyses the implications of probabilistic variations in the parameter space of linear or nonlinear programming model. The generating mechanism of such probabilistic variations in the economic models may be due to incomplete information about changes in demand, pro­duction and technology, specification errors about the econometric relations presumed for different economic agents, uncertainty of various sorts and the consequences of imperfect aggregation or disaggregating of economic variables. In this Research we discuss the probabilistic programming problem when the coefficient b_i is random variable

Salinity of soil or irrigation water is one of the most important obstacle towards crop production and productivity, especially with the increasing scarcity of fresh water in Iraq and the Arab countries. The impact of salinity will be alleviated with the increasing temperature due to global warming. The objectives of this article was to shed some light on traits more related to salinity stress tolerance in oats, and to identify genetic variation of these traits. A split-plot arrangement experiment with RCBD was applied through 2011-2013 on the farm of Dept. of Field Crops/Coll. of Agric./Univ. of Baghdad. The oats cultivars; Hamel, Pimula and Genzania were set in sub-plots, whereas water quality was set in main-plots. Water quality had two

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

Suppose R has been an identity-preserving commutative ring, and suppose V has been a legitimate submodule of R-module W. A submodule V has been J-Prime Occasionally as well as occasionally based on what’s needed, it has been acceptable: x ∈ V + J(W) according to some of that r ∈ R, x ∈ W and J(W) an interpretation of the Jacobson radical of W, which x ∈ V or r ∈ [V: W] = {s ∈ R; sW ⊆ V}. To that end, we investigate the notion of J-Prime submodules and characterize some of the attributes of has been classification of submodules.

In this research note approximately prime submodules is defined as a new generalization of prime submodules of unitary modules over a commutative ring with identity. A proper submodule  of an -module  is called an approximaitly prime submodule of  (for short app-prime submodule), if when ever , where , , implies that either  or . So, an ideal  of a ring  is called app-prime ideal of  if   is an app-prime submodule of -module . Several basic properties, characterizations and examples of approximaitly prime submodules were given. Furthermore, the definition of approximaitly prime radical of submodules of modules were introduced, and some of it is properties were established.