114results about How to "Reduce space overhead" patented technology

The present invention provides a map pathfinding method, dividing plane map into one or more identical area, generating waypoint on area border; when finding path, processing path find based on the area to acquire area path; then generating final path based on the triangular facet Path finding according to the acquired area path. The invention also provides a mapping road finding system, adopting method and system of the invention not only saves space occupation, but also improves road finding efficiency, also suitable for process of all kinds of maps.

A technique for monitoring an execution of a program is provided. At least one relational query is constructed and compiled into a program instrumentation. The program instrumentation is incorporated into the program and one or more query results are output from the program as the program executes.

The invention discloses a system for reminding about health schedules. The system comprises: a plan database comprising a plurality of action plans, a user database comprising user information, a plan task processing module, a reminder sending module and a user terminal, wherein the plan database, the user database, the plan task processing module and the remind sending module are arranged in a system server, and the system server is connected with the user terminal through the Internet or wireless communication. The plan task processing module scans plan items in the plan database at regular time to look for a plan item which is matched with the user information in the user database and accords with time conditions, and then sends the plan item to the user terminal through the reminder sending module. Accordingly, the invention also discloses a method for reminding about health schedules, and the method is realized by the reminding system.

The invention relates to an index tree construction method for a key value storage system, which comprises the following steps of: sorting and dividing prefixes of key values of key value data to generate a dictionary tree serving as an upper layer structure of an index tree; constructing a hash table by using the hash value of the key value, and generating a lower layer structure of the index tree by using the hash table; and establishing a corresponding relation between the key value data, the hash table and the dictionary tree, and generating the index tree. According to the index tree construction method, key value data indexing operation is conducted through the constructed index tree of the upper-layer and lower-layer structure, more excellent single operation capacity O(L+K) is achieved, lower space cost and higher efficiency are achieved, and range finding and dynamic data increasing processing are supported.

The invention discloses a moving target detection method based on gray features. The method comprises the following steps of: carrying out gray processing and denoising processing on a real-time video monitoring image sequence by utilizing a computer terminal, selecting a multiframe video monitoring image from the image sequence to form a training image sequence, extracting the corresponding gray feature set to each pixel at the same coordinate position in the training image sequence, screening the gray feature sets to obtain a background model, carrying out moving target detection on a subsequent video monitoring image in the image sequence, and carrying out morphology filtering and connected region detection on a binaryzation image including the moving target to obtain an outline and a position of the moving target. The method provided by the invention only needs the searching and comparison operations in the gray feature sets corresponding to the pixels without without complicated parameter estimation or probability calculation, thus simplifying the detection process, improving the detection precision, reducing the time cost and improving the operating efficiency.

The invention belongs to a method of judging whether a point is in a polygon, pertaining to a computer graphic and computer geometry technical field. The invention first convexly decomposes a polygon and builds a binary tree to manage these convex polygons; then the invention investigates the built binary tree according to the coordinate position of the tested point to find the convex polygon to which a leaf node of the binary tree corresponds; finally the invention tests whether the point is in the convex polygon or not, thus judging whether the tested point is in the given polygon or not. The invention has the advantages that the calculating speed is high and the storage space is saved compared with other similar methods based on polygon convex decomposition. The invention is applied to the condition that a plurality of points are judged whether in the same polygon.

The embodiment of the invention provides a high accuracy division operation method. The high accuracy division operation method comprises setting a system significant bit width 1, searching a start bit position Ps of an unsigned divisor x in a mode starting from a sign bit from high bit to low bit to obtain the significant bit length of the unsigned divisor x, dividing the unsigned divisor x into an a comprising a high 1bit significant bit and a b comprising a residue significant bit and transforming the reciprocal of the unsigned divisor, performing normalization processing on the a, and searching a pre-stored reciprocal table and performing regression processing to obtain the value of 1/a and further to obtain the value of 1/(1+b/a). The invention further provides a high accuracy division operation device. The high v division operation method and device improve the accuracy of a quotient by setting a pre-stored reciprocal table or/and through a mode of equation extension, are suitable for scenes requiring relatively high accuracy and are also suitable for scenes where the operational speed is high and the accuracy errors are controlled within a certain range, not only avoid multiple shift operation and subtraction operation in division operation in the prior art, but also avoid over-large errors caused by interpolation fitting.

A RAID-configured grouped-object storage system provides reduced storage space overhead for small objects. The storage system includes a plurality stripes arranged across a plurality of physical objects. Each stripe includes a plurality of storage blocks that are each mapped on to a respectively different physical object. The storage system also includes a plurality of virtual objects each containing at least one storage block. A group of virtual objects is formed when a virtual object contains less storage blocks than the number of stripes by associating the virtual object with at least one virtual object containing less storage blocks than the number of stripes and/or at least one storage block containing zero values so that the storage blocks of each group of virtual objects equals the number of stripes. The storage blocks of each virtual object and of each group of virtual objects are mapped to a respectively different stripe.

The present invention discloses a space-time efficient binary image binary logic operation method based on run-length coding, which can finish the four basic logic operations of or operation, and operation, xor operation and logic difference operation of the binary images and the combination thereof with less space and time expenses. According to the present invention, the binary images participating in operation are expressed into an equivalent run length tree structure by the run-length coding; various position relations between two run lengths are defined, the corresponding run length operation rules are determined according to the different position relations, and the basic logic operations of the binary images corresponding to the run lengths can be finished equivalently; the complicated logic operations are resolved into a plurality of basic binary logic operations, and a run length tree of the operation result binary images is obtained by applying the corresponding run length operation rules; and finally, the result binary images are reconstructed by the run length tree. According to the present invention, by the run-length coding, the space expense expressing the binary images is reduced, and a plurality of series pixel logic operations are compressed into a simple run length operation, thereby reducing the space and time expenses of the method remarkably.

The invention discloses a subgraph querying method, and belongs to the technical field of computers. The method comprises the following steps: acquiring queried graphs, wherein frontier sets of the queried graphs have a sequential relationship; acquiring current snapshot of graph dataflow on the basis of a time window; acquiring a current extension chain table of the queried graphs on the basis ofthe queried graphs and the snapshot, wherein the extension chain table comprises a plurality of chain table nodes, and L^i in the chain table nodes is used for storing omega (Preq(e_i)); and acquiring a matching solution of the queried graphs according to the extension chain table, wherein the matching solution of the queried graphs meets a time-order matching condition. Time-order characters ofthe queried graphs are considered, the obtained time-order matching between the matching solution and the queried graphs is ensured, and the accuracy of a subgraph querying process is improved.

The invention discloses a wearable device data optimization processing method based on the editing distance. The method includes the steps of firstly, conducting simple zero crossing point data segment on data fed back by a sensor; secondly, conducting periodic detection, and conducting the following more detailed periodic distinguishing if the data conforms to periodic action standards after periodic detection is completed; thirdly, conducting editing distance calculation on a data stream of the second step, and obtaining the calculation result; fourthly, obtaining the final precise result according the result of the third step and through the assistance of a correction function, and making the precise result conform to the objective common sense; fifthly, putting forward an undirected graph concept for a multi-sensor system, and calculating all edge weight values through the similarity algorithm; sixthly, obtaining the minimum sensor set Vf through the optimal node algorithm. According to the method, the existing long data processing flow in a single-sensor system is abandoned, and in a multi-sensor system, the aims of saving energy and reducing space expenses are achieved through an undirected graph and a dynamic planning function.