1479 results about "Tree root" patented technology

Provided is a system and method for a multicast routing algorithm to work in infrastructure based mesh networks. It chooses access points, fixed infrastructure gateway nodes connected to each other and / or the global internet via a wired / wireless backbone, as a group of local multicast group leaders to form a multicast group leader cloud. Each local multicast group leader is elected on-demand according to the local multicast group member's request. Each local multicast group leader forms a local multicast tree rooted at this leader connecting all multicast group members associated with the AP. The processes of electing and maintaining local multicast trees rooted at APs enable efficient coordination with underlying unicast routing to exploit the advantages of fixed infrastructure nodes. Therefore, routing overhead and multicast tree convergence time are reduced. The method can support large networks with fast topology change due to fast convergence and reduced routing overhead.

A method for avoiding loops from forming when setting up label switched paths is provided. The method uses a Label Splicing Message is followed by an Acknowledgment message to determine if loops are formed in the process of joining a new node or subtree to a multicast MPLS tree. By verifying that the path towards the root of the MPLS tree is loop-free during the construction of the tree, this method complements the loop detection mechanism provided by the label switched protocol (LDP).

Classification of image regions comprises: recursively partitioning an image into a tree of image regions having the image as a tree root and at least one image patch in each leaf image region of the tree, the tree having nodes defined by the image regions and edges defined by pairs of nodes connected by edges of the tree; assigning unary classification potentials to nodes of the tree; assigning pairwise classification potentials to edges of the tree; and labeling the image regions of the tree of image regions based on optimizing an objective function comprising an aggregation of the unary classification potentials and the pairwise classification potentials.

A scalable broker publish / subscribe broker network using a suite of active load balancing schemes is disclosed. In a Distributed Hashing Table (DHT) network, a workload management mechanism, consisting of two load balancing schemes on events and subscriptions respectively and one load-balancing scheduling scheme, is implemented over an aggregation tree rooted on a data sink when the data has a uniform distribution over all nodes in the network. An active load balancing method and one of two alternative DHT node joining / leaving schemes are employed to achieve the uniform traffic distribution for any potential aggregation tree and any potential input traffic distribution in the network.

The invention provides a data existence authentication system, a data existence authentication method and a data existence verification method. The authentication method comprises the steps of obtaining hash values of target data, and storing the hash values; generating at least one Merkel tree according to the hash values, and storing tree roots of the Merkel tree in block chains of a predetermined block chain network through trading; and generating receipts corresponding to the target data respectively, wherein the receipts comprise corresponding target hash values, corresponding tree roots and paths of the Merkel tree, and trading data storage paths, and the paths comprise the hash values sequentially paired with the target hash values to finally generate the tree roots. According to the data existence authentication system, the data existence authentication method and the data existence verification method, the authentication of the existence of the target data in the trading time can be realized through the trading without depending on an authentication mechanism by utilizing characteristics of the Merkel tree and a characteristic that data in the block chains cannot be rewritten, the trading only needs to store the tree roots in the block chains, and the authentication of batch data can be finished by one-time trading, so that the authentication cost is greatly reduced.

A structural cell system is disclosed for supporting hardscape areas in a way that enables tree root growth and accommodates filtering, retention, storage and infiltration of storm water while preventing hardscape damage. The system includes a plurality of structural cells capable of being positioned below a hardscape. The structural cells are designed to have openings that are sized to accept tree roots. The system has one or more permeable barriers around the structural cells with a way for water to flow into the plurality of structural cells flow out of the structural cells.

A backup of a database is determined to be performed. A backup of at least a portion of contents of a storage volume that includes data of the database is performed. The backup includes a step of creating a new metadata tree root node. Creating the new metadata tree root node includes copying from another metadata tree root node of a tree data structure corresponding to a previous backup instance, one or more references to one or more lower tier metadata tree nodes associated with the tree data structure corresponding to the previous backup instance.

A method for organizing a plurality of communication devices of an ad hoc communication system into a communication network. The devices are organized into one or more communication graphs where at least one of the graphs is a rooted tree. The invention also provides an ad hoc communication system wherein the devices are organized into one or more communication graphs, where at least one of the graphs is a rooted tree. A method for routing a communication session in the system is also provided where a session is routed from the calling node to the tree root and from the tree root to the called node. In a preferred embodiment, shortcuts are sought in the session route.

A block chain search engine method includes: using a block chain linkage address as a search engine address, adopting a distributed search method to search the block chain linkage address, and ranking the search results with the lengths of block chain linkages; establishing an index database according to the block chain linkage address, wherein the index database maps keywords, the index database includes a word dictionary and inverted files, the word dictionary is stored in a Hash linkage manner or in a Merkel tree root manner; establishing a keyword mapping webpage matrix; analyzing the relevance of the keyword mapping webpage matrix; and performing weighting through analysis of the relevance.

One embodiment of the present invention provides a switch. The switch includes an inter-switch multicast module and an edge multicast module. The inter-switch multicast module identifies for a first replication of a multicast packet an egress inter-switch port in a multicast tree rooted at the switch. The multicast tree is identified by an identifier of the switch. The edge multicast module identifies an egress edge port for a second replication of the multicast packet based on a multicast group identifier. The multicast group identifier is local within the switch.

The invention belongs to a planting method of plants, and particularly relates to a method for planting dendrobium candidum through imitating wild hanging trees. The adopted technical scheme is as follows: the method for planting dendrobium candidum through imitating wild hanging trees is characterized by comprising the following steps of: planting 3-5 cm dendrobium candidum large seedlings or domesticated seedlings in plastic flowerpots with a port diameter of 12-15 cm, hanging the flowerpot with dendrobium candidum planted on evergreen tree, applying routine nutrient solution and water on the dendrobium candidum large seedlings or domesticated seedlings, and spreading lime around the evergreen tree, wherein the bottom layer of the medium in the flowerpots is 50% of crushed wood blocks and the upper layer is sawdust mixture. By adopting the scheme, aiming at the defects of the prior art, the invention provides a novel method for planting dendrobium candidum which has a high growth rate and can be cultivated in a large scale through imitating wild hanging trees.

A tree root ball wrapping apparatus (100) includes a circular platform (109, 113) for supporting a separable, open-frame, root-containment structure (103, 105, 107) having an inverted conical shape. A group of pivot joints (201, 203, 205, 207) are located at an upper section of the root-containment structure for separating the root-containment structure into half sections. In practice, the group of pivot joints can be opened during tree transplantation for providing removal of a root ball from the wrapping apparatus by opening the sections at the group of pivot joints for easily facilitating removal of the wrapping apparatus (100) from within a transplantation hole.

An optimistic, latch-free index traversal (''OLFIT') concurrency control scheme is disclosed for an index structure for managing a database system. In each node of an index tree, the OLFIT shceme maintains a latch, a version number, and a link to the next node at the same level of the index tree. Index traversal involves consistent node read operations starting from the root. To ensure the consistency of node read operations without latching, every node update operation first obtains a latch and increments the version number after update of the node contents. Every node read operation begins with reading the version number into a register and ends with verifying if the current version number is consistent with the register-stored version number. If they are the same, the read operation is consistent. Otherwise, the node read is retried until the verification succeeds. The concurrency control scheme of the present invention is applicable to many index structures such as the B+-tree and the CSB+-tree.

The invention discloses a biological pesticidal organic fertilizer and a preparation method thereof. The biological pesticidal organic fertilizer is prepared from the following raw materials in parts by weight: 40-50 parts of pig manure, 20-30 parts of tea seed pulp, 10-15 parts of coffee grounds, 8-12 parts of paulownia sawdust, 5-10 parts of phosphogypsum, 4-8 parts of corn cob, 5-10 parts of pepper seed cake, 10-15 parts of mushroom dreg, 8-12 parts of wheat bran, 15-20 parts of bentonite, 10-15 parts of opoka, 2-3 parts of ferrous sulfate, 1-2 parts of manganese sulfate, 3-5 parts of humic acid, 1-2 parts of chinese tallow tree root and bark, 2-3 parts of sophora alopecuroides, 1-2 parts of stemona, 1-3 parts of Artemisia annua, 1.5-2.5 parts of ailanthus leaf, 2-3 parts of derris and 1-2 parts of Radix Euphorbiae Ebractealatae. The organic fertilizer disclosed by the invention has multiple effects of providing nutrients, improving the soil structure, preventing and treating pests and diseases and the like, can promote the crops to quickly grow, enhances the stress tolerance of the crops, can have favorable preventing and treating effects on nematodes and soil insects, reduces or avoids use of chemical pesticides, enhances the soil fertility, regulates the ecological equilibrium of soil, improves the quality of agricultural products, has no chemical residues, and implements yield increase and income increase of agricultural products.

A modular pallet for use in supporting and transporting goods. The modular pallet comprises a plurality of hollow legs integral to an inner side of the sidewall and a plurality of interlocking means integral to an outer side of the sidewall for coupling other modular pallets laterally, wherein each of the hollow legs comprises a top opening aligned with the top surface of the pallet and a bottom opening further away from the bottom surface of the pallet, and a top groove along a peripheral edge of the top opening and a bottom groove along a circumference of the hollow leg adjacent to the bottom surface. A multilayer support structure comprises at least two layers of the modular pallets separated by a plurality of hollow support columns for being positioned under the ground to support a hardscape / softscape disposed thereon while enable for tree roots growth, water drainage and storage of utilities.

A method for transplanting the big tree with bare root includes such steps as digging a tree, trimming the tree to be transplanted, transporting, preparing the conditions for transplanting, transplanting, post management, and draining water and preventing waterlogging. It features that the consumptions of nutrients, water and energy for the tree to be transplanted are decreased and the physiological function of its tissue, organs and root is restored as fast as possible. Its advantages are high survival rate and convenient transport.

The invention discloses polymorphic nitrogenous fertilizer and a preparation method thereof. The polymorphic nitrogenous fertilizer comprises, by weight, 13-18 parts of urea, 63-65 parts of ammonium sulfate, 13-15 parts of ammonium chloride, 3-4 parts of animal hairs and feathers, 14-16 parts of modified attapulgite, 0.6-0.8 part of zinc sulphate monohydrate, 0.2-0.4 part of micronutrients fertilizer, 3-8 parts of ferrous sulfate, 0.3-0.5 part of nitrogen-fixing bacteria, 2-4 parts of modified nanocarbon, 1-3 parts of fructus cnidii, 5-7 parts of pomegranate tree roots and 9-11 parts of willow leaves. The feathers and the like are hydrolyzed by acid to form amino acid, secondary and trace elements are chelated, carboxymethyl cellulose increases a chelation structure of the secondary and trace elements so as to facilitate effective utilization of the secondary and trace elements, and invalid release of the secondary and trace elements is reduced. The polymorphic nitrogenous fertilizer is suitable for crops of wheat, rice, corn, soybean, rape and the like, can urge the wheat and the rice to turn green rapidly, be much in shooting and longing resistant and enhance chill-proof, drought-resistant and disease and insect resistant capacity, and enables cotton and linen crops to enhance tension and strength of fiber and improve output and quality remarkably.

The invention discloses a distribution network state estimation method based on hierarchical solution. The method comprises the steps of 1) performing hierarchical partitioning based on a network topological structure of a distribution network and the configuration of measurement points to form a sub-partition set, and determining the current and voltage relationship between tree branch circuits; 2) traversing and extracting a sub-partition from the tree root in the sub-partition set, and deleting the extracted sub-partition in the sub-partition set; 3) based on the SCADA and AMI measurement data, performing state estimation of hybrid measurement information based on the time-scale hierarchical solution on the extracted sub-partition; and 4) repeating the steps 2) and 3) to determine whether the sub-partition set is empty, if so, integrating and outputting the estimation result of each sub-partition at the current time, and otherwise, executing the step 2). The method of the invention improves the redundancy of the state estimation based on the added AMI real-time measurement data, realizes the hierarchical state estimation of the distribution network through a hybrid strategy of the AMI and the SCADA measurement data, and can improve the accuracy of the three-phase state estimation of the distribution network.

Enhanced compiled representation of transformation formats to enable rapid application development and deployment is described. Techniques for partitioning data in a transformation include populating a table with a functoid associated with a functoid tree root, traversing the table and generating a page object corresponding to a page number found in the functoid, and instantiating the functoid in the page objects. A system for partitioning data in a transformation is also described, including a memory configured to store a table with a functoid associated with a functoid tree root, and a processor configured to traverse the table and generate a page object corresponding to a page number found in the functoid, and instantiate the functoid in the page object corresponding to the page number.

The invention provides a fast big tree grafting method of rare flowers and trees in the field of agriculture and forestry. The grafting method is mainly characterized by: choosing a trunk or a branch of a normal big tree as a rootstock, transplanting more than one variety of seedlings of rare flowers and trees to the root part of the rootstock, not cutting the trunk or top branch, connecting the trunk or top branch to the trunk or branch of the rootstock, taking nursing measure, and forming a big tree of the rare flowers and trees quickly. The engrafting rate is improved, the adaptability is strong, and the price is higher than that of the tree seedlings of the same variety, and the method can form one variety with one tree, so as to breed multiple rare flowers and trees, thus satisfying the social demand and having obvious economic benefit and social appreciation value.

The invention relates to a method for soil-column seedling culture and transplanting afforestation, wherein the transplanting afforestation method comprises the following steps of preparing soil-column blocks, using the soil-column blocks to cultivate tree / shrub seedlings and transplanting soil-column-block seedlings on site. The method can avoid the damage of bare-rooted seedling transplantation to tree root systems, as well as the problem of root-system coiling problem caused by container seedling transplantation, can enable transplanted seedlings to form root-system forms similar to self-generated trees so as to improve the survival rate of the seedlings and the adaptability of the seedlings to new environments, can avoid the destruction of fish-scale pits and other traditional afforestation methods to ground surface, and can reduce soil wind erosion. The method can be used for general flat-land afforestation, as well as slope-land, sandy-land and wasteland afforestation, and has obvious social, economic and ecological benefits.

The invention discloses a tree root allocation and message processing method and a routing network bridge which is applied to a transparent interconnection of lots of links (TRILL) network. The tree root allocation method comprises the steps of using one routing network bridge (RB) as a group designate node (GDRB) in a routing network bridge group, allocating tree roots for each RB in the group according to a tree selection strategy and then informing an allocation result to each RB in the group. Correspondingly, the routing network bridge comprises a tree selection unit for allocating the tree roots for each RB in the group according to the tree selection strategy when the RB is used as the GDRB in the routing network bridge group, an informing unit for informing the allocation result of the tree selection unit for allocating the tree roots for each RB to each RB in the group. After adopting the tree root allocation and message processing method and the routing network bridge, mistaken abandonment of messages can be avoided, tree root allocation is flexibly applied, and members in the group can perform full information share and flexible network configuration through the group designate node and provide guarantee for network application.

The invention discloses a cross-chain transaction method and device based on a block chain and a computer readable storage medium. The method comprises the steps that a first node acquires a cross-chain transaction data packet and tree root proof information which are sent by a relay node and aim at target transaction data, wherein the cross-chain transaction data packet and the tree root proof information are sent to the relay node by a second node, the first node belongs to a first service block chain, the second node belongs to a second service block chain, the cross-chain transaction datapacket comprises a target Merkel tree root and a consensus signature set of a block to which the target transaction data belongs, and the consensus signature set is obtained after consensus of the cross-chain transaction data packet is passed; verifying the consensus signature set, and verifying the target Merkel tree root according to the tree root proving information; and when the consensus signature set and the target Merkel tree root are successfully verified, executing a transaction service associated with the target transaction data. By adopting the method and the device, the reliabilityof the cross-chain transaction between the first service block chain and the second service block chain can be improved.

The invention discloses a multicast routing item updating method of a multilink transparent internet. The method comprises the following steps that: when an RB (Routing Bridge) detects that a link between the RB and a multicast tree root of a multicast tree is inaccessible, an LSP (Link State Protocol Data Unit) corresponding to the multicast tree root in an LSDB (Local Link State Databank) is eliminated; an available multicast tree root is generated according to the LSDB after the corresponding LSP is eliminated; an SPF tree is generated by using the available multicast tree root; and the multicast routing item is generated and updated by using the available multicast tree root by traversing the SPF tree. Based on the same idea, the invention also provides a device with which effective multicast routing items can be calculated rapidly when the link between the present RB and the multicast routing root is inaccessible, and the normal forwarding of multipurpose messages is ensured.

The invention provides a collision detection method based on a bounding volume tree, which performs detection from the root portion to the branch extreme end and includes that: step a building the bounding volume tree of two objects; step b obtaining current nodes of the bounding volume tree of the two objects for performing detection with two nodes as a group, judging whether the two nodes collide, and turning to step c if collision happens, otherwise, turning to step d; step c judging whether the current nodes are leaf nodes, recording the nodes if the current nodes are leaf nodes, returning and performing accurate detection to determine whether collision really happens, otherwise, taking all sub nodes of the current nodes as the current nodes of the tree and recursively executing the step b; and step d calculating node information including 'nearest distance', 'speed' and 'whether nodes are collided' if the current nodes do not contain undetected brother nodes and returning, otherwise, sequentially taking next brother nodes as the current nodes of the tree and recursively executing the step b. A method for performing detection from the branch extreme end to the root portion is further provided.