Results 31 to 40 of about 469,663 (197)
A Novel Web Scraping Approach Using the Additional Information Obtained From Web Pages
IEEE Access, 2020 Web scraping is a process of extracting valuable and interesting text information from web pages. Most of the current studies targeting this task are mostly about automated web data extraction.
Erdinc Uzun
doaj +1 more source
ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS [PDF]
International Journal of Foundations of Computer Science, 2012 The Parikh vector p(s) of a string s over a finite ordered alphabet Σ = {a1, …, aσ} is defined as the vector of multiplicities of the characters, p(s) = (p1, …, pσ), where pi = |{j | sj = ai}|. Parikh vector q occurs in s if s has a substring t with p(t) = q. The problem of searching for a query q in a text s of length n can be solved simply and worst-
Péter Burcsi +3 more
openaire +4 more sources
Mathematics, 2021 The Lattice String Approximation algorithm (or LSA algorithm) of M. L. Lapidus and M. van Frankenhuijsen is a procedure that approximates the complex dimensions of a nonlattice self-similar fractal string by the complex dimensions of a lattice self ...
Michel L. Lapidus +2 more
doaj +1 more source
Cross-Document Pattern Matching [PDF]
, 2012 We study a new variant of the string matching problem called cross-document string matching, which is the problem of indexing a collection of documents to support an efficient search for a pattern in a selected document, where the pattern itself is a ...
A. Andersson +14 more
core +7 more sources
Weighted approximate parameterized string matching
AKCE International Journal of Graphs and Combinatorics, 2017 We consider the problem of finding a bijection to match a pattern in a text where both the pattern and the text are strings from distinct alphabets.
Shibsankar Das, Kalpesh Kapoor
doaj +1 more source
Intuitionistic Fuzzy Automaton for Approximate String Matching
Fuzzy Information and Engineering, 2014 This paper introduces an intuitionistic fuzzy automaton model for computing the similarity between pairs of strings. The model details the possible edit operations needed to transform any input (observed) string into a target (pattern) string by ...
K.M. Ravi, A. Choubey, K.K. Tripati
doaj +1 more source
A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol. [PDF]
PLoS ONE, 2017 In this paper, based on our previous multi-pattern uniform resource locator (URL) binary-matching algorithm called HEM, we propose an improved multi-pattern matching algorithm called MH that is based on hash tables and binary tables. The MH algorithm can
Ping Zeng +7 more
doaj +1 more source
Repetition Detection in a Dynamic String [PDF]
, 2019 A string UU for a non-empty string U is called a square. Squares have been well-studied both from a combinatorial and an algorithmic perspective. In this paper, we are the first to consider the problem of maintaining a representation of the squares in a ...
Amir, Amihood +3 more
core +1 more source
Magnetic strings in Lattice QCD as Nonabelian Vortices
, 2007 Lattice studies indicate existence of magnetic strings in QCD vacuum. We argue that recently found nonabelian strings with rich worldsheet dynamics provide a proper pattern for the strings observed on the lattice.
A. Gorsky +4 more
core +1 more source
Modeling and Analysis of Drill String–Casing Collision under the Influence of Inviscid Fluid Forces
Applied Sciences, 2023 The current study aims to study the drill string–casing system operating in an inviscid fluid under imbalanced and rubbing damage types. The Navier–Stokes equations were linearized to establish the hydrodynamic forces surrounding the drill string and ...
Bernard Xavier Tchomeni Kouejou +2 more
doaj +1 more source