In this paper we tend to describe the notions of intuitionistic fuzzy asly ideal of ring indicated by (I. F.ASLY) ideal and, we will explore some properties and connections about this concept.

This paper deal with the estimation of the shape parameter (a) of Generalized Exponential (GE) distribution when the scale parameter (l) is known via preliminary test single stage shrinkage estimator (SSSE) when a prior knowledge (a₀) a vailable about the shape parameter as initial value due past experiences as well as suitable region (R) for testing this prior knowledge.

The Expression for the Bias, Mean squared error [MSE] and Relative Efficiency [R.Eff(×)] for the proposed estimator are derived. Numerical results about beha

Let M be a n-dimensional manifold. A C1- map f : M  M is called transversal if for all m N the graph of fm intersect transversally the diagonal of MM at each point (x,x) such that x is fixed point of fm. We study the minimal set of periods of f(M per (f)), where M has the same homology of the complex projective space and the real projective space. For maps of degree one we study the more general case of (M per (f)) for the class of continuous self-maps, where M has the same homology of the n-dimensional sphere.

As regional development, as a matter of course, poses a number of systemic, scientific and political problems. While the issue of development is primarily at the national level to the limits of World War II in the industrialized world and to the 1960s borders in most Third World countries, the increasing awareness of regional disparities has led to the regional issue Were taken into consideration in the early 1960s and 1970s in most industrialized and developing countries alike. The local issue was only introduced in the early 1980s. The awareness of regional disparities and the fact that the regions do not have the same potential and that some regions have the resources to enable them to develop, grow and develop, unlike other r

Relation on a set is a simple mathematical model to which many real-life data can be connected. A binary relation  on a set  can always be represented by a digraph. Topology on a set  can be generated by binary relations on the set . In this direction, the study will consider different classical categories of topological spaces whose topology is defined by the binary relations adjacency and reachability on the vertex set of a directed graph. This paper analyses some properties of these topologies and studies the properties of closure and interior of the vertex set of subgraphs of a digraph. Further, some applications of topology generated by digraphs in the study of biological systems are cited.

In this paper we describe several different training algorithms for feed forward neural networks(FFNN). In all of these algorithms we use the gradient of the performance function, energy function, to determine how to adjust the weights such that the performance function is minimized, where the back propagation algorithm has been used to increase the speed of training. The above algorithms have a variety of different computation and thus different type of form of search direction and storage requirements, however non of the above algorithms has a global properties which suited to all problems.