Results 1 to 10 of about 2,691,081 (297)
Algebraic Pattern Matching in Join Calculus [PDF]
Logical Methods in Computer Science, 2008 We propose an extension of the join calculus with pattern matching on algebraic data types. Our initial motivation is twofold: to provide an intuitive semantics of the interaction between concurrency and pattern matching; to define a practical ...
Qin Ma, Luc Maranget
doaj +1 more source
Refactoring pattern matching [PDF]
Science of Computer Programming, 2013 Defining functions by pattern matching over the arguments is advantageous for understanding and reasoning, but it tends to expose the implementation of a datatype. Significant effort has been invested in tackling this loss of modularity; however, decoupling patterns from concrete representations while maintaining soundness of reasoning has been a ...
Meng Wang 0002 +3 more
openaire +4 more sources
A memory-efficient deterministic finite automaton-based bit-split string matching scheme using pattern uniqueness in deep packet inspection. [PDF]
PLoS ONE, 2015 This paper proposes a memory-efficient bit-split string matching scheme for deep packet inspection (DPI). When the number of target patterns becomes large, the memory requirements of the string matching engine become a critical issue. The proposed string
HyunJin Kim, Kang-Il Choi, Sang-Il Choi
doaj +1 more source
Grouping Quick Search Matching Algorithm for Bit Steam [PDF]
Jisuanji gongcheng, 2017 In the pattern matching of bit stream,because the character sets of target string and pattern string are simple,the average jumping length of matching window is short during the matching process,making Quick Search(QS) matching not efficient.So this ...
TAO Zhao,YANG Jianbo,ZHANG Bo,ZHANG Liyun
doaj +1 more source
Matchings and Partial Patterns [PDF]
The Electronic Journal of Combinatorics, 2010 A matching of size $2n$ is a partition of the set $[2n]=\{1,2,\dotsc,2n\}$ into $n$ disjoint pairs. A matching may be identified with a canonical sequence, which is a sequence of integers in which each integer $i\in[n]$ occurs exactly twice, and the first occurrence of $i$ precedes the first occurrence of $i+1$.
Vít Jelínek, Toufik Mansour
openaire +3 more sources
Spintronic In-Memory Pattern Matching
IEEE Journal on Exploratory Solid-State Computational Devices and Circuits, 2019 Traditional Von Neumann computing is falling apart in the era of exploding data volumes as the overhead of data transfer becomes forbidding. Instead, it is more energy-efficient to fuse compute capability with memory where the data reside.
Zamshed I. Chowdhury +8 more
doaj +1 more source
Research on Uyghur Pattern Matching Based on Syllable Features
Information, 2020 Pattern matching is widely used in various fields such as information retrieval, natural language processing (NLP), data mining and network security. In Uyghur (a typical agglutinative, low-resource language with complex morphology, spoken by the ethnic ...
Wayit Abliz +6 more
doaj +1 more source
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomohiro I +2 more
openaire +1 more source
, 2007 It is quite appealing to base the description of pattern-based searches on positive as well as negative conditions. We would like for example to specify that we search for white cars that are not station wagons. To this end, we define the notion of anti-patterns and their semantics along with some of their properties.
Kirchner, Claude +2 more
openaire +3 more sources
Contactless Material Tensile Testing Using a High-Resolution Camera
Computation, 2022 This article deals with the use of contactless measurement with a high-resolution imaging device during tensile testing of materials in a universal tearing machine (UTM).
Jaroslav Bulava +2 more
doaj +1 more source