6 results about "Substring" patented technology

The application relates to a code detection method and device, computer equipment and a storage medium. The method comprises the following steps: obtaining a target code to be detected; performing string division on the target code to obtain a target substring sequence; obtaining a substring vector corresponding to each target substring in the target substring sequence to form a vector sequence; performing linear feature extraction on the vector sequence to obtain first extracted features, and performing nonlinear feature extraction on the vector sequence to obtain second extracted features; performing fusion processing on the first extracted features and the second extracted features to obtain fusion features; and performing code detection based on the fusion features to obtain a code detection result corresponding to the target code. A cloud server can use an artificial intelligence-based malicious code detection model to implement the code detection method of the application, thereby achieving the purpose of reducing network attacks. The method can improve the accuracy of malicious code detection.

This invention relates to the field of document processing and text analysis technology, and discloses a text comparison method based on a sliding window and a dynamically expanding KMP algorithm. This method sets a minimum matching threshold, uses a sliding window with a step size of 1 to extract substrings from the document character by character as matching patterns, and then employs an improved KMP algorithm for scanning and matching to fully preserve the actual position information of characters in the original text. This effectively avoids positional deviations and context loss caused by preprocessing in traditional methods. After a successful initial match, the system automatically enters a dynamic expansion phase, extending the matching range character by character until continuous matching is no longer possible, thereby determining the longest repeating text segment. After matching, a dedicated result merging module intelligently merges and structures adjacent or overlapping matching segments, ultimately outputting a clear result containing the original start and end positions, repeating content, and length information. These operations significantly improve the efficiency and accuracy of large-scale document comparison.

Provided herein are systems and methods for detecting and sanitizing sensitive data using domain-enhanced attention neural networks. In some embodiments, a processor of a client retrieves training data comprising tuples. Each tuple comprises a first parameter and a second parameter. For each tuple the processor matches a substring in a first parameter of the respective tuple to a keyword of a plurality of keywords, identifies a security category corresponding to the at least one keyword, and expands the first parameter of the respective tuple to comprise a respective string associated with the application event and the security category. The processor trains a model to detect and sanitize the sensitive data from the application events using the tuples, including an expanded first parameter for each tuple. The processor sanitizes the sensitive data using the trained model.

This application provides a deep learning-based regular expression matching method, apparatus, electronic device, and storage medium. The method includes acquiring a text string to be processed and segmenting it into multiple text substrings; sequentially inputting the multiple text substrings into a pre-trained prediction model to obtain the initial state prediction results output by the prediction model, the initial state prediction results including the predicted initial DFA state value of each text substring; for each text substring, performing string scanning based on the predicted initial DFA state value of the text substring to obtain the corresponding regular expression scanning result; and determining whether the concatenation condition is satisfied based on the connection relationship between the scanning results corresponding to all text substrings to obtain the regular expression scanning result of the text string to be processed.

This application provides a data query method, electronic device, computer storage medium, and program product. The method includes: using a statistical language model to segment a natural language query statement into multiple corresponding query segments; constructing a structured query language (SQL) statement for querying based on the multiple query segments using regular expressions, and obtaining multiple candidate query results by executing the SQL statement; extracting the longest common substring from each of the multiple candidate query results and the natural language query statement to obtain a target common substring; and determining the target query result that responds to the natural language query statement from the multiple candidate query results based on the target common substring. Therefore, this method can improve data query efficiency and the accuracy of query results, thereby meeting the user's query needs.

The application provides a data processing method and device, computer equipment and a storage medium, applied to the information field, and the method comprises the steps of: acquiring an application calling topological graph corresponding to a target object, wherein the application calling topological graph comprises a calling relationship between a plurality of data nodes called when the target object is executed; encoding the data nodes in each calling level of the application calling topological graph respectively, and generating a string corresponding to each calling level; determining a target substring in the string corresponding to each calling level and branch data corresponding to the target substring in the application calling topological graph, wherein the target substring is used to represent a data node that is called in a loop and meets a preset condition in the calling level; and deleting the branch data in the application calling topological graph. The data processing method provided by the application determines the branch data called in a loop by encoding the data nodes, thereby trimming the branch data, so as to reduce the storage cost of the application calling topological graph.