88 results about "Candidate key" patented technology

In some implementations, a device may obtain a data set that indicates scores for first terms based on association scores between the first terms and second terms. The association scores may be based on occurrences of the first terms in electronic documents that provide transcripts relating to telecommunication interactions, and occurrences of the second terms in electronic records that provide summaries relating to the telecommunication interactions. The device may process an electronic document, that provides a transcript relating to a new telecommunication interaction involving an agent device and a user device, to extract candidate key phrases from the transcript. The device may determine a relevance score for each candidate key phrase based on the score(s), of the data set, associated with the first term(s) in the candidate key phrase. The device may generate tag(s) for the new telecommunication interaction based candidate key phrase(s) associated with highest relevance score(s).

The invention discloses a semantic auxiliary vision SLAM loopback detection method based on topological graph matching, and belongs to the field of computer vision. The implementation method comprises the following steps of: screening out candidate key frames without a common-view relationship by judging whether the common-view relationship exists between a current frame and each frame in a historical key frame sequence or not; and constructing a semantic topological graph, namely constructing nodes and undirected weighted edges in the topological graph and calculating node descriptors, and realizing topological expression of the key frame image by constructing the semantic topological graph and calculating a feature descriptor for each node in the topological graph. And calculating an affinity matrix, constructing the affinity matrix between the topological graphs by combining the similarity between the weights of the node descriptors and the edges in the topological graph of the current key frame and the topological graph of the candidate key frame, and calculating an incidence matrix between the nodes of the topological graphs at the same time. And calculating the topological graph similarity through the affinity matrix and the incidence matrix. And judging whether loopback detection succeeds or not by judging whether the topological graph similarity reaches a loopback detection threshold value or not.

The invention discloses an impossible difference-intermediate encounter attack password analysis method, which comprises the following steps of: obtaining an impossible difference partition device of a certain block cipher, respectively expanding forwards and backwards for several rounds according to the difference characteristics of the head and the tail of the impossible difference partition device, and recording corresponding parameters; selecting a plaintext to attack, encrypting to obtain a corresponding ciphertext, and calculating data complexity required by the attack according to corresponding parameters; a key involved in the forward extension part is guessed, partial encryption is performed on the plaintext, pairing is performed by using data after partial encryption, and ciphertext data pairs corresponding to data pairs satisfying forward differential propagation are stored in a hash table; a key related to the backward expansion part is guessed, partial decryption is carried out on the ciphertext, pairing is carried out by using the partially decrypted data, online matching is carried out on a ciphertext pair corresponding to a data pair satisfying backward differential propagation and a ciphertext data pair in a hash table, and a wrong key is eliminated; and carrying out exhaustion search on the remaining candidate keys to find a correct key.

The invention provides an optimization method, device and equipment for a quantum key distribution handshake protocol, and the method comprises the steps: preparing a standard quantum state and building a spinning peak shifting time sequence, and achieving the time division multiplexing and parallel processing of a plurality of quantum channels; constructing a handshake mode with successful pre-matched codebook storage history, and supporting rapid mode matching; the authentication sub-process and the negotiation sub-process are decoupled through a parallel verification architecture and are executed in parallel on different time phases; the quantum signature token and the key negotiation parameters are fused to generate a handshake state matrix, and global representation of the handshake process is achieved; performing success probability pre-judgment based on quantum entanglement association strength analysis, and triggering a pre-generation mechanism of a candidate key pool; performing quantum state weaving and fusion on the key by using local, non-local and mixed entanglement distribution adjustment to generate an enhanced key; and finally, optimal distribution is completed in combination with a spinning peak shifting time sequence, so that parallelization of authentication and negotiation, intellectualization of resource distribution and real-time state monitoring are realized.

The invention provides a key point path planning method and device based on distance transformation, and the method comprises the steps: converting a grid map of a target region into a distance transformation map based on a distance definition method; a distance maximum value point is extracted from the distance transformation map to serve as a candidate key point, the candidate key point is screened to obtain a global key point, and at least two contact points exist between a circle generated with the global key point as the circle center and the distance value of the global key point as the radius and a grid representing a non-passing area; and constructing a connection relationship between the global key points, and searching and determining a navigation path based on the connection relationship between the global key points by using a # imgabs0 # algorithm. According to the method, the global key points are screened in the distance conversion map, and path search is performed based on the connection relation between the global key points, so that a more efficient robot path planning algorithm is realized.

The invention relates to a research and development investment project discrimination method and system based on a large language model, and belongs to the technical field of large language model application. The method comprises the steps of obtaining a research and development investment project field data set, and obtaining a research and development investment project field annotation data set through a preprocessing model according to the research and development investment project field data set; performing candidate keyword judgment through a knowledge graph according to the input project field words to obtain research and development input project field candidate key features; according to the research and development input project field candidate key features, obtaining a research and development input project field knowledge graph through a word graph construction model; according to the research and development investment project field knowledge graph, performing fine tuning on the BERT large language model through an Adapter fine tuning model to obtain a research and development investment project field BERT large language model; and obtaining key features of the research and development investment project through a research and development investment project field BERT big language model according to the research and development investment project field annotation data set. The key features of the research and development investment project are extracted.

The invention belongs to the technical field of mobile robot positioning and mapping. The invention provides an indoor loopback detection method and system based on angle features, and the method comprises the steps: carrying out the filtering of a key frame point cloud in a height direction, generating an average point cloud, extracting angle feature points from the average point cloud, carrying out the discrimination of a convex angle and a concave angle of each angle feature point, and carrying out the recognition of a convex angle and a concave angle. And constructing triangular descriptors based on the angle feature points and the corresponding convex angle and concave angle discrimination results, performing unified management on the triangular descriptors in the historical key frame by adopting a hash table structure, and determining the current key frame according to each triangular descriptor of the current key frame and the triangular descriptors of the historical key frame in the hash table structure. According to the method, multiple candidate loopback frames are determined, loopback verification is carried out on each candidate key frame, an optimal loopback frame is determined, two-dimensional rigid body transformation corresponding to the optimal loopback frame is used as initial pose estimation of point cloud registration between the current key frame and the optimal loopback frame, and high-robustness loopback detection is achieved.

The invention discloses a key management method and a storage device, and belongs to the field of storage security, the method comprises the following steps: deriving different types of key fragments from an authentication key according to different preset classification strategies, and respectively storing the different types of key fragments in different storage partitions corresponding to the preset classification strategies; receiving a data access request, wherein the data access request comprises data index information; based on different preset classification strategies, reading candidate key fragments matched with the data index information from the different storage partitions respectively, verifying the legality of the candidate key fragments matched with the data index information, and determining the candidate key fragments passing the verification as effective key fragments; and aggregating the effective key fragments of different types to generate the authentication key, and obtaining target access data of the data access request through the authentication key. According to the invention, the security of key storage and the flexibility of key management can be effectively improved.

The invention provides a point cloud key point generation method based on a key point detection network and a descriptor network, and the method comprises the steps: carrying out the random sampling of the key point detection network, obtaining candidate key points, carrying out the multi-level clustering with each candidate point as a center, expanding a sensing domain, and aggregating the neighborhood information, aggregated information is sent to a double-head attention mechanism to calculate a neighborhood point weight, and more representative key points are selected; the descriptor network receives the attention feature map of the detection network, carries out fusion learning on global information and local information of each key point, and calculates a descriptor and a direction vector for each key point. Secondary screening of the key points is carried out while the descriptors are optimized by using a joint matching loss function, and the key points with strong characteristic characterization force are obtained. Compared with the prior art, the time consumption is shortened by 90%, the key point repetition rate is 70%, the matching precision is 90% or above, and good robustness is achieved under different Gaussian noises.

The invention discloses a business process log case attribute automatic identification method and system, and belongs to the field of process mining, and the method comprises the following steps: extracting features from an event log; a binary classifier is constructed, the probability that each column belongs to the key attributes is output, and N attributes with the highest column probability are selected to form a candidate attribute set of each column; judging whether the candidate attribute set of each column is a single candidate attribute or a candidate attribute combination; combining the candidate attributes, and calculating the score of each candidate attribute combination; and selecting the candidate attribute combination with the highest score as final key attribute output. The system comprises an event log acquisition and feature extraction module, a candidate key attribute range narrowing module, a candidate attribute set judgment module, a process model discovery and evaluation module and an optimal candidate combination selection module. According to the method, the case attributes in the event logs can be automatically recognized for the event logs without labels, and the requirement for manual appointing is reduced.

A system and method for extracting structured key information from diverse document types using large multimodal models (LMMs) is disclosed. The invention employs a zero-shot analysis to identify candidate keys within an input document, then selects a document schema from a document schema database based on the identified keys. The LMM is prompted with the selected document schema to generate structured key-value pairs, with field constraints enforced by the document schema. Relationships among extracted keys are mapped to a graph representation, enabling robust handling of complex document layouts. The system supports nested structures, tabular data, and alias definitions for fields, and can update document schemas based on ground truth feedback. The resulting structured output is provided in a machine-readable format, enabling reliable and scalable document understanding across varied domains such as invoices, health cards, and driving licenses.

The invention belongs to an infringement recognition method, and provides a three-dimensional model block chain copyright infringement recognition method, system and program product for solving the problems that an existing three-dimensional digital copyright infringement recognition method is low in recognition accuracy, poor in recognition effect in a complex scene and not applicable in a high-precision requirement scene. And calculating the Hamming distance between the copyright fingerprint set of the three-dimensional model to be detected and the copyright fingerprint set of the three-dimensional model registered on the given chain, and judging whether to infringer according to the relationship between the Hamming distance and a preset overall matching rate threshold. Wherein during copyright fingerprint set calculation, key point scales in all vertexes of a three-dimensional model are determined according to the geometric volume and surface complexity of the three-dimensional model, mixed feature descriptors are obtained by combining geometric structures and surface texture changes of local neighborhoods of candidate key points, and corresponding fingerprint abstract values are calculated after Hash processing. And the recognition stability under non-infringement operations such as rotation, zooming, slight editing and the like is remarkably improved.

A kind of frame extraction method for road test vehicle image information, comprising: obtaining road test vehicle image information, and marking candidate key frame in road test vehicle image information;According to the marked candidate key frame, based on actual demand, relevant threshold setting and index calculation;According to the set threshold and calculated index, key frame is marked;According to the marked key frame and set threshold and calculated index, similar frame is marked;According to neural network model, no key target frame is marked;According to the marked key frame, similar frame and no key target frame, image information is frame extracted.The present application is highly adaptable to the business scene of automatic driving, and can more effectively solve the data redundancy problem of storage end.Free limited human resources, and then improve the execution efficiency of the entire automatic driving tool chain.And different content section image scene is processed by divide and conquer, and the frame extraction result is more reliable.

In some implementations, a device may obtain a data set that indicates scores for first terms based on association scores between the first terms and second terms. The association scores may be based on occurrences of the first terms in electronic documents that provide transcripts relating to telecommunication interactions, and occurrences of the second terms in electronic records that provide summaries relating to the telecommunication interactions. The device may process an electronic document, that provides a transcript relating to a new telecommunication interaction involving an agent device and a user device, to extract candidate key phrases from the transcript. The device may determine a relevance score for each candidate key phrase based on the score(s), of the data set, associated with the first term(s) in the candidate key phrase. The device may generate tag(s) for the new telecommunication interaction based candidate key phrase(s) associated with highest relevance score(s).

The disclosed embodiments disclose a data processing method, apparatus, electronic device, and computer storage medium. The method comprises: obtaining side channel information collected from a cryptographic device; the side channel information is physical information leaked during the operation process in which the private key to be cracked participates when the cryptographic device performs a bilinear pairing operation; selecting target information from the side channel information; the target information is the side channel information corresponding to the private key to be cracked during the process of being moved; matching the target information with preset information templates corresponding to multiple candidate keys; the preset information templates include reference information corresponding to the candidate keys; and determining one of the multiple candidate keys as the cracked private key based on the matching result. This technical solution can crack a private key based on the characteristic that the operation process in which the private key participates is prone to information leakage during the initial relocation of the private key, thereby improving the success rate of the attack.

The present invention discloses a method, apparatus and computer device for automatically constructing a house type based on pictures, including: classifying house type elements of a house type picture by using a semantic segmentation model; extracting candidate key points in the house type element classification result by using a key point detection model, and after screening the candidate key points, interrupting and clustering the walls based on the determined key points to construct wall elements; detecting image connected components according to the house type element classification result to construct door elements, window elements and column elements, and associating these three types of elements with the wall elements; and correcting the constructed wall elements, door elements, window elements and column elements in combination with the association result to obtain the constructed house type diagram. This method can improve the accuracy and efficiency of automatic house type construction.

This invention provides an optimization method, apparatus, and device for a quantum key distribution handshake protocol. By preparing standard quantum states and establishing a spin-staggered timing sequence, time-division multiplexing and parallel processing of multiple quantum channels are achieved. A pre-matched codebook stores historically successful handshake patterns, supporting fast pattern matching. The authentication and negotiation sub-processes are decoupled through a parallel verification architecture, allowing them to execute in parallel at different time phases. A handshake state matrix is ​​generated by fusing quantum signature tokens and key negotiation parameters, achieving a global representation of the handshake process. Success probability prediction is performed based on quantum entanglement correlation strength analysis, triggering a pre-generation mechanism for the candidate key pool. Quantum state weaving and fusion of keys are adjusted using local, non-local, and mixed entanglement distributions to generate enhanced keys. Finally, optimized distribution is completed by combining the spin-staggered timing sequence, achieving parallelization of authentication and negotiation, intelligent resource allocation, and real-time state monitoring.

The present application relates to the technical field of electronic products, and discloses a key determination method and apparatus, an electronic device, and a readable storage medium. The key determination method provided in embodiments of the present application comprises: acquiring first verification data sent by a card reading device, the first verification data being data obtained by performing first verification on a third sector among at least one first sector by the card reading device; determining at least one candidate key on the basis of the first verification data; acquiring second verification data sent by the card reading device, the second verification data being data obtained by performing second verification on the third sector by the card reading device; and determining a target key from among the at least one candidate key on the basis of the second verification data, the target key being used for reading sector data in a fourth sector, and the fourth sector being: a sector, corresponding to the third sector, among at least one second sector.

The invention provides a message processing method and device, electronic equipment and a readable storage medium, and relates to the technical field of artificial intelligence such as big data and cloud services. The message processing method comprises the following steps: analyzing a received target input message, and obtaining target key information corresponding to the target input message according to an analysis result; according to the target key information and the candidate key information, determining a target longitudinal linked list in a two-dimensional linked list, different candidate key information corresponding to different longitudinal linked lists in the two-dimensional linked list; and after mounting the target input message to the target longitudinal linked list, processing the target input message. According to the invention, the processing efficiency of the input message can be improved.

The present disclosure provides an information query method, device, equipment, storage medium and program product, relates to the technical field of data processing and computer, and particularly relates to the technical field of big data and intelligent search. The specific implementation scheme of the information query method is as follows: determining at least one candidate key information matched with the query information according to the query information; determining a first evaluation value for evaluating the candidate key information according to a key information evaluation parameter; determining at least one target key information from the at least one candidate key information according to the first evaluation value; and determining target content information according to the at least one target key information.

A stream processing method includes: obtaining a candidate generation sketch including k blocks; obtaining a verification sketch including k´ blocks; receiving records in a stream with insertions and / or retractions, each of the records including a key and a count that are in correspondence; updating the sketches by transferring each record to one of the k blocks of the candidate generation sketch and one of the k´ blocks of the verification sketch; querying the k blocks of the candidate generation sketch to determine a set of candidate keys; dividing the set of candidate keys into k´ sub-sets of candidate keys; testing each sub-set of candidate keys by using one of the k´ blocks of the verification sketch to obtain a verified current list of frequent keys; and outputting a current list of frequent keys in the insertion stream and / or retraction stream.

The invention proposes a method for constructing an original text reference library based on improved reinforcement learning, and the method comprises the steps: constructing a data set, carrying out the optimization of an online learning large model through combining with an online learning gradient updating strategy, and obtaining an optimized online learning large model; constructing a reference library based on a multi-layer index architecture according to an output result of the optimized LLM large model; for the optimized LLM large model, outputting a result, namely a plurality of candidate key expression statements, inputting the title, the text content and the corresponding candidate key expression statements into an auditing system, and performing manual auditing; inputting a to-be-verified article into the optimized online learning large model, outputting all candidate key expression sentences, and constructing a candidate expression sentence list; a structured phrase set and a sentence pattern structure regular expression formula are obtained from the candidate expression sentence list through a text analysis module, and phrase features are extracted through the structured phrase set; and performing retrieval in the reference library based on the multi-layer index architecture, and outputting a reference position and a similarity score.

The invention relates to a network protocol reverse analysis method, which comprises the following steps of: firstly, for each message in target network interaction flow, determining each global candidate key field position through numerical conversion and keyword position label analysis; then applying probabilistic reasoning and combining loop iteration to obtain the position of each target key field; and finally, obtaining a numerical vector corresponding to each message in the target network interaction flow, alternately optimizing and training by using an auto-encoder and a clustering algorithm, and analyzing each message under each cluster in a network protocol format. According to the design scheme, the problem of reverse analysis of the network protocol is effectively solved, keyword recognition is creatively constructed into a probabilistic reasoning problem, and the defect of uncertainty processing of a traditional method is overcome, so that a more accurate message format is output, and an efficient and comprehensive solution is provided for reverse analysis engineering of the network protocol.

The invention relates to the technical field of side channel analysis, and particularly provides a side channel analysis method and system based on bit decoupling and a medium, and the method comprises the steps: obtaining power consumption data during encryption, calculating an intermediate value, and carrying out the multi-label decoupling; extracting multi-scale features from the preprocessed energy traces, performing weighted fusion, and outputting global shared features; mapping the global shared features into initial bit features through linear projection, calculating a dependency relationship between the bit features by using an attention mechanism, and generating interactive bit features; the fusion proportion is dynamically adjusted through gating parameters, fusion features are input into a multi-label classifier, the posterior probability of each bit is obtained, and a loss function is adopted for training; and inputting a to-be-measured energy trace into the trained neural network model, outputting a prediction probability, and selecting a target key by calculating the confidence coefficient of the candidate key through traversal. According to the method, the quantity of required energy traces is greatly reduced, and meanwhile, the attack success rate in a low signal-to-noise ratio environment is remarkably improved.

The present disclosure relates to a key management method, device, storage medium and chip, and relates to the technical field of communication encryption. The key management method comprises: in the case that a local device exists an original key for communicating with a peer device, determining a first candidate key meeting a first target device trust level from the original key, and authenticating the first candidate key; in the case that the first candidate key passes the authentication, determining the first candidate key as a target key for the local device and the peer device to communicate, wherein the first target device trust level is a current device trust level of the local device and the peer device, so that the selected target key can meet the current device trust level, and in the case that the first candidate key passes the authentication, it is determined that the first candidate key can be directly used by both sides, so that the communication security is ensured while the communication response speed is accelerated.

Provided in the present application are a primary-key determination method and apparatus, and a computer-readable storage medium. The method comprises the following steps: a primary-key generation system acquiring a plurality of data records (which comprise a plurality of identical fields) in the same streaming data or different streaming data; performing sampling on the plurality of data records; determining, as non-candidate keys, fields and / or field combinations in the sampled data records which have repeated values; then, determining a plurality of possible candidate keys (which refer to the remaining elements, other than the non-candidate keys, in a universal set, the universal set comprising a plurality of fields and a combination of at least two of the plurality of fields); determining whether the plurality of possible candidate keys can all be used as candidate keys; when it is determined that the plurality of possible candidate keys can all be used as candidate keys, selecting a target candidate key from among the plurality of possible candidate keys; and finally, generating a value of a unified primary key of each data record on the basis of the value of the corresponding target candidate key in each data record. Therefore, a plurality of data records can subsequently be integrated on the basis of the unified primary key, that is, streaming data is integrated.

The application discloses a search processing method and device, equipment and a storage medium, and relates to the technical field of intelligent search. The specific implementation scheme is as follows: obtaining a query word input by a user; determining at least one candidate key word matched with the query word based on a pre-established index relationship; the index relationship is an index relationship between the segmentation of part of the key words corresponding to each category obtained through clustering according to semantics and the corresponding key words; determining the relevance of each candidate key word and the query word, and screening the candidate key words that meet a set condition; and determining a target key word matched with the query word based on the screened candidate key words. Through the introduction and use of the index relationship between the segmentation of part of the key words of each category after clustering and the corresponding key words, the search time is reduced, the search efficiency is improved, and the recall ability of the search system is improved.

The present application relates to the technical field of vehicle identity authentication, and discloses a vehicle distributed identity authentication method and system based on biological characteristics, which comprises the following steps: a user completes initial biological characteristic registration on a source vehicle, and biological characteristics are bound with random keys by a fuzzy binding algorithm to generate a binding factor and a biological characteristic hash value and store them in association; when the user uses a target vehicle, the target vehicle locates the source vehicle according to the user identity and requests verification. The source vehicle sends the binding factor and the biological characteristic hash value to the target vehicle; the target vehicle collects the current biological characteristics of the user, recovers the candidate key by decoding operation using the binding factor, and generates a temporary biological characteristic hash value; and the authentication is completed by comparing the temporary biological characteristic hash value with the received biological characteristic hash value. The method uses a decentralized hash transmission and fuzzy binding verification mechanism to realize efficient, safe and non-repeated cross-vehicle identity authentication on the premise of protecting the privacy of biological characteristics.

The embodiment of the present application provides an event auditing method and device in a cloud environment, the method comprises the following steps: obtaining an event to be audited in the cloud environment; judging whether the event to be audited is a future key event according to candidate key event information, wherein the candidate key event information comprises a plurality of candidate key events and an association relationship between the candidate key events; in the case that the event to be audited is a future key event, judging whether the event to be audited is a dangerous event according to event parameter information of the event to be audited and preset event parameter information; in the case that it is judged that the event to be audited is a dangerous event, executing a first safety measure corresponding to the dangerous event.

This specification discloses a data connection method, apparatus, storage medium, and electronic device. In the data connection method provided in this specification, a semi-join query statement is received, the first data table and the second data table connected by the semi-join query statement are obtained, and the join condition in the semi-join query statement is determined; when there is a non-equality condition in the join condition, the second data table is grouped according to the join condition; according to the join condition, the non-equality candidate keys included in the non-equality condition for joining in the second data table are determined; for each group of data, according to the non-equality condition and the values of the non-equality candidate keys of each row of data in this group of data, a specified key value is determined, and the data of the row where the specified key value is located is determined as the specified row data; according to the specified row data in each group of data, a deduplicated second data table is constructed; the connection method between the first data table and the deduplicated second data table is modified to an inner join to obtain a query result.