Determine point-to-point networking interactions using regular expressions
As Internet growth and becoming more popular, the number of concurrent data flows start to increasing, which makes sense in bandwidth requested. Providers and corporate customers need ability to identify point-to-point interactions.
Konstantin S. Deev, Yuriy V. Boyko
doaj +1 more source
Arabic Text Processing Model: Verbs Roots and Conjugation Automation
The Natural Language Processing (NLP) is a process to automate the text or speech of Natural Languages. This automation is mainly conducted for Western languages. The Arabic Language got less focus in this area.
Mohamed Tahar Ben Othman+2 more
doaj +1 more source
Generation of regular expressions for automata by the integral of regular expressions [PDF]
In this paper, the integral of regular expressions is defined and its properties are presented— The concept of the integral is then applied to establishing an algorithm for generating the regular expression of an arbitrary finite automaton specified by its state diagram or flow table.
Stephen S. Yau, L. W. Smith
openaire +2 more sources
Research on real-world knowledge mining and knowledge graph completion v(III):structured information extraction from real world data of bladder cancer based on regular expression [PDF]
With the development of medical big data, the real-world study (RWS) has received increasing attention in recent years, and has a good promising prospect.
MA Wenhao+9 more
doaj +1 more source
Pengelompokan Komentar Netizen pada Media Sosial Pemerintah Daerah Berdasarkan Frekuensi Kata Kunci
Menurut survei internetworldstats yang dirilis pada Januari 2018, jumlah pengguna internet di Indonesia telah mencapai 132,7 juta jiwa. Dari jumlah tersebut, 40% di antaranya merupakan pengguna aktif media sosial.
Nur Aini Rakhmawati, Nody Risky Pratomo
doaj +1 more source
Service Function Chaining Based on Grammar in Software Defined Networks [PDF]
Service Function Chaining is an architecture for orchestrating network services that assign choice to the network. This architecture is essentially a policy structure that should form the proper chain of services.
Pouya Khosravian Dehkordi+3 more
doaj +1 more source
Text Indexing for Regular Expression Matching
Finding substrings of a text T that match a regular expression p is a fundamental problem. Despite being the subject of extensive research, no solution with a time complexity significantly better than O(|T||p|) has been found.
Daniel Gibney, Sharma V. Thankachan
doaj +1 more source
Cybersecurity Named Entity Recognition Using Multi-Modal Ensemble Learning
Cybersecurity named entity recognition is an important part of threat information extraction from large-scale unstructured text collection in many cybersecurity applications.
Feng Yi, Bo Jiang, Lu Wang, Jianjun Wu
doaj +1 more source
Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract) [PDF]
The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity. In this paper, we consider extensions of the theory of regular expressions with various forms of parallel composition and study the ...
arxiv +1 more source
Learning from Uncurated Regular Expressions [PDF]
Significant work has been done on learning regular expressions from a set of data values. Depending on the domain, this approach can be very successful. However, significant time is required to learn these expressions and the resulting expressions can become either very complex or inaccurate in the presence of dirty data.
arxiv +1 more source