With the growth of interest in database searching and compound selection, the quantification of chemical similarity has become an area of intense practical and theoretical interest. One of the most widely used methods of measuring chemical similarity is based on mapping fragments within a molecule as bits within a binary string. We present empirical results which suggest that bit strings provid...

85 ABSTRACT: Semantic Similarity relates to computing the similarity between different ontological concepts .Various categories of semantic similarity measures have been proposed to determine how similar are they between any two concepts within ontology. Information Content (IC) measure is one such among the category of measures. We analyze different methods of calculating the IC value for any ...

We present a framework for analyzing the structure of digital media streams. Though our methods work for video, text, and audio, we concentrate on detecting the structure of digital music files. In the first step, spectral data is used to construct a similarity matrix calculated from inter-frame spectral similarity. The digital audio can be robustly segmented by correlating a kernel along the d...

We propose a new texture editing operation called texture splicing. For this operation, we regard a texture as having repetitive elements (textons) seamlessly distributed in a particular pattern. Taking two textures as input, texture splicing generates a new texture by selecting the texton appearance from one texture and distribution from the other. Texture splicing involves self-similarity sea...

Gravitational collapse of radiation shells in a non self-similar higher dimensional spherically symmetric spacetime is studied. Strong curvature naked singularities form for a highly inhomogeneous collapse, violating the cosmic censorship conjecture. As a special case, self similar models can be constructed.

In this paper, we investigate connection admission management for connections which generate self-similar traffic. We present a simple mathematical framework which does not require restrictive assumptions about the network behaviour. We show how this framework can be used to derive connection admission policies.

We prove that any sufficiently small perturbation of an isosceles triangle has a periodic billiard path. Our proof involves the analysis of certain infinite families of Fourier series that arise in connection with triangular billiards, and reveals some self-similarity phenomena in irrational triangular billiards. Our analysis illustrates the surprising fact that billiards on a triangle near a V...

A brief introduction to self-similar processes.

Given a set of data, recorded by observing the decisions of an expert player, we present a case-based framework that allows the successful generalisation of those decisions in the game of no limit Texas Hold’em. The transition from a limit betting structure to a no limit betting structure offers challenging problems that are not faced in the limit domain. In particular, we address the problems ...