Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

107 results about "Primitive operation" patented technology

Primitive operations. In addition to the operations that IBM® Rational® Rhapsody® automatically generates, you can define your own operations for objects. Each operation has a name and return type, and might include arguments. User‑defined operations are called primitive operations in Rational Rhapsody.

Method for analyzing similarity of character string under Web environment

The invention discloses a method for analyzing the similarity of character strings under a Web environment, comprising the following steps of: firstly, defining basic operation cost; pretreating the character strings to identify first characters thereof and remove the characters without real meaning; building distance matrix to realize the optimization of an edit distance by building a match index; then judging an abbreviated word, firstly judging whether the two character strings has an abbreviation relationship, if the abbreviation relationship is ensured, the distance is optimized; wherein, the abbreviation relationship is determined by two factors: (1) judging whether the two character strings has the similarity; and (2) judging whether the first characters of the two character strings have been matched; and after that optimizing the distance of the abbreviated word, wherein, the optimization is realized by reducing the cost for decreasing continuously inserted characters and continuously cancelled characters. The method for analyzing the similarity of the character strings can well treat the situations such as omission, abbreviation and character disorder which are usually in Web, has higher application, and under a Wed unknown environment has higher matching precision.
Owner:NORTHEASTERN UNIV

Large-scale graph data processing method based on k<2>-tree and multi-valued decision diagram

The invention discloses a large-scale graph data processing method based on a k<2>-tree and a Multi-valued Decision Diagram (MDD). The method comprises the following steps: 1, performing n-bit encoding on a peak of a graph according to the rule of the k<2>-tree, FORMULA, k being greater than or equal to 2; 2, encoding an edge according to a peak code; 3, constructing an MDD structure according to an edge code to obtain a k<2>-MDD structure which corresponds to an oriented graph and contains n variables, wherein the k<2>-MDD structure has the nature of the MDD and is applicable to the simplification rule of the MDD; 4, performing the following basic operation of the graph on the obtained k<2>-MDD structure through logic operation of a symbol decision diagram: edge inquiry, outside adjacent inquiry and calculation of an out degree of the peak, inside adjacent inquiry and calculation of an in degree of the peak, as well as adding and deletion of an edge, and the like. According to the method, the MDD is used for storing graph data, so that isomorphic sub trees in the k<2>-tree are combined, the number of nodes is reduced, and the structure is more compact; the basic operation of the graph is converted into the logic operation, so that the operation is simpler.
Owner:GUILIN UNIV OF ELECTRONIC TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products