91 results about "Substring" patented technology

The invention relates to the technical field of electrical digital data processing, and discloses a statistical entropy and multi-factor fused text similarity data processing method, which comprises the following steps that: a processor extracts substring sets which do not contain maximum common values of a first data sequence and a second data sequence, and calculates the quadratic sum of the lengths of substrings to generate local statistical entropy; traversing the maximum common substring set to obtain storage address indexes of the maximum common substring set in the first data sequence memory space and the second data sequence memory space, and constructing a topological mapping vector of a mapping structure displacement relationship; calculating the total number of inverted pairs of the topology mapping vector by using a merge sorting algorithm, and generating a normalized topology dissipation index; and by taking the local statistical entropy as an information carrier and taking the topological dissipation index as a structural damping factor, executing nonlinear damping modulation operation to obtain a final similarity score, and solving the technical problem that the block-level displacement cannot be identified by linear scanning logic by quantizing topological entropy increase of data distributed in a storage space.

The invention discloses a method and a device for converting a natural language into an SQL (Structured Query Language) statement based on a large model. The method comprises the following steps: S1, performing data governance on an original data table; s2, constructing indexes for all the values in the database, selecting correlation values from the database based on the user problems, calculating the matching degree between the user problems and the correlation values based on a longest common substring matching algorithm, and selecting the correlation value with the highest matching degree; s3, rewriting the problem of the user; s4, performing word segmentation matching on the user question; s5, storing the accumulated seed question and answer statements into a vector database, performing weight assignment on different keywords in the user question, matching the user question with the accumulated seed question and answer statements, and selecting SQL question and answer statements; and S6, optimizing the DDL statement to construct a Prompt statement, and calling the large model to generate an SQL statement. According to the method, the quality of the SQL statements generated by the large model is greatly improved, and the flexibility of querying the statements by the user and the accuracy of generating the SQL statements are greatly improved.

To replace texts related to speech recognition results without modifying a model.SOLUTION: A replacement device 10 comprises: a string acquisition unit 111 for acquiring a first string related to a first text that is a speech recognition result and a second string related to a second text that has been registered in advance; a selection unit 112 for selecting a range to be replaced from the first text based on similarity between at least a substring of the first string and the second string; and a replacement unit 113 that replaces the range to be replaced with the second text.SELECTED DRAWING: Figure 2

A system and method for generating structured data objects from unstructured data is provided. The unstructured data is received and parsed by comparing substrings with entries from an entities data structure and a listing of curated patterns to identify and classify substrings. The identified substrings are then ranked and filtered to identify one or more of the most relevant substrings. One or more of the ranked and filtered substrings are used to generate a structured data object.

The present application discloses a quantum computing task processing method, system, and computer device, relating to the field of quantum technology. The quantum computing task processing method includes: transforming the input quantum state of n+m quantum bits through a parameterized quantum circuit; the n+m quantum bits include n task bits and m auxiliary bits; measuring the output quantum state of the n+m quantum bits to obtain a bit string of n+m quantum bits; when the substring of the m auxiliary bits meets the post-selection condition and the parameterized quantum circuit has not converged, updating the parameters of the parameterized quantum circuit based on the output quantum state of the n task bits; when the substring meets the post-selection condition and the circuit converges, obtaining the calculation result based on the output quantum state of the n task bits. The above scheme improves the expressive power of the PQC of the variational task, thereby improving the execution effect of the variational task.

There is disclosed a computer-implemented method for detecting machine-generated documents in a collection of documents including machine-generated and human-authored documents. The computer-implemented method includes computing a set of long-repeated substrings (such as super-maximal repeats) with respect to the collection of documents and using a subset of the long-repeated substrings to designate documents containing the subset of the repeated substrings as machine-generated. The documents designated as machine-generated serve as positive examples of machine-generated documents and a set of documents including at least one human-authored document serves as negative examples of machine-generated documents. A plurality of classifiers are trained with a dataset including both the positive and negative examples of machine-generated documents. Classified output of the classifiers is then used to detect an extent to which a given document of the dataset is machine-generated.

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.

The present application relates to the technical field of information security, and aims at the problems that password guessing based on probabilistic context-free grammar is difficult to identify multi-semantic patterns and the semantic guidance strength is uncontrollable, and proposes a password guessing method based on multi-semantic fusion of probabilistic context-free grammar: enumerating sub-strings in the training password, identifying semantic segments according to simple, date, vocabulary and name patterns and prioritizing disambiguation, dynamically planning segmentation according to the principle of maximum semantic coverage and least semantic segments, setting semantic enhancement parameters β for each semantic pattern during training to weight and normalize the count, and outputting the candidate password dictionary according to the probability priority queue during generation, which is suitable for efficient password guessing in offline password audit, password policy evaluation and penetration testing.

This invention provides a method for calculating semantic similarity based on adjacent word features, relating to the field of natural language processing. First, in the example word extraction module, example words are extracted from the example sentence and the sentence to be matched using the longest common substring algorithm. Second, in the example sentence processing module, word segmentation is performed on the example sentence excluding the example words, and part-of-speech tagging is applied to the example words. Then, in the feature extraction module, features are extracted from the words surrounding the example words in the example sentence. The correlation between the surrounding words and the example words and option words is calculated using a corpus. The calculated results are weighted and combined with their respective features to form the features of the example words and option words. Finally, in the option processing module, the part-of-speech of the option words is compared with that of the example words, and a similarity score is calculated based on the features of the option words to select the optimal option word. This invention determines the features of the current word by extracting features from surrounding words and calculating correlation; it uses a corpus to calculate the mutual information between two words to achieve the correlation between the two words.

A computerized method of assigning a building automation system point type to a plurality of unclassified data points is provided. The method includes receiving unclassified data points and attributes for each data point. The method includes receiving classifications for a first subset of the unclassified data points. Each classification associates a data point with a building automation system point type. The method includes generating a term set containing substrings that appear in the attributes. The method includes generating a first matrix describing a frequency that the substrings appear in the attributes. The method includes calculating an indicator of a probability that the presence of the selected substring results in the data point belonging to the selected point type. The method includes assigning a point type to a second subset by finding the substring and potential point type pair having the greatest indication of probability.

A method includes storing input data in a first buffer where the input data includes a first set of symbols. The method also includes obtaining one or more keys from a second buffer where the one or more keys individually include buffer substrings. The method further includes comparing a portion of the first set of symbols to the buffer substrings to identify one or more substring matches. The method also includes identifying a longest substring match of the one or more substring matches. The longest substring match includes substring match symbols. The method further includes retaining a key of the one or more keys associated with the longest substring match. The method also includes performing a compression operation to the substring match symbols. The method further includes removing the portion of the first set of symbols from the first buffer.

This application relates to an FPGA-based full-offload regular expression matching system and method. The system includes a regular expression rule compilation unit and an FPGA full-matching unit. The regular expression rule compilation unit receives a set of regular expression rules, extracts fixed feature substrings from each rule, compiles a uniformly formatted isomorphic NFA, and constructs a mapping table between substrings and corresponding NFAs. The FPGA full-matching unit includes a parallel high-speed string matching engine array, a string-NFA mapping table module, a full regular expression data storage, a reconfigurable general-purpose NFA engine module, and a matching result output module. It performs full-offload regular expression matching on input network traffic: scanning the traffic through the engine array, filtering traffic containing fixed feature substrings to be verified and outputting substring identifiers, querying the NFA identifiers through the mapping table module, and loading the NFA for matching by the reconfigurable engine module. This method ensures low latency and high throughput performance for regular expression matching in high-speed network environments.

The application relates to the technical field of data processing, and discloses a SQL-based column segmentation method, device, equipment and storage medium, which comprises the following steps: obtaining a to-be-divided string, and sorting different text data in the to-be-divided string; saving the sorted string to a first temporary table space of a database, obtaining the number of substrings of the text data of the sorted string in the first temporary table space; dividing the text data according to the number of substrings to obtain divided text data; performing a column-to-row operation on the multiple substrings in the divided text data respectively, so that each column comprises one substring; saving the substrings and the corresponding number of times of the substrings to a second temporary table space of the database, sorting the substrings according to the corresponding number of times of the substrings to obtain a segmentation result. The application can be applied to the data processing of financial technology and medical health, can avoid increasing the complexity of a database management system, and can reduce the configuration and maintenance cost of the database.

The invention relates to a weak password judgment method and device. The method comprises the steps of obtaining a target character string, wherein the target character string is used for indicating a preset continuous character sequence and / or a keyboard character sequence; acquiring a password character string input by a user, and splitting the password character string into a plurality of substrings; a first array of each substring is determined, a second array is determined according to the first array, the first array is used for describing prefix and suffix features of a pattern string pointer on the substring, and the second array is used for indicating a rollback position of the pattern string pointer in the substring when matching fails; according to the second array of each substring, string matching is conducted on the substring and the target character string, a password judgment result is determined according to a matching result, and the password judgment result is used for indicating whether the password character string belongs to a weak password or not. According to the scheme provided by the invention, redundant and repeated operations can be reduced, and the recognition efficiency of the weak password is improved.

The embodiment of the present application discloses a kind of artificial address text similarity processing method and system filled in.This embodiment of the present application removes the regular character appearing in address in a reasonable way, so as to remove the error similarity contribution caused by address regular character.Using lower time complexity, the common substring of all more than two lengths in two addresses is calculated.A designed increasing function can map the length sequence of common substring into [0,1] space, and the function reasonably describes the characteristics of human-filled address data.A kind of address clustering algorithm capable of identifying not similar but actually identical address is designed.

The application relates to the technical field of network security, and in particular to a signature method and device, equipment and a medium. In the embodiment of the application, on the basis of obtaining a first string corresponding to request data, the first string is first divided into a first preset number of first substrings, then a shift operation is performed on each first string according to the offset corresponding to each first substring, and finally each string obtained after the shift is spliced to obtain a signature string. The complexity of the corresponding signature algorithm is higher, even if a rule-violating person with reverse experience tampers with the request data, it is impossible to think how to sign the tampered request data based on the signature algorithm of the application, therefore, the server can accurately verify whether the request data is tampered with based on whether the received signature string and the signature string calculated by the server based on the request data are consistent, and the security is higher.

The invention provides a bidding document duplicate checking method, system and device and a medium. The method comprises the steps of obtaining file content of a bidding document; the bidding document comprises a document to be subjected to duplicate checking and a comparison document; extracting sub-strings of the file content; performing bucket dividing processing on the sub-character strings, and mapping the sub-character strings meeting a preset condition into the same hash bucket; calculating the similarity between the sub-character strings of the document to be subjected to duplicate checking and the sub-character strings of the comparison document in the same hash bucket, and determining the pairing relationship between the sub-character strings; performing pairing and merging according to the pairing relationship to obtain a maximum repeated fragment; and calculating a content repetition rate according to the maximum repetition fragment so as to determine a duplicate checking result of the bidding document. Similar sub-strings are concentrated in the same hash bucket through a bucket dividing strategy, so that rapid repeated detection of large-scale text data is realized, and the duplicate checking response speed is increased; and determining the maximum duplicate fragment according to the similarity and the pairing relationship, thereby solving the problem that duplicate fragments with a small number of altered characters cannot be identified.

An adder for binary strings comprises a plurality of adder circuits arranged such that each adder circuit executes an addition of bits in the same position on a pair of binary substrings at the same t

A quantum computing task processing method includes: performing transformation processing on input quantum states of n+m qubits through a parameterized quantum circuit, the n+m qubits including n task bits and m auxiliary bits; measuring output quantum states of the n+m qubits to obtain a bit string of the n+m qubits; updating parameters of the parameterized quantum circuit based on output quantum states of the n task bits when an auxiliary substring satisfies a post-selection condition and the parameterized quantum circuit has not converged, the auxiliary substring being a substring corresponding to the m auxiliary bits in the bit string; and obtaining a computing result of the target quantum computing task based on the output quantum states of the n task bits when the auxiliary substring satisfies the post-selection condition and the circuit has converged.

An apparatus, system and method of entity / mention text transformation. The disclosure is and includes a computer readable medium storing non-transitory instructions that, when executed by a processor, cause the processor to perform operations including: recognizing entity text in an online posting comprising a plurality of substrings, wherein the plurality of substrings includes a subset of candidate strings, wherein the subset of candidate strings includes at least a first candidate string, and wherein the recognizing includes determining a first entity corresponding to the first candidate string; mapping the first entity to a first set of one or more prospective replacement texts; ranking the prospective replacement texts based on a plurality of weighted factors; and reconstructing the online posting, wherein the reconstructing includes replacing the first candidate string with a highly ranked one of the prospective replacement texts.

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.

The present disclosure provides an instruction recognition method, an instruction recognition device, an equipment and a computer medium. The instruction recognition method comprises: acquiring a to-be-recognized voice, and performing voice recognition on the to-be-recognized voice to obtain a corresponding recognized text; matching the recognized text with N command texts in a command text library to obtain N longest common subsequences and N longest common substrings of the recognized text and the N command texts; wherein N is an integer greater than 0; and determining a target text corresponding to the recognized text in the command text library according to lengths of the N longest common subsequences and lengths of the N longest common substrings.

The specification relates to the technical field of computers, in particular to a two-dimensional code check-in system, method and device and a two-dimensional code generation method. The system comprises a server, a check-in client and an attending client. The server is used to extract at least one character in a first token string corresponding to each conference scene, divide the first token string into multiple sub-strings; after determining that the check-in client and the attending client correspond to the same conference scene, analyze a first sub-string in a check-in client two-dimensional code and a second sub-string in an attending client two-dimensional code; according to a conference scene number, restore the first sub-string and the second sub-string to generate a second token string; judge whether the first token string and the second token string are consistent; the check-in client is used to generate a check-in two-dimensional code; and the attending client is used to generate an attending two-dimensional code according to a current time and a conference scene number of the attending client. The scheme enhances the security of the generated two-dimensional code and avoids false check-in by photographing and scanning the code.

The present invention discloses a privacy-protected matching method, which includes the following steps: sending the length value m of the character substring to the second end, so that the second end cuts the long character string held by the second end into g character strings of length m; receiving the number g returned by the second end, and obtaining the value k to generate two random binary matrices of g rows and k columns, namely, matrix T and matrix U; in the case of receiving an instruction for the receiving end to participate in the oblivious transmission, performing k oblivious transmissions of length g with the corresponding columns of matrix T and matrix U as input; in the case of receiving an oblivious pseudo-random function execution instruction, performing g preset oblivious pseudo-random functions with the character substring as input to obtain a first output result; obtaining the second input result sent by the second end, and comparing the first output result with the second output result to confirm the matching result. Accordingly, the present invention discloses a privacy-protected matching system.

A method for formatting a binary string in such a way that the need to consider a carry-over bit from an upstream adder is removed, by splitting the binary string into a pair of binary substrings and

The present application provides a method, apparatus, storage medium, and device for detecting abnormal domain names. This method, based on the significant differences in character distribution between normal and abnormal domain names, uses the N-Gram method to segment the character string of the domain name to be detected. The probability distribution of each target substring set obtained by the segmentation is then calculated. The JS divergence between the probability distribution of each target substring set and the probability distribution of the substring set of the normal domain name is then calculated. Finally, the calculated JS divergence is compared with a preset divergence threshold to determine whether the domain name to be detected is an abnormal domain name. This effectively improves the accuracy of abnormal domain name detection.

A suspicious Uniform Resource Locator (URL) of a resource on the public Internet is detected by searching a part of the URL for a candidate substring, which is the longest possible substring that is in accordance with a Base64 encoding scheme. The candidate substring is converted to a candidate binary data in accordance with the Base64 encoding scheme. The candidate binary data is then converted to a candidate American Standard Code for Information Interchange (ASCII) string. The candidate ASCII string is evaluated to determine the information type of the candidate ASCII string. A determination as to whether the URL is suspicious is based at least on the information type of the candidate ASCII string.

The present application discloses a string processing method and apparatus, which helps to save memory space and improve the efficiency of string data processing. The string processing method is applied to a computer device, and the method includes: obtaining a plurality of target strings, where each target string in the plurality of target strings includes at least one character. Obtaining a first substring group from the same position of each target string. Among them, the first substring in the first substring group includes some characters in the target string where the first substring is located. The substrings in the first substring group correspond to the same digit positions. Determine the base number of the digit positions corresponding to each substring in the first substring group according to the number of different substrings in the first substring group. Determine the target value corresponding to each target string according to the base number of the digit positions corresponding to each substring in the first substring group and the value corresponding to each substring in the first substring group, and process the plurality of target strings based on the target value corresponding to each target string.

Methods, systems, and media for lot classification are disclosed. In one example, a classification system for identifying lot listings receives a description for a listing in a publication system, identifies a string in the listing, identifies a quantity word or digit in the string, and converts an identified quantity word into digit form. A normalized string is tokenized to produce tokens, the tokenizing of the normalized string including splitting the normalized string into a series of substrings using a sequence of delimiters. For each substring, an additional split is performed by separating any digit from any other adjacent character, unless that character is another digit, and maintaining an internal character order of each split substring to produce a flattened list of tokenized tokens.

Embodiments provide systems, methods, and computer storage media for determining string similarity and pattern matching in strings that arrive in a stream. A stream representing string of characters is received and used to compute mapping values that are compared to a mapping value of a query string to identify a match between strings in the stream of characters and the query string. The stream of characters is searched in a single sequential pass to detect a match or the longest matching substring with a query string. An identified match or absence of a match is provided.