Results 241 to 250 of about 1,535,797 (279)
Some of the next articles are maybe not open access.
2015 IEEE Symposium Series on Computational Intelligence, 2015
While collecting data from network traffic, one can create classifiers that recognize threats, anomalies, or other events. The set of labelled Net Flow records collecting traffic statistics is a very useful source of decision rules that classify the records. These rules can be created automatically using machine learning techniques.
Marcin Luckner
exaly +2 more sources
While collecting data from network traffic, one can create classifiers that recognize threats, anomalies, or other events. The set of labelled Net Flow records collecting traffic statistics is a very useful source of decision rules that classify the records. These rules can be created automatically using machine learning techniques.
Marcin Luckner
exaly +2 more sources
An Application for Visual Representation of Deterministic Finite Automaton Generated by JFlex
2018 26th Telecommunications Forum (TELFOR), 2018JFlex is a well-known lexical analyzer generator for Java. It is widely used both for university coursers and in software developing practice. However, there is a lack of appropriate tools for efficient inspection of Java code generated by using JFlex.
exaly +2 more sources
On generating a random deterministic finite automaton as well as its failure equivalent
, 2015 An algorithm is proposed that constructs a failure deterministic finite automaton in lockstep with the construction of a languageequivalent deterministic finite automaton. The states of both automata are assumed to be predefined and the failure deterministic finite automaton's symbol and failure transitions are randomised.
Nxumalo, M. +3 more
openaire +2 more sources
A Compact and Secure Access Control Solution Based on a Deterministic Finite Automaton
2023 International Conference Automatics and Informatics (ICAI), 2023Nurassyl Kerimbayev, Timur Bakibayev
exaly +2 more sources
A Deterministic finite automaton approach to design rule checking for VLSI
Proceedings of the nineteenth design automation conference on - DAC '82, 1982Integrated circuit fabrication technologies place certain restrictions on the relationships with and between mask layers. These "design rules" are intended to describe the class of designs that the fabrication process will correctly implement. The intent of this paper is to describe a general design rule checking algorithm that will take as input the ...
Eustace, R. Alan +2 more
openaire +3 more sources
A Deterministic Finite Automaton for Faster Protein Hit Detection in BLAST
Journal of Computational Biology, 2006BLAST is the most popular bioinformatics tool and is used to run millions of queries each day. However, evaluating such queries is slow, taking typically minutes on modern workstations. Therefore, continuing evolution of BLAST--by improving its algorithms and optimizations--is essential to improve search times in the face of exponentially increasing ...
Michael Cameron +2 more
openaire +2 more sources
A regular expression matching using non-deterministic finite automaton
Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010), 2010This paper shows an implementation of CANSCID (Combined Architecture for Stream Categorization and Intrusion Detection). To satisfy the required system throughput, the packet assembler and the regular expression matching are implemented by the dedicated hardware. On the other hand, the counting of matching results and the system control are implemented
Hiroshi Nakahara +2 more
openaire +2 more sources
Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
2009 12th Euromicro Conference on Digital System Design, Architectures, Methods and Tools, 2009As the speed of current computer networks increases, it is necessary to protect networks by security systems such as firewalls and Intrusion Detection Systems operating at multigigabit speeds. Pattern matching is the time-critical operation of current IDS on multigigabit networks.
Jan Kastil, Jan Korenek, Ondrej Lengál
openaire +2 more sources
Multimedia learning machine based on non-deterministic finite automaton
2010 2nd International Conference on Computer Engineering and Technology, 2010With the increasing international communications, people are eager to learn foreign languages. As an auxiliary tool, multimedia learning machine (MLM) is welcomed by foreign language learners. So, it is very necessary to design a powerful MLM efficiently. How to deal with the state transition of MLM's different states is a key issue.
Wei-feng Shan, Ji-lin Feng
openaire +1 more source
ON THE REGULARITY OF SETS OF MULTI-ACCEPTED STRINGS OF A NON-DETERMINISTIC FINITE AUTOMATON
Asian-European Journal of Mathematics, 2009In this paper we establish the regularity of various sets of multi-accepted strings of nondeterministic finite automata. Regularity follows from the existence of accepting automata constructed by introducing a vector labeling method which generalizes the subset labeling approach.
L. K. Waters, J. K. Grieshop
openaire +1 more source