Presumably, with sufficient training data, it would be possible to build a classifier for each of the twenty predetermined complication labels. However since our training set consists of only a hundred and forty patients in total, and 14 of the 20 labels were associated with 10 or fewer patients, this approach was clearly infeasible. Similarly for the second task, there were only twenty patient...

The rapid development of mobile technologies has facilitated users to generate and store files on mobile devices. However, it has become a challenging issue for users to search efficiently and effectively for files of interest in a mobile environment that involves a large number of mobile nodes. In this thesis, file management and retrieval alternatives have been investigated to propose a feasi...

Evan's 1968 ANALOGY system was the first computer model of analogy. This paper demonstrates that structure-mapping, when combined with high-level visual processing and qualitative representations, can do the same kinds of problems with hand-drawn sketched inputs. Importantly, the bulk of the computations are not particular to the model of this task but are general purpose: we sketch the problem...

Given the recent explosion of interest in human authentication, verification based on tokenised pseudo-random numbers and userspecific biometric feature (BioHashing) has received much attention. The purpose of our paper is to investigate the pros and the cons of BioHashing. In particular we study: how to combine BioHashing in a multi-modal fusion approach based on the integration of face and fi...

With a growing number of ontologies used in the semantic web, agents can fully make sense of different datasets only if correspondences between those ontologies are known. Ontology matching tools have been proposed to find such correspondences. While the current research focus is mainly on fully automatic matching tools, some approaches have been proposed that involve the user in the matching p...

PPMuSA is a pattern matching program for PROSITE [2] signature patterns against amino acid sequence database. To characterize a group of protein among others, it is important work to find occurrences of a signature in an amino acid sequence of the protein. Such signatures are compiled in databases. The PROSITE is one of the databases of signatures that distinguish members of a protein families ...

The central problems w.r.t. interoperability and data integration issues in the Semantic Web are schema and ontology matching approaches. Today it takes an expert to determine the best algorithm and a decision can usually be made only after experimentation, so as both the necessary scaling and off-the-shelf use of matching algorithms are not possible. To tackle these issues, we present a rule-b...

With the web getting bigger and assimilating knowledge about different concepts and domains, it is becoming very difficult for simple database driven applications to capture the data for a domain. Thus developers have come out with ontology based systems which can store large amount of information and can apply reasoning and produce timely information. Thus facilitating effective knowledge mana...

Latent fingerprints are ubiquitously used as forensic evidence by law enforcement agencies in solving crimes. However, due to deformations and artifacts within latent fingerprint images, performance of the automated recognition systems far from desired levels. A basic matcher specifically designed for clean using a minutiae-based matching algorithm can have high speed accuracy sensor-to-sensor ...

Matching query interfaces is a critical step in data integration across multiple Web databases. The problem is closely related to schema matching that typically exploits different features of schemas. Relying on a particular feature of schemas is not sufficient. We propose an evidential approach to combining multiple matchers using Dempster-Shafer theory of evidence. First, our approach views t...