4results about How to "Avoid rebuilding" patented technology

The application belongs to the technical field of pattern matching and mining under the hypergraph data model, and particularly relates to an incremental dynamic hypergraph matching method centered on overlap, which comprises: on the basis of OHMiner, when the data of a pattern hypergraph changes, partial updating is performed on OIG; when a hyperedge is inserted, new overlap relationships brought by the new hyperedge are calculated, and the new overlap relationships are added to OIG as new nodes in an incremental manner, and the same nodes are merged; when the data of a target hypergraph changes dynamically, DDAL is updated incrementally, and pattern matching is performed in an incremental manner; when a new hyperedge is added, the existing partial matching affected by the new hyperedge is searched in a partial matching state storage library, each partial matching instance is incrementally expanded, and the size of a new overlap is calculated; the size of the new overlap is compared with a requirement in an execution plan to verify, and invalid candidates are discarded, which is incremental pruning. The application introduces a brand-new computing paradigm for dynamic hypergraph matching, and optimizes the performance of dynamic pattern matching.

This invention provides a method for rapid selection of modular multilevel submodules, an MMC control method, and a system, relating to the field of power electronics. By mapping continuous voltage distribution to a tree structure of voltage hierarchical indexing, this invention allows the "left low, right high" hierarchical relationship to be directly used for rapid location of target intervals. Combined with node counting, it achieves accurate quantity judgment across intervals, thus transforming the traditional O(Nlog N) sorting problem into an O(log N + k) tree search problem, achieving a significant reduction in complexity. Furthermore, this invention employs a local reconstruction mechanism that updates only the path nodes when the submodule voltage changes slightly, avoiding the reconstruction of the entire tree and greatly improving real-time performance and scalability.

The invention relates to the field of data encryption transmission, in particular to an attribute-based encryption method for a trusted data space, which comprises the following steps of: classifying attribute elements according to change states to obtain different change state subsets, obtaining a union set of all the change state subsets to obtain a change attribute set, taking any attribute element in the change attribute set as a target element, and obtaining a target attribute set; obtaining associated leaf nodes of the target element in a preset access strategy tree to construct an associated leaf node set, calculating the influence degree of the target element according to the associated leaf node set, and obtaining the total number of associated non-leaf nodes of the target element in the preset access strategy tree, calculating the adjustment amplitude caused by the target element according to the influence degree and the total number of the associated non-leaf nodes; and adjusting a corresponding threshold value and a corresponding associated leaf node in a preset access strategy tree in combination with the change state and the adjustment amplitude, and updating the key based on the adjusted access strategy tree. According to the invention, the system overhead in a high-frequency attribute change scene can be reduced.