6190398
Time Representation in Prolog Circuit Modelling
This paper is an examination of some issues in domain ontology and of various knowledge representation techniques for the temporal modelling of digital electronic circuits in Prolog. It should serve as an example of the advantages of such analysis, an area of relative neglect within the logic programming community.
32641793
Document Summarization using Wikipedia
Although most of the developing world is likely to first access the Internet through mobile phones, mobile devices are constrained by screen space, bandwidth and limited attention span. Single document summarization techniques have the potential to simplify information consumption on mobile phones by presenting only the most relevant information contained in the document. In this paper we present a language independent single-document summarization method. We map document sentences to semantic concepts in Wikipedia and select sentences for the summary based on the frequency of the mapped-to concepts. Our evaluation on English documents using the ROUGE package indicates our summarization method is competitive with the state of the art in single document summarization.
8269092
Color and texture fusion: application to aerial image segmentation and GIS updating
Abstract This paper describes a new algorithm for combining color and texture information for the segmentation of color images. The algorithm uses maximum likelihood classification combined with a certainty based fusion criterion. The algorithm was validated using mosaics of real color textures. It was also tested on real outdoor color scenes and aerial images. This algorithm is part of a more complex system, which is currently being designed to assist an operator in updating an old map of an area using aerial images.
31511581
Mutual Exclusion on a Hypercube
Abstract We present a decentralized, symmetric mutual exclusion algorithm that is tailored to the hypercube architecture. Our algorithm has better time complexity than a suitable hypercube adaptation of Maekawa′s O(√N) Mutual Exclusion algorithm. We show that, in the presence of contention, our algorithm has a shorter Blocking Delay than Maekawa′s algorithm. In the absence of contention, our algorithm achieves optimal Round-trip Delay under both the n-port and the one-port communication models.
9910171
Semantics and CBIR: a medical imaging perspective
Medical CBIR (content-based image retrieval) applications pose unique challenges but at the same time offer many new opportunities. On one hand, while one can easily understand news or sports videos, a medical image is often completely incomprehensible to untrained eyes. On the other hand, semantics in the medical domain is much better defined and there is a vast accumulation of formal knowledge representations that could be exploited to support semantic search for any specialty areas in medicine.
 In this paper, however, we will not dwell on any one particular specialty area, but rather address the question of how to support scalable semantic search across the whole of medical CBIR field: what are the advantages to take and gaps to fill, what are the key enabling technologies, and the critical success factor from an industrial point of view.
 In terms of enabling technologies, we discuss three aspects: 1. anatomical, disease, and contextual semantics, and their representations using ontologies; 2. scalable image analysis and tagging algorithms; and 3. ontological reasoning and its role in guiding and improving image analysis and retrieval.
 More specifically, for ontological representation of medical imaging semantics, we discuss the potential use of FMA, RadLex, ICD, and AIM. For scalable image analysis we present a learning-based anatomy detection and segmentation framework using distribution-free priors. It is easily adaptable to different anatomies and different imaging modalities.
62621279
Estimating Internet Users' Demand Characteristics
We investigate two parametric approaches and one non-parametric approach toestimating Internet users' value-of-time, an important characteristic ofdemand for Internet services. The advantages of these approaches are madeclear and their limitations discussed. The models are tested with datagenerated from our similation model of the Internet economy. Given thecharacteristics of the data, we investigate parametric count-data modelsfirst. While reasonably good results are obtained on all medium- andlarge-sized jobs, the method fails on small-sized ones. Second, we develop anonparametric quasi-Bayesian update algorithm for retrieving the underlyingdistribution function of Internet users' value-of-time purely fromobservations on their choices. Compared with the parametric count-data models,good results are obtained in every case.
29871849
Optimal Deployment of Triggers for Detecting Events
In active d atabases, rules are represented in the form of ECA (event-condition-action). Database events can be detected by defining triggers on the underlying application databases. Many-a-times, temporal conditions that limit the validity period of the event are as sociated with the ECA rule. The performance of the database can get adversely affected if such temporal constraints are checked (either at the application level or at database level) for every transaction (event) irrespective of whether that transaction (event) has occurred within the said time interval. This drawback can be avoided by optimizing the temporal constraints associated with the sub-events of a composite event based on the semantics of the composite event operators. This paper describes such an algorithm that optimizes the temporal constraints associated with (composite) events and improves the efficiency of the databases by creating and destroying triggers dynamically such that the semantics of the event is unchanged. The efficiency of the technique is validated by our experimental results.