707 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 discloses a self-adaptive sensitive information intelligent identification method, device and equipment, a storage medium and a product, relates to the technical field of sensitive information detection.The self-adaptive sensitive information intelligent identification method, device and equipment, the storage medium and the product comprise the steps that enterprise sensitive information flow batch data is subjected to block processing, and data blocks are obtained; carrying out feature extraction and vectorization processing on the data blocks to obtain feature vectors; constructing a retrieval binary tree based on enterprise sensitive information flow batch data; performing fuzzy retrieval based on the retrieval binary tree and the feature vector to obtain a sensitive entity feature set; respectively performing feature vector retrieval and semantic structure information retrieval on feature vectors of the sensitive entity feature set to respectively obtain related contexts of each preset number, and reordering the related contexts of each preset number to obtain a target context; and inputting the target context into the large language model to obtain an enterprise sensitive information identification result, thereby realizing accurate identification of the enterprise sensitive information.

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

A homomorphic encryption system includes a homomorphic encryption device encrypting original data into a first ciphertext using a homomorphic encryption algorithm, and a homomorphic encryption operation device receiving the first ciphertext from the homomorphic encryption device and performing an approximate arithmetic operation of a transcendental function with respect to the first ciphertext and a second ciphertext by performing a homomorphic multiplication operation in a binary tree structure.

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.

A content channel generation device comprises a resource unit assignment circuit, for assigning scheduled station(s) as node(s) of a full binary tree according to a search algorithm; a node computing circuit, for determining first node connection information of the full binary tree, and to determine second node connection information of a smallest full binary tree according to a smallest binary tree algorithm and the first node connection information; a load balance circuit, for determining user field numbers corresponding to content channels according to a load balance function and the second node connection information; a user field generation circuit, for generating a traversal result of the smallest full binary tree according to a traversal algorithm and the second node connection information, and for generating user fields corresponding to the content channels according to the traversal result, to generate the content channels.

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.

The invention discloses a cache management method and device, a cache, an electronic device and a storage medium. The cache comprises a plurality of groups, and each group comprises multiple paths of data blocks which are not 2 integer power. The cache management method comprises the steps that a binary tree structure corresponding to multiple paths of data blocks of each group in multiple groups is obtained, each leaf node of the binary tree structure corresponds to one path of multiple paths, replacement information is recorded in non-leaf nodes of the binary tree structure, and at least one path of the multiple paths belongs to two partitions of the bottom layer of the binary tree structure at the same time; and in response to replacement operation on the multi-path data blocks of any one of the multiple groups, starting to search from a root node of the binary tree structure until a target path meeting a replacement strategy is searched. According to the cache management method, through multiplexing of leaf nodes in a binary tree structure, a replacement strategy of a non-2 integer power path is realized.

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.

A partitioning method comprises determining whether a current block of a picture is a boundary block and whether the size of the current block is larger than a minimum allowed quadtree leaf node size; and if the current block is the boundary block and the size of the current block is not larger than the minimum allowed quadtree leaf node size (MinQTSize), applying forced binary tree (BT) partitioning to the current block. A method comprises making a determination that a current block of a picture is a boundary block and that a size of the current block is less than or equal to a minimum allowed quadtree (QT) leaf node size (MinQTSize); and applying, in response to the determination, forced binary tree (BT) partitioning to the current block.

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 discloses a real-scene three-dimensional system geographic entity space-time coding method, system and device and a medium, belongs to the technical field of three-dimensional scenes, and aims to solve the technical problem of how to quickly and accurately carry out space-time positioning and coding on a geographic entity in a real-scene three-dimensional system and improve data processing efficiency and precision. According to the technical scheme, multi-level network division and unique identifier: multi-level and multi-scale grids on the surface of the earth are divided based on a GeoSOT model, the GB / T 40087-2021 earth space grid coding rule is followed, the grid level is determined by calculating the size of a bounding box of a geographic entity, coordinate binarization left-shift operation is carried out at a coordinate of a center point of the entity, and a unique identifier is obtained; generating a unique grid code containing south and north hemisphere marks and east and west hemisphere marks by combining a Morton code conversion technology and a quaternary conversion technology; bTC Beidou subdivision of time codes is carried out; a space-time embedding model; optimizing spatial data coding in combination with Morton codes and binary tree coding; and sorting the space-time codes through a heap sorting algorithm.

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 discloses a wireless networking fault positioning method, device and system based on a binary tree algorithm, and relates to the technical field of communication network security, and the key points of the technical scheme are as follows: obtaining alarm information of a monitored network; judging whether the monitored network has a single-link fault or a multi-link fault according to the alarm information; if the fault is a single link fault, positioning the position of a fault point based on the topological structure of the monitored network, the alarm information and a pre-acquired binary decision tree model; if a multi-link fault occurs, decomposing the monitored network into a plurality of binary tree sub-networks; and for each binary tree sub-network, positioning the position of the fault point based on the topological structure of the binary tree sub-network, the alarm information and a pre-acquired binary decision tree model. By adopting the scheme provided by the invention, the timeliness and the accuracy of networking fault positioning are improved, and the safety and the reliability of networking communication are ensured.

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 data processing, and particularly provides a privacy set dynamic operation method, system and device and a storage medium, and the method comprises the steps: uniformly inserting elements of a privacy set into leaf nodes of a pre-constructed full binary tree; constructing a coding vector by using a grouping privacy protection key value storage algorithm and taking the element group of each leaf node as a basic unit; in a privacy set intersection operation stage, if an update element exists, recoding a leaf node where the update element is located into a new vector, and synchronously updating a corresponding coding vector backed up by an operation participant based on the new vector; and updating an intersection generated by the privacy set intersection operation based on the update element. According to the method, the updating operation of any local key value pair can be supported in the encoding stage, and meanwhile, most encoding results are not changed, so that the operation of the dynamic updatable privacy set can be realized.

The invention discloses a lattice-based hybrid revocable attribute encryption and decryption method and system, and the method comprises the steps: generating a common parameter and a master key according to an initialization algorithm, and constructing a binary tree structure; a binary tree leaf node is distributed to a user based on the binary tree structure, a user private key is generated in combination with a user attribute set and the master key, and the user private key comprises a path node key component; constructing a user revocation list according to the access strategy, and embedding a ciphertext in the user revocation list; verifying that the attribute set meets the access strategy and checking whether the secret key is consistent with the ciphertext version, and if yes, using the updated secret key to complete decryption. And through a key and ciphertext updating algorithm, the decryption capability of a specified attribute is periodically revoked to realize indirect attribute revocation.

The invention provides a large-scale scene organization and dynamic scheduling method based on two-dimensional Gaussian sputtering, and relates to the technical field of scene rendering, and the method comprises the steps: carrying out the blocking of a large-scale scene, obtaining a plurality of block scenes, and enabling the two adjacent block scenes to have an overlapping region; recursively creating a bounding box by adopting a median partitioning algorithm, and performing space partitioning on the partitioned scene to generate a BVH tree; nodes in the LOD tree are dynamically selected to generate an LOD structure according to the granularity of the nodes corresponding to the camera distance, and the scene performance of close-shot or medium-shot is achieved; based on the LOD tree, adopting a breadth traversal binary tree mode, and using leaf nodes of a preset proportion of the LOD tree to generate a hierarchical level of detail (HLOD) to realize long-range scene performance; combining the plurality of block scenes; the rendering efficiency can be improved while the visual quality is maintained.

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.

The invention discloses a snapshot multispectral camera demosaicing method and device based on a binary tree coating array, and the method comprises the steps: extracting a plurality of single-spectrum mosaic images according to a multispectral original image and a spectrum, and carrying out the estimation of a pseudo panchromatic estimation image according to the multispectral original image; calculating a difference value between each spectral band sparse pseudo panchromatic estimation image and the original spectral band sparse image, and calculating difference values at all pixel positions; adding the difference image after filtering interpolation with the pseudo panchromatic estimation image to obtain a demosaicing reconstruction result based on the pseudo panchromatic estimation image; and enhancing the spatial high-frequency information of the binary tree low-node spectral band image based on the binary tree high-node spectral band image by using the color and spatial correlation between adjacent spectral bands. According to the method, the problem of artifacts caused by weak spectrum correlation of the wide spectrum distribution optical filter can be solved, the artifacts of the reconstructed image are reduced, and the spatial resolution capability of the demosaiced image is improved.

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.