Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

2results about How to "Efficient pruning" patented technology

A low-noise electric lawnmower

ActiveCN224267431Ueasy to handleEfficient pruningMowersElectric machineryControl theory
This utility model discloses a low-noise electric lawnmower, relating to the field of lawnmower technology. It includes a frame with a U-shaped structure and a drive assembly at the bottom. A motor is mounted inside the frame, moving vertically, and a mowing assembly is fixedly mounted on the motor's output shaft. The mowing assembly includes a fixed cover, an adjusting post, and mowing blades. The upper surface of the fixed cover is fixedly connected to the motor's output shaft, and the adjusting post is fixedly mounted at the bottom. Three mowing blades are slidably mounted on the bottom side of the adjusting post. This utility model utilizes a rotating shaft, worm gear, worm, and adjusting disc. Rotating the adjusting disc drives the rotating disc via the worm gear, causing the connecting rod to slide along the guide groove, simultaneously adjusting the spacing between the three sets of mowing blades. This allows for free adjustment of the mowing range, enabling efficient handling of large lawns while precisely trimming corner areas, reducing repetitive trimming, optimizing the work path, and achieving energy-efficient and intelligent lawn maintenance.
Owner:NINGBO QIANGYA IND & TRADE

Blockchain-based verifiable query method, full node and readable storage medium

PendingCN122594321AAvoid traversing queriesEfficient pruning
The application discloses a blockchain-based verifiable query method, a full node and a readable storage medium, and relates to the technical field of blockchains. The method comprises the following steps: for a query condition of a pre-constructed verifiable data structure ADS, a full node locates transaction data by using an ADS corresponding to the query condition; the ADS comprises an inter-block index structure and an intra-block index structure; or for a query condition of an unpre-constructed ADS, the full node locates transaction data based on a hybrid filtering structure of a bitmap and a Merkle prefix tree (MPT); and the full node generates a verification object containing a minimum Merkle path based on the located transaction data. The method can avoid traversal query on blocks, thereby improving query efficiency.
Owner:CHINA MOBILE ZIJIN INNOVATION INST CO LTD +2