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]).
This work is devoted to define new generalized gamma and beta functions involving the recently suggested seven-parameter Mittag-Leffler function, followed by a review of all related special cases. In addition, necessary investigations are affirmed for the new generalized beta function, including, Mellin transform, differential formulas, integral representations, and essential summation relations. Furthermore, crucial statistical application has been realized for the new generalized beta function.
In this paper we use non-polynomial spline functions to develop numerical methods to approximate the solution of 2nd kind Volterra integral equations. Numerical examples are presented to illustrate the applications of these method, and to compare the computed results with other known methods.
Abstract
This research aim to overcome the problem of dimensionality by using the methods of non-linear regression, which reduces the root of the average square error (RMSE), and is called the method of projection pursuit regression (PPR), which is one of the methods for reducing dimensions that work to overcome the problem of dimensionality (curse of dimensionality), The (PPR) method is a statistical technique that deals with finding the most important projections in multi-dimensional data , and With each finding projection , the data is reduced by linear compounds overall the projection. The process repeated to produce good projections until the best projections are obtained. The main idea of the PPR is to model
... Show MoreChemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.
The research aims to apply one of the techniques of management accounting, which is the Quality Function Deployment(QFD) on the Pepsi product in Baghdad Soft Drinks Company and to determine the technical requirements objectively that have been applied in practice in Baghdad Soft Drinks Company / a private shareholding company, as it focuses on meeting the quality requirements and achieving positive quality to provide a product It meets the requirements of current and future customers, hence the importance of research that indicates that the Quality Function Deployment(QFD) is a useful tool to develop the requirements of new products, being a design process driven by customers through their voices, and thus contribute to achieve a competi
... Show MoreIn the literature, several correlations have been proposed for hold-up prediction in rotating disk contactor. However,
these correlations fail to predict hold-up over wide range of conditions. Based on a databank of around 611
measurements collected from the open literature, a correlation for hold up was derived using Artificial Neiral Network
(ANN) modeling. The dispersed phase hold up was found to be a function of six parameters: N, vc , vd , Dr , c d m / m ,
s . Statistical analysis showed that the proposed correlation has an Average Absolute Relative Error (AARE) of 6.52%
and Standard Deviation (SD) 9.21%. A comparison with selected correlations in the literature showed that the
developed ANN correlation noticeably
The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.