Results 241 to 250 of about 51,114 (288)
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
openaire +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
openaire +2 more sources
Multimedia learning machine based on non-deterministic finite automaton
2010 2nd International Conference on Computer Engineering and Technology, 2010 With 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.
Weifeng Shan, Jilin Feng
openalex +2 more sources
Learning a deterministic finite automaton with a recurrent neural network
International Conference on Graphics and Interaction, 1998We consider the problem of learning a finite automaton with recurrent neural networks from positive evidence. We train an Elman recurrent neural network with a set of sentences in a language and extract a finite automaton by clustering the states of the trained network.
Laura Firoiu, Tim Oates, Paul R. Cohen
openaire +2 more sources
Using non-deterministic finite automaton to research intrusion tolerant system
2009 3rd International Conference on Anti-counterfeiting, Security, and Identification in Communication, 2009 Intrusion Tolerant is a new network information security technology after firewall, access control and intrusion detection. When a network system is attacked by illegal intrusion, intrusion tolerant system is capable of self-diagnosing, recovering, reconstruction and continuing to provide service to legitimate clients in the presence of intrusions.
Cui-Cui Zhang, Xiaoyao Xie
openalex +2 more sources
Bin packing problem solution through a deterministic weighted finite automaton
AIP Conference Proceedings, 2016 In this article the solution of Bin Packing problem of one dimension through a weighted finite automaton is presented. Construction of the automaton and its application to solve three different instances, one synthetic data and two benchmarks are presented: N1C1W1_A.BPP belonging to data set Set_1; and BPP13.BPP belonging to hard28.
José Dı́az +4 more
openalex +2 more sources
Big Data, 2023 We present an efficient incremental learning algorithm for Deterministic Finite Automaton (DFA) with the help of inverse query (IQ) and membership query (MQ). This algorithm is an extension of the Identification of Regular Languages (ID) algorithm from a complete to an incremental learning setup.
Farah Haneef, Muddassar Azam Sindhu
openalex +3 more sources
Proceedings of the 6th International Conference on Information Technology: IoT and Smart City, 2018 In theory of computation, a deterministic finite automaton (DFA) is a finite state machine that accepts/rejects finite strings of symbols and only produces a unique computation. This study aims to convert the extracted decision tree rules sets from decision tree algorithm and the learning path sequence of the learning management system.
Ace C. Lagman +3 more
openalex +2 more sources
ON THE REGULARITY OF SETS OF MULTI-ACCEPTED STRINGS OF A NON-DETERMINISTIC FINITE AUTOMATON
Asian-European Journal of Mathematics, 2009 In 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, Justin Grieshop
openalex +2 more sources
Stroke-based intelligent character recognition using a deterministic finite automaton
Logic Journal of IGPL, 2015D. Alvarez, R. Fernandez, L. Sanchez
openaire +2 more sources
, 2018 An automaton is used where information and materials are transformed, transmitted, and utilized for performing some processes without direct involvement of human. A finite automaton (both deterministic and non-deterministic) is used to recognize a formal regular language.
Rinku +4 more
openalex +2 more sources