Web service substitution is one of the most advanced tasks that a composite Web service developer must achieve. Substitution occurs when, in a composite scenario, a service operation is replaced to improve the composition performance or fix a disruption caused by a failing service. To move the automation of substitution forward, a set of measures, considering structure and functionality of Web ...

Space-time paths and prisms are time geographic concepts delimiting the actual and potential mobility pattern of an object in space and time, respectively. While there is a range of similarity measures for space-time paths, it is only recently that researchers started to develop similarity measures for the space-time prism (STP). This paper proposes a new methodology for measuring the similarit...

A large number of heuristic algorithms have been developed over the years which have been aimed at solving examination timetabling problems. However, many of these algorithms have been developed specifically to solve one particular problem instance or a small subset of instances related to a given real-life problem. Our aim is to develop a more general system which, when given any exam timetabl...

In this paper, we discuss matching of diffusion tensor (DT) MRIs of the human brain. Issues concerned with matching and transforming these complex images are discussed. A number of similarity measures are proposed, based on indices derived from the DT, the DT itself and the DT deviatoric. Each measure is used to drive an elastic matching algorithm applied to the task of registration of 3D image...

Two new similarity measures for rigid image registration, based on the normalization of Jensen’s difference applied to Rényi and Tsallis-Havrda-Charvát entropies, are introduced. One measure is normalized by the first term of Jensen’s difference, which in our proposal coincides with the marginal entropy, and the other by the joint entropy. These measures can be seen as an extension of two measu...

Clustering is a useful technique that organizes a large quantity of unordered text documents into a small number of meaningful and coherent clusters, thereby providing a basis for intuitive and informative navigation and browsing mechanisms. Partitional clustering algorithms have been recognized to be more suitable as opposed to the hierarchical clustering schemes for processing large datasets....

Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1’s. We are interested in computing the cyclic swap distance between A and B, i.e., the minimum number of swaps needed to convert A to B, minimized over all rotations of B. We show that, given the compressed representation of A and B, this distance may be c...

Normalized cross correlation (NCC), Sum of squared differences (SSD), and Sum of absolute differences (SAD) are the linear correlation measures generally used for stereo correspondence. These measures fail to establish the correspondence under nonideal conditions such as specular reflection, occlusion etc. In this paper, the similarity measures for stereo correspondence based on rank correlatio...

In this paper, we propose a new method to recognize silhouettes of objects. Models of silhouettes are stored in the database using their textual descriptors. Textual Descriptors are written following the part-based method published in (Larabi et al, 2003). The main issue with the textual description is its sensitiveness to noise, in order to overcome this issue, we have applied (Aouat and Larab...

String similarity metrics are used for several purposes in text-processing. One task is the extraction of cognates from bilingual text. In this paper three approaches to the automatic generation of language dependent string matching functions are presented. 1 I n t r o d u c t i o n String similarity metrics are extensively used in the processing of textual data for several purposes such as the...