In this paper, we introduce the notation of the soft bornological group to solve the problem of boundedness for the soft group. We combine soft set theory with bornology space to produce a new structure which is called soft bornological group. So that both the product and inverse maps are soft bounded. As well as, we study the actions of the soft bornological group on the soft bornological sets. The aim soft bornological set is to partition into orbital classes by acting soft bornological group on the soft bornological set. In addition, we explain the centralizer, normalizer, and stabilizer in details. The main important results are to prove that the product of soft bornological groups is soft bornological group and the action for different elements are the same actions.
This paper deals with prediction the effect of soil re-moulding (smear) on the ultimate bearing capacity of driven piles. The proposed method based on detecting the decrease in ultimate bearing capacity of the pile shaft (excluding the share of pile tip) after sliding downward. This was done via conducting an experimental study on three installed R.C piles in a sandy clayey silt soil. The piles were installed so that a gap space is left between its tip and the base of borehole. The piles were tested for ultimate bearing capacity according to ASTM D1143 in three stages. Between each two stages the pile was jacked inside the borehole until a sliding of about 200mm is achieved to simulate the soil re-moulding due to actual pile driving. The re
... Show MoreMR Younus, Nasaq Journal, 2022
PDBN Rashid, International Journal of Development in Social Sciences and Humanities, 2023
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]).