67 results about "Exact match" patented technology

The invention discloses a permission matching method and device, and relates to the technical field of computers. The method comprises the following steps: acquiring a to-be-matched path; performing permission rule matching on the to-be-matched path based on a pre-constructed permission rule tree; when the permission rule in the permission rule tree is matched, determining a corresponding rule control permission based on the permission rule, and obtaining a permission matching result of the to-be-matched path; and when the permission rule in the permission rule tree is not matched, determining a preset default control permission as a permission matching result of the to-be-matched path. According to the method, the accurate child nodes, the single-wildcard child nodes and the multi-wildcard child nodes are integrated through the permission rule tree of the single tree structure, common permission matching scenes such as accurate matching, single-segment wildcard matching and cross-multi-segment wildcard matching can be covered without introducing a regular expression, the integrity of the expression ability is guaranteed, the implementation complexity is reduced, and the implementation efficiency is improved. And the system stability is improved. And meanwhile, the problem of matching logic confusion caused by traditional multi-rule scattered storage is avoided.

The invention relates to the technical field of artificial intelligence and music information processing, in particular to a multi-modal signal fusion music playing accuracy evaluation system. The system comprises a multi-modal signal synchronous acquisition module, a signal preprocessing and feature extraction module, a time domain alignment and event association engine, a hierarchical collaborative evaluation module and a comprehensive evaluation report generation module. Through high-precision synchronous acquisition of an MIDI instruction, an acoustic signal and a structural vibration signal, a nonlinear time domain alignment mechanism taking dynamic time warping as a core is constructed, accurate matching of a symbol event and a physical response is realized, and an alignment multi-modal event frame is formed; and collaborative quantitative evaluation of basic accuracy, technical skill and music expressive force is carried out through the hierarchical model. By adopting the technical scheme, full-link high-fidelity analysis from playing intention to physical presentation can be realized, and the accuracy, robustness and interpretability of evaluation are remarkably improved.

The invention discloses an interface internationalization language switching method based on a go language, and relates to the technical field of interface data processing. The method comprises the steps of 1, defining a translation data processing function, converting a to-be-translated field in an interface response message into a JSON object, and performing recursive matching on a key value of the JSON object and a key value of a pre-stored translation text; 2, binding a translation data processing function to a target interface, and automatically triggering translation processing after interface business logic is executed; 3, multi-language translation data are pre-stored through a database table or a JSON file, a storage structure comprises source language columns and multiple target language columns, and source language data and target language data in the same row are in one-to-one correspondence; and 4, dynamically loading translation data corresponding to a target language according to the language parameters in the request header when responding to message processing, and completing text replacement through accurate matching or fuzzy matching.

The invention relates to a multi-stage gene data accurate matching method and system, and the method comprises the steps: selecting K continuous basic groups from a to-be-processed read sequence as retrieval character strings according to a preset initial length K, and determining a matching interval of the retrieval character strings in a reference genome from a hash table constructed according to the length K in advance through a Kmer-Index algorithm; in the matching interval, carrying out base-by-base expansion and matching on the retrieval character string based on a pre-constructed FM index through an FM-Index algorithm until the number of matching positions of the retrieval character string and a reference genome is reduced to a preset matching frequency threshold value; and for each retrieval character string obtained after base-by-base expansion and matching, expanding according to a single base comparison mode until mismatching occurs, and taking the retrieval character string with the maximum number of matched bases as a finally determined seed sequence. According to the gene data accurate matching scheme, the seed search performance and the memory use efficiency can be improved, and the accurate matching position of the seed can be quickly searched under the condition of limited hardware resources.

The embodiment of the application discloses a source code positioning detection method and system, electronic equipment and a storage medium, and relates to the technical field of static security detection. The method comprises the following steps: generating a corresponding bytecode file based on a to-be-positioned source code; the bytecode file comprises structure information, metadata and method information; analyzing the bytecode file to obtain intermediate code corresponding to the bytecode file; parsing the intermediate code to generate a function sequence list called in the to-be-positioned source code; the function sequence list comprises attribute information and calling information of a function; and matching and querying according to the function sequence list to determine position information of the to-be-positioned source code. The application can realize accurate matching and positioning of a source code function, thereby solving the false alarm problem of functions with the same name in different modules and being suitable for a source code function static detection scene.

This application relates to the field of artificial intelligence, and more particularly to a method, apparatus, device, and program product for controlling document editing. The method includes: receiving a document editing request from a large language model agent; if no exact matching sequence is found in the target file for the content to be replaced, calculating the similarity between the content to be replaced and the sequence in the target file, and locating the best matching segment based on the similarity; performing a difference analysis between the content to be replaced and the best matching segment and generating an error diagnosis report including difference information; returning the error diagnosis report to the large language model agent, guiding the agent to correct the document editing request. This method finds the best matching segment for sequences that fail to match precisely and generates an error diagnosis report including difference information, facilitating rapid location of differences, reducing invalid attempts, and improving the agent's repair efficiency.

The invention belongs to the technical field of software engineering, and particularly relates to a probe generation method, system, equipment and medium for model coverage analysis, and the method comprises the following steps: traversing source codes of a whole model to identify operators needing instrumentation; aiming at each operator, generating a mapping file carrying a unique identifier according to a logic path recorded in the operator; wherein the mapping file defines a mapping relationship between the coverage state of each logic path and the bit of the integer value in the log entry; and generating one or more probes according to the number of logic paths recorded in the mapping file, and modifying source codes of the model according to source files of the probes to realize automatic instrumentation. According to the method, pre-compiling is not carried out during instrumentation, one or more probes with accurate matching interfaces are dynamically generated according to the monitoring requirements of a specific model, and compared with a limited preset traditional scheme, the number of the probes can be infinitely increased, and the actual requirements are met.

The application discloses a decoupling method, device, program product, server and storage medium, and relates to the field of servers. In view of the problem that the close coupling between a BMC and a BIOS causes the firmware versions of both to have to be kept in synchronization at all times, a decoupling method is provided, which introduces semantic hash values to replace field names to perform accurate matching of fields. Because the semantic hash values can represent the essential meaning of the fields better than the field names, the semantic hash values do not require complete consistency of surface names. Therefore, replacing the field names with the semantic hash values to perform field matching can improve compatibility and also enable automatic renaming of the field names. Based on this, the method can reduce the coupling between the BIOS and the BMC, so that the BMC and the BIOS versions can be upgraded independently and do not need to be maintained synchronously, thereby significantly reducing operation and maintenance costs.

The invention provides an engineering specification document processing method and system, and relates to the field of data set production, and the method comprises the steps: generating a chapter index sequence based on the hierarchical number characteristics of an engineering specification document; the method comprises the following steps: converting an engineering specification document into a high-resolution image, identifying text content based on an OCR technology, extracting a numbering mode from the OCR identification content through a regular expression, and accurately matching the numbering mode with a chapter index sequence so as to obtain page numbers and coordinate information of identified chapters; the missing position is calculated according to the coordinate information of the adjacent chapters, and interpolation completion is carried out on the missing coordinate information; calculating the image boundary of each chapter according to the complemented coordinate set, cutting the picture of the engineering specification document according to the image boundary, setting a boundary protection mechanism in the cutting process to maintain the integrity of the text content of each chapter, and finally forming a structured image library which can be directly used for knowledge management and intelligent retrieval. And the engineering specification retrieval efficiency and accuracy are improved.

The invention discloses an accurate model selection method and device for pneumatic element products. The method comprises the following steps: receiving a serial number and attribute information of a pneumatic element product to be selected input by a user; according to a preset detection rule, the serial number and the attribute information of the pneumatic element product to be selected are detected, and whether the corresponding all-model information is correct or not is judged; if the judgment result is yes, product information of the pneumatic element is retrieved according to all-model information corresponding to the serial number and the attribute information; and returning the retrieved product information. The device comprises a data receiving module, a detection module, a retrieval module and an information return module. The model selection method and device are more suitable for the conditions that the product capacity is huge and the product attribute information is complex, the product information of the pneumatic element to be selected can be accurately matched, the model selection method and device are more suitable for the accurate model selection requirement of similar pneumatic element products, and meanwhile the model selection accuracy is effectively improved.

The invention relates to the technical field of text processing and information retrieval, and discloses a fuzzy matching method and system based on an AC tree, electronic equipment and a storage medium. According to the fuzzy matching method based on the AC tree, a flexible matching strategy is achieved by setting the maximum skipping number, and in the process of matching a to-be-matched text based on the AC tree, the maximum skipping number is set, so that the matching efficiency is improved. If the current character is not matched, the current character is allowed to be skipped to continue matching until the set maximum skipping number is reached, accurate matching and fuzzy matching can be achieved at the same time, keywords in a discontinuous form can be effectively recognized, an accurate matching position can be returned, the accuracy of keyword filtering and content analysis is improved, and the user experience is improved. And matching tasks in multiple languages and complex modes can be supported.

The invention discloses a decoupling method and device, a program product, a server and a storage medium, and relates to the field of servers. Aiming at the problem that firmware versions of the BMC and the BIOS must be always kept synchronous due to tight coupling between the BMC and the BIOS, a decoupling method is provided, and accurate matching of fields is carried out by introducing semantic hash values instead of field names. Wherein the semantic hash value can better represent the essential meaning of the field compared with the field name, so that the surface name is not required to be completely consistent. Therefore, the field matching is carried out by replacing the field name with the semantic hash value, so that the compatibility can be improved, and the automatic renaming of the field name can be realized. On the basis of the method, the coupling between the BIOS and the BMC can be reduced, so that the BMC and the BIOS version can be independently upgraded without synchronous maintenance, and the operation and maintenance cost is remarkably reduced.

The application provides a network table query method and data packet processing method of a switch and related devices. A plurality of binary classifiers are set in the on-chip memory of a switch processor. According to the output values of the exact match table, the longest prefix match table and the access control list, the pre-operation results corresponding to the output values are generated through hash operation, and the pre-operation results are pre-stored in the plurality of binary classifiers corresponding to the exact match table, the longest prefix match table and the access control list. When the network table query of the switch is performed, the plurality of binary classifiers can be used to output the output values of the switch network table in parallel based on the pre-operation results. The scheme realizes the isomorphism of the storage structures of the exact match table, the longest prefix match table and the access control list, and can dynamically allocate the storage resources of the on-chip memory when the network table query is performed, so as to adapt to the network table query in different time and different scenes.

The invention discloses a multi-sequence parallel comparison method based on maximum precision matching, and relates to the technical field of crossing of bioinformatics and computational biology. The method comprises the following steps: splicing character strings of a plurality of sequences to obtain a long sequence, and determining a suffix array and a longest common prefix array of the long sequence by adopting a mode of combining a bucket dividing strategy and induced sequencing; according to the suffix array, searching a maximum accurate matching fragment from the longest common prefix array, and screening an ordered and non-overlapped maximum accurate matching fragment set through a dynamic programming technology; expanding each maximum accurate matching fragment in the maximum accurate matching fragment set to all sequences to form a chain; segmenting the long sequence through a chain to obtain a plurality of sub-sequence sets; and calling third-party multi-sequence comparison software to compare the plurality of sub-sequence sets, and splicing the comparison result of each sub-sequence set to obtain a multi-sequence comparison result. According to the method, the time complexity of ultra-long or large-scale sequence data comparison is reduced.

This invention discloses an automatic generation and execution method for intelligent closed-loop workflows in industrial events, belonging to the field of automation technology. The method includes receiving and parsing industrial event data, extracting key event elements and generating a structured event tag set, matching the event tag set with a pre-defined standardized workflow template's matching tag set to determine the optimal matching template, generating a specific execution workflow based on the selected template, and configuring parameters for each node. This invention solves the technical problem of achieving accurate matching and automatic generation of execution paths based on structured event tags and standard workflow templates. It realizes intelligent generation of the entire process from raw event data to precise workflow execution paths, effectively improving the accuracy and automation level of event-workflow matching. It has the advantages of more accurate event matching, more flexible process scheduling, and stronger system versatility, and is suitable for closed-loop handling of events from multiple scenarios, devices, and sources.

This application discloses an address input optimization method, apparatus, electronic device, and storage medium, comprising: acquiring initial address text and preprocessing it to obtain address text to be processed; performing initial phonetic and semantic detection and semantic completion on the address text to be processed to obtain completed address text; performing coarse matching and precise matching on the completed address text sequentially based on a preset address truth database to obtain matching results; if the matching result is a matching failure, performing layered correction optimization on the completed address text based on a preset phonetic-semantic joint optimization database until the optimized address text is determined to be a successful match; verifying the validity of the successfully matched address text, and determining it as the target address text after successful verification, and inputting the target address text into the address truth database.

The invention relates to the related technical field of intelligent substations, in particular to an intelligent station configuration file virtual terminal model matching method, according to the matching method, results are graded according to the recognition accuracy of a principle, correct matching results can be ensured by preferentially using the results, and if the correct matching results are not ensured, the matching result is not ensured. And sorting is carried out according to accurate possibilities. Compared with an accurate matching method, the method has a wider identification range, and terminals not in an identification library can be identified; for a fuzzy matching method, the result is more deterministic; according to the method, matching result sets of multiple modes are used as factors, main features of virtual terminator analysis are covered, and limitation of a single feature is avoided; according to the method, the standard business model library can be expanded at will according to needs, the method does not aim at any model standard, the modeling standard of the to-be-recognized model is not limited, and the method has wide compatibility.

The invention discloses a table retrieval method and device for a database cold boot scene and electronic equipment. The method comprises the following steps: S1, preprocessing structure information; s2, semantic enhancement and vector representation generation; s3, constructing a reverse index; s4, performing semantic recall; s5, carrying out keyword constraint and filtering; and S6, performing multi-score fusion sorting. The method is suitable for performing accurate, stable and interpretable retrieval on new or semantic sparse data tables in an enterprise database under the condition of lack of historical query logs, manual annotation or statistical information access. According to the method, data table filtering, semantic enhancement description data table generation and table-level semantic vector generation, reverse index construction, semantic similarity score calculation and semantic similarity score calculation are carried out on the whole. The processes of keyword matching score calculation, coverage rate score query, accurate matching score calculation, filtered candidate data table generation, fusion sorting score calculation and sorting are executed in sequence, and all the steps form a complete and closed-loop retrieval processing link.

The invention discloses a ten-million-level domain name rule quick loading method based on distributed compiling, which comprises the following steps of: reading and analyzing a rule file containing an accurate domain name and an extensive domain name, and distributing rule analysis result data into a hash table according to a grouping number to obtain a plurality of rule groups; according to the grouping number, compiling threads with the same number are created to form a compiling thread pool; traversing all the rule groups, allocating a compiling thread for each rule group to execute a compiling task, and performing distributed parallel compiling by using a Hyperscan state machine and a Trie tree; receiving an input domain name character string and determining a rule group to which the input domain name character string belongs; if yes, the Hyperscan state machine of the rule group is used for preliminary matching, and if yes, the Trie tree of the rule group is used for accurate matching. According to the method, the problem that a Hyperscan lightweight interface cannot precisely limit a domain name is solved, and rapid loading of a ten-million-level domain name rule is realized.

A content retrieval system may receive a query associated with a plurality of content items in a repository. For each content item of the plurality of content items: a respective first and second similarity score may be generated based on a similarity between embeddings indicative of a first and second data type generated from the query and for the content item; and a respective normalized similarity score may be generated based on a combination of the respective first and second similarity scores. A set of content items with respective normalized similarity scores that satisfy a similarity score threshold may be identified. An exact-match (lexical) search may yield respective mapping scores for content items that may also be ranked. An output indicative of content items that are identified in the set of content items with high-ranking similarity scores and identified in the set of content items with high-ranking mapping scores.

The invention belongs to the technical field of scene matching, and particularly relates to a rapid scene matching method for a large-range search area, which greatly improves the scene matching speed during large-range search and solves the problem of high time consumption in initial positioning of current scene matching. According to the method, a four-dimensional descriptor is firstly designed, so that the robustness of a back-end matching strategy can be greatly improved; furthermore, on the basis of the multi-dimensional reference descriptor and the multi-dimensional real-time descriptor, a convolution coarse matching and fine matching strategy is designed, firstly, the multi-dimensional reference descriptor is segmented to perform software acceleration, coarse matching is performed on the obtained nine regions by using convolution, and fine matching is performed on the obtained nine regions; cutting an image with the same size as the real-time image on the original reference image according to the matching position for accurate matching, and finally designing a matching judgment rule to judge a matching result. According to the method, a mode of combining segmentation rough matching and fine matching is adopted for a large-range search region, so that the matching speed of the large-range region is greatly improved.

A document source identification system includes one or more memory devices storing instructions, and one or more processors configured to execute the instructions to cause the system to receive uploaded document(s) having at least one extractable data entry. The system may categorize the document, and extract at least one data entry from the document. The system may normalize each extracted data entry and execute a deterministic ID search to determine that the normalized data entry matches zero, one, or more than one account data entries associated with user accounts. Responsive to an exact match, the system may link the uploaded document to a user account associated with the matching data entry. Responsive to zero or multiple matches, the system may execute a probabilistic ID search identifying a highest ranked user account data entry and link the document to a user account associated with the highest ranked user account data entry.

The invention discloses an identity affirmation and compensation device in data consistency comparison and a control method, and belongs to the technical field of data processing. The device comprises a basic data module, a weight configuration module, a data identity affirmation module, a TAC module and a compensation check module. According to the method, key fields and non-key fields are dynamically divided through a weight configuration module, accurate matching is adopted for the key fields, and fuzzy matching based on an editing distance algorithm is adopted for the non-key fields to calculate similarity; then, the average similarity of the fields is calculated according to weight grouping, and the identity affirmation rate percentage is obtained by combining weight weighting; if the affirmation rate exceeds a threshold value, starting consistency comparison, otherwise, transferring to manual review; and when the comparison result is inconsistent, the compensation check module performs delay retry and targeted secondary check on the inconsistent field, so that the problem of false inconsistency caused by data synchronization delay is effectively solved. And meanwhile, a layered matching mechanism is combined with compensation verification, so that the data comparison success rate is remarkably improved.

This invention relates to the field of intelligent information processing technology, and more particularly to a self-evolving process entry routing closed-loop method and system based on user feedback. The method constructs a two-dimensional dynamic lexicon containing process keywords and fuzzy synonyms; it segments the user's natural language to extract core keywords; it calculates the first and second hit rates of the core keywords and the two-dimensional lexicon respectively, and then weights and fuses them based on the two-dimensional weight coefficients to obtain a comprehensive matching score; it returns recommendation results to the user based on the score and ranking threshold and obtains interactive feedback data; finally, it dynamically updates the underlying lexicon based on the feedback data, and adaptively adjusts the weight coefficients and ranking thresholds in conjunction with business operation requirements data. This invention breaks through the barriers of traditional single exact matching, and achieves a self-evolving routing mechanism without manual intervention through data closed-loop, significantly improving the routing accuracy in complex contexts and dynamic business conditions.

In an example embodiment, embeddings are used to securely search sensitive encrypted data stored in a database without the need to retrieve and decrypt all data in a volume. Specifically, a piece of text is embedded into an embedding, which is then stored in a vector database. Then the piece of text can be encrypted and stored in another database. A linkage between the embedding and the ciphertext can also be stored. When a search is performed, one or more keywords from the search can be embedded and the keyword embedding can be compared to the embeddings in the vector database to locate similar embeddings. The ciphertexts corresponding to those similar embeddings can then be retrieved from the other database and decrypted. The decrypted ciphertexts can then be searched based on the keywords to find exact matches.

The present application relates to a training-free video corpus time moment retrieval method based on an adaptive calibration mechanism, and belongs to the technical field of computer vision and multi-modal information processing. It comprises: based on the constructed query event chain and video event chain, calculating the event level similarity score, and combining the mean-variance joint scoring mechanism for cross-modal retrieval to obtain candidate proposals; in the time positioning stage, a boundary level association is established among the video candidate proposals through a cooperative mechanism, and a profit-loss dynamic feedback strategy is used to perform adaptation and iteratively optimize the time boundary of the candidate proposals. The present application realizes a closed-loop retrieval process from text semantic analysis to video accurate matching. Compared with the prior art, the present application does not need large-scale labeled data for training or parameter updating, effectively solves the generalization bottleneck and deployment cost problem of video retrieval in open domain scenarios, and significantly improves the accuracy and robustness of time positioning under zero training conditions.

The invention relates to the technical field of digital data processing, in particular to an electric customer service dialogue intention and key information identification method based on a large model. The identification method comprises the following steps of: finely adjusting a large model based on annotation data; constructing an intention and key information identification model for intelligent arrangement; intention and time identification is carried out based on small model assistance; fusing the identification results of the large model and the small model; and feeding back query information based on the identification result. The intention and time are further identified by using a small model, and the identification accuracy is improved. According to empirical data, when certain specific words are matched in an input text, intention categories can be determined, keyword libraries of different intention categories can be maintained, and accurate matching can be carried out. The accuracy of the fine-tuned large model is improved to a certain extent, but when a scene which is difficult to recognize by the large model exists, accurate matching can make up for the defect.

The keyword matching method, device and electronic equipment across language environments provided by the embodiments of the present application relate to the technical field of information retrieval. First, a source language keyword used for matching a target language text is obtained; then, the source language keyword is processed by word segmentation, and the source language keyword is classified into a short keyword string or a long keyword string; then, when the source language keyword is a short keyword string, keyword cross-language matching is performed through semantic expansion to optimize the missing report problem of the source language keyword exact matching; when the language keyword is a long keyword string, the source language keyword cross-language matching is performed based on a semantic-level fuzzy matching technology, the overall matching degree of the keyword is calculated in combination with the semantic matching value and the overall relevance of the matching segment to the target text, so as to comprehensively consider the overall matching degree and the local matching degree of the source language keyword. The above scheme can adopt different matching strategies based on the classification of the source language keyword, and ensure the accuracy of the matching result.