In this paper, we define the bg**-connected space and study the relation between this space and other kinds of connected spaces .Also we study some types of continuous functions and study the relation among (connected space, b-connected space,  bg-connected  space and bg**-connected space) under these types of continuous functions.  

I n  this  paper ,we 'viii  consider  the density  questions  associC;lted with  the single  hidden layer feed forward  model. We proved  that a FFNN   with   one   hidden   layer  can   uniformly   approximate   any continuous  function  in C(k)(where k is a compact set in R11 ) to any required accuracy.

However, if the set of basis function is dense then the ANN's can has al most one hidden layer. But if the set of basis function  non-dense, then we  need more  hidden layers. Also, we have shown  that there exist  localized functions and that there is no t

     This paper introduces a relation between resultant and the Jacobian determinant
by generalizing Sakkalis theorem from two polynomials in two variables to the case of (n) polynomials in (n) variables. This leads us to study the results of the type:  ,            and use this relation to attack the Jacobian problem. The last section shows our contribution to proving the conjecture.

In practical engineering problems, uncertainty exists not only in external excitations but also in structural parameters. This study investigates the influence of structural geometry, elastic modulus, mass density, and section dimension uncertainty on the stochastic earthquake response of portal frames subjected to random ground motions. The North-South component of the El Centro earthquake in 1940 in California is selected as the ground excitation. Using the power spectral density function, the two-dimensional finite element model of the portal frame’s base motion is modified to account for random ground motions. A probabilistic study of the portal frame structure using stochastic finite elements utilizing Monte Carlo simulation

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.

The concept of -closedness, a kind of covering property for topological spaces, has already been studied with meticulous care from different angles and via different approaches. In this paper, we continue the said investigation in terms of a different concept viz. grills. The deliberations in the article include certain characterizations and a few necessary conditions for the -closedness of a space, the latter conditions are also shown to be equivalent to -closedness in a - almost regular space. All these and the associated discussions and results are done with grills as the prime supporting tool.

A new definition of a graph called Pure graph of a ring denote Pur(R) was presented , where the vertices of the graph represent the elements of R such that there is an edge between the two vertices ???? and ???? if and only if ????=???????? ???????? ????=????????, denoted by pur(R) . In this work we studied some new properties of pur(R) finally we defined the complement of pur(R) and studied some of it is properties

The concept of the order sum graph associated with a finite group based on the order of the group and order of group elements is introduced. Some of the properties and characteristics such as size, chromatic number, domination number, diameter, circumference, independence number, clique number, vertex connectivity, spectra, and Laplacian spectra of the order sum graph are determined. Characterizations of the order sum graph to be complete, perfect, etc. are also obtained.