Realizing the full potential of wireless sensor networks (WSNs) highlights many design issues, particularly the trade-offs concerning multiple conflicting improvements such as maximizing the route overlapping for efficient data aggregation and minimizing the total link cost. While the issues of data aggregation routing protocols and link cost function in a WSNs have been comprehensively considered in the literature, a trade-off improvement between these two has not yet been addressed. In this paper, a comprehensive weight for trade-off between different objectives has been employed, the so-called weighted data aggregation routing strategy (WDARS) which aims to maximize the overlap routes for efficient data aggregation and link cost

studied, and its important properties and relationship with both closed and open Nano sets were investigated. The new Nano sets were linked to the concept of Nano ideal, the development of nano ideal mildly closed set and it has been studied its properties. In addition to the applied aspect of the research, a sample was taken from patients infected with viral hepatitis, and by examining the infected people and using closed and open (nano mildly. and nano ideal mildly) sets, the important symptoms that constitute the core of this dangerous examining the infected people and using closed and open (nano mildly. and nano ideal mildly) sets, the important symptoms that constitute the core of this dangerous disease.

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

The regressor-based adaptive control is useful for controlling robotic systems with uncertain parameters but with known structure of robot dynamics. Unmodeled dynamics could lead to instability problems unless modification of control law is used. In addition, exact calculation of regressor for robots with more than 6 degrees of freedom is hard to be calculated, and the task could be more complex for robots. Whereas the adaptive approximation control is a powerful tool for controlling robotic systems with unmodeled dynamics. The local (partitioned) approximation-based adaptive control includes representation of the uncertain matrices and vectors in the robot model as finite combinations of basis functions. Update laws for the weighting matri

The main work of this paper is devoted to a new technique of constructing approximated solutions for linear delay differential equations using the basis functions power series functions with the aid of Weighted residual methods (collocations method, Galerkin’s method and least square method).

The use of credit cards for online purchases has significantly increased in recent years, but it has also led to an increase in fraudulent activities that cost businesses and consumers billions of dollars annually. Detecting fraudulent transactions is crucial for protecting customers and maintaining the financial system's integrity. However, the number of fraudulent transactions is less than legitimate transactions, which can result in a data imbalance that affects classification performance and bias in the model evaluation results. This paper focuses on processing imbalanced data by proposing a new weighted oversampling method, wADASMO, to generate minor-class data (i.e., fraudulent transactions). The proposed method is based on th

In this paper by using δ-semi.open sets we introduced the concept of weakly δ-semi.normal and δ-semi.normal spaces . Many properties and results were investigated and studied. Also we present the notion of δ- semi.compact spaces and we were able to compare with it δ-semi.regular spaces

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.