27 results about "Exact match" patented technology

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 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 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.

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.

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.

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.

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 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.

This application provides a data mapping method, which includes acquiring data information of the field to be mapped and a mapping rule base for the field to be mapped; performing a first-level match between the data information and the mapping rule base; the first-level match is an exact match between the data information and the mapping rule base; if the first-level match fails, performing a second-level match between the data information and the mapping rule base; the second-level match includes determining the comprehensive similarity and reference similarity between the field to be mapped and the mapping rule base; if the comprehensive similarity is greater than or equal to the reference similarity, the second-level match is successful; if either the first-level match or the second-level match is successful, the mapping result of the field to be mapped is output. This application provides a novel automatic and intelligent mapping method, reducing the manpower and resources required for manual data mapping of each new field to be mapped, thus improving work efficiency and saving time and manpower costs.

This invention relates to a standard parts retrieval method based on BM25 recall and parameter constraint rearrangement, comprising the following steps: selecting a publicly available standard parts model dataset, unifying the field format of all data in the dataset, and then forming a standard parts index set C; constructing a retrieval model PBMR, selecting a user query, inputting C into PBMR to obtain the rearranged score for , and then performing hard constraint judgment to obtain the final score; traversing all candidate samples in , obtaining the final score set of all candidate samples; constructing the loss function of PBMR; training the model with as input, stopping training when the training reaches the maximum number of iterations or no longer changes, and applying the trained parameters to PBMR to obtain the trained retrieval model PBMR'. This method can achieve efficient retrieval and accurate matching in a large-scale standard parts model library, and prioritize the output of renderable results, applicable to mechanical design selection, assembly retrieval, and browser-based 3D preview scenarios.

This invention relates to a system call analysis method based on multi-dimensional correlation, belonging to the field of data processing technology. It solves the problems of high performance overhead and difficulty in balancing accuracy and real-time performance in existing call analysis methods. The method includes: filtering and capturing system call events generated by a target application according to filtering rules, and dynamically adjusting the filtering rules by real-time monitoring of system load; correlating the captured system call events along process, time, and resource dimensions to obtain multiple system call sequences; precisely matching each system call sequence with atomic behavior rules to obtain the behavior type of successfully matched system call sequences; performing feature matching of unmatched system call sequences with historical behavior data to obtain the corresponding behavior type; and outputting structured behavior data based on each system call sequence and its behavior type. This achieves accurate and real-time analysis of discrete system call events.

The application discloses a kind of cross-system document intelligent coding method and system based on dynamic rule engine, by obtaining the metadata information of to-be-coded document, call dynamic rule engine from configurable rule base and match coding rule, rule engine supports multi-dimensional condition matching and priority dynamic calculation, and provide visual configuration interface to realize the real-time adjustment and version management of rule;Adopt three-level mapping strategy to convert the metadata of PDMS, BIM, SCADA and other heterogeneous systems into unified equipment and facility list ID without loss, combined with improved Levenshtein distance algorithm to calculate the similarity of equipment name, form the dual conflict detection mechanism of equipment ID accurate matching and equipment name similarity calculation, trigger artificial review when conflict is detected, review result is fed back to knowledge base to realize self-learning optimization, while establishing coding life cycle management;The application realizes the automation, intelligentization and traceability of cross-system document coding, significantly improves coding consistency and standard adaptation efficiency.

Methods and systems of using an approximate duplicate event filter are disclosed. Event processing systems of a service provider network such as a security service may receive a large volume of events to analyze. Events that have previously occurred can be given a lower priority for analysis than new events. Events that are similar to previous events can likely also be given a lower priority for analysis. These non-exact match events can be detected by comparing token representations of new events to token representations of previous events. Events may be considered according to the context in which the events occur.

This invention discloses a method, apparatus, and electronic device for encoding power system data, belonging to the field of data encoding technology. The encoding method for power system data weights and fuses the frequency of occurrence of various power-sensitive words with the corresponding sensitivity and importance weights to obtain a comprehensive sensitivity score for the business data to be processed. By introducing a dual-dimensional calculation model of sensitivity and importance, data classification becomes more scientific, enabling precise security investment and accurate matching of security resources with data value. Based on the comprehensive sensitivity score of the business data to be processed, an identification encoding scheme with corresponding anti-attack strength is selected, thereby automatically generating a structured security identifier with corresponding anti-attack strength. By applying encoding protection to the business data of the power system, it conforms to the core concept of power system security zoning and hierarchical protection.

The application discloses a development environment deployment method and device, a terminal and a storage medium, belongs to the field of software development, and utilizes operating system and architecture information to generate a basic environment identifier containing at least two layers of subordinate hierarchical fields; the identifier is matched in a global index file; when accurate matching fails, a version number and an OS type are peeled off according to a hierarchical priority to perform multi-level back-off addressing, and a configuration file path is determined; the configuration file is loaded, and depth merging is performed on array appending and object covering from low to high according to the hierarchy to generate a final configuration; a dependency and mutual exclusion relationship of a package or a task is acquired by parsing the final configuration, a directed acyclic graph is generated, and topological sorting is performed to generate a linear task sequence; the sequence is executed according to a parameter sequence by using an installation script, and mutually exclusive tasks are scheduled in a sandbox. The application improves cross-platform environment adaptation fault tolerance, solves mutual exclusion dependency conflicts, and realizes one-key safe deployment of a complex environment.

In order to facilitate entity resolution, systems and methods include a processor receiving entity records associated with one or more entities, the system leverages information processing techniques that include utilizing a first sector of a local cache memory to store verified entity records, and store an unverified non-exact match in a second sector of a local cache memory linking the verified and unverified entity records for real-time entity record resolution, the system and methods further order the unverified records to enhance search and reduce reliance on third party systems for entity record verification thus reducing API calls to external vendors.

A device, system and method is provided for receiving a packet that can not be routed in a network because it does not contain a recognizable network address. The packet may be parsed to identify a marker indicating a potential network address. One or more recognizable addresses in a set of network-recognizable addresses may be identified that contain the marker. For each of the identified recognizable addresses, multiple sequential searches may be iteratively executed for a non-exact match of the recognizable address in the packet. In each sequential search, a proximity of a matching criteria for the non-exact match may be incrementally decreased until a non-exact match is detected or a termination criterion is reached. The packet may be addressed to the recognizable address if the non-exact match is detected. The packet may thus be routed in the network to a device uniquely identified by the recognizable address.

This invention provides a method and system for detecting and correcting errors in power system operation tickets. The method includes: acquiring power system operation ticket information and generating a corresponding hash set; searching for a pre-constructed query key in the hash set; if a key exists, the exact match is deemed successful; if no key exists, the exact match is deemed unsuccessful; selecting all standard dual names for the substation from the ledger based on the substation name in the operation ticket information as a candidate correction set; and selecting one or more standard dual names with the highest similarity as recommended correction results based on the text similarity between the dual names for which operation steps in the operation ticket information do not match and each item in the candidate correction set. This invention achieves instantaneous exact matching, solves the efficiency bottleneck of manual review, overcomes the reliability problem of manual review, and fundamentally improves the safety level.

A method for processing packets, the method comprising receiving a packet by a data processing unit (DPU), making a first determination that there is no exact match flow entry in a hardware switch pipeline in the DPU for the packet, in response to the first determination, classifying, in the DPU, the packet as a data packet, in response to the classifying of the packet: identifying, using a software data plane in the DPU, a forwarding information base (FIB) entry to be used to transmit the packet towards its intended destination, identifying, using the software data plane, a flow associated with the packet, initiating, using the software data plane, programming of an exact match flow entry in the hardware switch pipeline, and initiating, using the software data plane, transmission of the packet towards its intended destination using the FIB entry and the hardware switch pipeline.

The application provides a kind of graph code matching method and system based on KM algorithm, it is related to big data field.The graph code matching method based on KM algorithm includes the following specific steps: step 1, the data acquisition of the face of the person and the equipment characteristic code accompanying with it;Step 2, according to the time of data acquisition, the matching relationship of face image and equipment characteristic code is established, and the graph code matching times are calculated;Step 3, the best matching set of face image and equipment characteristic code is obtained by KM algorithm;Step 4, the matching relationship classification calculation is carried out on the best matching set, and the accurate matching data set is obtained.The graph code matching based on KM algorithm can realize the accurate matching of the face of the person and the equipment characteristic code accompanying with it, greatly enrich and supplement the activity data of the same person, so as to form the prediction of the subsequent activity of the relevant personnel, and greatly improve the application value of graph code matching data.

For users to receive products that they purchased online, they may provide their delivery addresses to the e-commerce system. To minimize the number of incorrect delivery addresses processed by the e-commerce system, an address validation system may be used. However, technical challenges exist for such systems. A validation system which searches an address database for an exact match may be too strict and reject a user-provided address for insignificant reasons. Further, the validation system may not factor in aspects that are specific to postal address searching. In some embodiments, an intelligent address validation system may be implemented which performs an informed search that considers more than mere exact matches. Using the results of the informed search, the intelligent address validation system may perform further processing to choose a reference address, i.e., the address to which the user-provided address will finally be compared, for validation and correction suggestions purposes.

This invention belongs to the field of MES system and database structure technology, and discloses an intelligent workflow automation system based on ERP and MES integration. The system constructs a multi-dimensional balanced multi-way search tree index in memory. The index key is composed of the manufacturing execution system event timestamp, enterprise resource plan resource identifier, and workflow node status identifier. The event receiving component inserts equipment status change events into the corresponding leaf nodes and extracts the resource identifier; the index query component calls the range query interface with the timestamp as the query upper limit and the resource identifier as the exact matching condition to obtain the target result set. This solution transforms cross-system join queries into single-index range retrieval, eliminating the disk I / O time consumption and transaction lock contention caused by multi-table join operations, shortening data retrieval time, and ensuring the data state consistency of workflow routing decisions.

A method for automatically upgrading an operating system on a computer is provided. The method includes collecting system state information from the computer, and querying a knowledge base to identify state modification actions. Querying the knowledge base may include use of a classification algorithm, for example the k-nearest-neighbours algorithm, to identify non-exact matches in the knowledge base. The system is modified according to identified state modification actions and an upgrade is attempted. In the event that the upgrade fails, information from collected log files is used to update the knowledge base to propose further state modification actions, and the upgrade is attempted again.