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.

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.

This study aims to enhance the RC5 algorithm to improve encryption and decryption speeds in devices with limited power and memory resources. These resource-constrained applications, which range in size from wearables and smart cards to microscopic sensors, frequently function in settings where traditional cryptographic techniques because of their high computational overhead and memory requirements are impracticable. The Enhanced RC5 (ERC5) algorithm integrates the PKCS#7 padding method to effectively adapt to various data sizes. Empirical investigation reveals significant improvements in encryption speed with ERC5, ranging from 50.90% to 64.18% for audio files and 46.97% to 56.84% for image files, depending on file size. A substanti

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

In this paper, the error distribution function is estimated for the single index model by the empirical distribution function and the kernel distribution function. Refined minimum average variance estimation (RMAVE) method is used for estimating single index model. We use simulation experiments to compare the two estimation methods for error distribution function with different sample sizes, the results show that the kernel distribution function is better than the empirical distribution function.

This paper deals with the F-compact operator defined on probabilistic Hilbert space and gives some of its main properties.

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 cyber security, the most crucial subject in information security is user authentication. Robust text-based password methods may offer a certain level of protection. Strong passwords are hard to remember, though, so people who use them frequently write them on paper or store them in file for computer .Numerous of computer systems, networks, and Internet-based environments have experimented with using graphical authentication techniques for user authentication in recent years. The two main characteristics of all graphical passwords are their security and usability. Regretfully, none of these methods could adequately address both of these factors concurrently. The ISO usability standards and associated characteristics for graphical