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 m-consecutive-k-out-of-n: F linear and circular system consists of n sequentially connected components; the components are ordered on a line or a circle; it fails if there are at least m non-overlapping runs of consecutive-k failed components. This paper proposes the reliability and failure probability functions for both linearly and circularly m-consecutive-k-out-of-n: F systems. More precisely, the failure states of the system components are separated into two collections (the working and the failure collections); where each one is defined as a collection of finite mutual disjoint classes of the system states. Illustrative example is provided.

      Faintly continuous (FC) functions, entitled faintly S-continuous and faintly δS-continuous functions have been introduced and investigated via a -open and -open sets. Several characterizations and properties of faintly S-continuous and faintly -Continuous functions were obtained. In addition, relationships between faintly s- Continuous and faintly S-continuous function and other forms of FC function were investigated. Also, it is shown that every faintly  S-continuous is weakly S-continuous. The Convers is shown to be satisfied only if the co-domain of the function is almost regular.

A method for Approximated evaluation of linear functional differential equations is described. where a function approximation as a linear combination of a set of orthogonal basis functions which are chebyshev functions .The coefficients of the approximation are determined by (least square and Galerkin’s) methods. The property of chebyshev polynomials leads to good results , which are demonstrated with examples.

     In this paper, the class of meromorphic multivalent functions of the form by using fractional differ-integral operators is introduced. We get Coefficients estimates, radii of convexity and star likeness. Also closure theorems and distortion theorem for the class ,  is calculaed.

The process of selection assure the objective of receiving for chosen ones to high levels more than other ways , and the problem of this research came by these inquires (what is the variables of limits we must considered when first preliminaries selections for mini basket ? and what is the proper test that suits this category ? and is there any standards references it can be depend on it ?) also the aims of this research that knowing the limits variables to basketball mini and their tests as a indicators for preliminaries for mini basketball category in ages (9-12) years and specifies standards (modified standards degrees in following method) to tests results to some limits variables for research sample. Also the researchers depends on (16)

Some relations of inclusion and their properties are investigated for functions of type " -valent that involves the generalized operator of Srivastava-Attiya by using the principle of strong differential subordination.

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

Some experiments need to know the extent of their usefulness to continue providing them or not. This is done through the fuzzy regression discontinuous model, where the Epanechnikov Kernel and Triangular Kernel were used to estimate the model by generating data from the Monte Carlo experiment and comparing the results obtained. It was found that the. Epanechnikov Kernel has a least mean squared error.