Determine point-to-point networking interactions using regular expressions
Trudy Odesskogo Politehničeskogo Universiteta, 2015 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
A novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata [PDF]
Maejo International Journal of Science and Technology, 2013 Regular expressions with shuffle operators are widely used in diverse fields of computer science. The work presented here investigates the shuffling of regular expressions and their conversion into non-deterministic finite automata.
Ajay Kumar, Anil Kumar Verma
doaj +1 more source
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]
Yixue xinzhi zazhiWith 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
Arabic Text Processing Model: Verbs Roots and Conjugation Automation
IEEE Access, 2020 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
Service Function Chaining Based on Grammar in Software Defined Networks [PDF]
مجله مدل سازی در مهندسی, 2019 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
Algorithms, 2021 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
Pengelompokan Komentar Netizen pada Media Sosial Pemerintah Daerah Berdasarkan Frekuensi Kata Kunci
Khazanah Informatika, 2018 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
Cybersecurity Named Entity Recognition Using Multi-Modal Ensemble Learning
IEEE Access, 2020 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
TECHNOLOGIES OF CREATING SPELL CHECKER
Ìнформаційні технології в освіті, 2019 Spell checkers are created to control and correct mistakes in a user document. They are based on the comparison of every word against the spelling dictionary and on the use of correct spelling detection algorithms.
O. Riezina, R. Kosiuh , V. Vynnychenko
doaj +1 more source
Regular Expression Matching and Operational Semantics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Many programming languages and tools, ranging from grep to the Java String library, contain regular expression matchers. Rather than first translating a regular expression into a deterministic finite automaton, such implementations typically match the ...
Asiri Rathnayake, Hayo Thielecke
doaj +1 more source