A few localisation theorems

Given a functor $T:C \to D$ carrying a class of morphisms $S\subset C$ into a class $S'\subset D$, we give sufficient conditions in order that $T$ induces an equivalence on the localised categories. These conditions are in the spirit of Quillen's theorem A. We give some applications in algebaic and birational geometry.Comment: File mistake in Version 2 To appear in Homology, Homotopy and Application

Symbolic-Connectionist Representational Model for Optimizing Decision Making Behavior in Intelligent Systems

Modeling higher order cognitive processes like human decision making come in three representational approaches namely symbolic, connectionist and symbolic-connectionist. Many connectionist neural network models are evolved over the decades for optimizing decision making behaviors and their agents are also in place. There had been attempts to implement symbolic structures within connectionist architectures with distributed representations. Our work was aimed at proposing an enhanced connectionist approach of optimizing the decisions within the framework of a symbolic cognitive model. The action selection module of this framework is forefront in evolving intelligent agents through a variety of soft computing models. As a continous effort, a Connectionist Cognitive Model (CCN) had been evolved by bringing a traditional symbolic cognitive process model proposed by LIDA as an inspiration to a feed forward neural network model for optimizing decion making behaviours in intelligent agents. Significanct progress was observed while comparing its performance with other varients

Grothendieck's theorem on non-abelian H^2 and local-global principles

A theorem of Grothendieck asserts that over a perfect field k of cohomological dimension one, all non-abelian H^2-cohomology sets of algebraic groups are trivial. The purpose of this paper is to establish a formally real generalization of this theorem. The generalization -- to the context of perfect fields of virtual cohomological dimension one -- takes the form of a local-global principle for the H^2-sets with respect to the orderings of the field. This principle asserts in particular that an element in H^2 is neutral precisely when it is neutral in the real closure with respect to every ordering in a dense subset of the real spectrum of k. Our techniques provide a new proof of Grothendieck's original theorem. An application to homogeneous spaces over k is also given.Comment: 22 pages, AMS-TeX; accepted for publication by the Journal of the AM

Iwasawa theory and modular forms

This article does not have an abstract

An Analysis of Text-Based Authentication using Images in Banking System

The stipulation of electronic services, such as Transactional, Non-transactional, Financial institution administration, Management of multiple users having varying levels of authority and Transaction approval process, by banking organizations evolves and spreads with the introduction of enhanced communication technologies.  Though, this novel business occasion for the provision of banking products and services increases the need for security, especially due to the sensitive nature of the information exchanged.  The specific nature of Internet banking systems creates the necessity for focused facts on security issues to be able to successfully demeanor an assessment or security evaluation process.  More specifically, the information systems (IS) auditor should have the necessary technical and operational skills and knowledge to carry out the review of the technology employed and risks associated with Internet banking.  Following this requirement, this paper presents a novel authentication approach to provide security to the end users.  This proposed system, Analysis of Text-Based Authentication using Images in Banking System (ATBAIBS) provides great value in terms of convenience, customer intimacy, time saving, inexpensiveness and coherence in banking sectors

A SURVEY ON ANT COLONY OPTIMIZATION ALGORITHM

A novel Ant Colony Optimization algorithm (ACO) combined for the hierarchical multi- label classification problem of protein function prediction. This kind of problem is mainly focused on biometric area, given the large increase in the number of uncharacterized proteins available for analysis and the importance of determining their functions in order to improve the current biological knowledge. Because it is known that a protein can perform more than one function and many protein functional-definition schemes are organized in a hierarchical structure, the classification problem in this case is an instance of a hierarchical multi-label problem. In this classification method, each class might have multiple class labels and class labels are represented in a hierarchical structure—either a tree or a directed acyclic graph (DAG) structure. A more difficult problem than conventional flat classification in this approach, given that the classification algorithm has to take into account hierarchical relationships between class labels and be able to predict multiple class labels for the same example. The proposed ACO algorithm discovers an ordered list of hierarchical multi-label classification rules