539 results about "Binary tree" patented technology

The invention discloses an intelligent document analysis method and system, the method is executed by the intelligent document analysis system, and the method comprises the following steps: carrying out layout analysis on a PDF page by adopting a deep learning model; merging the block list from bottom to top by adopting a recursive algorithm; carrying out balance optimization on the binary tree structure; and outputting a result of the processed binary tree structure by adopting a preorder traversal mode. Layout analysis is carried out by adopting a deep learning model, various complex typesetting formats such as multi-column layout, image-text mixed typesetting, tables, lists and the like can be effectively identified and processed, and semantically continuous text blocks are ensured to keep continuity in a tree structure through a tree structure optimization module; a global semantic error correction module is added to carry out global document semantic representation learning and carry out adaptive adjustment and error correction on a preliminary structure, so that deep ambiguity is eliminated, logic errors are repaired, and the consistency of a final analysis result and human reading logic on the semantic level is maximized.

Techniques are described for a hierarchical caching mechanism enabling efficient cross-region replications. In some embodiments, replication-related information (e.g., key-value pairs) is stored in a particular layout in a binary tree (B-tree) of a file system for replication processing. A hierarchy of caches storing a first type of information (e.g., crypto keys associated with iNodes) may be arranged to match the particular layout in the B-tree to enable efficient parallel processing of a second type of information (e.g., files, file data, or symbolic links), where the replication-related information in the B-tree is partitioned into multiple key ranges for parallel processing. In some embodiments, the caches in different hierarchies may be shared by different parallel-processing key ranges and replication jobs in a file system.

The invention relates to a bridge structure vibration monitoring and analysis method based on artificial intelligence, and the method specifically comprises the following steps: setting an acceleration sensor network at a key part of a bridge, collecting and marking a vibration signal sample, and forming a data set; a high-resolution time-frequency matrix of sample adaptive optimal kernel time-frequency distribution is calculated, a damage sensitive resonance frequency band is positioned according to spectrum kurtosis, and the time-frequency matrix is enhanced by the resonance frequency band subjected to adaptive gain enhancement; dividing a matrix frequency axis multi-scale binary tree, calculating and normalizing sub-band average energy, quantifying energy distribution uniformity through information entropy, and splicing multi-scale entropy values into feature vectors; then constructing and training a bridge detection data model; and finally, preprocessing new data, inputting the preprocessed new data into the trained model, and automatically analyzing to obtain a bridge health monitoring result. Through time-frequency optimization, multi-scale entropy and deep learning technologies, the problems of large noise, difficult feature extraction and low automation and accuracy of traditional monitoring can be solved.

The invention discloses an RFID electronic tag anti-collision processing system, which relates to the technical field of radio frequency identification and comprises an encryption module, a signal processing module and a real-time processing module. The encryption module is used for realizing label identity verification based on a hash function; the signal processing module adopts a mixed anti-collision mechanism combining a time slot ALOHA protocol and a binary tree search algorithm; the real-time processing module comprises a multi-channel parallel processing unit, and each channel is configured with an independent local frequency. According to the RFID electronic tag anti-collision system, the encryption module, the signal processing module and the real-time processing module are combined, the problem of multi-tag collision of the RFID technology in a high-density and dynamic application scene is effectively solved, the encryption module adopts a hash function and an elliptic curve encryption algorithm, safe and efficient verification of tag identities is achieved, and the security and reliability of the RFID electronic tag are improved. The innovative hybrid anti-collision mechanism of the signal processing module is the combination of a slot ALOHA protocol and a binary tree search algorithm.

The invention discloses a decentralized identity management method based on a trusted execution environment, and the method comprises the steps: generating, isolating and storing a user decentralized identity in the trusted execution environment of equipment, carrying out the Hash signature of a decentralized identity document, and recording an uplink; the block chain consensus node verifies the decentralized document uplink transaction through a Byzantine fault-tolerant consensus mechanism and achieves consistency, and writes the metadata of the decentralized identity into the block; encrypting and storing the voucher in a trusted execution environment of the equipment by adopting a Pearson commitment, and supporting voucher Hash uplink and commitment uplink; and introducing a multilevel access structure based on a binary tree, and verifying the and / or logic combination voucher by adopting a depth-first search algorithm. According to the method, decentralized autonomy of the user identity and hardware security isolation are supported, and the reliability and privacy protection capability of user identity management are improved.

The invention relates to the technical field of security authentication and ubiquitous networks, and discloses a ubiquitous-network-oriented cloud-side collaborative multi-factor identity authentication method and system, and the method comprises the steps: issuing an identity certificate based on an elliptic curve and a PUF challenge-response library of a parameter initialization edge node through a cloud, and achieving the cloud-side bidirectional authentication; when the terminal is accessed, multi-factor authentication combining PUF challenge and a dynamic threshold value is adopted, so that the capability of resisting counterfeiting and replay attacks is improved; after the authentication is passed, the edge node generates a group public key locally and constructs a binary tree group key structure with a preset depth, and post-quantum safe and efficient group signature management is supported; when a newly added terminal joins, generating a secret key based on an elliptic curve algorithm and distributing a group signature private key share to realize lightweight member management; the integrity, confidentiality and traceability are realized while the transmission efficiency is guaranteed, and safe communication and dynamic revocation in an edge resource limited environment are effectively supported.

Disclosed are methods and apparatuses for decoding an image. A method includes receiving a bitstream obtained by encoding the image; dividing a first coding block into a plurality of second coding blocks; generating a prediction block of a second coding block based on syntax information obtained from the bitstream; and reconstructing the second coding block based on the prediction block and a residual block of the second coding block, the residual block being obtained by performing a dequantization and an inverse-transform on quantized transform coefficients from the bitstream. The first coding block has a recursive division structure. The first coding block is divided based on at least one of a quad tree division, a binary tree division or a triple tree division.

The invention discloses a path planning method for collaborative operation of multiple ship washing robots, which belongs to the technical field of robot path planning, and comprises the following steps: initializing parameters, and collecting real-time data acquired by sensors carried on ship washing robots; making a robot group priority strategy; rasterizing the surface of the ship body by adopting a grid contour method; an improved # imgabs0 # algorithm is adopted to generate an initial path of the ship washing robot group; adding a constraint tree of a binary tree structure, and performing path planning; and when there is no obstacle on a front and back node connecting line of a certain node, deleting redundant nodes of the path, only retaining starting and ending points and inflection points, then deleting redundant inflection points, extracting key nodes as intermediate target points, and outputting an optimal path scheme. According to the technical scheme, the cooperative work efficiency of the multiple ship brushing robots can be improved, and the technical problems of dynamic obstacle avoidance response lag, low multi-machine cooperation efficiency and the like existing in traditional path planning in a complex curved surface environment are solved.

Some implementations relate to methods, systems, and computer-readable media for generating a constructive solid geometry (CSG) model. A groundtruth occupancy function descriptive of a three-dimensional (3D) object is obtained. A constructive solid geometry (CSG) model of the 3D object is constructed. The CSG model is defined by a binary tree wherein nodes of the binary tree define Boolean operations and leaves of the binary tree define parameters of CSG primitives, wherein values of the Boolean operations and values of the parameters of the CSG primitives for the binary tree are identified by minimizing an error between an occupancy function of the CSG model and the groundtruth occupancy function of the 3D object. The Boolean operations may correspond to unified fuzzy Boolean operators that are differentiable with respect to a type of Boolean operator.

Disclosed are methods and apparatuses for decoding an image. A method includes receiving a bitstream obtained by encoding the image; dividing a first coding block into a plurality of second coding blocks; generating a prediction block of a second coding block based on syntax information obtained from the bitstream; and reconstructing the second coding block based on the prediction block and a residual block of the second coding block, the residual block being obtained by performing a dequantization and an inverse-transform on quantized transform coefficients from the bitstream. The first coding block has a recursive division structure. The first coding block is divided based on at least one of a quad tree division, a binary tree division or a triple tree division.

The invention discloses a distributed job scheduling method and device, a storage medium and computer equipment, relates to the technical field of distributed task scheduling, is suitable for the field of financial and medical services, and mainly aims at solving the problem that an existing distributed job scheduling system lacks task dependence management and dynamic scheduling capability. Comprising the following steps: performing task modeling processing on each to-be-executed task by adopting a binary tree structure to obtain a task binary tree corresponding to each to-be-executed task; performing serialization processing on the task binary tree by adopting a job arrangement engine to obtain a corresponding task sequence; issuing the task sequence to an event flow bus; after the event flow bus is started, tasks to be executed are allocated to different distributed actuators for execution based on the central control scheduler; and the distributed executor returns an execution result to the event flow bus in real time, so that the event flow bus triggers the downstream task after the upstream task is completed until the task sequence is completely executed.

The invention relates to the technical field of distributed data processing systems, and discloses a data processing system supporting full localization deployment and a compliance guarantee method thereof.The data processing system supporting full localization deployment comprises an audit event collection module used for collecting and storing processing event hash; the event organization module is used for realizing logic time sequence management of events through topological sorting and causal relationship marking; the hash chain construction module is used for constructing a local-to-global double-layer hash chain by utilizing the constructed directed acyclic graph and event hash; the increment synchronization module is used for executing increment synchronization based on Hash tree difference identification; the conflict solving module is used for detecting and solving event conflicts in the distributed environment by applying a version vector technology aiming at data differences found in the incremental synchronization process; according to the method, the lightweight linear hash chain is used for replacing a traditional binary tree structure, high-efficiency and low-cost audit chain maintenance is realized, and the data integrity is guaranteed in an unstable network environment.

The invention relates to the technical field of artificial intelligence chips and storage management, in particular to a cache line replacement method and device, a chip and electronic equipment. The method is applied to a chip comprising a data cache, the data cache comprises N cache lines in which data are stored, an access path corresponding to each cache line is managed based on a binary tree structure comprising N-1 nodes in a PLRU algorithm, and a data replacement instruction is responded, obtaining a path status bit from a root node to a leaf node on an access path corresponding to each cache line; for a specified cache line, calculating a PLRU path value according to the path status bit, and calculating a replacement score in combination with the importance level and the corresponding weight of the stored data; determining a replaceable cache line according to the replacement score; and storing the to-be-cached data and the importance level thereof into a replaceable cache line to replace the original data and the original level. Therefore, the cache line replacement priority is evaluated by combining the PLRU path value and the importance level of the stored data, the cache hit rate is effectively improved, and the system performance is optimized.

Disclosed are methods and apparatuses for decoding an image. A method includes receiving a bitstream obtained by encoding the image; dividing a first coding block into a plurality of second coding blocks; generating a prediction block of a second coding block based on syntax information obtained from the bitstream; and reconstructing the second coding block based on the prediction block and a residual block of the second coding block, the residual block being obtained by performing a dequantization and an inverse-transform on quantized transform coefficients from the bitstream. The first coding block has a recursive division structure. The first coding block is divided based on at least one of a quad tree division, a binary tree division or a triple tree division.

The invention relates to the technical field of computers, and discloses a cache replacement method, system and device based on binary tree status bit management and a medium. The method comprises the following steps: firstly mapping N cache lines of a cache unit into N leaf nodes of a binary tree, then setting status bits of internal nodes and leaf nodes of the binary tree, preferentially replacing the empty cache lines when accessing the cache, then judging whether the cache is hit or not, and if the cache is hit, judging whether the cache is hit or not. Determining state transition of the internal node according to whether the path node corresponding to the hit cache line is the same as the internal node, and updating the state of the leaf node; when the cache is not hit, the historical queue is checked firstly, then the sub-tree is selected according to the node state value to search and replace the cache line, and whether replacement is carried out or not is determined according to the leaf node and the state bit of the new cache. According to the method, relatively low hardware overhead can be kept, frequency locality and time locality can be better balanced, a higher cache hit rate is provided, and relatively good performance is achieved when data of different access modes are processed.

The present invention relates to the field of data processing technology, and specifically to a temperature monitoring system and a temperature monitoring method for a water jacket heating furnace. The method comprises: obtaining historical temperature data and real-time temperature data of the water jacket heating furnace, randomly generating multiple binary trees using the historical temperature data, and evaluating the structural stability of each binary tree and the reliability of the root node selection. The Gini index is calculated by the temperature data of the binary tree and the inverse is taken to obtain the node purity of the binary tree. The product of the node purity and the reliability of the root node selection is used as the segmentation ability value, and then the weight of each binary tree is determined. The real-time temperature data is inserted into the binary tree, the change in the complexity of the binary tree is obtained, and the weighted sum is used to obtain the degree of abnormality, so as to judge whether the real-time temperature data is abnormal, so as to achieve the purpose of monitoring the temperature. This method comprehensively evaluates the performance of the binary tree based on multiple factors, improves the accuracy of temperature anomaly detection, and improves the accuracy and reliability of temperature monitoring of the water jacket heating furnace.

Disclosed are methods and apparatuses for decoding an image. A method includes receiving a bitstream obtained by encoding the image; dividing a first coding block into a plurality of second coding blocks; generating a prediction block of a second coding block based on syntax information obtained from the bitstream; and reconstructing the second coding block based on the prediction block and a residual block of the second coding block, the residual block being obtained by performing a dequantization and an inverse-transform on quantized transform coefficients from the bitstream. The first coding block has a recursive division structure. The first coding block is divided based on at least one of a quad tree division, a binary tree division or a triple tree division.

The invention discloses a signal transmission method, a signal receiving method, a channel sending end and a channel receiving end, and belongs to the technical field of communication, and the signal transmission method comprises the steps: obtaining to-be-sent original data, and generating a bit encryption factor, a constellation encryption factor, a bit disturbance factor and a constellation disturbance factor; the method comprises the following steps: dividing original data to be sent into even number of data blocks according to a preset rule to construct a complete binary tree, and carrying out first traversal encryption and primary disturbance on the data blocks by utilizing a bit encryption factor; converting the data block subjected to primary perturbation into a parallel bit stream through serial-parallel conversion, performing QAM mapping on the parallel bit stream, and performing second traversal encryption and second perturbation according to a constellation perturbation factor; the parallel bit streams after secondary disturbance are converted into serial signals through a discrete Fresnel inverse transformation matrix and parallel-serial conversion; and performing up-conversion processing on the serial signal and transmitting the serial signal to a transmission channel. According to the invention, the problem of insufficient safety protection in practical application in the prior art is solved.

The invention relates to the technical field of computers, and provides an electric power data processing method and system based on a knowledge graph, and the method comprises the steps: building a data source binary tree according to a data source, and carrying out the correlation mapping of electric power data and entities in the electric power knowledge graph; extracting first data features from root nodes of the data source binary tree in a hierarchical manner according to a hierarchical sequence, performing preliminary anomaly judgment on the basis of the first data features and corresponding entity attributes of each data source in the electric power knowledge graph, and determining suspected abnormal data; nodes corresponding to the suspected abnormal data in the data source binary tree are backtracked, and upper-layer nodes and same-layer associated nodes are determined; based on the second data features of the upper-layer nodes and the third data features of the associated nodes on the same layer, secondary anomaly judgment is carried out on the basis of the association relationship between the fault modes and the fault propagation paths between the entities in the electric power knowledge graph, and a final anomaly judgment result is determined. According to the invention, the accuracy and reliability of power data anomaly detection are improved.

The invention discloses a log auditing method, system and device, electronic equipment and a medium, and relates to the technical field of information security, and the log auditing method comprises the following steps: performing fragmentation processing on an original log according to a preset fragmentation condition to obtain at least two target log fragments; based on the target log fragment, determining a target hash value corresponding to the target log fragment, the target hash value being a node value of a root node in a binary tree determined by the target log fragment; the target hash value is written into a block chain, the target hash value in the block chain is used for determining a log auditing result, and the technical problem that in a related log auditing scheme, logs on a centralized storage system are easily modified and deleted by internal personnel, and then the log auditing result is incredible is solved; the technical effect of improving the credibility of the audit result is achieved.

The invention discloses a data access control method and device, computer equipment and a storage medium. The data access control method comprises the following steps: carrying out initialized storage on to-be-stored data; when a data access request is received, a read-write request is sent to the ORAM binary tree, so that after the memory controller receives the request, whether a target data block exists in a buffer area Sash or not is searched, and a search result is received; if the search result is that the target data block does not exist, determining a real physical memory position of the target data block through a position mapping table, and re-mapping a path label of the target data block to a new random path; reading a path, stored in the ORAM binary tree, of the target data block, and storing the to-be-stored data to a buffer area Sash by adopting all data blocks contained in an RS decoding path; and updating the buffer Sash, and processing the target data block according to the read-write request. By adopting the method and the device, the safety and the integrity of the ORAM system in the data access process are improved.

The present invention discloses a method for optimizing the operation control of a centrifugal pump, which includes an offline calculation module and an online calculation module. The offline calculation module establishes a mathematical model of the centrifugal pump system according to the centrifugal pump theory and outputs the offline data of the centrifugal pump system, and constructs an offline database A; through the actually measured head, efficiency and flow rate data, an offline database B is constructed and corrected by an improved BPNN prediction model. The online calculation module, when the output end of the centrifugal pump system changes, triggers the intelligent control system of the centrifugal pump, searches for the control rate online, and judges whether the state parameter threshold is satisfied to perform operation adjustment. The present invention stores the head, flow rate and rotational speed as tree-shaped data, combines the binary tree search algorithm to quickly search for data under different working conditions, realizes real-time monitoring and optimized control; establishes an improved BPNN prediction model for self-data training to correct the problem of inaccurate mathematical model caused by the aging of the centrifugal pump.

The invention provides an updating method, a data processing system and a computer program product, which can be applied to the technical field of data query. The updating method comprises the following steps: executing the following operations by utilizing the first computing unit: receiving an updating instruction from the first control unit; in response to the updating instruction, reading the index shape graph from the first storage unit, and performing inverse compression reduction on a target shape node in the index shape graph to generate a reduced structure graph; a target vector constructed by target retrieval data included in the updating instruction is utilized to process and restore the structure diagram, and a process structure diagram containing target shape nodes is obtained; and updating the shape node in the path of the target shape node in the process structure diagram to obtain an updated index shape diagram. According to the updating method, the index binary tree does not need to be stored persistently, so that the storage space is saved, and the storage utilization rate is improved.

This application relates to apparatus and methods for generating and implementing a machine learning model in electronic delivery systems to determine delivery routes and times. In some examples, a computing device generates a machine learning model comprising a plurality of indexed binary trees. Each indexed binary tree determines either a first value, or a second value, based on comparing an input to a condition value. The machine learning model can generate prediction values based on the determined values of all indexed binary trees. The machine learning model is trained with historical data. Once trained, the machine learning model's performance is evaluated. Based on the evaluation, the machine learning model may be further refined. Once the machine learning model's performance satisfies requirements, the computing device employs the machine learning model to determine vehicle delivery routes and estimated delivery times.

The invention provides a document data processing method and device, a storage medium and computer equipment. The method comprises the steps of receiving a document editing operation for a target document; when the document editing operation is an attribute editing operation, determining a target attribute balanced binary tree in attribute balanced binary trees corresponding to the plurality of document attributes; updating the target attribute balanced binary tree according to the attribute editing operation; when the document editing operation is a character editing operation, updating a first character balanced binary tree and a corresponding attribute balanced binary tree of the target document based on the character editing operation; and updating the second character balanced binary tree and the node mapping relation of the target document according to the character editing operation. According to the method, the time complexity of node searching and node updating can be reduced, and then the efficiency of editing the document data can be improved.

The invention discloses a distribution network terminal topology identification and distance measurement method and system, and the method comprises the steps: generating a binary tree according to the data of a tower, a switch, a line and the like, determining a reference terminal and an effective terminal according to the wave head moment data after the line breaks down, carrying out the topology identification through employing a binary tree algorithm, positioning a fault section, and carrying out the distance measurement. The method can adapt to topological changes caused by switch position changes, and is small in calculation amount and easy to implement.

Disclosed are methods and apparatuses for decoding an image. A method includes receiving a bitstream obtained by encoding the image; dividing a first coding block into a plurality of second coding blocks; generating a prediction block of a second coding block based on syntax information obtained from the bitstream; and reconstructing the second coding block based on the prediction block and a residual block of the second coding block, the residual block being obtained by performing a dequantization and an inverse-transform on quantized transform coefficients from the bitstream. The first coding block has a recursive division structure. The first coding block is divided based on at least one of a quad tree division, a binary tree division or a triple tree division.

The invention provides a multi-medical image encryption method with tampering localization capability, and aims to solve the problems of security and integrity of digital medical images in transmission and storage, and the core is to provide localized tampering prevention capability. According to the method, firstly, a novel two-dimensional S-type logarithmic chaotic mapping 2D-SLCM is utilized to generate a secret key and a chaotic sequence which are highly related to plaintext content so as to resist differential attacks; then, performing efficient compression on each medical image by adopting a block compressed sensing (BCS) technology to ensure the transmission efficiency; in the encryption stage, data confidentiality is ensured through a multi-layer encryption process including local binary tree traversal scrambling and global random block scrambling; most importantly, an encrypted unique digital watermark is embedded into each image before the images are merged; the dual mechanism not only can detect the tampering behavior, but also can accurately identify which image in the multi-image set is damaged by verifying the watermark extracted from each image, thereby ensuring the reliability of residual data.

The invention discloses a dynamic searchable encryption method and system with forward and backward privacy, and relates to the technical field of information retrieval and cryptography, and the method comprises the steps: obtaining encrypted data, storing the encrypted data based on a virtual binary tree VBTree, and generating an encrypted database; the encrypted database is managed based on a pre-constructed version control library to achieve forward privacy of dynamic searchable encryption, and data deletion of the encrypted database is recorded based on a pre-constructed BF to achieve backward privacy of searchable encryption; recording a search result of the encrypted database based on a cache mechanism; the processed encrypted database is queried based on various complex queries, the complex queries comprise connection query, Boolean query and range query, a final query result is obtained, the complex queries can be achieved, and meanwhile forward privacy and backward privacy of dynamic searchable encryption are guaranteed.

Techniques for reducing interference graph generation time may include obtaining a data flow graph representing a computational flow. For each memory object in the data flow graph, a memory object live interval can be added to a vector of intervals. The memory object live interval indicates a last-use of the memory object and a first-definition of the memory object. The vector of intervals can be converted into a binary tree of interval nodes. For each interval node in the binary tree, an earliest-first-definition value is determined for the sub-tree rooted at the interval node, and is associated with the interval node. The binary tree can be queried for interferences of a memory object, and memory allocation can be performed for the computational flow based on the interferences.