In this report we study and try to minimize the total execution time of a Profile Matching protocol, a secure computations protocol based on an operation called conditional gate. We focus on reducing the complexities and study the interplay between them, mainly the round, communication, computational, space and random complexities. We propose several optimizations and study their effect , both ...

Various approaches in service engineering are based on service markets where brokers use service matching in order to perform service discovery. For matching, a broker translates the specifications of providers’ services and requesters’ requirements into her own specification language, in order to check their compliance using a matcher. The broker’s success depends on the configuration of her l...

We present the first derivation of the search phase of the Boyer-Moore stringmatching algorithm by partial evaluation of an inefficient string matcher. The derivation hinges on identifying the bad-character-shift heuristic as a bindingtime improvement, bounded static variation. An inefficient string matcher incorporating this binding-time improvement specializes into the search phase of the Hor...

Some ontology alignment (OA) systems find an identical bridge concept in a reference ontology to which both the source and target concept can be mapped. Then a mapping between the two is produced. Using semantic similarity within a reference ontology can find more mappings than with only identical bridge concepts. A wide variety of semantic similarity measures were implemented within AgreementM...

This paper focuses on improving face recognition performance with a new signature combining implicit facial features with explicit soft facial attributes. This signature has two components: the existing patch-based features and the soft facial attributes. A deep convolutional neural network adapted from state-of-the-art networks is used to learn the soft facial attributes. Then, a signature mat...

Despite serious research efforts, automatic ontology matching still suffers from severe problems with respect to the quality of matching results. Existing matching systems trade-off precision and recall and have their specific strengths and weaknesses. This leads to problems when the right matcher for a given task has to be selected. In this paper, we present a method for improving matching res...

A hot issue in the area of database management is to provide a high level interface for nontechnical users. An important research direction is the application of natural language interface. The paper presents an interface module that converts user’s query given in natural language into a corresponding SQL command. After clustering the input sentence, a pushdown automaton is used to verify the s...

This paper proposes a hardware-based parallel pattern matching engine using a memory-based bit-split string matcher architecture. The proposed bit-split string matcher separates the transition table from the state table, so that state transitions towards the initial state are not stored. Therefore, total memory requirements can be minimized. key words: computer network security, deep packet ins...

XML document processing is a subarea of tree processing for which the functional programming style is very natural. A pattern matcher is necessary for identifying parts of the tree to be processed. The functional style implies a processing model in which navigation is possible only to subtrees of a tree. This restriction can be compensated by using a tree pattern matcher able to relate to ances...