We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. The matching process is essentially divided into two steps: element level and structure level. Element level matchers consider only labels of nodes, while structure level matchers start from this information to consider the full graph. In this paper we present variou...

One purpose of network analysis especially of social networks is to identify important actors, crucial links, subgroups, roles, network characteristics, and so on, to answer substantive questions about structures. There are three main levels of interest: the element, group, and network level. On the element level, one is interested in properties (both absolute and relative) of single actors, li...

Business process model matching is concerned with the detection of similarities in business process models. To support the progress of process model matching techniques, efficient evaluation strategies are required. State-of-the-art evaluation techniques provide a grading of the evaluated matching techniques. However, they only offer limited information about strength and weaknesses of the indi...

We consider a naive, quadratic string matcher testing whether a pattern occurs in a text; we equip it with a cache mediating its access to the text; and we abstract the traversal policy of the pattern, the cache, and the text. We then specialize this abstracted program with respect to a pattern, using the off-the-shelf partial evaluator Similix. Instantiating the abstracted program with a left-...

Packet classification methods rely upon matching packet content/header against pre-defined rules, which are generated by network applications and their configurations. With the rapid development of technology fast-growing applications, users seek more enhanced, secure, diverse services. Hence it becomes critical to improve performance arbitrary operations. This article presents SIMD-Matcher, an...

Distribution matching transforms independent and Bernoulli(1/2) distributed input bits into a sequence of output symbols with a desired distribution PA. Fixed-to-fixed length, invertible encoders and decoders based on shell mapping are presented. The matcher minimizes the informational divergence for a large class of distributions including the Maxwell-Boltzmann and geometric distributions. Fin...

State-of-the-art multilingual ontology matchers use machine translation to reduce the problem to the monolingual case. We investigate an alternative, self-contained solution based on semantic matching where labels are parsed by multilingual natural language processing and then matched using a language-independent knowledge base acting as an interlingua. As the method relies on the availability ...

Most fingerprint matching systems rely on the distribution of minutiae on the fingertip to represent and match fingerprints. While the ridge flow pattern is generally used for classifying fingerprints, it is seldom used for matching. This paper describes a hybrid fingerprint matching scheme that uses both minutiae and ridge flow information to represent and match fingerprints. A set of 8 Gabor ...