Matching ontologies which utilize significantly heterogeneous terminologies is a challenging task for existing matching techniques. These techniques typically exploit lexical resources in order to enrich the ontologies with additional terminology such that more terminological matches can be found. However, they are limited by the availability of an appropriate lexical resource for each matching...

Fast and accurate 3D object reconstruction and partial 3D component retrieval from 2D image slices represent a difficult and challenging problem. To group related objects on different layers in an image stack, image segmentation and sequential matching of adjacent 2D objects have to be preformed. Object matching involves heavy computing and is time consuming. In this paper, we propose a new app...

Permutations are fundamental objects in combinatorics. An n-permutation is a sequence containing every one of the integers 1,2, . . . ,n exactly once. Within combinatorics, patterns in permutations are an important topic. A permutation T contains a permutation P as a pattern if there exists a subsequence of T that has the same relative order of elements as P. For example 53142 contains 231 as s...

To start with, having employed transformation wave, some nonlinear partial differential equations have been converted into an ODE. Then, using the infinite series method for equations with similar linear part, the researchers have earned the exact soliton solutions of the selected equations. It is required to state that the infinite series method is a well-organized method for obtaining exact s...

Permutation Pattern Matching (or PPM) is a decision problem whose input is a pair of permutations π and τ , represented as sequences of integers, and the task is to determine whether τ contains a subsequence order-isomorphic to π. Bose, Buss and Lubiw proved that PPM is NP-complete on general inputs. We show that PPM is NP-complete even when π has no decreasing subsequence of length 3 and τ has...

Matching of partial fingerprints has important applications in both biometrics and forensics. It is well-known that the accuracy of minutiae-based matching algorithms dramatically decrease as the number of available minutiae decreases. When singular structures such as core and delta are unavailable, general ridges can be utilized. Some existing highly accurate minutiae matchers do use local rid...

This paper presents an information retrieval model based on the principles of word formation to alleviate the mismatch between index terms and query terms. The model provides the partial matching method using morphological information which represent how morphemes consist of words. In this paper, we suggest a eecient method of dealing with derived words and compound words. The contribution of t...

to start with, having employed transformation wave, some nonlinear partial differential equations have been converted into an ode. then, using the infinite series method for equations with similar linear part, the researchers have earned the exact soliton solutions of the selected equations. it is required to state that the infinite series method is a well-organized method for obtaining exact s...

In this paper we describe a compression-based authorship verification model used in conjunction with a parts of speech tagger. We use standard language-specific parts of speech taggers on the texts in question to generate a stream of symbols representing each word, run the PPM (Prediction by Partial Matching) algorithm on the resulting stream, and use Bobicev’s method of calculating and compari...