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]).
When optimizing the performance of neural network-based chatbots, determining the optimizer is one of the most important aspects. Optimizers primarily control the adjustment of model parameters such as weight and bias to minimize a loss function during training. Adaptive optimizers such as ADAM have become a standard choice and are widely used for their invariant parameter updates' magnitudes concerning gradient scale variations, but often pose generalization problems. Alternatively, Stochastic Gradient Descent (SGD) with Momentum and the extension of ADAM, the ADAMW, offers several advantages. This study aims to compare and examine the effects of these optimizers on the chatbot CST dataset. The effectiveness of each optimizer is evaluat
... Show MoreThe aim of this paper, is to study different iteration algorithms types two steps called, modified SP, Ishikawa, Picard-S iteration and M-iteration, which is faster than of others by using like contraction mappings. On the other hand, the M-iteration is better than of modified SP, Ishikawa and Picard-S iterations. Also, we support our analytic proof with a numerical example.
Maximum values of one particle radial electronic density distribution has been calculated by using Hartree-Fock (HF)wave function with data published by[A. Sarsa et al. Atomic Data and Nuclear Data Tables 88 (2004) 163–202] for K and L shells for some Be-like ions. The Results confirm that there is a linear behavior restricted the increasing of maximum points of one particle radial electronic density distribution for K and L shells throughout some Be-like ions. This linear behavior can be described by using the nth term formula of arithmetic sequence, that can be used to calculate the maximum radial electronic density distribution for any ion within Be like ions for Z<20.
The main purpose from this paper is to introduce a new kind of soft open sets in soft
topological spaces called soft omega open sets and we show that the collection of
every soft omega open sets in a soft topological space (X,~,E) forms a soft topology
~
on X which is soft finer than ~
. Moreover we use soft omega open sets to define
and study new classes of soft functions called weakly soft omega open functions and
weakly soft omega closed functions which are weaker than weakly soft open functions
and weakly soft closed functions respectively. We obtain their basic properties, their
characterizations, and their relationships with other kinds of soft functions between
soft topological spaces.<
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
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
In this paper, we introduce a new type of functions in bitopological spaces, namely, (1,2)*-proper functions. Also, we study the basic properties and characterizations of these functions . One of the most important of equivalent definitions to the (1,2)*-proper functions is given by using (1,2)*-cluster points of filters . Moreover we define and study (1,2)*-perfect functions and (1,2)*-compact functions in bitopological spaces and we study the relation between (1,2)*-proper functions and each of (1,2)*-closed functions , (1,2)*-perfect functions and (1,2)*-compact functions and we give an example when the converse may not be true .
We dealt with the nature of the points under the influence of periodic function chaotic functions associated functions chaotic and sufficient conditions to be a very chaotic functions Palace