Results 41 to 50 of about 469,663 (197)

Relation between flux formation and pairing in doped antiferromagnets [PDF]

, 2001
We demonstrate that patterns formed by the current-current correlation function are landmarks which indicate that spin bipolarons form in doped antiferromagnets. Holes which constitute a spin bipolaron reside at opposite ends of a line (string) formed by
A.L. Chernyshev, B. Bucher, B.I. Shraiman, C.M. Varma, D.A. Ivanov, Dong-Ning Sheng, E. Cappelluti, F.C. Zhang, Fu Chun Zhang, H. Alloul, I.S. Sandalov, J.E. Sonier, L.N. Bulaevskii, M.U. Ubbens, P. Wróbel, P. Wróbel, P. Wróbel, P.A. Lee, P.W. Leung, R. Eder, R. Eder, R. Eder, S. Chakravarty, S.A. Trugman, S.A. Trugman, S.R. White, T. Timusk, V. Emery, Xiao-Gang Wen, Y.J. Uemura, Ziqiang Wang   +30 more
core   +1 more source

Efficient Online Timed Pattern Matching by Automata-Based Skipping

, 2017
The timed pattern matching problem is an actively studied topic because of its relevance in monitoring of real-time systems. There one is given a log $w$ and a specification $\mathcal{A}$ (given by a timed word and a timed automaton in this paper), and ...
A Kane, BW Watson, D Ničković, D Sunday, D Ulus, D Ulus, DE Knuth, DL Dill, DR Kini, E Asarin, F Franek, F Herbreteau, G Behrmann, G Behrmann, H-M Ho, M Waga, O Maler, R Alur, RS Boyer, S Chen, S Faro, T Ferrère, T Reinbacher   +22 more
core   +1 more source

A Parameterized Study of Maximum Generalized Pattern Matching Problems [PDF]

, 2014
The generalized function matching (GFM) problem has been intensively studied starting with [Ehrenfeucht and Rozenberg, 1979]. Given a pattern p and a text t, the goal is to find a mapping from the letters of p to non-empty substrings of t, such that ...
Ordyniak, Sebastian, Popa, Alexandru
core   +1 more source

stringi: Fast and Portable Character String Processing in R

Journal of Statistical Software, 2022
Effective processing of character strings is required at various stages of data analysis pipelines: from data cleansing and preparation, through information extraction, to report generation. Pattern searching, string collation and sorting, normalization,
Marek Gagolewski
doaj   +1 more source

Improved Parallel Rabin-Karp Algorithm Using Compute Unified Device Architecture

, 2018
String matching algorithms are among one of the most widely used algorithms in computer science. Traditional string matching algorithms efficiency of underlaying string matching algorithm will greatly increase the efficiency of any application. In recent
D Xu, DE Knuth, M Gongora-Blandon, N Singla, RM Karp, RS Boyer, RS Chillar   +6 more
core   +1 more source

Machine Learning Blunts the Needle of Advanced SQL Injections

Mendel, 2019
SQL injection is one of the most popular and serious information security threats. By exploiting database vulnerabilities, attackers may get access to sensitive data or enable compromised computers to conduct further network attacks.
Marina Volkova, Petr Chmelar, Lukas Sobotka   +2 more
doaj   +1 more source

A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations. [PDF]

PLoS ONE, 2017
Approximate string matching with k-differences has a number of practical applications, ranging from pattern recognition to computational biology. This paper proposes an efficient memory-access algorithm for parallel approximate string matching with k ...
ThienLuan Ho, Seung-Rohk Oh, HyunJin Kim
doaj   +1 more source

Higher Spins as Rolling Tachyons in Open String Field Theory

, 2016
We find a simple analytic solution in open string field theory which, in the on-shell limit, generates a tower of higher spin vertex operators in bosonic string theory.
Polyakov, Dimitri
core   +1 more source

Mutant knots with symmetry [PDF]

, 2007
Mutant knots, in the sense of Conway, are known to share the same Homfly polynomial. Their 2-string satellites also share the same Homfly polynomial, but in general their m-string satellites can have different Homfly polynomials for m>2.
Morton, H. R.
core   +2 more sources

Advanced String Pattern Matching

, 2023
Regular expressions are used for various string pattern matching tasks, such as search and replace operations in text editors. In this context, a useful feature is capturing groups and back-referencing, that provides the possibility to capture matched strings from the search pattern, and reference these strings in the replacement pattern.
openaire   +2 more sources