1495 results about "Binary tree" patented technology

A method for locating objects, such as images having fixed aspect ratios, within a predefined space, such as a printed page, is provided. The method comprises generating a binary tree structure comprising at least one node and a plurality of leaves, each leaf corresponding to an image and being associated with one node. The method further comprises characterizing a bounding box for each node in the binary tree structure, the bounding box establishing a boundary for all leaves associated with the node. The method also comprises manipulating bounding boxes to fit within the predefined space. The method may be selectively repeated to reposition images within the binary tree structure or to reform the binary tree structure and characterize and manipulate using the reformed binary tree structure. The end result is at least one potential layout having all images located within the predefined space.

A method for quickly and efficiently locating objects, such as images having fixed aspect ratios, within a predefined space, such as a printed page, is provided. The method comprises generating a binary tree containing a first image. The system generates a second tree, where the second tree modifies the first tree by inserting a second image at a location or position on the first tree. This iterative process of inserting images one at a time continues until the system generates a final tree including all images. In each iteration, the position in the binary tree where the system inserts each subsequent image can be either a leaf or a node. The system generates a series of candidate trees, one for each subsequent image inserted into each and every location in the preceding tree, and the candidate tree having a highest score indicates the selected location for the subsequent image and the new baseline, preferred binary tree.

The present application discloses a system and a method for tag estimation and anti-collision in an RFID system, which can estimate an exact number of tags within an RF area and can rapidly identify tags by using the estimated number of tags in an RFID system. The system includes an RFID reader and RFID tags. The RFID reader includes an identification means, a collision management means, a tag number estimation means, and a reader control means. The RFID tag includes a tag communication means, a message reading means, a counter management means, an information storage means, and a tag control means. The disclosed system and method can prevent occurrence of too many idle times slots in the DFSA and too many initial collisions in the binary tree scheme, and thus can identify a large number of tags at a high speed with a small number of time slots.

The invention provides a universal circuit breaker mechanical fault diagnosis method based on feature fusion of vibration and sound signals. The method includes steps of 1, collecting machine vibration signals and machine sound signals during an engaging and disengaging process of a universal circuit breaker; 2, adopting an improved wavelet packet threshold value denoising algorithm for denoising; 3, adopting a complementary total average empirical mode decomposition algorithm for extracting a plurality of solid mode function components reflecting state information of engagement and disengagement actions of the circuit breaker from the denoising signals; 4, determining the number Z of the solid mode function components; 5, calculating the energy ratio, the sample ratio and the power spectrum entropy as three types of features; 6, adopting a combination core principal component analysis method for performing dimension reduction on a feature sample with unified three types of features of the vibration and the sound signals and obtaining M principle components; 7, establishing a related vector machine based sequence binary tree multiple classifier model.

An approach for managing addition or deletion of nodes in a multicast or broadcast group, which avoids introducing a single point of failure at a group controller, certificate authority, or key distribution center, is disclosed. A central group controller utilizes a binary tree structure to generate and distribute session keys for the establishment of a secure multicast group among multiple user nodes. The central group controller is replicated in a plurality of other group controllers, interconnected in a network having a secure communication channel and connected to a load balancer. The secure communication channel is established using a public key exchange protocol. The load balancer distributes incoming join/leave requests to a master group controller. The master group controller processes the join or leave, generates a new group session key, and distributes the new group session key to all other group controller replicas. Each group controller is successively designated as master group controller in real time when a former master group controller crashes or relinquishes its master authority.

A method for reading and tracking radio frequency identification (RFID) tags in the presence of a noisy air channel is provided. In accordance with the method, a binary tree data structure is used to characterize a plurality of RFID tags, each of which is associated with a unique identification (ID) number. During communication between a tag reader and one or more RFID tags, the tag reader traverses the binary tree, eliminating tags from communication until one tag with a unique ID number is isolated and verified. As the binary tree is traversed, counters associated with each node in the tree are incremented based on tag matches, such that, over time, counters associated with nodes in tag-populated branches will tend to have a high value and counters associated with nodes in unpopulated tree branches will tend to have low values. Where the read process is subject to noise and the tag reader is forced make a decision at a branching node, the tag reader makes a branch prediction based on the current value of the node counters associated with each of the possible alternative branches.

Methods for generating information for displaying terrain on an aircraft display system that significantly reduces the computation and data load for producing the terrain display. This is accomplished through the use of intelligent level of detail control that computes and displays terrain and dynamic on-terrain perspective projection lines and distance rings aligned with the aircraft heading for depth perception and relative altitude awareness. The terrain details are processed and displayed in a manner that shows all significant terrain features, e.g., peaks, towers, and the like, but through the use of nonlinear error bound geometric morphing, coupled with triangle binary tree based terrain mesh generation, the polygon count, and thus the computational load, are significantly reduced, while visual fidelity is maintained.

Methods and systems for the negotiation of a population of RFID tags with improved security is provided. In one aspect, a binary traversal is performed to singulate tags without using information that directly identifies the tags in the tag population. A key is generated to identify each RFID tag of the population of RFID tags. The generated key does not include bits identifying an item with which the particular RFID tag is associated. A binary tree algorithm is operated to identify one or more tags in the population of RFIDs tags using the generated keys. In another aspect, frequency hopping and/or spread spectrum techniques are used to provide improved security while negotiating tags. In another aspect, the reader causes the tags to scroll series of bits back to the reader for each bit sent to the tags to provide improved security.

A generally lossless compression system suitable for compression of data in a real-time, remote monitoring application is disclosed. In one embodiment, the real-time monitoring application is subject to a fixed-delay transmission constraint. In one implementation, a specific set partitioning method (e.g., binary tree partitioning) is employed on blocks of data that are wavelet transformed in a reversible manner so that encoded blocks may be transmitted losslessly or truncated and transmitted with some loss.

A defect classification method to classify defects by using a classifier having a binary tree structure based on features of defects extracted from detected signals acquired from a defect inspection apparatus includes a classifier construction process for constructing the classifier by setting a branch condition including defect classes respectively belonging to groups located on both sides of the branch point, a feature to be used for branching, and a discriminant reference, for each branch point in the structure based on instruction of defect classes and feature data respectively associated therewith beforehand. The process includes a priority order specification process for previously specifying target classification performance of purity and accuracy for each defect class, whole and in worst case, with priority order, and an evaluation process for evaluating whether the specified target classification performance under the branching condition is satisfied and displaying a result of evaluation, every item.

An approach for establishing secure multicast communication among multiple members that participate in a multicast group is disclosed. In one feature, multiple multicast proxy service nodes (MPSNs) are defined and control when members join or leave the multicast group. The MPSNs are logically represented by a first binary tree in which each node of the first binary tree is associated with a domain of a directory service and one or more of the MPSNs. A second binary tree is created that has leaf nodes representing each member. The second binary tree is stored in a domain of the directory service with a root node that represents one or more of the MPSNs. The members can each establish multicast communication and serve as a key distribution center. When a member joins the multicast group, a new group session key is determined by replicating a branch of the second binary tree.

A program for decoding variable-length codes like Huffman codes is generated by receiving information describing a particular coding scheme that defines an association between source symbols and the variable-length codes, generating a binary tree that represents the coding scheme, generating a lookup table from the binary tree that can be used to decode variable-length codes having a length less than or equal to a threshold length, and processing the binary tree and the lookup table to generate the decode program.

Methods and systems for using binary searches for variable length network address prefix lookups are disclosed. Variable length prefixes are stored in a network address forwarding table. Each prefix corresponds to an entry in the forwarding table. The entries correspond to nodes in a binary tree. Each entry in the forwarding table includes path information regarding parent nodes of each entry in the binary tree. When a lookup is performed in the routing table, bits in the path information are used to determine the longest parent node prefix that matches the address being searched. The longest parent node prefix corresponds to the longest matching prefix.

The invention discloses a method for realizing timely user attribute cancel based on ciphertext-policy attribute-based encryption. The method is realized by the following steps: a system is established to generate a system public key and a master key; an encipherer constructs an access strategy; the encipherer carries out encryption to generate a ciphertext; an attribute authority center generates a user private key and an authorization private key; a cloud server constructs a path secret key binary tree; the cloud server carries out proxy re-encryption and generates a re-ciphertext to realize the cancel of user attributes; and a decipher carries out decryption to obtain a plaintext. The method helps to reduce the burden of the attribute authority center, and can solve the private key updating problem corresponding to the attribute cancel quickly and efficiently; when one or some attributes of a user is cancelled, access authority for other attributes is still reserved; and the cancelling of one or some attributes of the user does not influence the access authorities of other uses to the cancelled attribute; and the method has the advantages of being capable of cancelling the user attributes in a flexible, timely, fine-grained and efficient manner.

Methods and apparatus for key distribution in a conditional access system, assuming that the set of all user nodes which the system can accommodate is a complete set, and a subset is composed of all user nodes or part of user nodes. One method comprises: decomposing said subset into at least one secondary subset; assigning a different user key to each secondary subset, each said user key being transmitted to all users in a corresponding secondary subset; encrypting an entitlement key by using each said user key so as to generate a cipher text corresponding to each said secondary subset; and combining said cipher text to generate a media key control block and transmitting said media key control block to all users in said subset. Since a classification method of a binary tree and a multiple tree is used, the invention can save a lot of network resources.

The invention discloses a method and a system for converting a ladder diagram into an instruction list and carrying out the interpretive execution of an instruction list. The ladder diagram conversion method comprises the following steps: mapping the ladder diagram to an AOV diagram, establishing a binary tree representative of the logical relationship between the instructions based on the AOV diagram, and converting the ladder diagram to the instruction list by the postorder traversal of the binary tree. The method and the system perform the conversion between various complex ladder diagrams and instruction lists, particularly the conversion of the multi-output ladder diagram to the instruction list. Additionally, the converted instruction list exists in the form of postorder expression, which is conducive to increasing the efficiency of interpretive execution of the PLC master controller.

Methods, apparatus, and products are disclosed for parallel execution of operations for a partitioned binary radix tree that include: receiving, in a parallel computer, an operational entry for the PBRT, the PBRT comprising a plurality of logical pages that contain a plurality of entries, each logical page included in a tier and containing one or more subentries corresponding to the tier of the logical page containing the subentry, each entry is composed of a subentry from each logical page on an entry path; processing in parallel, on the parallel computer, each logical page in each tier, including: identifying a portion of the operational entry that corresponds to the tier of the logical page, and performing an operation on the logical page in dependence upon the identified portion of the operational entry for the tier; and selecting operation results from the logical pages on the entry path for the operational entry.

A scheduling system for choosing the most appropriate heuristic for solving time-dependant scheduling problems. The invention includes a means for selecting the most appropriate heuristic method for generating a schedule from an enumerative (“brute force”) method, a dynamic programming method, and a genetic method. The invention further includes a hashing function that is capable of detecting duplicate solutions generated by the dynamic programming module and a height-balanced binary tree for providing search insertion and deletion operations.

Example embodiments improve the lookup times and modification costs of indexing on a dynamically sorted list by using a combination of data structures to determine index values for secondary keys and vice versa. More specifically, exemplary embodiments provide a combination of a binary tree (e.g., a balanced binary tree) with a lookup table (e.g., linear dynamic hash table) to provide scalable retrieval of entries by either an array index or a secondary key. For example, given a key, a hash thereof returns a node placement within a balanced binary tree. This positioning can then be used at runtime to determine an index value for a data record, resulting in a near real-time lookup cost. Also note that modifications, such as reordering, insertions, and deletions, become a function of the nodes depth in the binary tree, rather than a linear function of number of records within the data array.