Constructing optimal reconfigurable pattern matching tools for information security
نویسندگان
چکیده
منابع مشابه
Reconfigurable approximate pattern matching architectures for nanotechnology
Approximate pattern matching is comparing an input pattern with a target pattern with a specified error tolerance. This ability to compensate for real-world sensor errors makes approximate pattern matching an ideal choice for a wide range of applications. This paper shows that two n-bit patterns may be matched with a single stage nanotechnology architecture using 2n þ 1 unit area resonant tunne...
متن کاملOptimal pattern matching algorithms
We study a class of finite state machines, called w-matching machines, which yield to simulate the behavior of pattern matching algorithms while searching for a pattern w. They can be used to compute the asymptotic speed, i.e. the limit of the expected ratio of the number of text accesses to the length of the text, of algorithms while parsing an iid text to find the pattern w. Defining the orde...
متن کاملA maintenance system model for optimal reconfigurable vibrating screen management
The reconfigurable vibrating screen (RVS) machine is an innovative beneficiation machine designed for screening different mineral particles of varying sizes and volumes required by the customers’ through the geometric transformation of its screen structure. The successful RVS machine upkeep requires its continuous, availability, reliability and maintainability. The RVS machine downtime, which c...
متن کاملOptimal Pattern Matching on Meshes
Parallel pattern matching on a mesh-connected array of processors is considered. The problem is to nd all occurrences of a pattern in a text. The input text is a string of n symbols placed in a p n p n mesh, each processor storing one symbol. The pattern is stored similarly in a contiguous portion of the mesh. An algorithm solving the problem in time O(p n) is presented. It applies a novel tech...
متن کاملOptimal Left-to-Right Pattern-Matching Automata
We propose a practical technique to compile pattern-matching for prioritised overlapping patterns in equational languages into a minimal, deterministic, left-toright, matching automaton. First, we present a method for constructing a tree matching automaton for such patterns. This allows pattern-matching to be performed without any backtracking. Space requirements are reduced by using a directed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ukrainian Scientific Journal of Information Security
سال: 2019
ISSN: 2411-071X,2225-5036
DOI: 10.18372/2225-5036.25.13824