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.

The adhesion strength between Polyethylene (PE) film and Aluminum surface by using the adhesive material (Cyanoacrylate) has been studied. Aluminum (Al) was used as a substrate, and polyethylene (PE) was used as a film adhered to the Al surface. Standard specimens were prepared to use in the peeling test in dry condition, other specimens were immersed in water for 12 days at room temperature. the results for the specimens in the dry condition had shown that high value in the peel force and the peel energy, the peel force was 0.38*103 N/m and the peel energy was 0.605*103 N/m, peeling the film from Al surface leaves a residual of the adhesive material on both adherend, the failure for this specimen were combination of adhesive and cohesive f

In this paper, we define some generalizations of topological group namely -topological group, -topological group and -topological group with illustrative examples. Also, we define grill topological group with respect to a grill. Later, we deliberate the quotient on generalizations of topological group in particular -topological group. Moreover, we model a robotic system which relays on the quotient of -topological group.

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, the Normality set  will be investigated. Then, the study highlights some concepts properties and important results. In addition, it will prove that every operator with normality set has non trivial invariant subspace of  .