scholarly journals Bimonadic Semantics for Basic Pattern Matching Calculi

2006 ◽  
pp. 253-273
Author(s):  
Wolfram Kahl ◽  
Jacques Carette ◽  
Xiaoheng Ji
Keyword(s):  
Pattern Matching ◽  
Basic Pattern

scholarly journals Formalization of basic pattern matching algorithms in production systems

2015 ◽  
Vol 4 (3(76)) ◽  
pp. 22
Author(s):  
Світлана Ігорівна Шаповалова ◽  
Ольга Олександрівна Мажара
Keyword(s):  
Pattern Matching ◽  
Production Systems ◽  
Basic Pattern

scholarly journals Integrated Memristor-MOS (M2) Sensor for Basic Pattern Matching Applications

2013 ◽  
Vol 13 (5) ◽  
pp. 3638-3640 ◽  
Author(s):  
Omid Kavehei ◽  
Kyoung-Rok Cho ◽  
Sang-Jin Lee ◽  
Said Al-Sarawi ◽  
Kamran Eshraghian ◽  
...  
Keyword(s):  
Pattern Matching ◽  
Basic Pattern

Hierarchical switching in a multi-dimensional task space is not induced by specific task cues

2001 ◽  
Vol 209 (2) ◽  
pp. 105-117 ◽  
Author(s):  
Thomas Kleinsorge ◽  
Herbert Heuer ◽  
Volker Schmidtke
Keyword(s):  
Specific Task ◽  
Task Space ◽  
Basic Pattern ◽  
Task Representation ◽  
Switching Mechanism ◽  
Factorial Combination ◽  
Individual Task ◽  
The Individual ◽  
The Way

Summary. When participants have to shift between four tasks that result from a factorial combination of the task dimensions judgment (numerical vs. spatial) and mapping (compatible vs. incompatible), a characteristic profile of shift costs can be observed that is suggestive of a hierarchical switching mechanism that operates upon a dimensionally ordered task representation, with judgment on the top and the response on the bottom of the task hierarchy ( Kleinsorge & Heuer, 1999 ). This switching mechanism results in unintentional shifts on lower levels of the task hierarchy whenever a shift on a higher level has to be performed, leading to non-shift costs on the lower levels. We investigated whether this profile depends on the way in which the individual task dimensions are cued. When the cues for the task dimensions were exchanged, the basic pattern of shift costs was replicated with only minor modifications. This indicates that the postulated hierarchical switching mechanism operates independently of the specifics of task cueing.

Pattern Recognition for Classification and Matching of Car Tires

2005 ◽  
Vol 33 (1) ◽  
pp. 2-17 ◽  
Author(s):  
D. Colbry ◽  
D. Cherba ◽  
J. Luchini
Keyword(s):  
Computer Vision ◽  
Feature Extraction ◽  
Pattern Matching ◽  
Fourier Transforms ◽  
Two Dimensions ◽  
Multiple Sources ◽  
Matching Process ◽  
Visual Searches ◽  
New Feature ◽  
2D Fft

Abstract Commercial databases containing images of tire tread patterns are currently used by product designers, forensic specialists and product application personnel to identify whether a given tread pattern matches an existing tire. Currently, this pattern matching process is almost entirely manual, requiring visual searches of extensive libraries of tire tread patterns. Our work explores a first step toward automating this pattern matching process by building on feature analysis techniques from computer vision and image processing to develop a new method for extracting and classifying features from tire tread patterns and automatically locating candidate matches from a database of existing tread pattern images. Our method begins with a selection of tire tread images obtained from multiple sources (including manufacturers' literature, Web site images, and Tire Guides, Inc.), which are preprocessed and normalized using Two-Dimensional Fast Fourier Transforms (2D-FFT). The results of this preprocessing are feature-rich images that are further analyzed using feature extraction algorithms drawn from research in computer vision. A new, feature extraction algorithm is developed based on the geometry of the 2D-FFT images of the tire. The resulting FFT-based analysis allows independent classification of the tire images along two dimensions, specifically by separating “rib” and “lug” features of the tread pattern. Dimensionality of (0,0) indicates a smooth treaded tire with no pattern; dimensionality of (1,0) and (0,1) are purely rib and lug tires; and dimensionality of (1,1) is an all-season pattern. This analysis technique allows a candidate tire to be classified according to the features of its tread pattern, and other tires with similar features and tread pattern classifications can be automatically retrieved from the database.

Parallel Combining Different Approaches to Multi-pattern Matching for Fpga-based Security Systems

2017 ◽  
Vol 5 (1) ◽  
pp. 8-15
Author(s):  
Sergii Hilgurt ◽  
Keyword(s):  
Information Security ◽  
Pattern Matching ◽  
Intrusion Detection System ◽  
Detection System ◽  
Finite Automata ◽  
Network Intrusion Detection ◽  
Security Systems ◽  
Analytical Technique ◽  
Network Intrusion ◽  
Pros And Cons

The multi-pattern matching is a fundamental technique found in applications like a network intrusion detection system, anti-virus, anti-worms and other signature- based information security tools. Due to rising traffic rates, increasing number and sophistication of attacks and the collapse of Moore’s law, traditional software solutions can no longer keep up. Therefore, hardware approaches are frequently being used by developers to accelerate pattern matching. Reconfigurable FPGA-based devices, providing the flexibility of software and the near-ASIC performance, have become increasingly popular for this purpose. Hence, increasing the efficiency of reconfigurable information security tools is a scientific issue now. Many different approaches to constructing hardware matching circuits on FPGAs are known. The most widely used of them are based on discrete comparators, hash-functions and finite automata. Each approach possesses its own pros and cons. None of them still became the leading one. In this paper, a method to combine several different approaches to enforce their advantages has been developed. An analytical technique to quickly advance estimate the resource costs of each matching scheme without need to compile FPGA project has been proposed. It allows to apply optimization procedures to near-optimally split the set of pattern between different approaches in acceptable time.

Sign in / Sign up

Export Citation Format

Share Document