In this paper we show that the function , () p fLI α ∈ ,0<p<1 where I=[-1,1] can be approximated by an algebraic polynomial with an error not exceeding , 1 ( , , ) kp ft n ϕ αω where
,
1 ( , , ) kp ft n ϕ αω is the Ditizian–Totik modules of smoothness of unbounded function in , () p LI
Some researchers are interested in using the flexible and applicable properties of quadratic functions as activation functions for FNNs. We study the essential approximation rate of any Lebesgue-integrable monotone function by a neural network of quadratic activation functions. The simultaneous degree of essential approximation is also studied. Both estimates are proved to be within the second order of modulus of smoothness.
The purpose of this paper is to find the best multiplier approximation of unbounded functions in –space by using some discrete linear positive operators. Also we will estimate the degree of the best multiplier approximation in term of modulus of continuity and the averaged modulus.
The aim of this paper is to study the best approximation of unbounded functions in the
weighted spaces
,
1, 0 ,
p
p L α
α ≥>.
Key Words: Weighted space, unbounded functions, monotone approximation
The objective of this paper is to show modern class of open sets which is an -open. Some functions via this concept were studied and the relationships such as continuous function strongly -continuous function -irresolute function -continuous function.
Promoting the production of industrially important aromatic chloroamines over transition-metal nitrides catalysts has emerged as a prominent theme in catalysis. This contribution provides an insight into the reduction mechanism of p-chloronitrobenzene (p-CNB) to p-chloroaniline (p-CAN) over the γ-Mo2N(111) surface by means of density functional theory calculations. The adsorption energies of various molecularly adsorbed modes of p-CNB were computed. Our findings display that, p-CNB prefers to be adsorbed over two distinct adsorption sites, namely, Mo-hollow face-centered cubic (fcc) and N-hollow hexagonal close-packed (hcp) sites with adsorption energies of −32.1 and −38.5 kcal/mol, respectively. We establish that the activation of nit
... Show MoreIn this paper we introduce a new class of degree of best algebraic approximation polynomial Α,, for unbounded functions in weighted space Lp,α(X), 1 ∞ .We shall prove direct and converse theorems for best algebraic approximation in terms modulus of smoothness in weighted space
The association of phytoplasma was investigated in symptomatic tomato (
Adsorption of AniLine and some derivatives from aqueous. solution on kaolin clays surface was investigated, The isotherms were of type S3 d S4 according to Giles Classification.
The effect of introducing electron withdrawing groups and
electron donating
Groups in the aromatic ring on the adsorption process has been investigated ; The results showed that the extent of adsorption has been increased as a
... Show MoreIn this paper an improved weighted 0-1 knapsack method (WKM) is proposed to optimize the resource allocation process when the sum of items' weight exceeds the knapsack total capacity .The improved method depends on a modified weight for each item to ensure the allocation of the required resources for all the involved items. The results of the improved WKM are compared to the traditional 0-1 Knapsack Problem (KP). The proposed method dominates on the other one in term of the total optimal solution value of the knapsack .
Meerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of the meerkat animal. This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC). These two strategies increase the diversification and intensification of the proposed algorithm and boost the searching ability to find more quality solutions. The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems. The experimental results demonstrate that the proposed algorithm had overcome the basic algorithm in terms of solution quality, speed a
... Show More