Universal method and device for processing the match of the segmented message mode
A pattern matching and message technology, applied in the field of communication
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0077] For the convenience of explanation, set the content of the transport stream as the matching mode as "rule A'abc'offset 3 depth 50, rule B'def'distance 4 within 10, rule C'ghk'distance 3within 8", referred to as this mode In mode ABC, the transmission content is still "abdddddcabcokabcddrtdefabcdddefdfdkdefkadghkdef". What the above content expresses is that in the transport stream, search for patterns that meet the specified rules A, B, and C: search for "abc" in the content that starts at offset 3 in the transport stream and has a length of 50, and matches A at the position Search for "def" in the content with a length of 10 starting from offset 4, and search for "ghk" in the content with a length of 8 starting at offset 3 at the position that matches B. If the final matching rule ABC is successful, it means that the pattern is matched in the transport stream content. However, those skilled in the art should understand that the setting of the above transport stream ma...
Embodiment 2
[0114] Step 201, when any segmented message is received, judge whether the transport stream where the segmented message is located has flow state information of the current mode, if so, perform step 203, otherwise perform step 202;
[0115] Step 202: Initialize the stream state information of the current mode for the transport stream, including creating the stream state information, specifically, initialize the state tree of the current mode for the transport stream, specifically, set the root node as the stream state information of the current mode and set a record A specified unit of pre-stored characters, the root node is the first matching unit node, at least including matching start position information and matching end position information for recording the first rule match of the pattern;
[0116] Step 203. Combine the segmented message with the pre-stored characters in the flow state information to form a target segmented message, and clear the pre-stored characters in ...
Embodiment 3
[0140] The state machine is mainly applicable to multi-mode matching. Taking the multi-mode matching including four modes as an example, the four modes included are "he", "she", "his" and "hers". It can be seen that multi-pattern matching is more suitable for the case where there are overlapping characters in the included patterns, and the state machine constructed in this way can effectively improve the efficiency. However, the rules in the single mode are often independent of each other. If a state machine is used to construct the result, the result will be linear; a, b, and c as linear states driven by state transitions.
[0141] see Figure 9 , is a schematic diagram of the finite state machine of this embodiment, wherein:
[0142] State 0 is the initial state, states 1, 3, 4, 6, and 8 are intermediate states, and states 2, 5, 7, and 9 are final states. --> is the state transition direction, the character above --> is the state transition driver, such as between state 0 a...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com