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, ...

Given a k-character query string and an array of n strings arranged in lexicographical order, computing the rank of the query string among the n strings or deciding whether it occurs in the array requires the inspection of k log logn log log (4 + k log log n logn ) + k + logn ! characters in the worst case.

This work focuses on semi-automatic extraction of verb-noun collocations from a corpus, performed to provide lexical evidence for the manual lexicographical processing of Support Verb Constructions (SVCs) in the Swedish-Czech Combinatorial Valency Lexicon of Predicate Nouns. Efficiency of pure manual extraction procedure is significantly improved by utilization of automatic statistical methods ...

The one variable Bernstein-Szegő theory for orthogonal polynomials on the real line is extended to a class of two variable measures. The polynomials orthonormal in the total degree ordering and the lexicographical ordering are constructed and their recurrence coefficients discussed.

The paper describes objectives, concept and methodology for ELEXIS, a European infrastructure fostering cooperation and information exchange among lexicographical research communities. The infrastructure is a newly granted project under the Horizon 2020 INFRAIA call, with the topic Integrating Activities for Starting Communities. The project is planned to start in

We demonstrate an efficient method for computing a Gröbner basis of a zero-dimensional ideal describing the key-recovery problem from a single plaintext/ciphertext pair for the full AES-128. This Gröbner basis is relative to a degree-lexicographical order. We investigate whether the existence of this Gröbner basis has any security implications for the AES.

This paper provides studies in area of design pattern identification in existing software systems. The target was to design and prototype specific extensions of a selected method with better and more precise results. This paper summarizes separate phases of a project analysis of different design pattern representations, analysis of different methods, algorithms for identification of design patt...

Digital searching is a well-known technique for storing and retrieving information using lexicographical (digital) structure of words. A radix trie (in short: trie) is such a digital search tree that edges are labelled by elements from aa alphabet (e.g., binary alphabet consisting of O’s and l’s) and leaves (external nodes) contain keys [ 1,4,9]. More precisely, in a binary case a key is a (pos...

This paper characterizes the Castelnuovo-Mumford regularity by evaluating the initial ideal with respect to the reverse lexicographic order.

In this paper we answer the following question: what is the lexicographically least sequence over the natural numbers that avoids 32 -powers?