This paper proposes a pattern partitioning algorithm that maps multiple target patterns onto homogeneous memory-based string matchers. The proposed algorithm adopts the greedy search based on lexicographical sorting. By mapping as many target patterns as possible onto each string matcher, the memory requirements are greatly reduced. key words: computer network security, deep packet inspection, ...

We present the first formal correctness proof of an offline polyvariant specialization algorithm for first-order recursive equations. As a corollary, we show that the specialization algorithm generates a program implementing the search phase of the Knuth-Morris-Pratt algorithm from an inefficient but binding-time-improved string matcher. ∗Basic Research in Computer Science (www.brics.dk), funde...

Integrating a stereo-photogrammetric robot head into a real-time system requires software solutions that rapidly resolve the stereo correspondence problem. The stereo-matcher presented in this paper uses therefore code parallelisation and was tested on three different processors with x87 and AVX. The results show that a 5mega pixels colour image can be matched in 5,55 seconds or as monochrome i...

A neural graph matcher based on Correlation Matrix Memories is evaluated in terms of efficiency and effectiveness against two maximum common subgraph (mcs) algorithms. The algorithm removes implausible solutions below a user-defined threshold and runs faster than conventional mcs methods on our database of chemical graphs while being slightly less effective.

We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that handles constraints on terms, thereby ensuring perfect information propagation. We illustrate this by transforming a näıvely specialised string matcher into an optimal one. The presented algorithm is guaranteed to term...

Intelligence professionals need to determine quickly and accurately the “big picture” that connects disparate data points – i.e. link analysis. These connections can be found by matching the data points with a knowledge base of models encoding activities of interest. In this paper, we propose using a flexible semantic matcher to satisfy this matching requirement.

For the transfer of mathematical knowledge from paper to electronic form, the reliable automatic analysis and understanding of mathematical texts is crucial. A robust system for this task needs to combine low level character recognition with higher level structural analysis of mathematical formulas. We present progress towards this goal by extending a database-driven optical character recogniti...

Studying biological phenomena of individual cells is enabled by matching the scales of microbes and cultivation devices. We present a versatile, chemically inert microfluidic lab-on-a-chip (LOC) device for biological and chemical analyses of isolated microorganisms. It is based on the Envirostat concept and guarantees constant environmental conditions. A new manufacturing process for direct fus...

BACKGROUND Inguinal hernia repair is one of the most frequently performed procedures in Switzerland (15'000/year). The most common complication postoperatively is development of chronic pain in up to 30% of all patients irrespective of the operative technique. METHODS/DESIGN 264 patients scheduled for an inguinal hernia repair using one of three procedures (Lichtenstein, Barwell and TEP = tot...

A new fault list reduction approach is proposed for use in the first stage of a two-stage bridge fault diagnosis procedure. Modified structural analysis and layout extraction procedures are performed to obtain a reduced realistic bridge fault list that can be used in the second stage, which employs diagnostic fault simulation. The fault list reduction approach can reduce the final candidate bri...