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]).

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

The root-mean square-radius of proton, neutron, matter and charge radii, energy level, inelastic longitudinal form factors, reduced transition probability from the ground state to first-excited 2⁺ state of even-even isotopes, quadrupole moments, quadrupole deformation parameter, and the occupation numbers for some calcium isotopes for A=42,44,46,48,50 are computed using fp-model space and FPBM interaction. ⁴⁰Ca nucleus is regarded as the inert core for all isotopes under this model space with valence nucleons are moving throughout the fp-shell model space involving 1f_7/2, 2p_3/2, 1f_5/2, and 2p_1/2 orbits. Model space is used to present calculations using FPBM intera

In this paper, we study and investigate the quark anti-quark interaction mechanism through the annihilation process. The production of photons in association with interaction quark and gluon in the annihilation process. We investigate the effect of critical temperature, strength coupling and photons energy in terms of the quantum chromodynamics model theory framework. We find that the use of large critical temperature Tc =134 allows us to dramatically increase the strength coupling of quarks interaction. Its sensitivity to decreasing in photons rate with respect to strength coupling estimates. We also discuss the effect of photons energy on the rate of the photon , such as energies in range (1.5 to 5 GeV).The photons rate increases

Summary:

This research revolves around the probing of those whom Ibn Hajar said, "He has a vision", its significance, and the ruling on the connection and transmission to it.  The number of narrators reached fifty-one (51) narrators, among whom it was said, “He has a vision, whether it is definite or possibly. Some of them had a vision and companionship.”They are eleven (11) narrators, And among them were those who had visions and had no company, and their number was twenty-one (21) narrators, and among them were those who had no vision and nor company, and their number is nineteen (19) narrators.
As a result , whoever said about him “has a vision” and has companions, his hadith is connected, even i

The purpose of this paper is to introduce and prove some coupled coincidence fixed point theorems for self mappings satisfying -contractive condition with rational expressions on complete partially ordered metric spaces involving altering distance functions with mixed monotone property of the mapping. Our results improve and unify a multitude of coupled fixed point theorems and generalize some recent results in partially ordered metric space. An example is given to show the validity of our main result.